2 * @brief memory-mapped database library
4 * A Btree-based database management library modeled loosely on the
5 * BerkeleyDB API, but much simplified.
8 * Copyright 2011-2013 Howard Chu, Symas Corp.
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted only as authorized by the OpenLDAP
15 * A copy of this license is available in the file LICENSE in the
16 * top-level directory of the distribution or, alternatively, at
17 * <http://www.OpenLDAP.org/license.html>.
19 * This code is derived from btree.c written by Martin Hedenfalk.
21 * Copyright (c) 2009, 2010 Martin Hedenfalk <martin@bzero.se>
23 * Permission to use, copy, modify, and distribute this software for any
24 * purpose with or without fee is hereby granted, provided that the above
25 * copyright notice and this permission notice appear in all copies.
27 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
28 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
29 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
30 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
31 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
32 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
33 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
38 #include <sys/types.h>
40 #include <sys/param.h>
46 #ifdef HAVE_SYS_FILE_H
63 #if !(defined(BYTE_ORDER) || defined(__BYTE_ORDER))
64 #include <netinet/in.h>
65 #include <resolv.h> /* defines BYTE_ORDER on HPUX and Solaris */
68 #if defined(__APPLE__) || defined (BSD)
69 # define MDB_USE_POSIX_SEM 1
70 # define MDB_FDATASYNC fsync
71 #elif defined(ANDROID)
72 # define MDB_FDATASYNC fsync
77 #ifdef MDB_USE_POSIX_SEM
78 #include <semaphore.h>
83 #include <valgrind/memcheck.h>
84 #define VGMEMP_CREATE(h,r,z) VALGRIND_CREATE_MEMPOOL(h,r,z)
85 #define VGMEMP_ALLOC(h,a,s) VALGRIND_MEMPOOL_ALLOC(h,a,s)
86 #define VGMEMP_FREE(h,a) VALGRIND_MEMPOOL_FREE(h,a)
87 #define VGMEMP_DESTROY(h) VALGRIND_DESTROY_MEMPOOL(h)
88 #define VGMEMP_DEFINED(a,s) VALGRIND_MAKE_MEM_DEFINED(a,s)
90 #define VGMEMP_CREATE(h,r,z)
91 #define VGMEMP_ALLOC(h,a,s)
92 #define VGMEMP_FREE(h,a)
93 #define VGMEMP_DESTROY(h)
94 #define VGMEMP_DEFINED(a,s)
98 # if (defined(_LITTLE_ENDIAN) || defined(_BIG_ENDIAN)) && !(defined(_LITTLE_ENDIAN) && defined(_BIG_ENDIAN))
99 /* Solaris just defines one or the other */
100 # define LITTLE_ENDIAN 1234
101 # define BIG_ENDIAN 4321
102 # ifdef _LITTLE_ENDIAN
103 # define BYTE_ORDER LITTLE_ENDIAN
105 # define BYTE_ORDER BIG_ENDIAN
108 # define BYTE_ORDER __BYTE_ORDER
112 #ifndef LITTLE_ENDIAN
113 #define LITTLE_ENDIAN __LITTLE_ENDIAN
116 #define BIG_ENDIAN __BIG_ENDIAN
119 #if defined(__i386) || defined(__x86_64) || defined(_M_IX86)
120 #define MISALIGNED_OK 1
126 #if (BYTE_ORDER == LITTLE_ENDIAN) == (BYTE_ORDER == BIG_ENDIAN)
127 # error "Unknown or unsupported endianness (BYTE_ORDER)"
128 #elif (-6 & 5) || CHAR_BIT != 8 || UINT_MAX < 0xffffffff || ULONG_MAX % 0xFFFF
129 # error "Two's complement, reasonably sized integer types, please"
132 /** @defgroup internal MDB Internals
135 /** @defgroup compat Windows Compatibility Macros
136 * A bunch of macros to minimize the amount of platform-specific ifdefs
137 * needed throughout the rest of the code. When the features this library
138 * needs are similar enough to POSIX to be hidden in a one-or-two line
139 * replacement, this macro approach is used.
143 #define pthread_t DWORD
144 #define pthread_mutex_t HANDLE
145 #define pthread_key_t DWORD
146 #define pthread_self() GetCurrentThreadId()
147 #define pthread_key_create(x,y) \
148 ((*(x) = TlsAlloc()) == TLS_OUT_OF_INDEXES ? ErrCode() : 0)
149 #define pthread_key_delete(x) TlsFree(x)
150 #define pthread_getspecific(x) TlsGetValue(x)
151 #define pthread_setspecific(x,y) (TlsSetValue(x,y) ? 0 : ErrCode())
152 #define pthread_mutex_unlock(x) ReleaseMutex(x)
153 #define pthread_mutex_lock(x) WaitForSingleObject(x, INFINITE)
154 #define LOCK_MUTEX_R(env) pthread_mutex_lock((env)->me_rmutex)
155 #define UNLOCK_MUTEX_R(env) pthread_mutex_unlock((env)->me_rmutex)
156 #define LOCK_MUTEX_W(env) pthread_mutex_lock((env)->me_wmutex)
157 #define UNLOCK_MUTEX_W(env) pthread_mutex_unlock((env)->me_wmutex)
158 #define getpid() GetCurrentProcessId()
159 #define MDB_FDATASYNC(fd) (!FlushFileBuffers(fd))
160 #define MDB_MSYNC(addr,len,flags) (!FlushViewOfFile(addr,len))
161 #define ErrCode() GetLastError()
162 #define GET_PAGESIZE(x) {SYSTEM_INFO si; GetSystemInfo(&si); (x) = si.dwPageSize;}
163 #define close(fd) (CloseHandle(fd) ? 0 : -1)
164 #define munmap(ptr,len) UnmapViewOfFile(ptr)
167 #ifdef MDB_USE_POSIX_SEM
169 #define LOCK_MUTEX_R(env) mdb_sem_wait((env)->me_rmutex)
170 #define UNLOCK_MUTEX_R(env) sem_post((env)->me_rmutex)
171 #define LOCK_MUTEX_W(env) mdb_sem_wait((env)->me_wmutex)
172 #define UNLOCK_MUTEX_W(env) sem_post((env)->me_wmutex)
175 mdb_sem_wait(sem_t *sem)
178 while ((rc = sem_wait(sem)) && (rc = errno) == EINTR) ;
183 /** Lock the reader mutex.
185 #define LOCK_MUTEX_R(env) pthread_mutex_lock(&(env)->me_txns->mti_mutex)
186 /** Unlock the reader mutex.
188 #define UNLOCK_MUTEX_R(env) pthread_mutex_unlock(&(env)->me_txns->mti_mutex)
190 /** Lock the writer mutex.
191 * Only a single write transaction is allowed at a time. Other writers
192 * will block waiting for this mutex.
194 #define LOCK_MUTEX_W(env) pthread_mutex_lock(&(env)->me_txns->mti_wmutex)
195 /** Unlock the writer mutex.
197 #define UNLOCK_MUTEX_W(env) pthread_mutex_unlock(&(env)->me_txns->mti_wmutex)
198 #endif /* MDB_USE_POSIX_SEM */
200 /** Get the error code for the last failed system function.
202 #define ErrCode() errno
204 /** An abstraction for a file handle.
205 * On POSIX systems file handles are small integers. On Windows
206 * they're opaque pointers.
210 /** A value for an invalid file handle.
211 * Mainly used to initialize file variables and signify that they are
214 #define INVALID_HANDLE_VALUE (-1)
216 /** Get the size of a memory page for the system.
217 * This is the basic size that the platform's memory manager uses, and is
218 * fundamental to the use of memory-mapped files.
220 #define GET_PAGESIZE(x) ((x) = sysconf(_SC_PAGE_SIZE))
223 #if defined(_WIN32) || defined(MDB_USE_POSIX_SEM)
226 #define MNAME_LEN (sizeof(pthread_mutex_t))
232 /** A flag for opening a file and requesting synchronous data writes.
233 * This is only used when writing a meta page. It's not strictly needed;
234 * we could just do a normal write and then immediately perform a flush.
235 * But if this flag is available it saves us an extra system call.
237 * @note If O_DSYNC is undefined but exists in /usr/include,
238 * preferably set some compiler flag to get the definition.
239 * Otherwise compile with the less efficient -DMDB_DSYNC=O_SYNC.
242 # define MDB_DSYNC O_DSYNC
246 /** Function for flushing the data of a file. Define this to fsync
247 * if fdatasync() is not supported.
249 #ifndef MDB_FDATASYNC
250 # define MDB_FDATASYNC fdatasync
254 # define MDB_MSYNC(addr,len,flags) msync(addr,len,flags)
265 /** A page number in the database.
266 * Note that 64 bit page numbers are overkill, since pages themselves
267 * already represent 12-13 bits of addressable memory, and the OS will
268 * always limit applications to a maximum of 63 bits of address space.
270 * @note In the #MDB_node structure, we only store 48 bits of this value,
271 * which thus limits us to only 60 bits of addressable data.
273 typedef MDB_ID pgno_t;
275 /** A transaction ID.
276 * See struct MDB_txn.mt_txnid for details.
278 typedef MDB_ID txnid_t;
280 /** @defgroup debug Debug Macros
284 /** Enable debug output.
285 * Set this to 1 for copious tracing. Set to 2 to add dumps of all IDLs
286 * read from and written to the database (used for free space management).
291 #if !(__STDC_VERSION__ >= 199901L || defined(__GNUC__))
294 # define DPRINTF (void) /* Vararg macros may be unsupported */
296 static int mdb_debug;
297 static txnid_t mdb_debug_start;
299 /** Print a debug message with printf formatting. */
300 # define DPRINTF(fmt, ...) /**< Requires 2 or more args */ \
301 ((void) ((mdb_debug) && \
302 fprintf(stderr, "%s:%d " fmt "\n", __func__, __LINE__, __VA_ARGS__)))
304 # define DPRINTF(fmt, ...) ((void) 0)
305 # define MDB_DEBUG_SKIP
307 /** Print a debug string.
308 * The string is printed literally, with no format processing.
310 #define DPUTS(arg) DPRINTF("%s", arg)
313 /** A default memory page size.
314 * The actual size is platform-dependent, but we use this for
315 * boot-strapping. We probably should not be using this any more.
316 * The #GET_PAGESIZE() macro is used to get the actual size.
318 * Note that we don't currently support Huge pages. On Linux,
319 * regular data files cannot use Huge pages, and in general
320 * Huge pages aren't actually pageable. We rely on the OS
321 * demand-pager to read our data and page it out when memory
322 * pressure from other processes is high. So until OSs have
323 * actual paging support for Huge pages, they're not viable.
325 #define MDB_PAGESIZE 4096
327 /** The minimum number of keys required in a database page.
328 * Setting this to a larger value will place a smaller bound on the
329 * maximum size of a data item. Data items larger than this size will
330 * be pushed into overflow pages instead of being stored directly in
331 * the B-tree node. This value used to default to 4. With a page size
332 * of 4096 bytes that meant that any item larger than 1024 bytes would
333 * go into an overflow page. That also meant that on average 2-3KB of
334 * each overflow page was wasted space. The value cannot be lower than
335 * 2 because then there would no longer be a tree structure. With this
336 * value, items larger than 2KB will go into overflow pages, and on
337 * average only 1KB will be wasted.
339 #define MDB_MINKEYS 2
341 /** A stamp that identifies a file as an MDB file.
342 * There's nothing special about this value other than that it is easily
343 * recognizable, and it will reflect any byte order mismatches.
345 #define MDB_MAGIC 0xBEEFC0DE
347 /** The version number for a database's file format. */
348 #define MDB_VERSION 1
350 /** @brief The maximum size of a key in the database.
352 * The library rejects bigger keys, and cannot deal with records
353 * with bigger keys stored by a library with bigger max keysize.
355 * We require that keys all fit onto a regular page. This limit
356 * could be raised a bit further if needed; to something just
357 * under #MDB_PAGESIZE / #MDB_MINKEYS.
359 * Note that data items in an #MDB_DUPSORT database are actually keys
360 * of a subDB, so they're also limited to this size.
362 #ifndef MDB_MAXKEYSIZE
363 #define MDB_MAXKEYSIZE 511
366 /** @brief The maximum size of a data item.
368 * We only store a 32 bit value for node sizes.
370 #define MAXDATASIZE 0xffffffffUL
375 * This is used for printing a hex dump of a key's contents.
377 #define DKBUF char kbuf[(MDB_MAXKEYSIZE*2+1)]
378 /** Display a key in hex.
380 * Invoke a function to display a key in hex.
382 #define DKEY(x) mdb_dkey(x, kbuf)
384 #define DKBUF typedef int dummy_kbuf /* so we can put ';' after */
388 /** An invalid page number.
389 * Mainly used to denote an empty tree.
391 #define P_INVALID (~(pgno_t)0)
393 /** Test if the flags \b f are set in a flag word \b w. */
394 #define F_ISSET(w, f) (((w) & (f)) == (f))
396 /** Used for offsets within a single page.
397 * Since memory pages are typically 4 or 8KB in size, 12-13 bits,
400 typedef uint16_t indx_t;
402 /** Default size of memory map.
403 * This is certainly too small for any actual applications. Apps should always set
404 * the size explicitly using #mdb_env_set_mapsize().
406 #define DEFAULT_MAPSIZE 1048576
408 /** @defgroup readers Reader Lock Table
409 * Readers don't acquire any locks for their data access. Instead, they
410 * simply record their transaction ID in the reader table. The reader
411 * mutex is needed just to find an empty slot in the reader table. The
412 * slot's address is saved in thread-specific data so that subsequent read
413 * transactions started by the same thread need no further locking to proceed.
415 * If #MDB_NOTLS is set, the slot address is not saved in thread-specific data.
417 * No reader table is used if the database is on a read-only filesystem.
419 * Since the database uses multi-version concurrency control, readers don't
420 * actually need any locking. This table is used to keep track of which
421 * readers are using data from which old transactions, so that we'll know
422 * when a particular old transaction is no longer in use. Old transactions
423 * that have discarded any data pages can then have those pages reclaimed
424 * for use by a later write transaction.
426 * The lock table is constructed such that reader slots are aligned with the
427 * processor's cache line size. Any slot is only ever used by one thread.
428 * This alignment guarantees that there will be no contention or cache
429 * thrashing as threads update their own slot info, and also eliminates
430 * any need for locking when accessing a slot.
432 * A writer thread will scan every slot in the table to determine the oldest
433 * outstanding reader transaction. Any freed pages older than this will be
434 * reclaimed by the writer. The writer doesn't use any locks when scanning
435 * this table. This means that there's no guarantee that the writer will
436 * see the most up-to-date reader info, but that's not required for correct
437 * operation - all we need is to know the upper bound on the oldest reader,
438 * we don't care at all about the newest reader. So the only consequence of
439 * reading stale information here is that old pages might hang around a
440 * while longer before being reclaimed. That's actually good anyway, because
441 * the longer we delay reclaiming old pages, the more likely it is that a
442 * string of contiguous pages can be found after coalescing old pages from
443 * many old transactions together.
446 /** Number of slots in the reader table.
447 * This value was chosen somewhat arbitrarily. 126 readers plus a
448 * couple mutexes fit exactly into 8KB on my development machine.
449 * Applications should set the table size using #mdb_env_set_maxreaders().
451 #define DEFAULT_READERS 126
453 /** The size of a CPU cache line in bytes. We want our lock structures
454 * aligned to this size to avoid false cache line sharing in the
456 * This value works for most CPUs. For Itanium this should be 128.
462 /** The information we store in a single slot of the reader table.
463 * In addition to a transaction ID, we also record the process and
464 * thread ID that owns a slot, so that we can detect stale information,
465 * e.g. threads or processes that went away without cleaning up.
466 * @note We currently don't check for stale records. We simply re-init
467 * the table when we know that we're the only process opening the
470 typedef struct MDB_rxbody {
471 /** Current Transaction ID when this transaction began, or (txnid_t)-1.
472 * Multiple readers that start at the same time will probably have the
473 * same ID here. Again, it's not important to exclude them from
474 * anything; all we need to know is which version of the DB they
475 * started from so we can avoid overwriting any data used in that
476 * particular version.
479 /** The process ID of the process owning this reader txn. */
481 /** The thread ID of the thread owning this txn. */
485 /** The actual reader record, with cacheline padding. */
486 typedef struct MDB_reader {
489 /** shorthand for mrb_txnid */
490 #define mr_txnid mru.mrx.mrb_txnid
491 #define mr_pid mru.mrx.mrb_pid
492 #define mr_tid mru.mrx.mrb_tid
493 /** cache line alignment */
494 char pad[(sizeof(MDB_rxbody)+CACHELINE-1) & ~(CACHELINE-1)];
498 /** The header for the reader table.
499 * The table resides in a memory-mapped file. (This is a different file
500 * than is used for the main database.)
502 * For POSIX the actual mutexes reside in the shared memory of this
503 * mapped file. On Windows, mutexes are named objects allocated by the
504 * kernel; we store the mutex names in this mapped file so that other
505 * processes can grab them. This same approach is also used on
506 * MacOSX/Darwin (using named semaphores) since MacOSX doesn't support
507 * process-shared POSIX mutexes. For these cases where a named object
508 * is used, the object name is derived from a 64 bit FNV hash of the
509 * environment pathname. As such, naming collisions are extremely
510 * unlikely. If a collision occurs, the results are unpredictable.
512 typedef struct MDB_txbody {
513 /** Stamp identifying this as an MDB file. It must be set
516 /** Version number of this lock file. Must be set to #MDB_VERSION. */
517 uint32_t mtb_version;
518 #if defined(_WIN32) || defined(MDB_USE_POSIX_SEM)
519 char mtb_rmname[MNAME_LEN];
521 /** Mutex protecting access to this table.
522 * This is the reader lock that #LOCK_MUTEX_R acquires.
524 pthread_mutex_t mtb_mutex;
526 /** The ID of the last transaction committed to the database.
527 * This is recorded here only for convenience; the value can always
528 * be determined by reading the main database meta pages.
531 /** The number of slots that have been used in the reader table.
532 * This always records the maximum count, it is not decremented
533 * when readers release their slots.
535 unsigned mtb_numreaders;
538 /** The actual reader table definition. */
539 typedef struct MDB_txninfo {
542 #define mti_magic mt1.mtb.mtb_magic
543 #define mti_version mt1.mtb.mtb_version
544 #define mti_mutex mt1.mtb.mtb_mutex
545 #define mti_rmname mt1.mtb.mtb_rmname
546 #define mti_txnid mt1.mtb.mtb_txnid
547 #define mti_numreaders mt1.mtb.mtb_numreaders
548 char pad[(sizeof(MDB_txbody)+CACHELINE-1) & ~(CACHELINE-1)];
551 #if defined(_WIN32) || defined(MDB_USE_POSIX_SEM)
552 char mt2_wmname[MNAME_LEN];
553 #define mti_wmname mt2.mt2_wmname
555 pthread_mutex_t mt2_wmutex;
556 #define mti_wmutex mt2.mt2_wmutex
558 char pad[(MNAME_LEN+CACHELINE-1) & ~(CACHELINE-1)];
560 MDB_reader mti_readers[1];
564 /** Common header for all page types.
565 * Overflow records occupy a number of contiguous pages with no
566 * headers on any page after the first.
568 typedef struct MDB_page {
569 #define mp_pgno mp_p.p_pgno
570 #define mp_next mp_p.p_next
572 pgno_t p_pgno; /**< page number */
573 void * p_next; /**< for in-memory list of freed structs */
576 /** @defgroup mdb_page Page Flags
578 * Flags for the page headers.
581 #define P_BRANCH 0x01 /**< branch page */
582 #define P_LEAF 0x02 /**< leaf page */
583 #define P_OVERFLOW 0x04 /**< overflow page */
584 #define P_META 0x08 /**< meta page */
585 #define P_DIRTY 0x10 /**< dirty page */
586 #define P_LEAF2 0x20 /**< for #MDB_DUPFIXED records */
587 #define P_SUBP 0x40 /**< for #MDB_DUPSORT sub-pages */
589 uint16_t mp_flags; /**< @ref mdb_page */
590 #define mp_lower mp_pb.pb.pb_lower
591 #define mp_upper mp_pb.pb.pb_upper
592 #define mp_pages mp_pb.pb_pages
595 indx_t pb_lower; /**< lower bound of free space */
596 indx_t pb_upper; /**< upper bound of free space */
598 uint32_t pb_pages; /**< number of overflow pages */
600 indx_t mp_ptrs[1]; /**< dynamic size */
603 /** Size of the page header, excluding dynamic data at the end */
604 #define PAGEHDRSZ ((unsigned) offsetof(MDB_page, mp_ptrs))
606 /** Address of first usable data byte in a page, after the header */
607 #define METADATA(p) ((void *)((char *)(p) + PAGEHDRSZ))
609 /** Number of nodes on a page */
610 #define NUMKEYS(p) (((p)->mp_lower - PAGEHDRSZ) >> 1)
612 /** The amount of space remaining in the page */
613 #define SIZELEFT(p) (indx_t)((p)->mp_upper - (p)->mp_lower)
615 /** The percentage of space used in the page, in tenths of a percent. */
616 #define PAGEFILL(env, p) (1000L * ((env)->me_psize - PAGEHDRSZ - SIZELEFT(p)) / \
617 ((env)->me_psize - PAGEHDRSZ))
618 /** The minimum page fill factor, in tenths of a percent.
619 * Pages emptier than this are candidates for merging.
621 #define FILL_THRESHOLD 250
623 /** Test if a page is a leaf page */
624 #define IS_LEAF(p) F_ISSET((p)->mp_flags, P_LEAF)
625 /** Test if a page is a LEAF2 page */
626 #define IS_LEAF2(p) F_ISSET((p)->mp_flags, P_LEAF2)
627 /** Test if a page is a branch page */
628 #define IS_BRANCH(p) F_ISSET((p)->mp_flags, P_BRANCH)
629 /** Test if a page is an overflow page */
630 #define IS_OVERFLOW(p) F_ISSET((p)->mp_flags, P_OVERFLOW)
631 /** Test if a page is a sub page */
632 #define IS_SUBP(p) F_ISSET((p)->mp_flags, P_SUBP)
634 /** The number of overflow pages needed to store the given size. */
635 #define OVPAGES(size, psize) ((PAGEHDRSZ-1 + (size)) / (psize) + 1)
637 /** Header for a single key/data pair within a page.
638 * We guarantee 2-byte alignment for nodes.
640 typedef struct MDB_node {
641 /** lo and hi are used for data size on leaf nodes and for
642 * child pgno on branch nodes. On 64 bit platforms, flags
643 * is also used for pgno. (Branch nodes have no flags).
644 * They are in host byte order in case that lets some
645 * accesses be optimized into a 32-bit word access.
647 #define mn_lo mn_offset[BYTE_ORDER!=LITTLE_ENDIAN]
648 #define mn_hi mn_offset[BYTE_ORDER==LITTLE_ENDIAN] /**< part of dsize or pgno */
649 unsigned short mn_offset[2]; /**< storage for #mn_lo and #mn_hi */
650 /** @defgroup mdb_node Node Flags
652 * Flags for node headers.
655 #define F_BIGDATA 0x01 /**< data put on overflow page */
656 #define F_SUBDATA 0x02 /**< data is a sub-database */
657 #define F_DUPDATA 0x04 /**< data has duplicates */
659 /** valid flags for #mdb_node_add() */
660 #define NODE_ADD_FLAGS (F_DUPDATA|F_SUBDATA|MDB_RESERVE|MDB_APPEND)
663 unsigned short mn_flags; /**< @ref mdb_node */
664 unsigned short mn_ksize; /**< key size */
665 char mn_data[1]; /**< key and data are appended here */
668 /** Size of the node header, excluding dynamic data at the end */
669 #define NODESIZE offsetof(MDB_node, mn_data)
671 /** Bit position of top word in page number, for shifting mn_flags */
672 #define PGNO_TOPWORD ((pgno_t)-1 > 0xffffffffu ? 32 : 0)
674 /** Size of a node in a branch page with a given key.
675 * This is just the node header plus the key, there is no data.
677 #define INDXSIZE(k) (NODESIZE + ((k) == NULL ? 0 : (k)->mv_size))
679 /** Size of a node in a leaf page with a given key and data.
680 * This is node header plus key plus data size.
682 #define LEAFSIZE(k, d) (NODESIZE + (k)->mv_size + (d)->mv_size)
684 /** Address of node \b i in page \b p */
685 #define NODEPTR(p, i) ((MDB_node *)((char *)(p) + (p)->mp_ptrs[i]))
687 /** Address of the key for the node */
688 #define NODEKEY(node) (void *)((node)->mn_data)
690 /** Address of the data for a node */
691 #define NODEDATA(node) (void *)((char *)(node)->mn_data + (node)->mn_ksize)
693 /** Get the page number pointed to by a branch node */
694 #define NODEPGNO(node) \
695 ((node)->mn_lo | ((pgno_t) (node)->mn_hi << 16) | \
696 (PGNO_TOPWORD ? ((pgno_t) (node)->mn_flags << PGNO_TOPWORD) : 0))
697 /** Set the page number in a branch node */
698 #define SETPGNO(node,pgno) do { \
699 (node)->mn_lo = (pgno) & 0xffff; (node)->mn_hi = (pgno) >> 16; \
700 if (PGNO_TOPWORD) (node)->mn_flags = (pgno) >> PGNO_TOPWORD; } while(0)
702 /** Get the size of the data in a leaf node */
703 #define NODEDSZ(node) ((node)->mn_lo | ((unsigned)(node)->mn_hi << 16))
704 /** Set the size of the data for a leaf node */
705 #define SETDSZ(node,size) do { \
706 (node)->mn_lo = (size) & 0xffff; (node)->mn_hi = (size) >> 16;} while(0)
707 /** The size of a key in a node */
708 #define NODEKSZ(node) ((node)->mn_ksize)
710 /** Copy a page number from src to dst */
712 #define COPY_PGNO(dst,src) dst = src
714 #if SIZE_MAX > 4294967295UL
715 #define COPY_PGNO(dst,src) do { \
716 unsigned short *s, *d; \
717 s = (unsigned short *)&(src); \
718 d = (unsigned short *)&(dst); \
725 #define COPY_PGNO(dst,src) do { \
726 unsigned short *s, *d; \
727 s = (unsigned short *)&(src); \
728 d = (unsigned short *)&(dst); \
734 /** The address of a key in a LEAF2 page.
735 * LEAF2 pages are used for #MDB_DUPFIXED sorted-duplicate sub-DBs.
736 * There are no node headers, keys are stored contiguously.
738 #define LEAF2KEY(p, i, ks) ((char *)(p) + PAGEHDRSZ + ((i)*(ks)))
740 /** Set the \b node's key into \b key, if requested. */
741 #define MDB_GET_KEY(node, key) { if ((key) != NULL) { \
742 (key)->mv_size = NODEKSZ(node); (key)->mv_data = NODEKEY(node); } }
744 /** Information about a single database in the environment. */
745 typedef struct MDB_db {
746 uint32_t md_pad; /**< also ksize for LEAF2 pages */
747 uint16_t md_flags; /**< @ref mdb_dbi_open */
748 uint16_t md_depth; /**< depth of this tree */
749 pgno_t md_branch_pages; /**< number of internal pages */
750 pgno_t md_leaf_pages; /**< number of leaf pages */
751 pgno_t md_overflow_pages; /**< number of overflow pages */
752 size_t md_entries; /**< number of data items */
753 pgno_t md_root; /**< the root page of this tree */
756 /** mdb_dbi_open flags */
757 #define MDB_VALID 0x8000 /**< DB handle is valid, for me_dbflags */
758 #define PERSISTENT_FLAGS (0xffff & ~(MDB_VALID))
759 #define VALID_FLAGS (MDB_REVERSEKEY|MDB_DUPSORT|MDB_INTEGERKEY|MDB_DUPFIXED|\
760 MDB_INTEGERDUP|MDB_REVERSEDUP|MDB_CREATE)
762 /** Handle for the DB used to track free pages. */
764 /** Handle for the default DB. */
767 /** Meta page content. */
768 typedef struct MDB_meta {
769 /** Stamp identifying this as an MDB file. It must be set
772 /** Version number of this lock file. Must be set to #MDB_VERSION. */
774 void *mm_address; /**< address for fixed mapping */
775 size_t mm_mapsize; /**< size of mmap region */
776 MDB_db mm_dbs[2]; /**< first is free space, 2nd is main db */
777 /** The size of pages used in this DB */
778 #define mm_psize mm_dbs[0].md_pad
779 /** Any persistent environment flags. @ref mdb_env */
780 #define mm_flags mm_dbs[0].md_flags
781 pgno_t mm_last_pg; /**< last used page in file */
782 txnid_t mm_txnid; /**< txnid that committed this page */
785 /** Buffer for a stack-allocated dirty page.
786 * The members define size and alignment, and silence type
787 * aliasing warnings. They are not used directly; that could
788 * mean incorrectly using several union members in parallel.
790 typedef union MDB_pagebuf {
791 char mb_raw[MDB_PAGESIZE];
794 char mm_pad[PAGEHDRSZ];
799 /** Auxiliary DB info.
800 * The information here is mostly static/read-only. There is
801 * only a single copy of this record in the environment.
803 typedef struct MDB_dbx {
804 MDB_val md_name; /**< name of the database */
805 MDB_cmp_func *md_cmp; /**< function for comparing keys */
806 MDB_cmp_func *md_dcmp; /**< function for comparing data items */
807 MDB_rel_func *md_rel; /**< user relocate function */
808 void *md_relctx; /**< user-provided context for md_rel */
811 /** A database transaction.
812 * Every operation requires a transaction handle.
815 MDB_txn *mt_parent; /**< parent of a nested txn */
816 MDB_txn *mt_child; /**< nested txn under this txn */
817 pgno_t mt_next_pgno; /**< next unallocated page */
818 /** The ID of this transaction. IDs are integers incrementing from 1.
819 * Only committed write transactions increment the ID. If a transaction
820 * aborts, the ID may be re-used by the next writer.
823 MDB_env *mt_env; /**< the DB environment */
824 /** The list of pages that became unused during this transaction.
828 MDB_ID2L dirty_list; /**< for write txns: modified pages */
829 MDB_reader *reader; /**< this thread's reader table slot or NULL */
831 /** Array of records for each DB known in the environment. */
833 /** Array of MDB_db records for each known DB */
835 /** @defgroup mt_dbflag Transaction DB Flags
839 #define DB_DIRTY 0x01 /**< DB was written in this txn */
840 #define DB_STALE 0x02 /**< DB record is older than txnID */
841 #define DB_NEW 0x04 /**< DB handle opened in this txn */
842 #define DB_VALID 0x08 /**< DB handle is valid, see also #MDB_VALID */
844 /** In write txns, array of cursors for each DB */
845 MDB_cursor **mt_cursors;
846 /** Array of flags for each DB */
847 unsigned char *mt_dbflags;
848 /** Number of DB records in use. This number only ever increments;
849 * we don't decrement it when individual DB handles are closed.
853 /** @defgroup mdb_txn Transaction Flags
857 #define MDB_TXN_RDONLY 0x01 /**< read-only transaction */
858 #define MDB_TXN_ERROR 0x02 /**< an error has occurred */
859 #define MDB_TXN_DIRTY 0x04 /**< must write, even if dirty list is empty */
861 unsigned int mt_flags; /**< @ref mdb_txn */
862 /** dirty_list maxsize - # of allocated pages allowed, including in parent txns */
863 unsigned int mt_dirty_room;
864 /** Tracks which of the two meta pages was used at the start
865 * of this transaction.
867 unsigned int mt_toggle;
870 /** Enough space for 2^32 nodes with minimum of 2 keys per node. I.e., plenty.
871 * At 4 keys per node, enough for 2^64 nodes, so there's probably no need to
872 * raise this on a 64 bit machine.
874 #define CURSOR_STACK 32
878 /** Cursors are used for all DB operations */
880 /** Next cursor on this DB in this txn */
882 /** Original cursor if this is a shadow */
884 /** Context used for databases with #MDB_DUPSORT, otherwise NULL */
885 struct MDB_xcursor *mc_xcursor;
886 /** The transaction that owns this cursor */
888 /** The database handle this cursor operates on */
890 /** The database record for this cursor */
892 /** The database auxiliary record for this cursor */
894 /** The @ref mt_dbflag for this database */
895 unsigned char *mc_dbflag;
896 unsigned short mc_snum; /**< number of pushed pages */
897 unsigned short mc_top; /**< index of top page, normally mc_snum-1 */
898 /** @defgroup mdb_cursor Cursor Flags
900 * Cursor state flags.
903 #define C_INITIALIZED 0x01 /**< cursor has been initialized and is valid */
904 #define C_EOF 0x02 /**< No more data */
905 #define C_SUB 0x04 /**< Cursor is a sub-cursor */
906 #define C_SHADOW 0x08 /**< Cursor is a dup from a parent txn */
907 #define C_ALLOCD 0x10 /**< Cursor was malloc'd */
908 #define C_SPLITTING 0x20 /**< Cursor is in page_split */
909 #define C_UNTRACK 0x40 /**< Un-track cursor when closing */
911 unsigned int mc_flags; /**< @ref mdb_cursor */
912 MDB_page *mc_pg[CURSOR_STACK]; /**< stack of pushed pages */
913 indx_t mc_ki[CURSOR_STACK]; /**< stack of page indices */
916 /** Context for sorted-dup records.
917 * We could have gone to a fully recursive design, with arbitrarily
918 * deep nesting of sub-databases. But for now we only handle these
919 * levels - main DB, optional sub-DB, sorted-duplicate DB.
921 typedef struct MDB_xcursor {
922 /** A sub-cursor for traversing the Dup DB */
923 MDB_cursor mx_cursor;
924 /** The database record for this Dup DB */
926 /** The auxiliary DB record for this Dup DB */
928 /** The @ref mt_dbflag for this Dup DB */
929 unsigned char mx_dbflag;
932 /** State of FreeDB old pages, stored in the MDB_env */
933 typedef struct MDB_pgstate {
934 pgno_t *mf_pghead; /**< Reclaimed freeDB pages, or NULL before use */
935 txnid_t mf_pglast; /**< ID of last used record, or 0 if !mf_pghead */
938 /** The database environment. */
940 HANDLE me_fd; /**< The main data file */
941 HANDLE me_lfd; /**< The lock file */
942 HANDLE me_mfd; /**< just for writing the meta pages */
943 /** Failed to update the meta page. Probably an I/O error. */
944 #define MDB_FATAL_ERROR 0x80000000U
945 /** Some fields are initialized. */
946 #define MDB_ENV_ACTIVE 0x20000000U
947 /** me_txkey is set */
948 #define MDB_ENV_TXKEY 0x10000000U
949 uint32_t me_flags; /**< @ref mdb_env */
950 unsigned int me_psize; /**< size of a page, from #GET_PAGESIZE */
951 unsigned int me_maxreaders; /**< size of the reader table */
952 unsigned int me_numreaders; /**< max numreaders set by this env */
953 MDB_dbi me_numdbs; /**< number of DBs opened */
954 MDB_dbi me_maxdbs; /**< size of the DB table */
955 pid_t me_pid; /**< process ID of this env */
956 char *me_path; /**< path to the DB files */
957 char *me_map; /**< the memory map of the data file */
958 MDB_txninfo *me_txns; /**< the memory map of the lock file or NULL */
959 MDB_meta *me_metas[2]; /**< pointers to the two meta pages */
960 MDB_txn *me_txn; /**< current write transaction */
961 size_t me_mapsize; /**< size of the data memory map */
962 off_t me_size; /**< current file size */
963 pgno_t me_maxpg; /**< me_mapsize / me_psize */
964 MDB_dbx *me_dbxs; /**< array of static DB info */
965 uint16_t *me_dbflags; /**< array of flags from MDB_db.md_flags */
966 pthread_key_t me_txkey; /**< thread-key for readers */
967 MDB_pgstate me_pgstate; /**< state of old pages from freeDB */
968 # define me_pglast me_pgstate.mf_pglast
969 # define me_pghead me_pgstate.mf_pghead
970 MDB_page *me_dpages; /**< list of malloc'd blocks for re-use */
971 /** IDL of pages that became unused in a write txn */
973 /** ID2L of pages written during a write txn. Length MDB_IDL_UM_SIZE. */
974 MDB_ID2L me_dirty_list;
975 /** Max number of freelist items that can fit in a single overflow page */
977 /** Max size of a node on a page */
978 unsigned int me_nodemax;
980 HANDLE me_rmutex; /* Windows mutexes don't reside in shared mem */
982 #elif defined(MDB_USE_POSIX_SEM)
983 sem_t *me_rmutex; /* Shared mutexes are not supported */
988 /** Nested transaction */
989 typedef struct MDB_ntxn {
990 MDB_txn mnt_txn; /* the transaction */
991 MDB_pgstate mnt_pgstate; /* parent transaction's saved freestate */
994 /** max number of pages to commit in one writev() call */
995 #define MDB_COMMIT_PAGES 64
996 #if defined(IOV_MAX) && IOV_MAX < MDB_COMMIT_PAGES
997 #undef MDB_COMMIT_PAGES
998 #define MDB_COMMIT_PAGES IOV_MAX
1001 /* max bytes to write in one call */
1002 #define MAX_WRITE (0x80000000U >> (sizeof(ssize_t) == 4))
1004 static int mdb_page_alloc(MDB_cursor *mc, int num, MDB_page **mp);
1005 static int mdb_page_new(MDB_cursor *mc, uint32_t flags, int num, MDB_page **mp);
1006 static int mdb_page_touch(MDB_cursor *mc);
1008 static int mdb_page_get(MDB_txn *txn, pgno_t pgno, MDB_page **mp, int *lvl);
1009 static int mdb_page_search_root(MDB_cursor *mc,
1010 MDB_val *key, int modify);
1011 #define MDB_PS_MODIFY 1
1012 #define MDB_PS_ROOTONLY 2
1013 static int mdb_page_search(MDB_cursor *mc,
1014 MDB_val *key, int flags);
1015 static int mdb_page_merge(MDB_cursor *csrc, MDB_cursor *cdst);
1017 #define MDB_SPLIT_REPLACE MDB_APPENDDUP /**< newkey is not new */
1018 static int mdb_page_split(MDB_cursor *mc, MDB_val *newkey, MDB_val *newdata,
1019 pgno_t newpgno, unsigned int nflags);
1021 static int mdb_env_read_header(MDB_env *env, MDB_meta *meta);
1022 static int mdb_env_pick_meta(const MDB_env *env);
1023 static int mdb_env_write_meta(MDB_txn *txn);
1024 #if !(defined(_WIN32) || defined(MDB_USE_POSIX_SEM)) /* Drop unused excl arg */
1025 # define mdb_env_close0(env, excl) mdb_env_close1(env)
1027 static void mdb_env_close0(MDB_env *env, int excl);
1029 static MDB_node *mdb_node_search(MDB_cursor *mc, MDB_val *key, int *exactp);
1030 static int mdb_node_add(MDB_cursor *mc, indx_t indx,
1031 MDB_val *key, MDB_val *data, pgno_t pgno, unsigned int flags);
1032 static void mdb_node_del(MDB_page *mp, indx_t indx, int ksize);
1033 static void mdb_node_shrink(MDB_page *mp, indx_t indx);
1034 static int mdb_node_move(MDB_cursor *csrc, MDB_cursor *cdst);
1035 static int mdb_node_read(MDB_txn *txn, MDB_node *leaf, MDB_val *data);
1036 static size_t mdb_leaf_size(MDB_env *env, MDB_val *key, MDB_val *data);
1037 static size_t mdb_branch_size(MDB_env *env, MDB_val *key);
1039 static int mdb_rebalance(MDB_cursor *mc);
1040 static int mdb_update_key(MDB_cursor *mc, MDB_val *key);
1042 static void mdb_cursor_pop(MDB_cursor *mc);
1043 static int mdb_cursor_push(MDB_cursor *mc, MDB_page *mp);
1045 static int mdb_cursor_del0(MDB_cursor *mc, MDB_node *leaf);
1046 static int mdb_cursor_sibling(MDB_cursor *mc, int move_right);
1047 static int mdb_cursor_next(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op);
1048 static int mdb_cursor_prev(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op);
1049 static int mdb_cursor_set(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op,
1051 static int mdb_cursor_first(MDB_cursor *mc, MDB_val *key, MDB_val *data);
1052 static int mdb_cursor_last(MDB_cursor *mc, MDB_val *key, MDB_val *data);
1054 static void mdb_cursor_init(MDB_cursor *mc, MDB_txn *txn, MDB_dbi dbi, MDB_xcursor *mx);
1055 static void mdb_xcursor_init0(MDB_cursor *mc);
1056 static void mdb_xcursor_init1(MDB_cursor *mc, MDB_node *node);
1058 static int mdb_drop0(MDB_cursor *mc, int subs);
1059 static void mdb_default_cmp(MDB_txn *txn, MDB_dbi dbi);
1062 static MDB_cmp_func mdb_cmp_memn, mdb_cmp_memnr, mdb_cmp_int, mdb_cmp_cint, mdb_cmp_long;
1066 static SECURITY_DESCRIPTOR mdb_null_sd;
1067 static SECURITY_ATTRIBUTES mdb_all_sa;
1068 static int mdb_sec_inited;
1071 /** Return the library version info. */
1073 mdb_version(int *major, int *minor, int *patch)
1075 if (major) *major = MDB_VERSION_MAJOR;
1076 if (minor) *minor = MDB_VERSION_MINOR;
1077 if (patch) *patch = MDB_VERSION_PATCH;
1078 return MDB_VERSION_STRING;
1081 /** Table of descriptions for MDB @ref errors */
1082 static char *const mdb_errstr[] = {
1083 "MDB_KEYEXIST: Key/data pair already exists",
1084 "MDB_NOTFOUND: No matching key/data pair found",
1085 "MDB_PAGE_NOTFOUND: Requested page not found",
1086 "MDB_CORRUPTED: Located page was wrong type",
1087 "MDB_PANIC: Update of meta page failed",
1088 "MDB_VERSION_MISMATCH: Database environment version mismatch",
1089 "MDB_INVALID: File is not an MDB file",
1090 "MDB_MAP_FULL: Environment mapsize limit reached",
1091 "MDB_DBS_FULL: Environment maxdbs limit reached",
1092 "MDB_READERS_FULL: Environment maxreaders limit reached",
1093 "MDB_TLS_FULL: Thread-local storage keys full - too many environments open",
1094 "MDB_TXN_FULL: Transaction has too many dirty pages - transaction too big",
1095 "MDB_CURSOR_FULL: Internal error - cursor stack limit reached",
1096 "MDB_PAGE_FULL: Internal error - page has no more space",
1097 "MDB_MAP_RESIZED: Database contents grew beyond environment mapsize",
1098 "MDB_INCOMPATIBLE: Database flags changed or would change",
1099 "MDB_BAD_RSLOT: Invalid reuse of reader locktable slot",
1103 mdb_strerror(int err)
1107 return ("Successful return: 0");
1109 if (err >= MDB_KEYEXIST && err <= MDB_LAST_ERRCODE) {
1110 i = err - MDB_KEYEXIST;
1111 return mdb_errstr[i];
1114 return strerror(err);
1118 /** Display a key in hexadecimal and return the address of the result.
1119 * @param[in] key the key to display
1120 * @param[in] buf the buffer to write into. Should always be #DKBUF.
1121 * @return The key in hexadecimal form.
1124 mdb_dkey(MDB_val *key, char *buf)
1127 unsigned char *c = key->mv_data;
1133 if (key->mv_size > MDB_MAXKEYSIZE)
1134 return "MDB_MAXKEYSIZE";
1135 /* may want to make this a dynamic check: if the key is mostly
1136 * printable characters, print it as-is instead of converting to hex.
1140 for (i=0; i<key->mv_size; i++)
1141 ptr += sprintf(ptr, "%02x", *c++);
1143 sprintf(buf, "%.*s", key->mv_size, key->mv_data);
1148 /** Display all the keys in the page. */
1150 mdb_page_list(MDB_page *mp)
1153 unsigned int i, nkeys, nsize;
1157 nkeys = NUMKEYS(mp);
1158 fprintf(stderr, "Page %zu numkeys %d\n", mp->mp_pgno, nkeys);
1159 for (i=0; i<nkeys; i++) {
1160 node = NODEPTR(mp, i);
1161 key.mv_size = node->mn_ksize;
1162 key.mv_data = node->mn_data;
1163 nsize = NODESIZE + NODEKSZ(node) + sizeof(indx_t);
1164 if (IS_BRANCH(mp)) {
1165 fprintf(stderr, "key %d: page %zu, %s\n", i, NODEPGNO(node),
1168 if (F_ISSET(node->mn_flags, F_BIGDATA))
1169 nsize += sizeof(pgno_t);
1171 nsize += NODEDSZ(node);
1172 fprintf(stderr, "key %d: nsize %d, %s\n", i, nsize, DKEY(&key));
1178 mdb_cursor_chk(MDB_cursor *mc)
1184 if (!mc->mc_snum && !(mc->mc_flags & C_INITIALIZED)) return;
1185 for (i=0; i<mc->mc_top; i++) {
1187 node = NODEPTR(mp, mc->mc_ki[i]);
1188 if (NODEPGNO(node) != mc->mc_pg[i+1]->mp_pgno)
1191 if (mc->mc_ki[i] >= NUMKEYS(mc->mc_pg[i]))
1197 /** Count all the pages in each DB and in the freelist
1198 * and make sure it matches the actual number of pages
1201 static void mdb_audit(MDB_txn *txn)
1205 MDB_ID freecount, count;
1210 mdb_cursor_init(&mc, txn, FREE_DBI, NULL);
1211 while ((rc = mdb_cursor_get(&mc, &key, &data, MDB_NEXT)) == 0)
1212 freecount += *(MDB_ID *)data.mv_data;
1215 for (i = 0; i<txn->mt_numdbs; i++) {
1217 mdb_cursor_init(&mc, txn, i, &mx);
1218 if (txn->mt_dbs[i].md_root == P_INVALID)
1220 count += txn->mt_dbs[i].md_branch_pages +
1221 txn->mt_dbs[i].md_leaf_pages +
1222 txn->mt_dbs[i].md_overflow_pages;
1223 if (txn->mt_dbs[i].md_flags & MDB_DUPSORT) {
1224 mdb_page_search(&mc, NULL, 0);
1228 mp = mc.mc_pg[mc.mc_top];
1229 for (j=0; j<NUMKEYS(mp); j++) {
1230 MDB_node *leaf = NODEPTR(mp, j);
1231 if (leaf->mn_flags & F_SUBDATA) {
1233 memcpy(&db, NODEDATA(leaf), sizeof(db));
1234 count += db.md_branch_pages + db.md_leaf_pages +
1235 db.md_overflow_pages;
1239 while (mdb_cursor_sibling(&mc, 1) == 0);
1242 if (freecount + count + 2 /* metapages */ != txn->mt_next_pgno) {
1243 fprintf(stderr, "audit: %lu freecount: %lu count: %lu total: %lu next_pgno: %lu\n",
1244 txn->mt_txnid, freecount, count+2, freecount+count+2, txn->mt_next_pgno);
1250 mdb_cmp(MDB_txn *txn, MDB_dbi dbi, const MDB_val *a, const MDB_val *b)
1252 return txn->mt_dbxs[dbi].md_cmp(a, b);
1256 mdb_dcmp(MDB_txn *txn, MDB_dbi dbi, const MDB_val *a, const MDB_val *b)
1258 return txn->mt_dbxs[dbi].md_dcmp(a, b);
1261 /** Allocate a page.
1262 * Re-use old malloc'd pages first for singletons, otherwise just malloc.
1265 mdb_page_malloc(MDB_txn *txn, unsigned num)
1267 MDB_env *env = txn->mt_env;
1268 MDB_page *ret = env->me_dpages;
1269 size_t sz = env->me_psize;
1272 VGMEMP_ALLOC(env, ret, sz);
1273 VGMEMP_DEFINED(ret, sizeof(ret->mp_next));
1274 env->me_dpages = ret->mp_next;
1280 if ((ret = malloc(sz)) != NULL) {
1281 VGMEMP_ALLOC(env, ret, sz);
1286 /** Free a single page.
1287 * Saves single pages to a list, for future reuse.
1288 * (This is not used for multi-page overflow pages.)
1291 mdb_page_free(MDB_env *env, MDB_page *mp)
1293 mp->mp_next = env->me_dpages;
1294 VGMEMP_FREE(env, mp);
1295 env->me_dpages = mp;
1298 /* Free a dirty page */
1300 mdb_dpage_free(MDB_env *env, MDB_page *dp)
1302 if (!IS_OVERFLOW(dp) || dp->mp_pages == 1) {
1303 mdb_page_free(env, dp);
1305 /* large pages just get freed directly */
1306 VGMEMP_FREE(env, dp);
1311 /* Return all dirty pages to dpage list */
1313 mdb_dlist_free(MDB_txn *txn)
1315 MDB_env *env = txn->mt_env;
1316 MDB_ID2L dl = txn->mt_u.dirty_list;
1317 unsigned i, n = dl[0].mid;
1319 for (i = 1; i <= n; i++) {
1320 mdb_dpage_free(env, dl[i].mptr);
1325 /** Find oldest txnid still referenced. Expects txn->mt_txnid > 0. */
1327 mdb_find_oldest(MDB_txn *txn)
1330 txnid_t mr, oldest = txn->mt_txnid - 1;
1331 MDB_reader *r = txn->mt_env->me_txns->mti_readers;
1332 for (i = txn->mt_env->me_txns->mti_numreaders; --i >= 0; ) {
1342 /** Allocate pages for writing.
1343 * If there are free pages available from older transactions, they
1344 * will be re-used first. Otherwise a new page will be allocated.
1345 * @param[in] mc cursor A cursor handle identifying the transaction and
1346 * database for which we are allocating.
1347 * @param[in] num the number of pages to allocate.
1348 * @param[out] mp Address of the allocated page(s). Requests for multiple pages
1349 * will always be satisfied by a single contiguous chunk of memory.
1350 * @return 0 on success, non-zero on failure.
1353 mdb_page_alloc(MDB_cursor *mc, int num, MDB_page **mp)
1355 #ifdef MDB_PARANOID /* Seems like we can ignore this now */
1356 /* Get at most <Max_retries> more freeDB records once me_pghead
1357 * has enough pages. If not enough, use new pages from the map.
1358 * If <Paranoid> and mc is updating the freeDB, only get new
1359 * records if me_pghead is empty. Then the freelist cannot play
1360 * catch-up with itself by growing while trying to save it.
1362 enum { Paranoid = 1, Max_retries = 500 };
1364 enum { Paranoid = 0, Max_retries = INT_MAX /*infinite*/ };
1366 int rc, n2 = num-1, retry = Max_retries;
1367 MDB_txn *txn = mc->mc_txn;
1368 MDB_env *env = txn->mt_env;
1369 pgno_t pgno, *mop = env->me_pghead;
1370 unsigned i, j, k, mop_len = mop ? mop[0] : 0;
1373 txnid_t oldest = 0, last;
1376 int (*insert)(MDB_ID2L, MDB_ID2 *);
1380 /* If our dirty list is already full, we can't do anything */
1381 if (txn->mt_dirty_room == 0)
1382 return MDB_TXN_FULL;
1384 for (op = MDB_FIRST;; op = MDB_NEXT) {
1387 pgno_t *idl, old_id, new_id;
1389 /* Seek a big enough contiguous page range. Prefer
1390 * pages at the tail, just truncating the list.
1392 if (mop_len >= (unsigned)num) {
1396 if (mop[i-n2] == pgno+n2)
1398 } while (--i >= (unsigned)num);
1399 if (Max_retries < INT_MAX && --retry < 0)
1403 if (op == MDB_FIRST) { /* 1st iteration */
1404 /* Prepare to fetch more and coalesce */
1405 oldest = mdb_find_oldest(txn);
1406 last = env->me_pglast;
1407 mdb_cursor_init(&m2, txn, FREE_DBI, NULL);
1410 key.mv_data = &last; /* will loop up last+1 */
1411 key.mv_size = sizeof(last);
1413 if (Paranoid && mc->mc_dbi == FREE_DBI)
1416 if (Paranoid && retry < 0 && mop_len)
1420 /* Do not fetch more if the record will be too recent */
1423 rc = mdb_cursor_get(&m2, &key, NULL, op);
1425 if (rc == MDB_NOTFOUND)
1429 last = *(txnid_t*)key.mv_data;
1432 np = m2.mc_pg[m2.mc_top];
1433 leaf = NODEPTR(np, m2.mc_ki[m2.mc_top]);
1434 if ((rc = mdb_node_read(txn, leaf, &data)) != MDB_SUCCESS)
1437 idl = (MDB_ID *) data.mv_data;
1440 if (!(env->me_pghead = mop = mdb_midl_alloc(i)))
1443 if ((rc = mdb_midl_need(&env->me_pghead, i)) != 0)
1445 mop = env->me_pghead;
1447 env->me_pglast = last;
1449 DPRINTF("IDL read txn %zu root %zu num %u",
1450 last, txn->mt_dbs[FREE_DBI].md_root, i);
1452 DPRINTF("IDL %zu", idl[k]);
1454 /* Merge in descending sorted order */
1457 mop[0] = (pgno_t)-1;
1461 for (; old_id < new_id; old_id = mop[--j])
1468 /* Use new pages from the map when nothing suitable in the freeDB */
1470 pgno = txn->mt_next_pgno;
1471 if (pgno + num >= env->me_maxpg) {
1472 DPUTS("DB size maxed out");
1473 return MDB_MAP_FULL;
1477 if (env->me_flags & MDB_WRITEMAP) {
1478 np = (MDB_page *)(env->me_map + env->me_psize * pgno);
1479 insert = mdb_mid2l_append;
1481 if (!(np = mdb_page_malloc(txn, num)))
1483 insert = mdb_mid2l_insert;
1486 mop[0] = mop_len -= num;
1487 /* Move any stragglers down */
1488 for (j = i-num; j < mop_len; )
1489 mop[++j] = mop[++i];
1491 txn->mt_next_pgno = pgno + num;
1493 mid.mid = np->mp_pgno = pgno;
1495 insert(txn->mt_u.dirty_list, &mid);
1496 txn->mt_dirty_room--;
1502 /** Copy the used portions of a non-overflow page.
1503 * @param[in] dst page to copy into
1504 * @param[in] src page to copy from
1505 * @param[in] psize size of a page
1508 mdb_page_copy(MDB_page *dst, MDB_page *src, unsigned int psize)
1510 enum { Align = sizeof(pgno_t) };
1511 indx_t upper = src->mp_upper, lower = src->mp_lower, unused = upper-lower;
1513 /* If page isn't full, just copy the used portion. Adjust
1514 * alignment so memcpy may copy words instead of bytes.
1516 if ((unused &= -Align) && !IS_LEAF2(src)) {
1518 memcpy(dst, src, (lower + (Align-1)) & -Align);
1519 memcpy((pgno_t *)((char *)dst+upper), (pgno_t *)((char *)src+upper),
1522 memcpy(dst, src, psize - unused);
1526 /** Touch a page: make it dirty and re-insert into tree with updated pgno.
1527 * @param[in] mc cursor pointing to the page to be touched
1528 * @return 0 on success, non-zero on failure.
1531 mdb_page_touch(MDB_cursor *mc)
1533 MDB_page *mp = mc->mc_pg[mc->mc_top], *np;
1534 MDB_txn *txn = mc->mc_txn;
1535 MDB_cursor *m2, *m3;
1540 if (!F_ISSET(mp->mp_flags, P_DIRTY)) {
1541 if ((rc = mdb_midl_need(&txn->mt_free_pgs, 1)) ||
1542 (rc = mdb_page_alloc(mc, 1, &np)))
1545 DPRINTF("touched db %u page %zu -> %zu", mc->mc_dbi,mp->mp_pgno,pgno);
1546 assert(mp->mp_pgno != pgno);
1547 mdb_midl_xappend(txn->mt_free_pgs, mp->mp_pgno);
1548 /* Update the parent page, if any, to point to the new page */
1550 MDB_page *parent = mc->mc_pg[mc->mc_top-1];
1551 MDB_node *node = NODEPTR(parent, mc->mc_ki[mc->mc_top-1]);
1552 SETPGNO(node, pgno);
1554 mc->mc_db->md_root = pgno;
1556 } else if (txn->mt_parent && !IS_SUBP(mp)) {
1557 MDB_ID2 mid, *dl = txn->mt_u.dirty_list;
1559 /* If txn has a parent, make sure the page is in our
1563 unsigned x = mdb_mid2l_search(dl, pgno);
1564 if (x <= dl[0].mid && dl[x].mid == pgno) {
1567 mc->mc_pg[mc->mc_top] = np;
1571 assert(dl[0].mid < MDB_IDL_UM_MAX);
1573 np = mdb_page_malloc(txn, 1);
1578 mdb_mid2l_insert(dl, &mid);
1583 mdb_page_copy(np, mp, txn->mt_env->me_psize);
1585 np->mp_flags |= P_DIRTY;
1587 /* Adjust cursors pointing to mp */
1588 mc->mc_pg[mc->mc_top] = np;
1590 if (mc->mc_flags & C_SUB) {
1592 for (m2 = txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
1593 m3 = &m2->mc_xcursor->mx_cursor;
1594 if (m3->mc_snum < mc->mc_snum) continue;
1595 if (m3->mc_pg[mc->mc_top] == mp)
1596 m3->mc_pg[mc->mc_top] = np;
1599 for (m2 = txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
1600 if (m2->mc_snum < mc->mc_snum) continue;
1601 if (m2->mc_pg[mc->mc_top] == mp) {
1602 m2->mc_pg[mc->mc_top] = np;
1603 if ((mc->mc_db->md_flags & MDB_DUPSORT) &&
1604 m2->mc_ki[mc->mc_top] == mc->mc_ki[mc->mc_top])
1606 MDB_node *leaf = NODEPTR(np, mc->mc_ki[mc->mc_top]);
1607 if (!(leaf->mn_flags & F_SUBDATA))
1608 m2->mc_xcursor->mx_cursor.mc_pg[0] = NODEDATA(leaf);
1617 mdb_env_sync(MDB_env *env, int force)
1620 if (force || !F_ISSET(env->me_flags, MDB_NOSYNC)) {
1621 if (env->me_flags & MDB_WRITEMAP) {
1622 int flags = ((env->me_flags & MDB_MAPASYNC) && !force)
1623 ? MS_ASYNC : MS_SYNC;
1624 if (MDB_MSYNC(env->me_map, env->me_mapsize, flags))
1627 else if (flags == MS_SYNC && MDB_FDATASYNC(env->me_fd))
1631 if (MDB_FDATASYNC(env->me_fd))
1638 /** Make shadow copies of all of parent txn's cursors */
1640 mdb_cursor_shadow(MDB_txn *src, MDB_txn *dst)
1642 MDB_cursor *mc, *m2;
1643 unsigned int i, j, size;
1645 for (i=0;i<src->mt_numdbs; i++) {
1646 if (src->mt_cursors[i]) {
1647 size = sizeof(MDB_cursor);
1648 if (src->mt_cursors[i]->mc_xcursor)
1649 size += sizeof(MDB_xcursor);
1650 for (m2 = src->mt_cursors[i]; m2; m2=m2->mc_next) {
1657 mc->mc_db = &dst->mt_dbs[i];
1658 mc->mc_dbx = m2->mc_dbx;
1659 mc->mc_dbflag = &dst->mt_dbflags[i];
1660 mc->mc_snum = m2->mc_snum;
1661 mc->mc_top = m2->mc_top;
1662 mc->mc_flags = m2->mc_flags | (C_SHADOW|C_ALLOCD);
1663 for (j=0; j<mc->mc_snum; j++) {
1664 mc->mc_pg[j] = m2->mc_pg[j];
1665 mc->mc_ki[j] = m2->mc_ki[j];
1667 if (m2->mc_xcursor) {
1668 MDB_xcursor *mx, *mx2;
1669 mx = (MDB_xcursor *)(mc+1);
1670 mc->mc_xcursor = mx;
1671 mx2 = m2->mc_xcursor;
1672 mx->mx_db = mx2->mx_db;
1673 mx->mx_dbx = mx2->mx_dbx;
1674 mx->mx_dbflag = mx2->mx_dbflag;
1675 mx->mx_cursor.mc_txn = dst;
1676 mx->mx_cursor.mc_dbi = mx2->mx_cursor.mc_dbi;
1677 mx->mx_cursor.mc_db = &mx->mx_db;
1678 mx->mx_cursor.mc_dbx = &mx->mx_dbx;
1679 mx->mx_cursor.mc_dbflag = &mx->mx_dbflag;
1680 mx->mx_cursor.mc_snum = mx2->mx_cursor.mc_snum;
1681 mx->mx_cursor.mc_top = mx2->mx_cursor.mc_top;
1682 mx->mx_cursor.mc_flags = mx2->mx_cursor.mc_flags | C_SHADOW;
1683 for (j=0; j<mx2->mx_cursor.mc_snum; j++) {
1684 mx->mx_cursor.mc_pg[j] = mx2->mx_cursor.mc_pg[j];
1685 mx->mx_cursor.mc_ki[j] = mx2->mx_cursor.mc_ki[j];
1688 mc->mc_xcursor = NULL;
1690 mc->mc_next = dst->mt_cursors[i];
1691 dst->mt_cursors[i] = mc;
1698 /** Close this write txn's cursors, after optionally merging its shadow
1699 * cursors back into parent's.
1700 * @param[in] txn the transaction handle.
1701 * @param[in] merge 0 to not merge cursors, C_SHADOW to merge.
1702 * @return 0 on success, non-zero on failure.
1705 mdb_cursors_close(MDB_txn *txn, unsigned merge)
1707 MDB_cursor **cursors = txn->mt_cursors, *mc, *next;
1710 for (i = txn->mt_numdbs; --i >= 0; ) {
1711 for (mc = cursors[i]; mc; mc = next) {
1713 if (mc->mc_flags & merge) {
1714 MDB_cursor *m2 = mc->mc_orig;
1715 m2->mc_snum = mc->mc_snum;
1716 m2->mc_top = mc->mc_top;
1717 for (j = mc->mc_snum; --j >= 0; ) {
1718 m2->mc_pg[j] = mc->mc_pg[j];
1719 m2->mc_ki[j] = mc->mc_ki[j];
1722 if (mc->mc_flags & C_ALLOCD)
1729 #ifdef MDB_DEBUG_SKIP
1730 #define mdb_txn_reset0(txn, act) mdb_txn_reset0(txn)
1733 mdb_txn_reset0(MDB_txn *txn, const char *act);
1735 /** Common code for #mdb_txn_begin() and #mdb_txn_renew().
1736 * @param[in] txn the transaction handle to initialize
1737 * @return 0 on success, non-zero on failure.
1740 mdb_txn_renew0(MDB_txn *txn)
1742 MDB_env *env = txn->mt_env;
1745 int rc, new_notls = 0;
1748 txn->mt_numdbs = env->me_numdbs;
1749 txn->mt_dbxs = env->me_dbxs; /* mostly static anyway */
1751 if (txn->mt_flags & MDB_TXN_RDONLY) {
1752 if (!env->me_txns) {
1753 i = mdb_env_pick_meta(env);
1754 txn->mt_txnid = env->me_metas[i]->mm_txnid;
1755 txn->mt_u.reader = NULL;
1757 MDB_reader *r = (env->me_flags & MDB_NOTLS) ? txn->mt_u.reader :
1758 pthread_getspecific(env->me_txkey);
1760 if (r->mr_pid != env->me_pid || r->mr_txnid != (txnid_t)-1)
1761 return MDB_BAD_RSLOT;
1763 pid_t pid = env->me_pid;
1764 pthread_t tid = pthread_self();
1767 for (i=0; i<env->me_txns->mti_numreaders; i++)
1768 if (env->me_txns->mti_readers[i].mr_pid == 0)
1770 if (i == env->me_maxreaders) {
1771 UNLOCK_MUTEX_R(env);
1772 return MDB_READERS_FULL;
1774 env->me_txns->mti_readers[i].mr_pid = pid;
1775 env->me_txns->mti_readers[i].mr_tid = tid;
1776 if (i >= env->me_txns->mti_numreaders)
1777 env->me_txns->mti_numreaders = i+1;
1778 /* Save numreaders for un-mutexed mdb_env_close() */
1779 env->me_numreaders = env->me_txns->mti_numreaders;
1780 UNLOCK_MUTEX_R(env);
1781 r = &env->me_txns->mti_readers[i];
1782 new_notls = (env->me_flags & MDB_NOTLS);
1783 if (!new_notls && (rc=pthread_setspecific(env->me_txkey, r))) {
1788 txn->mt_txnid = r->mr_txnid = env->me_txns->mti_txnid;
1789 txn->mt_u.reader = r;
1791 txn->mt_toggle = txn->mt_txnid & 1;
1795 txn->mt_txnid = env->me_txns->mti_txnid;
1796 txn->mt_toggle = txn->mt_txnid & 1;
1799 if (txn->mt_txnid == mdb_debug_start)
1802 txn->mt_dirty_room = MDB_IDL_UM_MAX;
1803 txn->mt_u.dirty_list = env->me_dirty_list;
1804 txn->mt_u.dirty_list[0].mid = 0;
1805 txn->mt_free_pgs = env->me_free_pgs;
1806 txn->mt_free_pgs[0] = 0;
1810 /* Copy the DB info and flags */
1811 memcpy(txn->mt_dbs, env->me_metas[txn->mt_toggle]->mm_dbs, 2 * sizeof(MDB_db));
1813 /* Moved to here to avoid a data race in read TXNs */
1814 txn->mt_next_pgno = env->me_metas[txn->mt_toggle]->mm_last_pg+1;
1816 for (i=2; i<txn->mt_numdbs; i++) {
1817 x = env->me_dbflags[i];
1818 txn->mt_dbs[i].md_flags = x & PERSISTENT_FLAGS;
1819 txn->mt_dbflags[i] = (x & MDB_VALID) ? DB_VALID|DB_STALE : 0;
1821 txn->mt_dbflags[0] = txn->mt_dbflags[1] = DB_VALID;
1823 if (env->me_maxpg < txn->mt_next_pgno) {
1824 mdb_txn_reset0(txn, "renew0-mapfail");
1826 txn->mt_u.reader->mr_pid = 0;
1827 txn->mt_u.reader = NULL;
1829 return MDB_MAP_RESIZED;
1836 mdb_txn_renew(MDB_txn *txn)
1840 if (!txn || txn->mt_dbxs) /* A reset txn has mt_dbxs==NULL */
1843 if (txn->mt_env->me_flags & MDB_FATAL_ERROR) {
1844 DPUTS("environment had fatal error, must shutdown!");
1848 rc = mdb_txn_renew0(txn);
1849 if (rc == MDB_SUCCESS) {
1850 DPRINTF("renew txn %zu%c %p on mdbenv %p, root page %zu",
1851 txn->mt_txnid, (txn->mt_flags & MDB_TXN_RDONLY) ? 'r' : 'w',
1852 (void *)txn, (void *)txn->mt_env, txn->mt_dbs[MAIN_DBI].md_root);
1858 mdb_txn_begin(MDB_env *env, MDB_txn *parent, unsigned int flags, MDB_txn **ret)
1862 int rc, size, tsize = sizeof(MDB_txn);
1864 if (env->me_flags & MDB_FATAL_ERROR) {
1865 DPUTS("environment had fatal error, must shutdown!");
1868 if ((env->me_flags & MDB_RDONLY) && !(flags & MDB_RDONLY))
1871 /* Nested transactions: Max 1 child, write txns only, no writemap */
1872 if (parent->mt_child ||
1873 (flags & MDB_RDONLY) || (parent->mt_flags & MDB_TXN_RDONLY) ||
1874 (env->me_flags & MDB_WRITEMAP))
1878 tsize = sizeof(MDB_ntxn);
1880 size = tsize + env->me_maxdbs * (sizeof(MDB_db)+1);
1881 if (!(flags & MDB_RDONLY))
1882 size += env->me_maxdbs * sizeof(MDB_cursor *);
1884 if ((txn = calloc(1, size)) == NULL) {
1885 DPRINTF("calloc: %s", strerror(ErrCode()));
1888 txn->mt_dbs = (MDB_db *) ((char *)txn + tsize);
1889 if (flags & MDB_RDONLY) {
1890 txn->mt_flags |= MDB_TXN_RDONLY;
1891 txn->mt_dbflags = (unsigned char *)(txn->mt_dbs + env->me_maxdbs);
1893 txn->mt_cursors = (MDB_cursor **)(txn->mt_dbs + env->me_maxdbs);
1894 txn->mt_dbflags = (unsigned char *)(txn->mt_cursors + env->me_maxdbs);
1900 txn->mt_u.dirty_list = malloc(sizeof(MDB_ID2)*MDB_IDL_UM_SIZE);
1901 if (!txn->mt_u.dirty_list ||
1902 !(txn->mt_free_pgs = mdb_midl_alloc(MDB_IDL_UM_MAX)))
1904 free(txn->mt_u.dirty_list);
1908 txn->mt_txnid = parent->mt_txnid;
1909 txn->mt_toggle = parent->mt_toggle;
1910 txn->mt_dirty_room = parent->mt_dirty_room;
1911 txn->mt_u.dirty_list[0].mid = 0;
1912 txn->mt_next_pgno = parent->mt_next_pgno;
1913 parent->mt_child = txn;
1914 txn->mt_parent = parent;
1915 txn->mt_numdbs = parent->mt_numdbs;
1916 txn->mt_flags = parent->mt_flags;
1917 txn->mt_dbxs = parent->mt_dbxs;
1918 memcpy(txn->mt_dbs, parent->mt_dbs, txn->mt_numdbs * sizeof(MDB_db));
1919 /* Copy parent's mt_dbflags, but clear DB_NEW */
1920 for (i=0; i<txn->mt_numdbs; i++)
1921 txn->mt_dbflags[i] = parent->mt_dbflags[i] & ~DB_NEW;
1923 ntxn = (MDB_ntxn *)txn;
1924 ntxn->mnt_pgstate = env->me_pgstate; /* save parent me_pghead & co */
1925 if (env->me_pghead) {
1926 size = MDB_IDL_SIZEOF(env->me_pghead);
1927 env->me_pghead = mdb_midl_alloc(env->me_pghead[0]);
1929 memcpy(env->me_pghead, ntxn->mnt_pgstate.mf_pghead, size);
1934 rc = mdb_cursor_shadow(parent, txn);
1936 mdb_txn_reset0(txn, "beginchild-fail");
1938 rc = mdb_txn_renew0(txn);
1944 DPRINTF("begin txn %zu%c %p on mdbenv %p, root page %zu",
1945 txn->mt_txnid, (txn->mt_flags & MDB_TXN_RDONLY) ? 'r' : 'w',
1946 (void *) txn, (void *) env, txn->mt_dbs[MAIN_DBI].md_root);
1952 /** Export or close DBI handles opened in this txn. */
1954 mdb_dbis_update(MDB_txn *txn, int keep)
1957 MDB_dbi n = txn->mt_numdbs;
1958 MDB_env *env = txn->mt_env;
1959 unsigned char *tdbflags = txn->mt_dbflags;
1961 for (i = n; --i >= 2;) {
1962 if (tdbflags[i] & DB_NEW) {
1964 env->me_dbflags[i] = txn->mt_dbs[i].md_flags | MDB_VALID;
1966 char *ptr = env->me_dbxs[i].md_name.mv_data;
1967 env->me_dbxs[i].md_name.mv_data = NULL;
1968 env->me_dbxs[i].md_name.mv_size = 0;
1969 env->me_dbflags[i] = 0;
1974 if (keep && env->me_numdbs < n)
1978 /** Common code for #mdb_txn_reset() and #mdb_txn_abort().
1979 * May be called twice for readonly txns: First reset it, then abort.
1980 * @param[in] txn the transaction handle to reset
1983 mdb_txn_reset0(MDB_txn *txn, const char *act)
1985 MDB_env *env = txn->mt_env;
1987 /* Close any DBI handles opened in this txn */
1988 mdb_dbis_update(txn, 0);
1990 DPRINTF("%s txn %zu%c %p on mdbenv %p, root page %zu",
1991 act, txn->mt_txnid, (txn->mt_flags & MDB_TXN_RDONLY) ? 'r' : 'w',
1992 (void *) txn, (void *)env, txn->mt_dbs[MAIN_DBI].md_root);
1994 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY)) {
1995 if (txn->mt_u.reader) {
1996 txn->mt_u.reader->mr_txnid = (txnid_t)-1;
1997 if (!(env->me_flags & MDB_NOTLS))
1998 txn->mt_u.reader = NULL; /* txn does not own reader */
2000 txn->mt_numdbs = 0; /* close nothing if called again */
2001 txn->mt_dbxs = NULL; /* mark txn as reset */
2003 mdb_cursors_close(txn, 0);
2005 if (!(env->me_flags & MDB_WRITEMAP)) {
2006 mdb_dlist_free(txn);
2008 mdb_midl_free(env->me_pghead);
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);
2018 if (mdb_midl_shrink(&txn->mt_free_pgs))
2019 env->me_free_pgs = txn->mt_free_pgs;
2020 env->me_pghead = NULL;
2024 /* The writer mutex was locked in mdb_txn_begin. */
2025 UNLOCK_MUTEX_W(env);
2030 mdb_txn_reset(MDB_txn *txn)
2035 /* This call is only valid for read-only txns */
2036 if (!(txn->mt_flags & MDB_TXN_RDONLY))
2039 mdb_txn_reset0(txn, "reset");
2043 mdb_txn_abort(MDB_txn *txn)
2049 mdb_txn_abort(txn->mt_child);
2051 mdb_txn_reset0(txn, "abort");
2052 /* Free reader slot tied to this txn (if MDB_NOTLS && writable FS) */
2053 if ((txn->mt_flags & MDB_TXN_RDONLY) && txn->mt_u.reader)
2054 txn->mt_u.reader->mr_pid = 0;
2059 /** Save the freelist as of this transaction to the freeDB.
2060 * This changes the freelist. Keep trying until it stabilizes.
2063 mdb_freelist_save(MDB_txn *txn)
2065 /* env->me_pghead[] can grow and shrink during this call.
2066 * env->me_pglast and txn->mt_free_pgs[] can only grow.
2067 * Page numbers cannot disappear from txn->mt_free_pgs[].
2070 MDB_env *env = txn->mt_env;
2071 int rc, maxfree_1pg = env->me_maxfree_1pg, more = 1;
2072 txnid_t pglast = 0, head_id = 0;
2073 pgno_t freecnt = 0, *free_pgs, *mop;
2074 ssize_t head_room = 0, total_room = 0, mop_len;
2076 mdb_cursor_init(&mc, txn, FREE_DBI, NULL);
2078 if (env->me_pghead) {
2079 /* Make sure first page of freeDB is touched and on freelist */
2080 rc = mdb_page_search(&mc, NULL, MDB_PS_MODIFY);
2081 if (rc && rc != MDB_NOTFOUND)
2086 /* Come back here after each Put() in case freelist changed */
2089 /* If using records from freeDB which we have not yet
2090 * deleted, delete them and any we reserved for me_pghead.
2092 while (pglast < env->me_pglast) {
2093 rc = mdb_cursor_first(&mc, &key, NULL);
2096 pglast = head_id = *(txnid_t *)key.mv_data;
2097 total_room = head_room = 0;
2098 assert(pglast <= env->me_pglast);
2099 rc = mdb_cursor_del(&mc, 0);
2104 /* Save the IDL of pages freed by this txn, to a single record */
2105 if (freecnt < txn->mt_free_pgs[0]) {
2107 /* Make sure last page of freeDB is touched and on freelist */
2108 key.mv_size = MDB_MAXKEYSIZE+1;
2110 rc = mdb_page_search(&mc, &key, MDB_PS_MODIFY);
2111 if (rc && rc != MDB_NOTFOUND)
2114 free_pgs = txn->mt_free_pgs;
2115 /* Write to last page of freeDB */
2116 key.mv_size = sizeof(txn->mt_txnid);
2117 key.mv_data = &txn->mt_txnid;
2119 freecnt = free_pgs[0];
2120 data.mv_size = MDB_IDL_SIZEOF(free_pgs);
2121 rc = mdb_cursor_put(&mc, &key, &data, MDB_RESERVE);
2124 /* Retry if mt_free_pgs[] grew during the Put() */
2125 free_pgs = txn->mt_free_pgs;
2126 } while (freecnt < free_pgs[0]);
2127 mdb_midl_sort(free_pgs);
2128 memcpy(data.mv_data, free_pgs, data.mv_size);
2131 unsigned int i = free_pgs[0];
2132 DPRINTF("IDL write txn %zu root %zu num %u",
2133 txn->mt_txnid, txn->mt_dbs[FREE_DBI].md_root, i);
2135 DPRINTF("IDL %zu", free_pgs[i]);
2141 mop = env->me_pghead;
2142 mop_len = mop ? mop[0] : 0;
2144 /* Reserve records for me_pghead[]. Split it if multi-page,
2145 * to avoid searching freeDB for a page range. Use keys in
2146 * range [1,me_pglast]: Smaller than txnid of oldest reader.
2148 if (total_room >= mop_len) {
2149 if (total_room == mop_len || --more < 0)
2151 } else if (head_room >= maxfree_1pg && head_id > 1) {
2152 /* Keep current record (overflow page), add a new one */
2156 /* (Re)write {key = head_id, IDL length = head_room} */
2157 total_room -= head_room;
2158 head_room = mop_len - total_room;
2159 if (head_room > maxfree_1pg && head_id > 1) {
2160 /* Overflow multi-page for part of me_pghead */
2161 head_room /= head_id; /* amortize page sizes */
2162 head_room += maxfree_1pg - head_room % (maxfree_1pg + 1);
2163 } else if (head_room < 0) {
2164 /* Rare case, not bothering to delete this record */
2167 key.mv_size = sizeof(head_id);
2168 key.mv_data = &head_id;
2169 data.mv_size = (head_room + 1) * sizeof(pgno_t);
2170 rc = mdb_cursor_put(&mc, &key, &data, MDB_RESERVE);
2173 *(MDB_ID *)data.mv_data = 0; /* IDL is initially empty */
2174 total_room += head_room;
2177 /* Fill in the reserved, touched me_pghead records. Avoid write ops
2178 * so they cannot rearrange anything, just read the destinations.
2185 rc = mdb_cursor_first(&mc, &key, &data);
2186 for (; !rc; rc = mdb_cursor_next(&mc, &key, &data, MDB_NEXT)) {
2187 MDB_IDL dest = data.mv_data;
2188 ssize_t len = (ssize_t)(data.mv_size / sizeof(MDB_ID)) - 1;
2190 assert(len >= 0 && *(txnid_t*)key.mv_data <= env->me_pglast);
2194 memcpy(dest, mop -= len, len * sizeof(MDB_ID));
2195 if (! (mop_len -= len))
2202 /** Flush dirty pages to the map, after clearing their dirty flag.
2205 mdb_page_flush(MDB_txn *txn)
2207 MDB_env *env = txn->mt_env;
2208 MDB_ID2L dl = txn->mt_u.dirty_list;
2209 unsigned psize = env->me_psize;
2210 int i, pagecount = dl[0].mid, rc;
2211 size_t size = 0, pos = 0;
2213 MDB_page *dp = NULL;
2217 struct iovec iov[MDB_COMMIT_PAGES];
2218 ssize_t wpos, wsize = 0, wres;
2219 size_t next_pos = 1; /* impossible pos, so pos != next_pos */
2223 if (env->me_flags & MDB_WRITEMAP) {
2224 /* Clear dirty flags */
2225 for (i = pagecount; i; i--) {
2227 dp->mp_flags &= ~P_DIRTY;
2233 /* Write the pages */
2235 if (i <= pagecount) {
2238 /* clear dirty flag */
2239 dp->mp_flags &= ~P_DIRTY;
2242 if (IS_OVERFLOW(dp)) size *= dp->mp_pages;
2247 /* Windows actually supports scatter/gather I/O, but only on
2248 * unbuffered file handles. Since we're relying on the OS page
2249 * cache for all our data, that's self-defeating. So we just
2250 * write pages one at a time. We use the ov structure to set
2251 * the write offset, to at least save the overhead of a Seek
2254 DPRINTF("committing page %zu", pgno);
2255 memset(&ov, 0, sizeof(ov));
2256 ov.Offset = pos & 0xffffffff;
2257 ov.OffsetHigh = pos >> 16 >> 16;
2258 if (!WriteFile(env->me_fd, dp, size, NULL, &ov)) {
2260 DPRINTF("WriteFile: %d", rc);
2264 /* Write up to MDB_COMMIT_PAGES dirty pages at a time. */
2265 if (pos!=next_pos || n==MDB_COMMIT_PAGES || wsize+size>MAX_WRITE) {
2267 /* Write previous page(s) */
2268 #ifdef MDB_USE_PWRITEV
2269 wres = pwritev(env->me_fd, iov, n, wpos);
2272 wres = pwrite(env->me_fd, iov[0].iov_base, wsize, wpos);
2274 if (lseek(env->me_fd, wpos, SEEK_SET) == -1) {
2276 DPRINTF("lseek: %s", strerror(rc));
2279 wres = writev(env->me_fd, iov, n);
2282 if (wres != wsize) {
2285 DPRINTF("Write error: %s", strerror(rc));
2287 rc = EIO; /* TODO: Use which error code? */
2288 DPUTS("short write, filesystem full?");
2299 DPRINTF("committing page %zu", pgno);
2300 next_pos = pos + size;
2301 iov[n].iov_len = size;
2302 iov[n].iov_base = (char *)dp;
2308 mdb_dlist_free(txn);
2314 mdb_txn_commit(MDB_txn *txn)
2320 assert(txn != NULL);
2321 assert(txn->mt_env != NULL);
2323 if (txn->mt_child) {
2324 rc = mdb_txn_commit(txn->mt_child);
2325 txn->mt_child = NULL;
2332 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY)) {
2333 mdb_dbis_update(txn, 1);
2334 txn->mt_numdbs = 2; /* so txn_abort() doesn't close any new handles */
2339 if (F_ISSET(txn->mt_flags, MDB_TXN_ERROR)) {
2340 DPUTS("error flag is set, can't commit");
2342 txn->mt_parent->mt_flags |= MDB_TXN_ERROR;
2347 if (txn->mt_parent) {
2348 MDB_txn *parent = txn->mt_parent;
2352 /* Append our free list to parent's */
2353 rc = mdb_midl_append_list(&parent->mt_free_pgs, txn->mt_free_pgs);
2356 mdb_midl_free(txn->mt_free_pgs);
2358 parent->mt_next_pgno = txn->mt_next_pgno;
2359 parent->mt_flags = txn->mt_flags;
2361 /* Merge our cursors into parent's and close them */
2362 mdb_cursors_close(txn, C_SHADOW);
2364 /* Update parent's DB table. */
2365 memcpy(parent->mt_dbs, txn->mt_dbs, txn->mt_numdbs * sizeof(MDB_db));
2366 txn->mt_parent->mt_numdbs = txn->mt_numdbs;
2367 txn->mt_parent->mt_dbflags[0] = txn->mt_dbflags[0];
2368 txn->mt_parent->mt_dbflags[1] = txn->mt_dbflags[1];
2369 for (i=2; i<txn->mt_numdbs; i++) {
2370 /* preserve parent's DB_NEW status */
2371 x = txn->mt_parent->mt_dbflags[i] & DB_NEW;
2372 txn->mt_parent->mt_dbflags[i] = txn->mt_dbflags[i] | x;
2375 dst = txn->mt_parent->mt_u.dirty_list;
2376 src = txn->mt_u.dirty_list;
2377 /* Find len = length of merging our dirty list with parent's */
2379 dst[0].mid = 0; /* simplify loops */
2380 if (parent->mt_parent) {
2381 len = x + src[0].mid;
2382 y = mdb_mid2l_search(src, dst[x].mid + 1) - 1;
2383 for (i = x; y && i; y--) {
2384 pgno_t yp = src[y].mid;
2385 while (yp < dst[i].mid)
2387 if (yp == dst[i].mid) {
2392 } else { /* Simplify the above for single-ancestor case */
2393 len = MDB_IDL_UM_MAX - txn->mt_dirty_room;
2395 /* Merge our dirty list with parent's */
2397 for (i = len; y; dst[i--] = src[y--]) {
2398 pgno_t yp = src[y].mid;
2399 while (yp < dst[x].mid)
2400 dst[i--] = dst[x--];
2401 if (yp == dst[x].mid)
2402 free(dst[x--].mptr);
2406 free(txn->mt_u.dirty_list);
2407 parent->mt_dirty_room = txn->mt_dirty_room;
2409 txn->mt_parent->mt_child = NULL;
2410 mdb_midl_free(((MDB_ntxn *)txn)->mnt_pgstate.mf_pghead);
2415 if (txn != env->me_txn) {
2416 DPUTS("attempt to commit unknown transaction");
2421 mdb_cursors_close(txn, 0);
2423 if (!txn->mt_u.dirty_list[0].mid && !(txn->mt_flags & MDB_TXN_DIRTY))
2426 DPRINTF("committing txn %zu %p on mdbenv %p, root page %zu",
2427 txn->mt_txnid, (void *)txn, (void *)env, txn->mt_dbs[MAIN_DBI].md_root);
2429 /* Update DB root pointers */
2430 if (txn->mt_numdbs > 2) {
2434 data.mv_size = sizeof(MDB_db);
2436 mdb_cursor_init(&mc, txn, MAIN_DBI, NULL);
2437 for (i = 2; i < txn->mt_numdbs; i++) {
2438 if (txn->mt_dbflags[i] & DB_DIRTY) {
2439 data.mv_data = &txn->mt_dbs[i];
2440 rc = mdb_cursor_put(&mc, &txn->mt_dbxs[i].md_name, &data, 0);
2447 rc = mdb_freelist_save(txn);
2451 mdb_midl_free(env->me_pghead);
2452 env->me_pghead = NULL;
2453 if (mdb_midl_shrink(&txn->mt_free_pgs))
2454 env->me_free_pgs = txn->mt_free_pgs;
2460 if ((rc = mdb_page_flush(txn)) ||
2461 (rc = mdb_env_sync(env, 0)) ||
2462 (rc = mdb_env_write_meta(txn)))
2468 mdb_dbis_update(txn, 1);
2470 UNLOCK_MUTEX_W(env);
2480 /** Read the environment parameters of a DB environment before
2481 * mapping it into memory.
2482 * @param[in] env the environment handle
2483 * @param[out] meta address of where to store the meta information
2484 * @return 0 on success, non-zero on failure.
2487 mdb_env_read_header(MDB_env *env, MDB_meta *meta)
2494 /* We don't know the page size yet, so use a minimum value.
2495 * Read both meta pages so we can use the latest one.
2498 for (i=off=0; i<2; i++, off = meta->mm_psize) {
2502 memset(&ov, 0, sizeof(ov));
2504 rc = ReadFile(env->me_fd,&pbuf,MDB_PAGESIZE,&len,&ov) ? (int)len : -1;
2506 rc = pread(env->me_fd, &pbuf, MDB_PAGESIZE, off);
2508 if (rc != MDB_PAGESIZE) {
2509 if (rc == 0 && off == 0)
2511 rc = rc < 0 ? (int) ErrCode() : MDB_INVALID;
2512 DPRINTF("read: %s", mdb_strerror(rc));
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;
2535 if (off == 0 || m->mm_txnid > meta->mm_txnid)
2541 /** Write the environment parameters of a freshly created DB environment.
2542 * @param[in] env the environment handle
2543 * @param[out] meta address of where to store the meta information
2544 * @return 0 on success, non-zero on failure.
2547 mdb_env_init_meta(MDB_env *env, MDB_meta *meta)
2553 DPUTS("writing new meta page");
2555 GET_PAGESIZE(psize);
2557 meta->mm_magic = MDB_MAGIC;
2558 meta->mm_version = MDB_VERSION;
2559 meta->mm_mapsize = env->me_mapsize;
2560 meta->mm_psize = psize;
2561 meta->mm_last_pg = 1;
2562 meta->mm_flags = env->me_flags & 0xffff;
2563 meta->mm_flags |= MDB_INTEGERKEY;
2564 meta->mm_dbs[0].md_root = P_INVALID;
2565 meta->mm_dbs[1].md_root = P_INVALID;
2567 p = calloc(2, psize);
2569 p->mp_flags = P_META;
2570 *(MDB_meta *)METADATA(p) = *meta;
2572 q = (MDB_page *)((char *)p + psize);
2574 q->mp_flags = P_META;
2575 *(MDB_meta *)METADATA(q) = *meta;
2581 memset(&ov, 0, sizeof(ov));
2582 rc = WriteFile(env->me_fd, p, psize * 2, &len, &ov);
2583 rc = rc ? (len == psize * 2 ? MDB_SUCCESS : EIO) : ErrCode();
2586 rc = pwrite(env->me_fd, p, psize * 2, 0);
2587 rc = (rc == (int)psize * 2) ? MDB_SUCCESS : rc < 0 ? ErrCode() : EIO;
2593 /** Update the environment info to commit a transaction.
2594 * @param[in] txn the transaction that's being committed
2595 * @return 0 on success, non-zero on failure.
2598 mdb_env_write_meta(MDB_txn *txn)
2601 MDB_meta meta, metab, *mp;
2603 int rc, len, toggle;
2612 assert(txn != NULL);
2613 assert(txn->mt_env != NULL);
2615 toggle = !txn->mt_toggle;
2616 DPRINTF("writing meta page %d for root page %zu",
2617 toggle, txn->mt_dbs[MAIN_DBI].md_root);
2620 mp = env->me_metas[toggle];
2622 if (env->me_flags & MDB_WRITEMAP) {
2623 /* Persist any increases of mapsize config */
2624 if (env->me_mapsize > mp->mm_mapsize)
2625 mp->mm_mapsize = env->me_mapsize;
2626 mp->mm_dbs[0] = txn->mt_dbs[0];
2627 mp->mm_dbs[1] = txn->mt_dbs[1];
2628 mp->mm_last_pg = txn->mt_next_pgno - 1;
2629 mp->mm_txnid = txn->mt_txnid;
2630 if (!(env->me_flags & (MDB_NOMETASYNC|MDB_NOSYNC))) {
2631 rc = (env->me_flags & MDB_MAPASYNC) ? MS_ASYNC : MS_SYNC;
2634 ptr += env->me_psize;
2635 if (MDB_MSYNC(ptr, env->me_psize, rc)) {
2642 metab.mm_txnid = env->me_metas[toggle]->mm_txnid;
2643 metab.mm_last_pg = env->me_metas[toggle]->mm_last_pg;
2645 ptr = (char *)&meta;
2646 if (env->me_mapsize > mp->mm_mapsize) {
2647 /* Persist any increases of mapsize config */
2648 meta.mm_mapsize = env->me_mapsize;
2649 off = offsetof(MDB_meta, mm_mapsize);
2651 off = offsetof(MDB_meta, mm_dbs[0].md_depth);
2653 len = sizeof(MDB_meta) - off;
2656 meta.mm_dbs[0] = txn->mt_dbs[0];
2657 meta.mm_dbs[1] = txn->mt_dbs[1];
2658 meta.mm_last_pg = txn->mt_next_pgno - 1;
2659 meta.mm_txnid = txn->mt_txnid;
2662 off += env->me_psize;
2665 /* Write to the SYNC fd */
2666 mfd = env->me_flags & (MDB_NOSYNC|MDB_NOMETASYNC) ?
2667 env->me_fd : env->me_mfd;
2670 memset(&ov, 0, sizeof(ov));
2672 if (!WriteFile(mfd, ptr, len, (DWORD *)&rc, &ov))
2676 rc = pwrite(mfd, ptr, len, off);
2679 rc = rc < 0 ? ErrCode() : EIO;
2680 DPUTS("write failed, disk error?");
2681 /* On a failure, the pagecache still contains the new data.
2682 * Write some old data back, to prevent it from being used.
2683 * Use the non-SYNC fd; we know it will fail anyway.
2685 meta.mm_last_pg = metab.mm_last_pg;
2686 meta.mm_txnid = metab.mm_txnid;
2688 memset(&ov, 0, sizeof(ov));
2690 WriteFile(env->me_fd, ptr, len, NULL, &ov);
2692 r2 = pwrite(env->me_fd, ptr, len, off);
2695 env->me_flags |= MDB_FATAL_ERROR;
2699 /* Memory ordering issues are irrelevant; since the entire writer
2700 * is wrapped by wmutex, all of these changes will become visible
2701 * after the wmutex is unlocked. Since the DB is multi-version,
2702 * readers will get consistent data regardless of how fresh or
2703 * how stale their view of these values is.
2705 env->me_txns->mti_txnid = txn->mt_txnid;
2710 /** Check both meta pages to see which one is newer.
2711 * @param[in] env the environment handle
2712 * @return meta toggle (0 or 1).
2715 mdb_env_pick_meta(const MDB_env *env)
2717 return (env->me_metas[0]->mm_txnid < env->me_metas[1]->mm_txnid);
2721 mdb_env_create(MDB_env **env)
2725 e = calloc(1, sizeof(MDB_env));
2729 e->me_maxreaders = DEFAULT_READERS;
2730 e->me_maxdbs = e->me_numdbs = 2;
2731 e->me_fd = INVALID_HANDLE_VALUE;
2732 e->me_lfd = INVALID_HANDLE_VALUE;
2733 e->me_mfd = INVALID_HANDLE_VALUE;
2734 #ifdef MDB_USE_POSIX_SEM
2735 e->me_rmutex = SEM_FAILED;
2736 e->me_wmutex = SEM_FAILED;
2738 e->me_pid = getpid();
2739 VGMEMP_CREATE(e,0,0);
2745 mdb_env_set_mapsize(MDB_env *env, size_t size)
2749 env->me_mapsize = size;
2751 env->me_maxpg = env->me_mapsize / env->me_psize;
2756 mdb_env_set_maxdbs(MDB_env *env, MDB_dbi dbs)
2760 env->me_maxdbs = dbs + 2; /* Named databases + main and free DB */
2765 mdb_env_set_maxreaders(MDB_env *env, unsigned int readers)
2767 if (env->me_map || readers < 1)
2769 env->me_maxreaders = readers;
2774 mdb_env_get_maxreaders(MDB_env *env, unsigned int *readers)
2776 if (!env || !readers)
2778 *readers = env->me_maxreaders;
2782 /** Further setup required for opening an MDB environment
2785 mdb_env_open2(MDB_env *env)
2787 unsigned int flags = env->me_flags;
2795 memset(&meta, 0, sizeof(meta));
2797 if ((i = mdb_env_read_header(env, &meta)) != 0) {
2800 DPUTS("new mdbenv");
2804 /* Was a mapsize configured? */
2805 if (!env->me_mapsize) {
2806 /* If this is a new environment, take the default,
2807 * else use the size recorded in the existing env.
2809 env->me_mapsize = newenv ? DEFAULT_MAPSIZE : meta.mm_mapsize;
2810 } else if (env->me_mapsize < meta.mm_mapsize) {
2811 /* If the configured size is smaller, make sure it's
2812 * still big enough. Silently round up to minimum if not.
2814 size_t minsize = (meta.mm_last_pg + 1) * meta.mm_psize;
2815 if (env->me_mapsize < minsize)
2816 env->me_mapsize = minsize;
2823 LONG sizelo, sizehi;
2824 sizelo = env->me_mapsize & 0xffffffff;
2825 sizehi = env->me_mapsize >> 16 >> 16; /* only needed on Win64 */
2826 /* Windows won't create mappings for zero length files.
2827 * Just allocate the maxsize right now.
2830 if (SetFilePointer(env->me_fd, sizelo, &sizehi, 0) != (DWORD)sizelo
2831 || !SetEndOfFile(env->me_fd)
2832 || SetFilePointer(env->me_fd, 0, NULL, 0) != 0)
2835 mh = CreateFileMapping(env->me_fd, NULL, flags & MDB_WRITEMAP ?
2836 PAGE_READWRITE : PAGE_READONLY,
2837 sizehi, sizelo, NULL);
2840 env->me_map = MapViewOfFileEx(mh, flags & MDB_WRITEMAP ?
2841 FILE_MAP_WRITE : FILE_MAP_READ,
2842 0, 0, env->me_mapsize, meta.mm_address);
2843 rc = env->me_map ? 0 : ErrCode();
2851 if (flags & MDB_WRITEMAP) {
2853 if (ftruncate(env->me_fd, env->me_mapsize) < 0)
2856 env->me_map = mmap(meta.mm_address, env->me_mapsize, prot, i,
2858 if (env->me_map == MAP_FAILED) {
2862 /* Turn off readahead. It's harmful when the DB is larger than RAM. */
2864 madvise(env->me_map, env->me_mapsize, MADV_RANDOM);
2866 #ifdef POSIX_MADV_RANDOM
2867 posix_madvise(env->me_map, env->me_mapsize, POSIX_MADV_RANDOM);
2868 #endif /* POSIX_MADV_RANDOM */
2869 #endif /* MADV_RANDOM */
2873 if (flags & MDB_FIXEDMAP)
2874 meta.mm_address = env->me_map;
2875 i = mdb_env_init_meta(env, &meta);
2876 if (i != MDB_SUCCESS) {
2879 } else if (meta.mm_address && env->me_map != meta.mm_address) {
2880 /* Can happen because the address argument to mmap() is just a
2881 * hint. mmap() can pick another, e.g. if the range is in use.
2882 * The MAP_FIXED flag would prevent that, but then mmap could
2883 * instead unmap existing pages to make room for the new map.
2885 return EBUSY; /* TODO: Make a new MDB_* error code? */
2887 env->me_psize = meta.mm_psize;
2888 env->me_maxfree_1pg = (env->me_psize - PAGEHDRSZ) / sizeof(pgno_t) - 1;
2889 env->me_nodemax = (env->me_psize - PAGEHDRSZ) / MDB_MINKEYS;
2891 env->me_maxpg = env->me_mapsize / env->me_psize;
2893 p = (MDB_page *)env->me_map;
2894 env->me_metas[0] = METADATA(p);
2895 env->me_metas[1] = (MDB_meta *)((char *)env->me_metas[0] + meta.mm_psize);
2899 int toggle = mdb_env_pick_meta(env);
2900 MDB_db *db = &env->me_metas[toggle]->mm_dbs[MAIN_DBI];
2902 DPRINTF("opened database version %u, pagesize %u",
2903 env->me_metas[0]->mm_version, env->me_psize);
2904 DPRINTF("using meta page %d", toggle);
2905 DPRINTF("depth: %u", db->md_depth);
2906 DPRINTF("entries: %zu", db->md_entries);
2907 DPRINTF("branch pages: %zu", db->md_branch_pages);
2908 DPRINTF("leaf pages: %zu", db->md_leaf_pages);
2909 DPRINTF("overflow pages: %zu", db->md_overflow_pages);
2910 DPRINTF("root: %zu", db->md_root);
2918 /** Release a reader thread's slot in the reader lock table.
2919 * This function is called automatically when a thread exits.
2920 * @param[in] ptr This points to the slot in the reader lock table.
2923 mdb_env_reader_dest(void *ptr)
2925 MDB_reader *reader = ptr;
2931 /** Junk for arranging thread-specific callbacks on Windows. This is
2932 * necessarily platform and compiler-specific. Windows supports up
2933 * to 1088 keys. Let's assume nobody opens more than 64 environments
2934 * in a single process, for now. They can override this if needed.
2936 #ifndef MAX_TLS_KEYS
2937 #define MAX_TLS_KEYS 64
2939 static pthread_key_t mdb_tls_keys[MAX_TLS_KEYS];
2940 static int mdb_tls_nkeys;
2942 static void NTAPI mdb_tls_callback(PVOID module, DWORD reason, PVOID ptr)
2946 case DLL_PROCESS_ATTACH: break;
2947 case DLL_THREAD_ATTACH: break;
2948 case DLL_THREAD_DETACH:
2949 for (i=0; i<mdb_tls_nkeys; i++) {
2950 MDB_reader *r = pthread_getspecific(mdb_tls_keys[i]);
2951 mdb_env_reader_dest(r);
2954 case DLL_PROCESS_DETACH: break;
2959 const PIMAGE_TLS_CALLBACK mdb_tls_cbp __attribute__((section (".CRT$XLB"))) = mdb_tls_callback;
2961 PIMAGE_TLS_CALLBACK mdb_tls_cbp __attribute__((section (".CRT$XLB"))) = mdb_tls_callback;
2965 /* Force some symbol references.
2966 * _tls_used forces the linker to create the TLS directory if not already done
2967 * mdb_tls_cbp prevents whole-program-optimizer from dropping the symbol.
2969 #pragma comment(linker, "/INCLUDE:_tls_used")
2970 #pragma comment(linker, "/INCLUDE:mdb_tls_cbp")
2971 #pragma const_seg(".CRT$XLB")
2972 extern const PIMAGE_TLS_CALLBACK mdb_tls_callback;
2973 const PIMAGE_TLS_CALLBACK mdb_tls_cbp = mdb_tls_callback;
2976 #pragma comment(linker, "/INCLUDE:__tls_used")
2977 #pragma comment(linker, "/INCLUDE:_mdb_tls_cbp")
2978 #pragma data_seg(".CRT$XLB")
2979 PIMAGE_TLS_CALLBACK mdb_tls_cbp = mdb_tls_callback;
2981 #endif /* WIN 32/64 */
2982 #endif /* !__GNUC__ */
2985 /** Downgrade the exclusive lock on the region back to shared */
2987 mdb_env_share_locks(MDB_env *env, int *excl)
2989 int rc = 0, toggle = mdb_env_pick_meta(env);
2991 env->me_txns->mti_txnid = env->me_metas[toggle]->mm_txnid;
2996 /* First acquire a shared lock. The Unlock will
2997 * then release the existing exclusive lock.
2999 memset(&ov, 0, sizeof(ov));
3000 if (!LockFileEx(env->me_lfd, 0, 0, 1, 0, &ov)) {
3003 UnlockFile(env->me_lfd, 0, 0, 1, 0);
3009 struct flock lock_info;
3010 /* The shared lock replaces the existing lock */
3011 memset((void *)&lock_info, 0, sizeof(lock_info));
3012 lock_info.l_type = F_RDLCK;
3013 lock_info.l_whence = SEEK_SET;
3014 lock_info.l_start = 0;
3015 lock_info.l_len = 1;
3016 while ((rc = fcntl(env->me_lfd, F_SETLK, &lock_info)) &&
3017 (rc = ErrCode()) == EINTR) ;
3018 *excl = rc ? -1 : 0; /* error may mean we lost the lock */
3025 /** Try to get exlusive lock, otherwise shared.
3026 * Maintain *excl = -1: no/unknown lock, 0: shared, 1: exclusive.
3029 mdb_env_excl_lock(MDB_env *env, int *excl)
3033 if (LockFile(env->me_lfd, 0, 0, 1, 0)) {
3037 memset(&ov, 0, sizeof(ov));
3038 if (LockFileEx(env->me_lfd, 0, 0, 1, 0, &ov)) {
3045 struct flock lock_info;
3046 memset((void *)&lock_info, 0, sizeof(lock_info));
3047 lock_info.l_type = F_WRLCK;
3048 lock_info.l_whence = SEEK_SET;
3049 lock_info.l_start = 0;
3050 lock_info.l_len = 1;
3051 while ((rc = fcntl(env->me_lfd, F_SETLK, &lock_info)) &&
3052 (rc = ErrCode()) == EINTR) ;
3056 # ifdef MDB_USE_POSIX_SEM
3057 if (*excl < 0) /* always true when !MDB_USE_POSIX_SEM */
3060 lock_info.l_type = F_RDLCK;
3061 while ((rc = fcntl(env->me_lfd, F_SETLKW, &lock_info)) &&
3062 (rc = ErrCode()) == EINTR) ;
3070 #if defined(_WIN32) || defined(MDB_USE_POSIX_SEM)
3072 * hash_64 - 64 bit Fowler/Noll/Vo-0 FNV-1a hash code
3074 * @(#) $Revision: 5.1 $
3075 * @(#) $Id: hash_64a.c,v 5.1 2009/06/30 09:01:38 chongo Exp $
3076 * @(#) $Source: /usr/local/src/cmd/fnv/RCS/hash_64a.c,v $
3078 * http://www.isthe.com/chongo/tech/comp/fnv/index.html
3082 * Please do not copyright this code. This code is in the public domain.
3084 * LANDON CURT NOLL DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
3085 * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO
3086 * EVENT SHALL LANDON CURT NOLL BE LIABLE FOR ANY SPECIAL, INDIRECT OR
3087 * CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF
3088 * USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
3089 * OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
3090 * PERFORMANCE OF THIS SOFTWARE.
3093 * chongo <Landon Curt Noll> /\oo/\
3094 * http://www.isthe.com/chongo/
3096 * Share and Enjoy! :-)
3099 typedef unsigned long long mdb_hash_t;
3100 #define MDB_HASH_INIT ((mdb_hash_t)0xcbf29ce484222325ULL)
3102 /** perform a 64 bit Fowler/Noll/Vo FNV-1a hash on a buffer
3103 * @param[in] str string to hash
3104 * @param[in] hval initial value for hash
3105 * @return 64 bit hash
3107 * NOTE: To use the recommended 64 bit FNV-1a hash, use MDB_HASH_INIT as the
3108 * hval arg on the first call.
3111 mdb_hash_val(MDB_val *val, mdb_hash_t hval)
3113 unsigned char *s = (unsigned char *)val->mv_data; /* unsigned string */
3114 unsigned char *end = s + val->mv_size;
3116 * FNV-1a hash each octet of the string
3119 /* xor the bottom with the current octet */
3120 hval ^= (mdb_hash_t)*s++;
3122 /* multiply by the 64 bit FNV magic prime mod 2^64 */
3123 hval += (hval << 1) + (hval << 4) + (hval << 5) +
3124 (hval << 7) + (hval << 8) + (hval << 40);
3126 /* return our new hash value */
3130 /** Hash the string and output the hash in hex.
3131 * @param[in] str string to hash
3132 * @param[out] hexbuf an array of 17 chars to hold the hash
3135 mdb_hash_hex(MDB_val *val, char *hexbuf)
3138 mdb_hash_t h = mdb_hash_val(val, MDB_HASH_INIT);
3139 for (i=0; i<8; i++) {
3140 hexbuf += sprintf(hexbuf, "%02x", (unsigned int)h & 0xff);
3146 /** Open and/or initialize the lock region for the environment.
3147 * @param[in] env The MDB environment.
3148 * @param[in] lpath The pathname of the file used for the lock region.
3149 * @param[in] mode The Unix permissions for the file, if we create it.
3150 * @param[out] excl Resulting file lock type: -1 none, 0 shared, 1 exclusive
3151 * @param[in,out] excl In -1, out lock type: -1 none, 0 shared, 1 exclusive
3152 * @return 0 on success, non-zero on failure.
3155 mdb_env_setup_locks(MDB_env *env, char *lpath, int mode, int *excl)
3158 # define MDB_ERRCODE_ROFS ERROR_WRITE_PROTECT
3160 # define MDB_ERRCODE_ROFS EROFS
3161 #ifdef O_CLOEXEC /* Linux: Open file and set FD_CLOEXEC atomically */
3162 # define MDB_CLOEXEC O_CLOEXEC
3165 # define MDB_CLOEXEC 0
3172 env->me_lfd = CreateFile(lpath, GENERIC_READ|GENERIC_WRITE,
3173 FILE_SHARE_READ|FILE_SHARE_WRITE, NULL, OPEN_ALWAYS,
3174 FILE_ATTRIBUTE_NORMAL, NULL);
3176 env->me_lfd = open(lpath, O_RDWR|O_CREAT|MDB_CLOEXEC, mode);
3178 if (env->me_lfd == INVALID_HANDLE_VALUE) {
3180 if (rc == MDB_ERRCODE_ROFS && (env->me_flags & MDB_RDONLY)) {
3185 #if ! ((MDB_CLOEXEC) || defined(_WIN32))
3186 /* Lose record locks when exec*() */
3187 if ((fdflags = fcntl(env->me_lfd, F_GETFD) | FD_CLOEXEC) >= 0)
3188 fcntl(env->me_lfd, F_SETFD, fdflags);
3191 if (!(env->me_flags & MDB_NOTLS)) {
3192 rc = pthread_key_create(&env->me_txkey, mdb_env_reader_dest);
3195 env->me_flags |= MDB_ENV_TXKEY;
3197 /* Windows TLS callbacks need help finding their TLS info. */
3198 if (mdb_tls_nkeys >= MAX_TLS_KEYS) {
3202 mdb_tls_keys[mdb_tls_nkeys++] = env->me_txkey;
3206 /* Try to get exclusive lock. If we succeed, then
3207 * nobody is using the lock region and we should initialize it.
3209 if ((rc = mdb_env_excl_lock(env, excl))) goto fail;
3212 size = GetFileSize(env->me_lfd, NULL);
3214 size = lseek(env->me_lfd, 0, SEEK_END);
3215 if (size == -1) goto fail_errno;
3217 rsize = (env->me_maxreaders-1) * sizeof(MDB_reader) + sizeof(MDB_txninfo);
3218 if (size < rsize && *excl > 0) {
3220 if (SetFilePointer(env->me_lfd, rsize, NULL, FILE_BEGIN) != rsize
3221 || !SetEndOfFile(env->me_lfd))
3224 if (ftruncate(env->me_lfd, rsize) != 0) goto fail_errno;
3228 size = rsize - sizeof(MDB_txninfo);
3229 env->me_maxreaders = size/sizeof(MDB_reader) + 1;
3234 mh = CreateFileMapping(env->me_lfd, NULL, PAGE_READWRITE,
3236 if (!mh) goto fail_errno;
3237 env->me_txns = MapViewOfFileEx(mh, FILE_MAP_WRITE, 0, 0, rsize, NULL);
3239 if (!env->me_txns) goto fail_errno;
3241 void *m = mmap(NULL, rsize, PROT_READ|PROT_WRITE, MAP_SHARED,
3243 if (m == MAP_FAILED) goto fail_errno;
3249 BY_HANDLE_FILE_INFORMATION stbuf;
3258 if (!mdb_sec_inited) {
3259 InitializeSecurityDescriptor(&mdb_null_sd,
3260 SECURITY_DESCRIPTOR_REVISION);
3261 SetSecurityDescriptorDacl(&mdb_null_sd, TRUE, 0, FALSE);
3262 mdb_all_sa.nLength = sizeof(SECURITY_ATTRIBUTES);
3263 mdb_all_sa.bInheritHandle = FALSE;
3264 mdb_all_sa.lpSecurityDescriptor = &mdb_null_sd;
3267 if (!GetFileInformationByHandle(env->me_lfd, &stbuf)) goto fail_errno;
3268 idbuf.volume = stbuf.dwVolumeSerialNumber;
3269 idbuf.nhigh = stbuf.nFileIndexHigh;
3270 idbuf.nlow = stbuf.nFileIndexLow;
3271 val.mv_data = &idbuf;
3272 val.mv_size = sizeof(idbuf);
3273 mdb_hash_hex(&val, hexbuf);
3274 sprintf(env->me_txns->mti_rmname, "Global\\MDBr%s", hexbuf);
3275 sprintf(env->me_txns->mti_wmname, "Global\\MDBw%s", hexbuf);
3276 env->me_rmutex = CreateMutex(&mdb_all_sa, FALSE, env->me_txns->mti_rmname);
3277 if (!env->me_rmutex) goto fail_errno;
3278 env->me_wmutex = CreateMutex(&mdb_all_sa, FALSE, env->me_txns->mti_wmname);
3279 if (!env->me_wmutex) goto fail_errno;
3280 #elif defined(MDB_USE_POSIX_SEM)
3289 if (fstat(env->me_lfd, &stbuf)) goto fail_errno;
3290 idbuf.dev = stbuf.st_dev;
3291 idbuf.ino = stbuf.st_ino;
3292 val.mv_data = &idbuf;
3293 val.mv_size = sizeof(idbuf);
3294 mdb_hash_hex(&val, hexbuf);
3295 sprintf(env->me_txns->mti_rmname, "/MDBr%s", hexbuf);
3296 sprintf(env->me_txns->mti_wmname, "/MDBw%s", hexbuf);
3297 /* Clean up after a previous run, if needed: Try to
3298 * remove both semaphores before doing anything else.
3300 sem_unlink(env->me_txns->mti_rmname);
3301 sem_unlink(env->me_txns->mti_wmname);
3302 env->me_rmutex = sem_open(env->me_txns->mti_rmname,
3303 O_CREAT|O_EXCL, mode, 1);
3304 if (env->me_rmutex == SEM_FAILED) goto fail_errno;
3305 env->me_wmutex = sem_open(env->me_txns->mti_wmname,
3306 O_CREAT|O_EXCL, mode, 1);
3307 if (env->me_wmutex == SEM_FAILED) goto fail_errno;
3308 #else /* MDB_USE_POSIX_SEM */
3309 pthread_mutexattr_t mattr;
3311 if ((rc = pthread_mutexattr_init(&mattr))
3312 || (rc = pthread_mutexattr_setpshared(&mattr, PTHREAD_PROCESS_SHARED))
3313 || (rc = pthread_mutex_init(&env->me_txns->mti_mutex, &mattr))
3314 || (rc = pthread_mutex_init(&env->me_txns->mti_wmutex, &mattr)))
3316 pthread_mutexattr_destroy(&mattr);
3317 #endif /* _WIN32 || MDB_USE_POSIX_SEM */
3319 env->me_txns->mti_version = MDB_VERSION;
3320 env->me_txns->mti_magic = MDB_MAGIC;
3321 env->me_txns->mti_txnid = 0;
3322 env->me_txns->mti_numreaders = 0;
3325 if (env->me_txns->mti_magic != MDB_MAGIC) {
3326 DPUTS("lock region has invalid magic");
3330 if (env->me_txns->mti_version != MDB_VERSION) {
3331 DPRINTF("lock region is version %u, expected version %u",
3332 env->me_txns->mti_version, MDB_VERSION);
3333 rc = MDB_VERSION_MISMATCH;
3337 if (rc && rc != EACCES && rc != EAGAIN) {
3341 env->me_rmutex = OpenMutex(SYNCHRONIZE, FALSE, env->me_txns->mti_rmname);
3342 if (!env->me_rmutex) goto fail_errno;
3343 env->me_wmutex = OpenMutex(SYNCHRONIZE, FALSE, env->me_txns->mti_wmname);
3344 if (!env->me_wmutex) goto fail_errno;
3345 #elif defined(MDB_USE_POSIX_SEM)
3346 env->me_rmutex = sem_open(env->me_txns->mti_rmname, 0);
3347 if (env->me_rmutex == SEM_FAILED) goto fail_errno;
3348 env->me_wmutex = sem_open(env->me_txns->mti_wmname, 0);
3349 if (env->me_wmutex == SEM_FAILED) goto fail_errno;
3360 /** The name of the lock file in the DB environment */
3361 #define LOCKNAME "/lock.mdb"
3362 /** The name of the data file in the DB environment */
3363 #define DATANAME "/data.mdb"
3364 /** The suffix of the lock file when no subdir is used */
3365 #define LOCKSUFF "-lock"
3366 /** Only a subset of the @ref mdb_env flags can be changed
3367 * at runtime. Changing other flags requires closing the
3368 * environment and re-opening it with the new flags.
3370 #define CHANGEABLE (MDB_NOSYNC|MDB_NOMETASYNC|MDB_MAPASYNC)
3371 #define CHANGELESS (MDB_FIXEDMAP|MDB_NOSUBDIR|MDB_RDONLY|MDB_WRITEMAP|MDB_NOTLS)
3374 mdb_env_open(MDB_env *env, const char *path, unsigned int flags, mdb_mode_t mode)
3376 int oflags, rc, len, excl = -1;
3377 char *lpath, *dpath;
3379 if (env->me_fd!=INVALID_HANDLE_VALUE || (flags & ~(CHANGEABLE|CHANGELESS)))
3383 if (flags & MDB_NOSUBDIR) {
3384 rc = len + sizeof(LOCKSUFF) + len + 1;
3386 rc = len + sizeof(LOCKNAME) + len + sizeof(DATANAME);
3391 if (flags & MDB_NOSUBDIR) {
3392 dpath = lpath + len + sizeof(LOCKSUFF);
3393 sprintf(lpath, "%s" LOCKSUFF, path);
3394 strcpy(dpath, path);
3396 dpath = lpath + len + sizeof(LOCKNAME);
3397 sprintf(lpath, "%s" LOCKNAME, path);
3398 sprintf(dpath, "%s" DATANAME, path);
3402 flags |= env->me_flags;
3403 if (flags & MDB_RDONLY) {
3404 /* silently ignore WRITEMAP when we're only getting read access */
3405 flags &= ~MDB_WRITEMAP;
3407 if (!((env->me_free_pgs = mdb_midl_alloc(MDB_IDL_UM_MAX)) &&
3408 (env->me_dirty_list = calloc(MDB_IDL_UM_SIZE, sizeof(MDB_ID2)))))
3411 env->me_flags = flags |= MDB_ENV_ACTIVE;
3415 env->me_path = strdup(path);
3416 env->me_dbxs = calloc(env->me_maxdbs, sizeof(MDB_dbx));
3417 env->me_dbflags = calloc(env->me_maxdbs, sizeof(uint16_t));
3418 if (!(env->me_dbxs && env->me_path && env->me_dbflags)) {
3423 rc = mdb_env_setup_locks(env, lpath, mode, &excl);
3428 if (F_ISSET(flags, MDB_RDONLY)) {
3429 oflags = GENERIC_READ;
3430 len = OPEN_EXISTING;
3432 oflags = GENERIC_READ|GENERIC_WRITE;
3435 mode = FILE_ATTRIBUTE_NORMAL;
3436 env->me_fd = CreateFile(dpath, oflags, FILE_SHARE_READ|FILE_SHARE_WRITE,
3437 NULL, len, mode, NULL);
3439 if (F_ISSET(flags, MDB_RDONLY))
3442 oflags = O_RDWR | O_CREAT;
3444 env->me_fd = open(dpath, oflags, mode);
3446 if (env->me_fd == INVALID_HANDLE_VALUE) {
3451 if ((rc = mdb_env_open2(env)) == MDB_SUCCESS) {
3452 if (flags & (MDB_RDONLY|MDB_WRITEMAP)) {
3453 env->me_mfd = env->me_fd;
3455 /* Synchronous fd for meta writes. Needed even with
3456 * MDB_NOSYNC/MDB_NOMETASYNC, in case these get reset.
3459 env->me_mfd = CreateFile(dpath, oflags,
3460 FILE_SHARE_READ|FILE_SHARE_WRITE, NULL, len,
3461 mode | FILE_FLAG_WRITE_THROUGH, NULL);
3463 env->me_mfd = open(dpath, oflags | MDB_DSYNC, mode);
3465 if (env->me_mfd == INVALID_HANDLE_VALUE) {
3470 DPRINTF("opened dbenv %p", (void *) env);
3472 rc = mdb_env_share_locks(env, &excl);
3478 mdb_env_close0(env, excl);
3484 /** Destroy resources from mdb_env_open(), clear our readers & DBIs */
3486 mdb_env_close0(MDB_env *env, int excl)
3490 if (!(env->me_flags & MDB_ENV_ACTIVE))
3493 /* Doing this here since me_dbxs may not exist during mdb_env_close */
3494 for (i = env->me_maxdbs; --i > MAIN_DBI; )
3495 free(env->me_dbxs[i].md_name.mv_data);
3497 free(env->me_dbflags);
3500 free(env->me_dirty_list);
3501 mdb_midl_free(env->me_free_pgs);
3503 if (env->me_flags & MDB_ENV_TXKEY) {
3504 pthread_key_delete(env->me_txkey);
3506 /* Delete our key from the global list */
3507 for (i=0; i<mdb_tls_nkeys; i++)
3508 if (mdb_tls_keys[i] == env->me_txkey) {
3509 mdb_tls_keys[i] = mdb_tls_keys[mdb_tls_nkeys-1];
3517 munmap(env->me_map, env->me_mapsize);
3519 if (env->me_mfd != env->me_fd && env->me_mfd != INVALID_HANDLE_VALUE)
3520 (void) close(env->me_mfd);
3521 if (env->me_fd != INVALID_HANDLE_VALUE)
3522 (void) close(env->me_fd);
3524 pid_t pid = env->me_pid;
3525 /* Clearing readers is done in this function because
3526 * me_txkey with its destructor must be disabled first.
3528 for (i = env->me_numreaders; --i >= 0; )
3529 if (env->me_txns->mti_readers[i].mr_pid == pid)
3530 env->me_txns->mti_readers[i].mr_pid = 0;
3532 if (env->me_rmutex) {
3533 CloseHandle(env->me_rmutex);
3534 if (env->me_wmutex) CloseHandle(env->me_wmutex);
3536 /* Windows automatically destroys the mutexes when
3537 * the last handle closes.
3539 #elif defined(MDB_USE_POSIX_SEM)
3540 if (env->me_rmutex != SEM_FAILED) {
3541 sem_close(env->me_rmutex);
3542 if (env->me_wmutex != SEM_FAILED)
3543 sem_close(env->me_wmutex);
3544 /* If we have the filelock: If we are the
3545 * only remaining user, clean up semaphores.
3548 mdb_env_excl_lock(env, &excl);
3550 sem_unlink(env->me_txns->mti_rmname);
3551 sem_unlink(env->me_txns->mti_wmname);
3555 munmap((void *)env->me_txns, (env->me_maxreaders-1)*sizeof(MDB_reader)+sizeof(MDB_txninfo));
3557 if (env->me_lfd != INVALID_HANDLE_VALUE) {
3560 /* Unlock the lockfile. Windows would have unlocked it
3561 * after closing anyway, but not necessarily at once.
3563 UnlockFile(env->me_lfd, 0, 0, 1, 0);
3566 (void) close(env->me_lfd);
3569 env->me_flags &= ~(MDB_ENV_ACTIVE|MDB_ENV_TXKEY);
3573 mdb_env_copyfd(MDB_env *env, HANDLE fd)
3575 MDB_txn *txn = NULL;
3580 /* Do the lock/unlock of the reader mutex before starting the
3581 * write txn. Otherwise other read txns could block writers.
3583 rc = mdb_txn_begin(env, NULL, MDB_RDONLY, &txn);
3588 /* We must start the actual read txn after blocking writers */
3589 mdb_txn_reset0(txn, "reset-stage1");
3591 /* Temporarily block writers until we snapshot the meta pages */
3594 rc = mdb_txn_renew0(txn);
3596 UNLOCK_MUTEX_W(env);
3601 wsize = env->me_psize * 2;
3605 rc = WriteFile(fd, env->me_map, wsize, &len, NULL);
3606 rc = rc ? (len == wsize ? MDB_SUCCESS : EIO) : ErrCode();
3609 rc = write(fd, env->me_map, wsize);
3610 rc = rc == (int)wsize ? MDB_SUCCESS : rc < 0 ? ErrCode() : EIO;
3613 UNLOCK_MUTEX_W(env);
3618 ptr = env->me_map + wsize;
3619 wsize = txn->mt_next_pgno * env->me_psize - wsize;
3623 if (wsize > MAX_WRITE)
3627 rc = WriteFile(fd, ptr, w2, &len, NULL);
3628 rc = rc ? (len == w2 ? MDB_SUCCESS : EIO) : ErrCode();
3637 if (wsize > MAX_WRITE)
3641 wres = write(fd, ptr, w2);
3642 rc = wres == (ssize_t)w2 ? MDB_SUCCESS : wres < 0 ? ErrCode() : EIO;
3655 mdb_env_copy(MDB_env *env, const char *path)
3659 HANDLE newfd = INVALID_HANDLE_VALUE;
3661 if (env->me_flags & MDB_NOSUBDIR) {
3662 lpath = (char *)path;
3665 len += sizeof(DATANAME);
3666 lpath = malloc(len);
3669 sprintf(lpath, "%s" DATANAME, path);
3672 /* The destination path must exist, but the destination file must not.
3673 * We don't want the OS to cache the writes, since the source data is
3674 * already in the OS cache.
3677 newfd = CreateFile(lpath, GENERIC_WRITE, 0, NULL, CREATE_NEW,
3678 FILE_FLAG_NO_BUFFERING|FILE_FLAG_WRITE_THROUGH, NULL);
3680 newfd = open(lpath, O_WRONLY|O_CREAT|O_EXCL
3686 if (newfd == INVALID_HANDLE_VALUE) {
3691 #ifdef F_NOCACHE /* __APPLE__ */
3692 rc = fcntl(newfd, F_NOCACHE, 1);
3699 rc = mdb_env_copyfd(env, newfd);
3702 if (!(env->me_flags & MDB_NOSUBDIR))
3704 if (newfd != INVALID_HANDLE_VALUE)
3705 if (close(newfd) < 0 && rc == MDB_SUCCESS)
3712 mdb_env_close(MDB_env *env)
3719 VGMEMP_DESTROY(env);
3720 while ((dp = env->me_dpages) != NULL) {
3721 VGMEMP_DEFINED(&dp->mp_next, sizeof(dp->mp_next));
3722 env->me_dpages = dp->mp_next;
3726 mdb_env_close0(env, 0);
3730 /** Compare two items pointing at aligned size_t's */
3732 mdb_cmp_long(const MDB_val *a, const MDB_val *b)
3734 return (*(size_t *)a->mv_data < *(size_t *)b->mv_data) ? -1 :
3735 *(size_t *)a->mv_data > *(size_t *)b->mv_data;
3738 /** Compare two items pointing at aligned int's */
3740 mdb_cmp_int(const MDB_val *a, const MDB_val *b)
3742 return (*(unsigned int *)a->mv_data < *(unsigned int *)b->mv_data) ? -1 :
3743 *(unsigned int *)a->mv_data > *(unsigned int *)b->mv_data;
3746 /** Compare two items pointing at ints of unknown alignment.
3747 * Nodes and keys are guaranteed to be 2-byte aligned.
3750 mdb_cmp_cint(const MDB_val *a, const MDB_val *b)
3752 #if BYTE_ORDER == LITTLE_ENDIAN
3753 unsigned short *u, *c;
3756 u = (unsigned short *) ((char *) a->mv_data + a->mv_size);
3757 c = (unsigned short *) ((char *) b->mv_data + a->mv_size);
3760 } while(!x && u > (unsigned short *)a->mv_data);
3763 return memcmp(a->mv_data, b->mv_data, a->mv_size);
3767 /** Compare two items lexically */
3769 mdb_cmp_memn(const MDB_val *a, const MDB_val *b)
3776 len_diff = (ssize_t) a->mv_size - (ssize_t) b->mv_size;
3782 diff = memcmp(a->mv_data, b->mv_data, len);
3783 return diff ? diff : len_diff<0 ? -1 : len_diff;
3786 /** Compare two items in reverse byte order */
3788 mdb_cmp_memnr(const MDB_val *a, const MDB_val *b)
3790 const unsigned char *p1, *p2, *p1_lim;
3794 p1_lim = (const unsigned char *)a->mv_data;
3795 p1 = (const unsigned char *)a->mv_data + a->mv_size;
3796 p2 = (const unsigned char *)b->mv_data + b->mv_size;
3798 len_diff = (ssize_t) a->mv_size - (ssize_t) b->mv_size;
3804 while (p1 > p1_lim) {
3805 diff = *--p1 - *--p2;
3809 return len_diff<0 ? -1 : len_diff;
3812 /** Search for key within a page, using binary search.
3813 * Returns the smallest entry larger or equal to the key.
3814 * If exactp is non-null, stores whether the found entry was an exact match
3815 * in *exactp (1 or 0).
3816 * Updates the cursor index with the index of the found entry.
3817 * If no entry larger or equal to the key is found, returns NULL.
3820 mdb_node_search(MDB_cursor *mc, MDB_val *key, int *exactp)
3822 unsigned int i = 0, nkeys;
3825 MDB_page *mp = mc->mc_pg[mc->mc_top];
3826 MDB_node *node = NULL;
3831 nkeys = NUMKEYS(mp);
3836 COPY_PGNO(pgno, mp->mp_pgno);
3837 DPRINTF("searching %u keys in %s %spage %zu",
3838 nkeys, IS_LEAF(mp) ? "leaf" : "branch", IS_SUBP(mp) ? "sub-" : "",
3845 low = IS_LEAF(mp) ? 0 : 1;
3847 cmp = mc->mc_dbx->md_cmp;
3849 /* Branch pages have no data, so if using integer keys,
3850 * alignment is guaranteed. Use faster mdb_cmp_int.
3852 if (cmp == mdb_cmp_cint && IS_BRANCH(mp)) {
3853 if (NODEPTR(mp, 1)->mn_ksize == sizeof(size_t))
3860 nodekey.mv_size = mc->mc_db->md_pad;
3861 node = NODEPTR(mp, 0); /* fake */
3862 while (low <= high) {
3863 i = (low + high) >> 1;
3864 nodekey.mv_data = LEAF2KEY(mp, i, nodekey.mv_size);
3865 rc = cmp(key, &nodekey);
3866 DPRINTF("found leaf index %u [%s], rc = %i",
3867 i, DKEY(&nodekey), rc);
3876 while (low <= high) {
3877 i = (low + high) >> 1;
3879 node = NODEPTR(mp, i);
3880 nodekey.mv_size = NODEKSZ(node);
3881 nodekey.mv_data = NODEKEY(node);
3883 rc = cmp(key, &nodekey);
3886 DPRINTF("found leaf index %u [%s], rc = %i",
3887 i, DKEY(&nodekey), rc);
3889 DPRINTF("found branch index %u [%s -> %zu], rc = %i",
3890 i, DKEY(&nodekey), NODEPGNO(node), rc);
3901 if (rc > 0) { /* Found entry is less than the key. */
3902 i++; /* Skip to get the smallest entry larger than key. */
3904 node = NODEPTR(mp, i);
3907 *exactp = (rc == 0);
3908 /* store the key index */
3909 mc->mc_ki[mc->mc_top] = i;
3911 /* There is no entry larger or equal to the key. */
3914 /* nodeptr is fake for LEAF2 */
3920 mdb_cursor_adjust(MDB_cursor *mc, func)
3924 for (m2 = mc->mc_txn->mt_cursors[mc->mc_dbi]; m2; m2=m2->mc_next) {
3925 if (m2->mc_pg[m2->mc_top] == mc->mc_pg[mc->mc_top]) {
3932 /** Pop a page off the top of the cursor's stack. */
3934 mdb_cursor_pop(MDB_cursor *mc)
3937 #ifndef MDB_DEBUG_SKIP
3938 MDB_page *top = mc->mc_pg[mc->mc_top];
3944 DPRINTF("popped page %zu off db %u cursor %p", top->mp_pgno,
3945 mc->mc_dbi, (void *) mc);
3949 /** Push a page onto the top of the cursor's stack. */
3951 mdb_cursor_push(MDB_cursor *mc, MDB_page *mp)
3953 DPRINTF("pushing page %zu on db %u cursor %p", mp->mp_pgno,
3954 mc->mc_dbi, (void *) mc);
3956 if (mc->mc_snum >= CURSOR_STACK) {
3957 assert(mc->mc_snum < CURSOR_STACK);
3958 return MDB_CURSOR_FULL;
3961 mc->mc_top = mc->mc_snum++;
3962 mc->mc_pg[mc->mc_top] = mp;
3963 mc->mc_ki[mc->mc_top] = 0;
3968 /** Find the address of the page corresponding to a given page number.
3969 * @param[in] txn the transaction for this access.
3970 * @param[in] pgno the page number for the page to retrieve.
3971 * @param[out] ret address of a pointer where the page's address will be stored.
3972 * @param[out] lvl dirty_list inheritance level of found page. 1=current txn, 0=mapped page.
3973 * @return 0 on success, non-zero on failure.
3976 mdb_page_get(MDB_txn *txn, pgno_t pgno, MDB_page **ret, int *lvl)
3981 if (!((txn->mt_flags & MDB_TXN_RDONLY) |
3982 (txn->mt_env->me_flags & MDB_WRITEMAP)))
3987 MDB_ID2L dl = tx2->mt_u.dirty_list;
3989 unsigned x = mdb_mid2l_search(dl, pgno);
3990 if (x <= dl[0].mid && dl[x].mid == pgno) {
3996 } while ((tx2 = tx2->mt_parent) != NULL);
3999 if (pgno < txn->mt_next_pgno) {
4001 p = (MDB_page *)(txn->mt_env->me_map + txn->mt_env->me_psize * pgno);
4003 DPRINTF("page %zu not found", pgno);
4005 return MDB_PAGE_NOTFOUND;
4015 /** Search for the page a given key should be in.
4016 * Pushes parent pages on the cursor stack. This function continues a
4017 * search on a cursor that has already been initialized. (Usually by
4018 * #mdb_page_search() but also by #mdb_node_move().)
4019 * @param[in,out] mc the cursor for this operation.
4020 * @param[in] key the key to search for. If NULL, search for the lowest
4021 * page. (This is used by #mdb_cursor_first().)
4022 * @param[in] modify If true, visited pages are updated with new page numbers.
4023 * @return 0 on success, non-zero on failure.
4026 mdb_page_search_root(MDB_cursor *mc, MDB_val *key, int modify)
4028 MDB_page *mp = mc->mc_pg[mc->mc_top];
4033 while (IS_BRANCH(mp)) {
4037 DPRINTF("branch page %zu has %u keys", mp->mp_pgno, NUMKEYS(mp));
4038 assert(NUMKEYS(mp) > 1);
4039 DPRINTF("found index 0 to page %zu", NODEPGNO(NODEPTR(mp, 0)));
4041 if (key == NULL) /* Initialize cursor to first page. */
4043 else if (key->mv_size > MDB_MAXKEYSIZE && key->mv_data == NULL) {
4044 /* cursor to last page */
4048 node = mdb_node_search(mc, key, &exact);
4050 i = NUMKEYS(mp) - 1;
4052 i = mc->mc_ki[mc->mc_top];
4061 DPRINTF("following index %u for key [%s]",
4063 assert(i < NUMKEYS(mp));
4064 node = NODEPTR(mp, i);
4066 if ((rc = mdb_page_get(mc->mc_txn, NODEPGNO(node), &mp, NULL)) != 0)
4069 mc->mc_ki[mc->mc_top] = i;
4070 if ((rc = mdb_cursor_push(mc, mp)))
4074 if ((rc = mdb_page_touch(mc)) != 0)
4076 mp = mc->mc_pg[mc->mc_top];
4081 DPRINTF("internal error, index points to a %02X page!?",
4083 return MDB_CORRUPTED;
4086 DPRINTF("found leaf page %zu for key [%s]", mp->mp_pgno,
4087 key ? DKEY(key) : NULL);
4092 /** Search for the lowest key under the current branch page.
4093 * This just bypasses a NUMKEYS check in the current page
4094 * before calling mdb_page_search_root(), because the callers
4095 * are all in situations where the current page is known to
4099 mdb_page_search_lowest(MDB_cursor *mc)
4101 MDB_page *mp = mc->mc_pg[mc->mc_top];
4102 MDB_node *node = NODEPTR(mp, 0);
4105 if ((rc = mdb_page_get(mc->mc_txn, NODEPGNO(node), &mp, NULL)) != 0)
4108 mc->mc_ki[mc->mc_top] = 0;
4109 if ((rc = mdb_cursor_push(mc, mp)))
4111 return mdb_page_search_root(mc, NULL, 0);
4114 /** Search for the page a given key should be in.
4115 * Pushes parent pages on the cursor stack. This function just sets up
4116 * the search; it finds the root page for \b mc's database and sets this
4117 * as the root of the cursor's stack. Then #mdb_page_search_root() is
4118 * called to complete the search.
4119 * @param[in,out] mc the cursor for this operation.
4120 * @param[in] key the key to search for. If NULL, search for the lowest
4121 * page. (This is used by #mdb_cursor_first().)
4122 * @param[in] flags If MDB_PS_MODIFY set, visited pages are updated with new page numbers.
4123 * If MDB_PS_ROOTONLY set, just fetch root node, no further lookups.
4124 * @return 0 on success, non-zero on failure.
4127 mdb_page_search(MDB_cursor *mc, MDB_val *key, int flags)
4132 /* Make sure the txn is still viable, then find the root from
4133 * the txn's db table.
4135 if (F_ISSET(mc->mc_txn->mt_flags, MDB_TXN_ERROR)) {
4136 DPUTS("transaction has failed, must abort");
4139 /* Make sure we're using an up-to-date root */
4140 if (mc->mc_dbi > MAIN_DBI) {
4141 if ((*mc->mc_dbflag & DB_STALE) ||
4142 ((flags & MDB_PS_MODIFY) && !(*mc->mc_dbflag & DB_DIRTY))) {
4144 unsigned char dbflag = 0;
4145 mdb_cursor_init(&mc2, mc->mc_txn, MAIN_DBI, NULL);
4146 rc = mdb_page_search(&mc2, &mc->mc_dbx->md_name, flags & MDB_PS_MODIFY);
4149 if (*mc->mc_dbflag & DB_STALE) {
4153 MDB_node *leaf = mdb_node_search(&mc2,
4154 &mc->mc_dbx->md_name, &exact);
4156 return MDB_NOTFOUND;
4157 rc = mdb_node_read(mc->mc_txn, leaf, &data);
4160 memcpy(&flags, ((char *) data.mv_data + offsetof(MDB_db, md_flags)),
4162 /* The txn may not know this DBI, or another process may
4163 * have dropped and recreated the DB with other flags.
4165 if ((mc->mc_db->md_flags & PERSISTENT_FLAGS) != flags)
4166 return MDB_INCOMPATIBLE;
4167 memcpy(mc->mc_db, data.mv_data, sizeof(MDB_db));
4169 if (flags & MDB_PS_MODIFY)
4171 *mc->mc_dbflag &= ~DB_STALE;
4172 *mc->mc_dbflag |= dbflag;
4175 root = mc->mc_db->md_root;
4177 if (root == P_INVALID) { /* Tree is empty. */
4178 DPUTS("tree is empty");
4179 return MDB_NOTFOUND;
4184 if (!mc->mc_pg[0] || mc->mc_pg[0]->mp_pgno != root)
4185 if ((rc = mdb_page_get(mc->mc_txn, root, &mc->mc_pg[0], NULL)) != 0)
4191 DPRINTF("db %u root page %zu has flags 0x%X",
4192 mc->mc_dbi, root, mc->mc_pg[0]->mp_flags);
4194 if (flags & MDB_PS_MODIFY) {
4195 if ((rc = mdb_page_touch(mc)))
4199 if (flags & MDB_PS_ROOTONLY)
4202 return mdb_page_search_root(mc, key, flags);
4206 mdb_ovpage_free(MDB_cursor *mc, MDB_page *mp)
4208 MDB_txn *txn = mc->mc_txn;
4209 pgno_t pg = mp->mp_pgno;
4210 unsigned i, ovpages = mp->mp_pages;
4211 MDB_env *env = txn->mt_env;
4214 DPRINTF("free ov page %zu (%d)", pg, ovpages);
4215 /* If the page is dirty we just acquired it, so we should
4216 * give it back to our current free list, if any.
4217 * Not currently supported in nested txns.
4218 * Otherwise put it onto the list of pages we freed in this txn.
4220 if ((mp->mp_flags & P_DIRTY) && !txn->mt_parent && env->me_pghead) {
4223 MDB_ID2 *dl, ix, iy;
4224 rc = mdb_midl_need(&env->me_pghead, ovpages);
4227 /* Remove from dirty list */
4228 dl = txn->mt_u.dirty_list;
4230 for (ix = dl[x]; ix.mptr != mp; ix = iy) {
4238 dl[j] = ix; /* Unsorted. OK when MDB_TXN_ERROR. */
4239 txn->mt_flags |= MDB_TXN_ERROR;
4240 return MDB_CORRUPTED;
4243 if (!(env->me_flags & MDB_WRITEMAP))
4244 mdb_dpage_free(env, mp);
4245 /* Insert in me_pghead */
4246 mop = env->me_pghead;
4247 j = mop[0] + ovpages;
4248 for (i = mop[0]; i && mop[i] < pg; i--)
4254 rc = mdb_midl_append_range(&txn->mt_free_pgs, pg, ovpages);
4258 mc->mc_db->md_overflow_pages -= ovpages;
4262 /** Return the data associated with a given node.
4263 * @param[in] txn The transaction for this operation.
4264 * @param[in] leaf The node being read.
4265 * @param[out] data Updated to point to the node's data.
4266 * @return 0 on success, non-zero on failure.
4269 mdb_node_read(MDB_txn *txn, MDB_node *leaf, MDB_val *data)
4271 MDB_page *omp; /* overflow page */
4275 if (!F_ISSET(leaf->mn_flags, F_BIGDATA)) {
4276 data->mv_size = NODEDSZ(leaf);
4277 data->mv_data = NODEDATA(leaf);
4281 /* Read overflow data.
4283 data->mv_size = NODEDSZ(leaf);
4284 memcpy(&pgno, NODEDATA(leaf), sizeof(pgno));
4285 if ((rc = mdb_page_get(txn, pgno, &omp, NULL)) != 0) {
4286 DPRINTF("read overflow page %zu failed", pgno);
4289 data->mv_data = METADATA(omp);
4295 mdb_get(MDB_txn *txn, MDB_dbi dbi,
4296 MDB_val *key, MDB_val *data)
4305 DPRINTF("===> get db %u key [%s]", dbi, DKEY(key));
4307 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs || !(txn->mt_dbflags[dbi] & DB_VALID))
4310 if (key->mv_size == 0 || key->mv_size > MDB_MAXKEYSIZE) {
4314 mdb_cursor_init(&mc, txn, dbi, &mx);
4315 return mdb_cursor_set(&mc, key, data, MDB_SET, &exact);
4318 /** Find a sibling for a page.
4319 * Replaces the page at the top of the cursor's stack with the
4320 * specified sibling, if one exists.
4321 * @param[in] mc The cursor for this operation.
4322 * @param[in] move_right Non-zero if the right sibling is requested,
4323 * otherwise the left sibling.
4324 * @return 0 on success, non-zero on failure.
4327 mdb_cursor_sibling(MDB_cursor *mc, int move_right)
4333 if (mc->mc_snum < 2) {
4334 return MDB_NOTFOUND; /* root has no siblings */
4338 DPRINTF("parent page is page %zu, index %u",
4339 mc->mc_pg[mc->mc_top]->mp_pgno, mc->mc_ki[mc->mc_top]);
4341 if (move_right ? (mc->mc_ki[mc->mc_top] + 1u >= NUMKEYS(mc->mc_pg[mc->mc_top]))
4342 : (mc->mc_ki[mc->mc_top] == 0)) {
4343 DPRINTF("no more keys left, moving to %s sibling",
4344 move_right ? "right" : "left");
4345 if ((rc = mdb_cursor_sibling(mc, move_right)) != MDB_SUCCESS) {
4346 /* undo cursor_pop before returning */
4353 mc->mc_ki[mc->mc_top]++;
4355 mc->mc_ki[mc->mc_top]--;
4356 DPRINTF("just moving to %s index key %u",
4357 move_right ? "right" : "left", mc->mc_ki[mc->mc_top]);
4359 assert(IS_BRANCH(mc->mc_pg[mc->mc_top]));
4361 indx = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
4362 if ((rc = mdb_page_get(mc->mc_txn, NODEPGNO(indx), &mp, NULL) != 0))
4365 mdb_cursor_push(mc, mp);
4367 mc->mc_ki[mc->mc_top] = NUMKEYS(mp)-1;
4372 /** Move the cursor to the next data item. */
4374 mdb_cursor_next(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op)
4380 if (mc->mc_flags & C_EOF) {
4381 return MDB_NOTFOUND;
4384 assert(mc->mc_flags & C_INITIALIZED);
4386 mp = mc->mc_pg[mc->mc_top];
4388 if (mc->mc_db->md_flags & MDB_DUPSORT) {
4389 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
4390 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4391 if (op == MDB_NEXT || op == MDB_NEXT_DUP) {
4392 rc = mdb_cursor_next(&mc->mc_xcursor->mx_cursor, data, NULL, MDB_NEXT);
4393 if (op != MDB_NEXT || rc != MDB_NOTFOUND)
4397 mc->mc_xcursor->mx_cursor.mc_flags &= ~C_INITIALIZED;
4398 if (op == MDB_NEXT_DUP)
4399 return MDB_NOTFOUND;
4403 DPRINTF("cursor_next: top page is %zu in cursor %p", mp->mp_pgno, (void *) mc);
4405 if (mc->mc_ki[mc->mc_top] + 1u >= NUMKEYS(mp)) {
4406 DPUTS("=====> move to next sibling page");
4407 if ((rc = mdb_cursor_sibling(mc, 1)) != MDB_SUCCESS) {
4408 mc->mc_flags |= C_EOF;
4409 mc->mc_flags &= ~C_INITIALIZED;
4412 mp = mc->mc_pg[mc->mc_top];
4413 DPRINTF("next page is %zu, key index %u", mp->mp_pgno, mc->mc_ki[mc->mc_top]);
4415 mc->mc_ki[mc->mc_top]++;
4417 DPRINTF("==> cursor points to page %zu with %u keys, key index %u",
4418 mp->mp_pgno, NUMKEYS(mp), mc->mc_ki[mc->mc_top]);
4421 key->mv_size = mc->mc_db->md_pad;
4422 key->mv_data = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], key->mv_size);
4426 assert(IS_LEAF(mp));
4427 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
4429 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4430 mdb_xcursor_init1(mc, leaf);
4433 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
4436 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4437 rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
4438 if (rc != MDB_SUCCESS)
4443 MDB_GET_KEY(leaf, key);
4447 /** Move the cursor to the previous data item. */
4449 mdb_cursor_prev(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op)
4455 assert(mc->mc_flags & C_INITIALIZED);
4457 mp = mc->mc_pg[mc->mc_top];
4459 if (mc->mc_db->md_flags & MDB_DUPSORT) {
4460 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
4461 if (op == MDB_PREV || op == MDB_PREV_DUP) {
4462 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4463 rc = mdb_cursor_prev(&mc->mc_xcursor->mx_cursor, data, NULL, MDB_PREV);
4464 if (op != MDB_PREV || rc != MDB_NOTFOUND)
4467 mc->mc_xcursor->mx_cursor.mc_flags &= ~C_INITIALIZED;
4468 if (op == MDB_PREV_DUP)
4469 return MDB_NOTFOUND;
4474 DPRINTF("cursor_prev: top page is %zu in cursor %p", mp->mp_pgno, (void *) mc);
4476 if (mc->mc_ki[mc->mc_top] == 0) {
4477 DPUTS("=====> move to prev sibling page");
4478 if ((rc = mdb_cursor_sibling(mc, 0)) != MDB_SUCCESS) {
4479 mc->mc_flags &= ~C_INITIALIZED;
4482 mp = mc->mc_pg[mc->mc_top];
4483 mc->mc_ki[mc->mc_top] = NUMKEYS(mp) - 1;
4484 DPRINTF("prev page is %zu, key index %u", mp->mp_pgno, mc->mc_ki[mc->mc_top]);
4486 mc->mc_ki[mc->mc_top]--;
4488 mc->mc_flags &= ~C_EOF;
4490 DPRINTF("==> cursor points to page %zu with %u keys, key index %u",
4491 mp->mp_pgno, NUMKEYS(mp), mc->mc_ki[mc->mc_top]);
4494 key->mv_size = mc->mc_db->md_pad;
4495 key->mv_data = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], key->mv_size);
4499 assert(IS_LEAF(mp));
4500 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
4502 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4503 mdb_xcursor_init1(mc, leaf);
4506 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
4509 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4510 rc = mdb_cursor_last(&mc->mc_xcursor->mx_cursor, data, NULL);
4511 if (rc != MDB_SUCCESS)
4516 MDB_GET_KEY(leaf, key);
4520 /** Set the cursor on a specific data item. */
4522 mdb_cursor_set(MDB_cursor *mc, MDB_val *key, MDB_val *data,
4523 MDB_cursor_op op, int *exactp)
4527 MDB_node *leaf = NULL;
4532 assert(key->mv_size > 0);
4534 /* See if we're already on the right page */
4535 if (mc->mc_flags & C_INITIALIZED) {
4538 mp = mc->mc_pg[mc->mc_top];
4540 mc->mc_ki[mc->mc_top] = 0;
4541 return MDB_NOTFOUND;
4543 if (mp->mp_flags & P_LEAF2) {
4544 nodekey.mv_size = mc->mc_db->md_pad;
4545 nodekey.mv_data = LEAF2KEY(mp, 0, nodekey.mv_size);
4547 leaf = NODEPTR(mp, 0);
4548 MDB_GET_KEY(leaf, &nodekey);
4550 rc = mc->mc_dbx->md_cmp(key, &nodekey);
4552 /* Probably happens rarely, but first node on the page
4553 * was the one we wanted.
4555 mc->mc_ki[mc->mc_top] = 0;
4562 unsigned int nkeys = NUMKEYS(mp);
4564 if (mp->mp_flags & P_LEAF2) {
4565 nodekey.mv_data = LEAF2KEY(mp,
4566 nkeys-1, nodekey.mv_size);
4568 leaf = NODEPTR(mp, nkeys-1);
4569 MDB_GET_KEY(leaf, &nodekey);
4571 rc = mc->mc_dbx->md_cmp(key, &nodekey);
4573 /* last node was the one we wanted */
4574 mc->mc_ki[mc->mc_top] = nkeys-1;
4580 if (mc->mc_ki[mc->mc_top] < NUMKEYS(mp)) {
4581 /* This is definitely the right page, skip search_page */
4582 if (mp->mp_flags & P_LEAF2) {
4583 nodekey.mv_data = LEAF2KEY(mp,
4584 mc->mc_ki[mc->mc_top], nodekey.mv_size);
4586 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
4587 MDB_GET_KEY(leaf, &nodekey);
4589 rc = mc->mc_dbx->md_cmp(key, &nodekey);
4591 /* current node was the one we wanted */
4601 /* If any parents have right-sibs, search.
4602 * Otherwise, there's nothing further.
4604 for (i=0; i<mc->mc_top; i++)
4606 NUMKEYS(mc->mc_pg[i])-1)
4608 if (i == mc->mc_top) {
4609 /* There are no other pages */
4610 mc->mc_ki[mc->mc_top] = nkeys;
4611 return MDB_NOTFOUND;
4615 /* There are no other pages */
4616 mc->mc_ki[mc->mc_top] = 0;
4617 return MDB_NOTFOUND;
4621 rc = mdb_page_search(mc, key, 0);
4622 if (rc != MDB_SUCCESS)
4625 mp = mc->mc_pg[mc->mc_top];
4626 assert(IS_LEAF(mp));
4629 leaf = mdb_node_search(mc, key, exactp);
4630 if (exactp != NULL && !*exactp) {
4631 /* MDB_SET specified and not an exact match. */
4632 return MDB_NOTFOUND;
4636 DPUTS("===> inexact leaf not found, goto sibling");
4637 if ((rc = mdb_cursor_sibling(mc, 1)) != MDB_SUCCESS)
4638 return rc; /* no entries matched */
4639 mp = mc->mc_pg[mc->mc_top];
4640 assert(IS_LEAF(mp));
4641 leaf = NODEPTR(mp, 0);
4645 mc->mc_flags |= C_INITIALIZED;
4646 mc->mc_flags &= ~C_EOF;
4649 key->mv_size = mc->mc_db->md_pad;
4650 key->mv_data = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], key->mv_size);
4654 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4655 mdb_xcursor_init1(mc, leaf);
4658 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4659 if (op == MDB_SET || op == MDB_SET_KEY || op == MDB_SET_RANGE) {
4660 rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
4663 if (op == MDB_GET_BOTH) {
4669 rc = mdb_cursor_set(&mc->mc_xcursor->mx_cursor, data, NULL, MDB_SET_RANGE, ex2p);
4670 if (rc != MDB_SUCCESS)
4673 } else if (op == MDB_GET_BOTH || op == MDB_GET_BOTH_RANGE) {
4675 if ((rc = mdb_node_read(mc->mc_txn, leaf, &d2)) != MDB_SUCCESS)
4677 rc = mc->mc_dbx->md_dcmp(data, &d2);
4679 if (op == MDB_GET_BOTH || rc > 0)
4680 return MDB_NOTFOUND;
4685 mc->mc_xcursor->mx_cursor.mc_flags &= ~C_INITIALIZED;
4686 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
4691 /* The key already matches in all other cases */
4692 if (op == MDB_SET_RANGE || op == MDB_SET_KEY)
4693 MDB_GET_KEY(leaf, key);
4694 DPRINTF("==> cursor placed on key [%s]", DKEY(key));
4699 /** Move the cursor to the first item in the database. */
4701 mdb_cursor_first(MDB_cursor *mc, MDB_val *key, MDB_val *data)
4706 if (!(mc->mc_flags & C_INITIALIZED) || mc->mc_top) {
4707 rc = mdb_page_search(mc, NULL, 0);
4708 if (rc != MDB_SUCCESS)
4711 assert(IS_LEAF(mc->mc_pg[mc->mc_top]));
4713 leaf = NODEPTR(mc->mc_pg[mc->mc_top], 0);
4714 mc->mc_flags |= C_INITIALIZED;
4715 mc->mc_flags &= ~C_EOF;
4717 mc->mc_ki[mc->mc_top] = 0;
4719 if (IS_LEAF2(mc->mc_pg[mc->mc_top])) {
4720 key->mv_size = mc->mc_db->md_pad;
4721 key->mv_data = LEAF2KEY(mc->mc_pg[mc->mc_top], 0, key->mv_size);
4726 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4727 mdb_xcursor_init1(mc, leaf);
4728 rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
4733 mc->mc_xcursor->mx_cursor.mc_flags &= ~C_INITIALIZED;
4734 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
4738 MDB_GET_KEY(leaf, key);
4742 /** Move the cursor to the last item in the database. */
4744 mdb_cursor_last(MDB_cursor *mc, MDB_val *key, MDB_val *data)
4749 if (!(mc->mc_flags & C_EOF)) {
4751 if (!(mc->mc_flags & C_INITIALIZED) || mc->mc_top) {
4754 lkey.mv_size = MDB_MAXKEYSIZE+1;
4755 lkey.mv_data = NULL;
4756 rc = mdb_page_search(mc, &lkey, 0);
4757 if (rc != MDB_SUCCESS)
4760 assert(IS_LEAF(mc->mc_pg[mc->mc_top]));
4763 mc->mc_ki[mc->mc_top] = NUMKEYS(mc->mc_pg[mc->mc_top]) - 1;
4764 mc->mc_flags |= C_INITIALIZED|C_EOF;
4765 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
4767 if (IS_LEAF2(mc->mc_pg[mc->mc_top])) {
4768 key->mv_size = mc->mc_db->md_pad;
4769 key->mv_data = LEAF2KEY(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], key->mv_size);
4774 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4775 mdb_xcursor_init1(mc, leaf);
4776 rc = mdb_cursor_last(&mc->mc_xcursor->mx_cursor, data, NULL);
4781 mc->mc_xcursor->mx_cursor.mc_flags &= ~C_INITIALIZED;
4782 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
4787 MDB_GET_KEY(leaf, key);
4792 mdb_cursor_get(MDB_cursor *mc, MDB_val *key, MDB_val *data,
4801 case MDB_GET_CURRENT:
4802 if (!(mc->mc_flags & C_INITIALIZED)) {
4805 MDB_page *mp = mc->mc_pg[mc->mc_top];
4807 mc->mc_ki[mc->mc_top] = 0;
4813 key->mv_size = mc->mc_db->md_pad;
4814 key->mv_data = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], key->mv_size);
4816 MDB_node *leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
4817 MDB_GET_KEY(leaf, key);
4819 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4820 rc = mdb_cursor_get(&mc->mc_xcursor->mx_cursor, data, NULL, MDB_GET_CURRENT);
4822 rc = mdb_node_read(mc->mc_txn, leaf, data);
4829 case MDB_GET_BOTH_RANGE:
4830 if (data == NULL || mc->mc_xcursor == NULL) {
4838 if (key == NULL || key->mv_size == 0 || key->mv_size > MDB_MAXKEYSIZE) {
4840 } else if (op == MDB_SET_RANGE)
4841 rc = mdb_cursor_set(mc, key, data, op, NULL);
4843 rc = mdb_cursor_set(mc, key, data, op, &exact);
4845 case MDB_GET_MULTIPLE:
4847 !(mc->mc_db->md_flags & MDB_DUPFIXED) ||
4848 !(mc->mc_flags & C_INITIALIZED)) {
4853 if (!(mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED) ||
4854 (mc->mc_xcursor->mx_cursor.mc_flags & C_EOF))
4857 case MDB_NEXT_MULTIPLE:
4859 !(mc->mc_db->md_flags & MDB_DUPFIXED)) {
4863 if (!(mc->mc_flags & C_INITIALIZED))
4864 rc = mdb_cursor_first(mc, key, data);
4866 rc = mdb_cursor_next(mc, key, data, MDB_NEXT_DUP);
4867 if (rc == MDB_SUCCESS) {
4868 if (mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED) {
4871 mx = &mc->mc_xcursor->mx_cursor;
4872 data->mv_size = NUMKEYS(mx->mc_pg[mx->mc_top]) *
4874 data->mv_data = METADATA(mx->mc_pg[mx->mc_top]);
4875 mx->mc_ki[mx->mc_top] = NUMKEYS(mx->mc_pg[mx->mc_top])-1;
4883 case MDB_NEXT_NODUP:
4884 if (!(mc->mc_flags & C_INITIALIZED))
4885 rc = mdb_cursor_first(mc, key, data);
4887 rc = mdb_cursor_next(mc, key, data, op);
4891 case MDB_PREV_NODUP:
4892 if (!(mc->mc_flags & C_INITIALIZED)) {
4893 rc = mdb_cursor_last(mc, key, data);
4896 mc->mc_flags |= C_INITIALIZED;
4897 mc->mc_ki[mc->mc_top]++;
4899 rc = mdb_cursor_prev(mc, key, data, op);
4902 rc = mdb_cursor_first(mc, key, data);
4906 !(mc->mc_db->md_flags & MDB_DUPSORT) ||
4907 !(mc->mc_flags & C_INITIALIZED) ||
4908 !(mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED)) {
4912 rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
4915 rc = mdb_cursor_last(mc, key, data);
4919 !(mc->mc_db->md_flags & MDB_DUPSORT) ||
4920 !(mc->mc_flags & C_INITIALIZED) ||
4921 !(mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED)) {
4925 rc = mdb_cursor_last(&mc->mc_xcursor->mx_cursor, data, NULL);
4928 DPRINTF("unhandled/unimplemented cursor operation %u", op);
4936 /** Touch all the pages in the cursor stack.
4937 * Makes sure all the pages are writable, before attempting a write operation.
4938 * @param[in] mc The cursor to operate on.
4941 mdb_cursor_touch(MDB_cursor *mc)
4945 if (mc->mc_dbi > MAIN_DBI && !(*mc->mc_dbflag & DB_DIRTY)) {
4948 mdb_cursor_init(&mc2, mc->mc_txn, MAIN_DBI, &mcx);
4949 rc = mdb_page_search(&mc2, &mc->mc_dbx->md_name, MDB_PS_MODIFY);
4952 *mc->mc_dbflag |= DB_DIRTY;
4954 for (mc->mc_top = 0; mc->mc_top < mc->mc_snum; mc->mc_top++) {
4955 rc = mdb_page_touch(mc);
4959 mc->mc_top = mc->mc_snum-1;
4964 mdb_cursor_put(MDB_cursor *mc, MDB_val *key, MDB_val *data,
4967 MDB_node *leaf = NULL;
4968 MDB_val xdata, *rdata, dkey;
4971 int do_sub = 0, insert = 0;
4972 unsigned int mcount = 0;
4976 char dbuf[MDB_MAXKEYSIZE+1];
4977 unsigned int nflags;
4980 if (F_ISSET(mc->mc_txn->mt_flags, MDB_TXN_RDONLY))
4983 if (flags != MDB_CURRENT && (key->mv_size == 0 || key->mv_size > MDB_MAXKEYSIZE))
4986 if (F_ISSET(mc->mc_db->md_flags, MDB_DUPSORT) && data->mv_size > MDB_MAXKEYSIZE)
4989 #if SIZE_MAX > MAXDATASIZE
4990 if (data->mv_size > MAXDATASIZE)
4994 DPRINTF("==> put db %u key [%s], size %zu, data size %zu",
4995 mc->mc_dbi, DKEY(key), key ? key->mv_size:0, data->mv_size);
4999 if (flags == MDB_CURRENT) {
5000 if (!(mc->mc_flags & C_INITIALIZED))
5003 } else if (mc->mc_db->md_root == P_INVALID) {
5005 /* new database, write a root leaf page */
5006 DPUTS("allocating new root leaf page");
5007 if ((rc = mdb_page_new(mc, P_LEAF, 1, &np))) {
5011 mdb_cursor_push(mc, np);
5012 mc->mc_db->md_root = np->mp_pgno;
5013 mc->mc_db->md_depth++;
5014 *mc->mc_dbflag |= DB_DIRTY;
5015 if ((mc->mc_db->md_flags & (MDB_DUPSORT|MDB_DUPFIXED))
5017 np->mp_flags |= P_LEAF2;
5018 mc->mc_flags |= C_INITIALIZED;
5024 if (flags & MDB_APPEND) {
5026 rc = mdb_cursor_last(mc, &k2, &d2);
5028 rc = mc->mc_dbx->md_cmp(key, &k2);
5031 mc->mc_ki[mc->mc_top]++;
5033 /* new key is <= last key */
5038 rc = mdb_cursor_set(mc, key, &d2, MDB_SET, &exact);
5040 if ((flags & MDB_NOOVERWRITE) && rc == 0) {
5041 DPRINTF("duplicate key [%s]", DKEY(key));
5043 return MDB_KEYEXIST;
5045 if (rc && rc != MDB_NOTFOUND)
5049 /* Cursor is positioned, now make sure all pages are writable */
5050 rc2 = mdb_cursor_touch(mc);
5055 /* The key already exists */
5056 if (rc == MDB_SUCCESS) {
5057 /* there's only a key anyway, so this is a no-op */
5058 if (IS_LEAF2(mc->mc_pg[mc->mc_top])) {
5059 unsigned int ksize = mc->mc_db->md_pad;
5060 if (key->mv_size != ksize)
5062 if (flags == MDB_CURRENT) {
5063 char *ptr = LEAF2KEY(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], ksize);
5064 memcpy(ptr, key->mv_data, ksize);
5069 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
5072 if (F_ISSET(mc->mc_db->md_flags, MDB_DUPSORT)) {
5073 /* Was a single item before, must convert now */
5075 if (!F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5076 /* Just overwrite the current item */
5077 if (flags == MDB_CURRENT)
5080 dkey.mv_size = NODEDSZ(leaf);
5081 dkey.mv_data = NODEDATA(leaf);
5082 #if UINT_MAX < SIZE_MAX
5083 if (mc->mc_dbx->md_dcmp == mdb_cmp_int && dkey.mv_size == sizeof(size_t))
5084 #ifdef MISALIGNED_OK
5085 mc->mc_dbx->md_dcmp = mdb_cmp_long;
5087 mc->mc_dbx->md_dcmp = mdb_cmp_cint;
5090 /* if data matches, ignore it */
5091 if (!mc->mc_dbx->md_dcmp(data, &dkey))
5092 return (flags == MDB_NODUPDATA) ? MDB_KEYEXIST : MDB_SUCCESS;
5094 /* create a fake page for the dup items */
5095 memcpy(dbuf, dkey.mv_data, dkey.mv_size);
5096 dkey.mv_data = dbuf;
5097 fp = (MDB_page *)&pbuf;
5098 fp->mp_pgno = mc->mc_pg[mc->mc_top]->mp_pgno;
5099 fp->mp_flags = P_LEAF|P_DIRTY|P_SUBP;
5100 fp->mp_lower = PAGEHDRSZ;
5101 fp->mp_upper = PAGEHDRSZ + dkey.mv_size + data->mv_size;
5102 if (mc->mc_db->md_flags & MDB_DUPFIXED) {
5103 fp->mp_flags |= P_LEAF2;
5104 fp->mp_pad = data->mv_size;
5105 fp->mp_upper += 2 * data->mv_size; /* leave space for 2 more */
5107 fp->mp_upper += 2 * sizeof(indx_t) + 2 * NODESIZE +
5108 (dkey.mv_size & 1) + (data->mv_size & 1);
5110 mdb_node_del(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], 0);
5113 xdata.mv_size = fp->mp_upper;
5118 if (!F_ISSET(leaf->mn_flags, F_SUBDATA)) {
5119 /* See if we need to convert from fake page to subDB */
5121 unsigned int offset;
5125 fp = NODEDATA(leaf);
5126 if (flags == MDB_CURRENT) {
5128 fp->mp_flags |= P_DIRTY;
5129 COPY_PGNO(fp->mp_pgno, mc->mc_pg[mc->mc_top]->mp_pgno);
5130 mc->mc_xcursor->mx_cursor.mc_pg[0] = fp;
5134 if (mc->mc_db->md_flags & MDB_DUPFIXED) {
5135 offset = fp->mp_pad;
5136 if (SIZELEFT(fp) >= offset)
5138 offset *= 4; /* space for 4 more */
5140 offset = NODESIZE + sizeof(indx_t) + data->mv_size;
5142 offset += offset & 1;
5143 fp_flags = fp->mp_flags;
5144 if (NODESIZE + sizeof(indx_t) + NODEKSZ(leaf) + NODEDSZ(leaf) +
5145 offset >= mc->mc_txn->mt_env->me_nodemax) {
5146 /* yes, convert it */
5148 if (mc->mc_db->md_flags & MDB_DUPFIXED) {
5149 dummy.md_pad = fp->mp_pad;
5150 dummy.md_flags = MDB_DUPFIXED;
5151 if (mc->mc_db->md_flags & MDB_INTEGERDUP)
5152 dummy.md_flags |= MDB_INTEGERKEY;
5155 dummy.md_branch_pages = 0;
5156 dummy.md_leaf_pages = 1;
5157 dummy.md_overflow_pages = 0;
5158 dummy.md_entries = NUMKEYS(fp);
5160 xdata.mv_size = sizeof(MDB_db);
5161 xdata.mv_data = &dummy;
5162 if ((rc = mdb_page_alloc(mc, 1, &mp)))
5164 offset = mc->mc_txn->mt_env->me_psize - NODEDSZ(leaf);
5165 flags |= F_DUPDATA|F_SUBDATA;
5166 dummy.md_root = mp->mp_pgno;
5167 fp_flags &= ~P_SUBP;
5169 /* no, just grow it */
5171 xdata.mv_size = NODEDSZ(leaf) + offset;
5172 xdata.mv_data = &pbuf;
5173 mp = (MDB_page *)&pbuf;
5174 mp->mp_pgno = mc->mc_pg[mc->mc_top]->mp_pgno;
5177 mp->mp_flags = fp_flags | P_DIRTY;
5178 mp->mp_pad = fp->mp_pad;
5179 mp->mp_lower = fp->mp_lower;
5180 mp->mp_upper = fp->mp_upper + offset;
5182 memcpy(METADATA(mp), METADATA(fp), NUMKEYS(fp) * fp->mp_pad);
5184 nsize = NODEDSZ(leaf) - fp->mp_upper;
5185 memcpy((char *)mp + mp->mp_upper, (char *)fp + fp->mp_upper, nsize);
5186 for (i=0; i<NUMKEYS(fp); i++)
5187 mp->mp_ptrs[i] = fp->mp_ptrs[i] + offset;
5189 mdb_node_del(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], 0);
5193 /* data is on sub-DB, just store it */
5194 flags |= F_DUPDATA|F_SUBDATA;
5198 /* overflow page overwrites need special handling */
5199 if (F_ISSET(leaf->mn_flags, F_BIGDATA)) {
5202 unsigned psize = mc->mc_txn->mt_env->me_psize;
5203 int level, ovpages, dpages = OVPAGES(data->mv_size, psize);
5205 memcpy(&pg, NODEDATA(leaf), sizeof(pg));
5206 if ((rc2 = mdb_page_get(mc->mc_txn, pg, &omp, &level)) != 0)
5208 ovpages = omp->mp_pages;
5210 /* Is the ov page writable and large enough? */
5211 if ((omp->mp_flags & P_DIRTY) && ovpages >= dpages) {
5212 /* yes, overwrite it. Note in this case we don't
5213 * bother to try shrinking the page if the new data
5214 * is smaller than the overflow threshold.
5217 /* It is writable only in a parent txn */
5218 size_t sz = (size_t) psize * ovpages, off;
5219 MDB_page *np = mdb_page_malloc(mc->mc_txn, ovpages);
5225 mdb_mid2l_insert(mc->mc_txn->mt_u.dirty_list, &id2);
5226 if (!(flags & MDB_RESERVE)) {
5227 /* Copy end of page, adjusting alignment so
5228 * compiler may copy words instead of bytes.
5230 off = (PAGEHDRSZ + data->mv_size) & -sizeof(size_t);
5231 memcpy((size_t *)((char *)np + off),
5232 (size_t *)((char *)omp + off), sz - off);
5235 memcpy(np, omp, sz); /* Copy beginning of page */
5238 SETDSZ(leaf, data->mv_size);
5239 if (F_ISSET(flags, MDB_RESERVE))
5240 data->mv_data = METADATA(omp);
5242 memcpy(METADATA(omp), data->mv_data, data->mv_size);
5245 if ((rc2 = mdb_ovpage_free(mc, omp)) != MDB_SUCCESS)
5248 } else if (NODEDSZ(leaf) == data->mv_size) {
5249 /* same size, just replace it. Note that we could
5250 * also reuse this node if the new data is smaller,
5251 * but instead we opt to shrink the node in that case.
5253 if (F_ISSET(flags, MDB_RESERVE))
5254 data->mv_data = NODEDATA(leaf);
5255 else if (data->mv_size)
5256 memcpy(NODEDATA(leaf), data->mv_data, data->mv_size);
5258 memcpy(NODEKEY(leaf), key->mv_data, key->mv_size);
5261 mdb_node_del(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], 0);
5262 mc->mc_db->md_entries--;
5264 DPRINTF("inserting key at index %i", mc->mc_ki[mc->mc_top]);
5271 nflags = flags & NODE_ADD_FLAGS;
5272 nsize = IS_LEAF2(mc->mc_pg[mc->mc_top]) ? key->mv_size : mdb_leaf_size(mc->mc_txn->mt_env, key, rdata);
5273 if (SIZELEFT(mc->mc_pg[mc->mc_top]) < nsize) {
5274 if (( flags & (F_DUPDATA|F_SUBDATA)) == F_DUPDATA )
5275 nflags &= ~MDB_APPEND;
5277 nflags |= MDB_SPLIT_REPLACE;
5278 rc = mdb_page_split(mc, key, rdata, P_INVALID, nflags);
5280 /* There is room already in this leaf page. */
5281 rc = mdb_node_add(mc, mc->mc_ki[mc->mc_top], key, rdata, 0, nflags);
5282 if (rc == 0 && !do_sub && insert) {
5283 /* Adjust other cursors pointing to mp */
5284 MDB_cursor *m2, *m3;
5285 MDB_dbi dbi = mc->mc_dbi;
5286 unsigned i = mc->mc_top;
5287 MDB_page *mp = mc->mc_pg[i];
5289 if (mc->mc_flags & C_SUB)
5292 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
5293 if (mc->mc_flags & C_SUB)
5294 m3 = &m2->mc_xcursor->mx_cursor;
5297 if (m3 == mc || m3->mc_snum < mc->mc_snum) continue;
5298 if (m3->mc_pg[i] == mp && m3->mc_ki[i] >= mc->mc_ki[i]) {
5305 if (rc != MDB_SUCCESS)
5306 mc->mc_txn->mt_flags |= MDB_TXN_ERROR;
5308 /* Now store the actual data in the child DB. Note that we're
5309 * storing the user data in the keys field, so there are strict
5310 * size limits on dupdata. The actual data fields of the child
5311 * DB are all zero size.
5318 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
5319 if (flags & MDB_CURRENT) {
5320 xflags = MDB_CURRENT;
5322 mdb_xcursor_init1(mc, leaf);
5323 xflags = (flags & MDB_NODUPDATA) ? MDB_NOOVERWRITE : 0;
5325 /* converted, write the original data first */
5327 rc = mdb_cursor_put(&mc->mc_xcursor->mx_cursor, &dkey, &xdata, xflags);
5331 /* Adjust other cursors pointing to mp */
5333 unsigned i = mc->mc_top;
5334 MDB_page *mp = mc->mc_pg[i];
5336 for (m2 = mc->mc_txn->mt_cursors[mc->mc_dbi]; m2; m2=m2->mc_next) {
5337 if (m2 == mc || m2->mc_snum < mc->mc_snum) continue;
5338 if (m2->mc_pg[i] == mp && m2->mc_ki[i] == mc->mc_ki[i]) {
5339 mdb_xcursor_init1(m2, leaf);
5343 /* we've done our job */
5346 if (flags & MDB_APPENDDUP)
5347 xflags |= MDB_APPEND;
5348 rc = mdb_cursor_put(&mc->mc_xcursor->mx_cursor, data, &xdata, xflags);
5349 if (flags & F_SUBDATA) {
5350 void *db = NODEDATA(leaf);
5351 memcpy(db, &mc->mc_xcursor->mx_db, sizeof(MDB_db));
5354 /* sub-writes might have failed so check rc again.
5355 * Don't increment count if we just replaced an existing item.
5357 if (!rc && !(flags & MDB_CURRENT))
5358 mc->mc_db->md_entries++;
5359 if (flags & MDB_MULTIPLE) {
5361 if (mcount < data[1].mv_size) {
5362 data[0].mv_data = (char *)data[0].mv_data + data[0].mv_size;
5363 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
5369 /* If we succeeded and the key didn't exist before, make sure
5370 * the cursor is marked valid.
5373 mc->mc_flags |= C_INITIALIZED;
5378 mdb_cursor_del(MDB_cursor *mc, unsigned int flags)
5383 if (F_ISSET(mc->mc_txn->mt_flags, MDB_TXN_RDONLY))
5386 if (!(mc->mc_flags & C_INITIALIZED))
5389 rc = mdb_cursor_touch(mc);
5393 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
5395 if (!IS_LEAF2(mc->mc_pg[mc->mc_top]) && F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5396 if (flags != MDB_NODUPDATA) {
5397 if (!F_ISSET(leaf->mn_flags, F_SUBDATA)) {
5398 mc->mc_xcursor->mx_cursor.mc_pg[0] = NODEDATA(leaf);
5400 rc = mdb_cursor_del(&mc->mc_xcursor->mx_cursor, 0);
5401 /* If sub-DB still has entries, we're done */
5402 if (mc->mc_xcursor->mx_db.md_entries) {
5403 if (leaf->mn_flags & F_SUBDATA) {
5404 /* update subDB info */
5405 void *db = NODEDATA(leaf);
5406 memcpy(db, &mc->mc_xcursor->mx_db, sizeof(MDB_db));
5409 /* shrink fake page */
5410 mdb_node_shrink(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
5411 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
5412 mc->mc_xcursor->mx_cursor.mc_pg[0] = NODEDATA(leaf);
5413 /* fix other sub-DB cursors pointed at this fake page */
5414 for (m2 = mc->mc_txn->mt_cursors[mc->mc_dbi]; m2; m2=m2->mc_next) {
5415 if (m2 == mc || m2->mc_snum < mc->mc_snum) continue;
5416 if (m2->mc_pg[mc->mc_top] == mc->mc_pg[mc->mc_top] &&
5417 m2->mc_ki[mc->mc_top] == mc->mc_ki[mc->mc_top])
5418 m2->mc_xcursor->mx_cursor.mc_pg[0] = NODEDATA(leaf);
5421 mc->mc_db->md_entries--;
5424 /* otherwise fall thru and delete the sub-DB */
5427 if (leaf->mn_flags & F_SUBDATA) {
5428 /* add all the child DB's pages to the free list */
5429 rc = mdb_drop0(&mc->mc_xcursor->mx_cursor, 0);
5430 if (rc == MDB_SUCCESS) {
5431 mc->mc_db->md_entries -=
5432 mc->mc_xcursor->mx_db.md_entries;
5437 return mdb_cursor_del0(mc, leaf);
5440 /** Allocate and initialize new pages for a database.
5441 * @param[in] mc a cursor on the database being added to.
5442 * @param[in] flags flags defining what type of page is being allocated.
5443 * @param[in] num the number of pages to allocate. This is usually 1,
5444 * unless allocating overflow pages for a large record.
5445 * @param[out] mp Address of a page, or NULL on failure.
5446 * @return 0 on success, non-zero on failure.
5449 mdb_page_new(MDB_cursor *mc, uint32_t flags, int num, MDB_page **mp)
5454 if ((rc = mdb_page_alloc(mc, num, &np)))
5456 DPRINTF("allocated new mpage %zu, page size %u",
5457 np->mp_pgno, mc->mc_txn->mt_env->me_psize);
5458 np->mp_flags = flags | P_DIRTY;
5459 np->mp_lower = PAGEHDRSZ;
5460 np->mp_upper = mc->mc_txn->mt_env->me_psize;
5463 mc->mc_db->md_branch_pages++;
5464 else if (IS_LEAF(np))
5465 mc->mc_db->md_leaf_pages++;
5466 else if (IS_OVERFLOW(np)) {
5467 mc->mc_db->md_overflow_pages += num;
5475 /** Calculate the size of a leaf node.
5476 * The size depends on the environment's page size; if a data item
5477 * is too large it will be put onto an overflow page and the node
5478 * size will only include the key and not the data. Sizes are always
5479 * rounded up to an even number of bytes, to guarantee 2-byte alignment
5480 * of the #MDB_node headers.
5481 * @param[in] env The environment handle.
5482 * @param[in] key The key for the node.
5483 * @param[in] data The data for the node.
5484 * @return The number of bytes needed to store the node.
5487 mdb_leaf_size(MDB_env *env, MDB_val *key, MDB_val *data)
5491 sz = LEAFSIZE(key, data);
5492 if (sz >= env->me_nodemax) {
5493 /* put on overflow page */
5494 sz -= data->mv_size - sizeof(pgno_t);
5498 return sz + sizeof(indx_t);
5501 /** Calculate the size of a branch node.
5502 * The size should depend on the environment's page size but since
5503 * we currently don't support spilling large keys onto overflow
5504 * pages, it's simply the size of the #MDB_node header plus the
5505 * size of the key. Sizes are always rounded up to an even number
5506 * of bytes, to guarantee 2-byte alignment of the #MDB_node headers.
5507 * @param[in] env The environment handle.
5508 * @param[in] key The key for the node.
5509 * @return The number of bytes needed to store the node.
5512 mdb_branch_size(MDB_env *env, MDB_val *key)
5517 if (sz >= env->me_nodemax) {
5518 /* put on overflow page */
5519 /* not implemented */
5520 /* sz -= key->size - sizeof(pgno_t); */
5523 return sz + sizeof(indx_t);
5526 /** Add a node to the page pointed to by the cursor.
5527 * @param[in] mc The cursor for this operation.
5528 * @param[in] indx The index on the page where the new node should be added.
5529 * @param[in] key The key for the new node.
5530 * @param[in] data The data for the new node, if any.
5531 * @param[in] pgno The page number, if adding a branch node.
5532 * @param[in] flags Flags for the node.
5533 * @return 0 on success, non-zero on failure. Possible errors are:
5535 * <li>ENOMEM - failed to allocate overflow pages for the node.
5536 * <li>MDB_PAGE_FULL - there is insufficient room in the page. This error
5537 * should never happen since all callers already calculate the
5538 * page's free space before calling this function.
5542 mdb_node_add(MDB_cursor *mc, indx_t indx,
5543 MDB_val *key, MDB_val *data, pgno_t pgno, unsigned int flags)
5546 size_t node_size = NODESIZE;
5549 MDB_page *mp = mc->mc_pg[mc->mc_top];
5550 MDB_page *ofp = NULL; /* overflow page */
5553 assert(mp->mp_upper >= mp->mp_lower);
5555 DPRINTF("add to %s %spage %zu index %i, data size %zu key size %zu [%s]",
5556 IS_LEAF(mp) ? "leaf" : "branch",
5557 IS_SUBP(mp) ? "sub-" : "",
5558 mp->mp_pgno, indx, data ? data->mv_size : 0,
5559 key ? key->mv_size : 0, key ? DKEY(key) : NULL);
5562 /* Move higher keys up one slot. */
5563 int ksize = mc->mc_db->md_pad, dif;
5564 char *ptr = LEAF2KEY(mp, indx, ksize);
5565 dif = NUMKEYS(mp) - indx;
5567 memmove(ptr+ksize, ptr, dif*ksize);
5568 /* insert new key */
5569 memcpy(ptr, key->mv_data, ksize);
5571 /* Just using these for counting */
5572 mp->mp_lower += sizeof(indx_t);
5573 mp->mp_upper -= ksize - sizeof(indx_t);
5578 node_size += key->mv_size;
5582 if (F_ISSET(flags, F_BIGDATA)) {
5583 /* Data already on overflow page. */
5584 node_size += sizeof(pgno_t);
5585 } else if (node_size + data->mv_size >= mc->mc_txn->mt_env->me_nodemax) {
5586 int ovpages = OVPAGES(data->mv_size, mc->mc_txn->mt_env->me_psize);
5588 /* Put data on overflow page. */
5589 DPRINTF("data size is %zu, node would be %zu, put data on overflow page",
5590 data->mv_size, node_size+data->mv_size);
5591 node_size += sizeof(pgno_t);
5592 if ((rc = mdb_page_new(mc, P_OVERFLOW, ovpages, &ofp)))
5594 DPRINTF("allocated overflow page %zu", ofp->mp_pgno);
5597 node_size += data->mv_size;
5600 node_size += node_size & 1;
5602 if (node_size + sizeof(indx_t) > SIZELEFT(mp)) {
5603 DPRINTF("not enough room in page %zu, got %u ptrs",
5604 mp->mp_pgno, NUMKEYS(mp));
5605 DPRINTF("upper - lower = %u - %u = %u", mp->mp_upper, mp->mp_lower,
5606 mp->mp_upper - mp->mp_lower);
5607 DPRINTF("node size = %zu", node_size);
5608 return MDB_PAGE_FULL;
5611 /* Move higher pointers up one slot. */
5612 for (i = NUMKEYS(mp); i > indx; i--)
5613 mp->mp_ptrs[i] = mp->mp_ptrs[i - 1];
5615 /* Adjust free space offsets. */
5616 ofs = mp->mp_upper - node_size;
5617 assert(ofs >= mp->mp_lower + sizeof(indx_t));
5618 mp->mp_ptrs[indx] = ofs;
5620 mp->mp_lower += sizeof(indx_t);
5622 /* Write the node data. */
5623 node = NODEPTR(mp, indx);
5624 node->mn_ksize = (key == NULL) ? 0 : key->mv_size;
5625 node->mn_flags = flags;
5627 SETDSZ(node,data->mv_size);
5632 memcpy(NODEKEY(node), key->mv_data, key->mv_size);
5637 if (F_ISSET(flags, F_BIGDATA))
5638 memcpy(node->mn_data + key->mv_size, data->mv_data,
5640 else if (F_ISSET(flags, MDB_RESERVE))
5641 data->mv_data = node->mn_data + key->mv_size;
5643 memcpy(node->mn_data + key->mv_size, data->mv_data,
5646 memcpy(node->mn_data + key->mv_size, &ofp->mp_pgno,
5648 if (F_ISSET(flags, MDB_RESERVE))
5649 data->mv_data = METADATA(ofp);
5651 memcpy(METADATA(ofp), data->mv_data, data->mv_size);
5658 /** Delete the specified node from a page.
5659 * @param[in] mp The page to operate on.
5660 * @param[in] indx The index of the node to delete.
5661 * @param[in] ksize The size of a node. Only used if the page is
5662 * part of a #MDB_DUPFIXED database.
5665 mdb_node_del(MDB_page *mp, indx_t indx, int ksize)
5668 indx_t i, j, numkeys, ptr;
5675 COPY_PGNO(pgno, mp->mp_pgno);
5676 DPRINTF("delete node %u on %s page %zu", indx,
5677 IS_LEAF(mp) ? "leaf" : "branch", pgno);
5680 assert(indx < NUMKEYS(mp));
5683 int x = NUMKEYS(mp) - 1 - indx;
5684 base = LEAF2KEY(mp, indx, ksize);
5686 memmove(base, base + ksize, x * ksize);
5687 mp->mp_lower -= sizeof(indx_t);
5688 mp->mp_upper += ksize - sizeof(indx_t);
5692 node = NODEPTR(mp, indx);
5693 sz = NODESIZE + node->mn_ksize;
5695 if (F_ISSET(node->mn_flags, F_BIGDATA))
5696 sz += sizeof(pgno_t);
5698 sz += NODEDSZ(node);
5702 ptr = mp->mp_ptrs[indx];
5703 numkeys = NUMKEYS(mp);
5704 for (i = j = 0; i < numkeys; i++) {
5706 mp->mp_ptrs[j] = mp->mp_ptrs[i];
5707 if (mp->mp_ptrs[i] < ptr)
5708 mp->mp_ptrs[j] += sz;
5713 base = (char *)mp + mp->mp_upper;
5714 memmove(base + sz, base, ptr - mp->mp_upper);
5716 mp->mp_lower -= sizeof(indx_t);
5720 /** Compact the main page after deleting a node on a subpage.
5721 * @param[in] mp The main page to operate on.
5722 * @param[in] indx The index of the subpage on the main page.
5725 mdb_node_shrink(MDB_page *mp, indx_t indx)
5732 indx_t i, numkeys, ptr;
5734 node = NODEPTR(mp, indx);
5735 sp = (MDB_page *)NODEDATA(node);
5736 osize = NODEDSZ(node);
5738 delta = sp->mp_upper - sp->mp_lower;
5739 SETDSZ(node, osize - delta);
5740 xp = (MDB_page *)((char *)sp + delta);
5742 /* shift subpage upward */
5744 nsize = NUMKEYS(sp) * sp->mp_pad;
5745 memmove(METADATA(xp), METADATA(sp), nsize);
5748 nsize = osize - sp->mp_upper;
5749 numkeys = NUMKEYS(sp);
5750 for (i=numkeys-1; i>=0; i--)
5751 xp->mp_ptrs[i] = sp->mp_ptrs[i] - delta;
5753 xp->mp_upper = sp->mp_lower;
5754 xp->mp_lower = sp->mp_lower;
5755 xp->mp_flags = sp->mp_flags;
5756 xp->mp_pad = sp->mp_pad;
5757 COPY_PGNO(xp->mp_pgno, mp->mp_pgno);
5759 /* shift lower nodes upward */
5760 ptr = mp->mp_ptrs[indx];
5761 numkeys = NUMKEYS(mp);
5762 for (i = 0; i < numkeys; i++) {
5763 if (mp->mp_ptrs[i] <= ptr)
5764 mp->mp_ptrs[i] += delta;
5767 base = (char *)mp + mp->mp_upper;
5768 memmove(base + delta, base, ptr - mp->mp_upper + NODESIZE + NODEKSZ(node));
5769 mp->mp_upper += delta;
5772 /** Initial setup of a sorted-dups cursor.
5773 * Sorted duplicates are implemented as a sub-database for the given key.
5774 * The duplicate data items are actually keys of the sub-database.
5775 * Operations on the duplicate data items are performed using a sub-cursor
5776 * initialized when the sub-database is first accessed. This function does
5777 * the preliminary setup of the sub-cursor, filling in the fields that
5778 * depend only on the parent DB.
5779 * @param[in] mc The main cursor whose sorted-dups cursor is to be initialized.
5782 mdb_xcursor_init0(MDB_cursor *mc)
5784 MDB_xcursor *mx = mc->mc_xcursor;
5786 mx->mx_cursor.mc_xcursor = NULL;
5787 mx->mx_cursor.mc_txn = mc->mc_txn;
5788 mx->mx_cursor.mc_db = &mx->mx_db;
5789 mx->mx_cursor.mc_dbx = &mx->mx_dbx;
5790 mx->mx_cursor.mc_dbi = mc->mc_dbi+1;
5791 mx->mx_cursor.mc_dbflag = &mx->mx_dbflag;
5792 mx->mx_cursor.mc_snum = 0;
5793 mx->mx_cursor.mc_top = 0;
5794 mx->mx_cursor.mc_flags = C_SUB;
5795 mx->mx_dbx.md_cmp = mc->mc_dbx->md_dcmp;
5796 mx->mx_dbx.md_dcmp = NULL;
5797 mx->mx_dbx.md_rel = mc->mc_dbx->md_rel;
5800 /** Final setup of a sorted-dups cursor.
5801 * Sets up the fields that depend on the data from the main cursor.
5802 * @param[in] mc The main cursor whose sorted-dups cursor is to be initialized.
5803 * @param[in] node The data containing the #MDB_db record for the
5804 * sorted-dup database.
5807 mdb_xcursor_init1(MDB_cursor *mc, MDB_node *node)
5809 MDB_xcursor *mx = mc->mc_xcursor;
5811 if (node->mn_flags & F_SUBDATA) {
5812 memcpy(&mx->mx_db, NODEDATA(node), sizeof(MDB_db));
5813 mx->mx_cursor.mc_pg[0] = 0;
5814 mx->mx_cursor.mc_snum = 0;
5815 mx->mx_cursor.mc_flags = C_SUB;
5817 MDB_page *fp = NODEDATA(node);
5818 mx->mx_db.md_pad = mc->mc_pg[mc->mc_top]->mp_pad;
5819 mx->mx_db.md_flags = 0;
5820 mx->mx_db.md_depth = 1;
5821 mx->mx_db.md_branch_pages = 0;
5822 mx->mx_db.md_leaf_pages = 1;
5823 mx->mx_db.md_overflow_pages = 0;
5824 mx->mx_db.md_entries = NUMKEYS(fp);
5825 COPY_PGNO(mx->mx_db.md_root, fp->mp_pgno);
5826 mx->mx_cursor.mc_snum = 1;
5827 mx->mx_cursor.mc_flags = C_INITIALIZED|C_SUB;
5828 mx->mx_cursor.mc_top = 0;
5829 mx->mx_cursor.mc_pg[0] = fp;
5830 mx->mx_cursor.mc_ki[0] = 0;
5831 if (mc->mc_db->md_flags & MDB_DUPFIXED) {
5832 mx->mx_db.md_flags = MDB_DUPFIXED;
5833 mx->mx_db.md_pad = fp->mp_pad;
5834 if (mc->mc_db->md_flags & MDB_INTEGERDUP)
5835 mx->mx_db.md_flags |= MDB_INTEGERKEY;
5838 DPRINTF("Sub-db %u for db %u root page %zu", mx->mx_cursor.mc_dbi, mc->mc_dbi,
5840 mx->mx_dbflag = DB_VALID | (F_ISSET(mc->mc_pg[mc->mc_top]->mp_flags, P_DIRTY) ?
5842 mx->mx_dbx.md_name.mv_data = NODEKEY(node);
5843 mx->mx_dbx.md_name.mv_size = node->mn_ksize;
5844 #if UINT_MAX < SIZE_MAX
5845 if (mx->mx_dbx.md_cmp == mdb_cmp_int && mx->mx_db.md_pad == sizeof(size_t))
5846 #ifdef MISALIGNED_OK
5847 mx->mx_dbx.md_cmp = mdb_cmp_long;
5849 mx->mx_dbx.md_cmp = mdb_cmp_cint;
5854 /** Initialize a cursor for a given transaction and database. */
5856 mdb_cursor_init(MDB_cursor *mc, MDB_txn *txn, MDB_dbi dbi, MDB_xcursor *mx)
5861 mc->mc_db = &txn->mt_dbs[dbi];
5862 mc->mc_dbx = &txn->mt_dbxs[dbi];
5863 mc->mc_dbflag = &txn->mt_dbflags[dbi];
5868 if (txn->mt_dbs[dbi].md_flags & MDB_DUPSORT) {
5870 mc->mc_xcursor = mx;
5871 mdb_xcursor_init0(mc);
5873 mc->mc_xcursor = NULL;
5875 if (*mc->mc_dbflag & DB_STALE) {
5876 mdb_page_search(mc, NULL, MDB_PS_ROOTONLY);
5881 mdb_cursor_open(MDB_txn *txn, MDB_dbi dbi, MDB_cursor **ret)
5884 size_t size = sizeof(MDB_cursor);
5886 if (txn == NULL || ret == NULL || dbi >= txn->mt_numdbs || !(txn->mt_dbflags[dbi] & DB_VALID))
5889 /* Allow read access to the freelist */
5890 if (!dbi && !F_ISSET(txn->mt_flags, MDB_TXN_RDONLY))
5893 if (txn->mt_dbs[dbi].md_flags & MDB_DUPSORT)
5894 size += sizeof(MDB_xcursor);
5896 if ((mc = malloc(size)) != NULL) {
5897 mdb_cursor_init(mc, txn, dbi, (MDB_xcursor *)(mc + 1));
5898 if (txn->mt_cursors) {
5899 mc->mc_next = txn->mt_cursors[dbi];
5900 txn->mt_cursors[dbi] = mc;
5901 mc->mc_flags |= C_UNTRACK;
5903 mc->mc_flags |= C_ALLOCD;
5914 mdb_cursor_renew(MDB_txn *txn, MDB_cursor *mc)
5918 if (txn == NULL || mc == NULL || mc->mc_dbi >= txn->mt_numdbs)
5921 if ((mc->mc_flags & C_UNTRACK) || txn->mt_cursors)
5924 flags = mc->mc_flags;
5926 mdb_cursor_init(mc, txn, mc->mc_dbi, mc->mc_xcursor);
5928 mc->mc_flags |= (flags & C_ALLOCD);
5932 /* Return the count of duplicate data items for the current key */
5934 mdb_cursor_count(MDB_cursor *mc, size_t *countp)
5938 if (mc == NULL || countp == NULL)
5941 if (!(mc->mc_db->md_flags & MDB_DUPSORT))
5944 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
5945 if (!F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5948 if (!(mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED))
5951 *countp = mc->mc_xcursor->mx_db.md_entries;
5957 mdb_cursor_close(MDB_cursor *mc)
5960 /* remove from txn, if tracked */
5961 if ((mc->mc_flags & C_UNTRACK) && mc->mc_txn->mt_cursors) {
5962 MDB_cursor **prev = &mc->mc_txn->mt_cursors[mc->mc_dbi];
5963 while (*prev && *prev != mc) prev = &(*prev)->mc_next;
5965 *prev = mc->mc_next;
5967 if (mc->mc_flags & C_ALLOCD)
5973 mdb_cursor_txn(MDB_cursor *mc)
5975 if (!mc) return NULL;
5980 mdb_cursor_dbi(MDB_cursor *mc)
5986 /** Replace the key for a node with a new key.
5987 * @param[in] mc Cursor pointing to the node to operate on.
5988 * @param[in] key The new key to use.
5989 * @return 0 on success, non-zero on failure.
5992 mdb_update_key(MDB_cursor *mc, MDB_val *key)
5999 indx_t ptr, i, numkeys, indx;
6002 indx = mc->mc_ki[mc->mc_top];
6003 mp = mc->mc_pg[mc->mc_top];
6004 node = NODEPTR(mp, indx);
6005 ptr = mp->mp_ptrs[indx];
6009 char kbuf2[(MDB_MAXKEYSIZE*2+1)];
6010 k2.mv_data = NODEKEY(node);
6011 k2.mv_size = node->mn_ksize;
6012 DPRINTF("update key %u (ofs %u) [%s] to [%s] on page %zu",
6014 mdb_dkey(&k2, kbuf2),
6020 delta0 = delta = key->mv_size - node->mn_ksize;
6022 /* Must be 2-byte aligned. If new key is
6023 * shorter by 1, the shift will be skipped.
6025 delta += (delta & 1);
6027 if (delta > 0 && SIZELEFT(mp) < delta) {
6029 /* not enough space left, do a delete and split */
6030 DPRINTF("Not enough room, delta = %d, splitting...", delta);
6031 pgno = NODEPGNO(node);
6032 mdb_node_del(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], 0);
6033 return mdb_page_split(mc, key, NULL, pgno, MDB_SPLIT_REPLACE);
6036 numkeys = NUMKEYS(mp);
6037 for (i = 0; i < numkeys; i++) {
6038 if (mp->mp_ptrs[i] <= ptr)
6039 mp->mp_ptrs[i] -= delta;
6042 base = (char *)mp + mp->mp_upper;
6043 len = ptr - mp->mp_upper + NODESIZE;
6044 memmove(base - delta, base, len);
6045 mp->mp_upper -= delta;
6047 node = NODEPTR(mp, indx);
6050 /* But even if no shift was needed, update ksize */
6052 node->mn_ksize = key->mv_size;
6055 memcpy(NODEKEY(node), key->mv_data, key->mv_size);
6061 mdb_cursor_copy(const MDB_cursor *csrc, MDB_cursor *cdst);
6063 /** Move a node from csrc to cdst.
6066 mdb_node_move(MDB_cursor *csrc, MDB_cursor *cdst)
6073 unsigned short flags;
6077 /* Mark src and dst as dirty. */
6078 if ((rc = mdb_page_touch(csrc)) ||
6079 (rc = mdb_page_touch(cdst)))
6082 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
6083 srcnode = NODEPTR(csrc->mc_pg[csrc->mc_top], 0); /* fake */
6084 key.mv_size = csrc->mc_db->md_pad;
6085 key.mv_data = LEAF2KEY(csrc->mc_pg[csrc->mc_top], csrc->mc_ki[csrc->mc_top], key.mv_size);
6087 data.mv_data = NULL;
6091 srcnode = NODEPTR(csrc->mc_pg[csrc->mc_top], csrc->mc_ki[csrc->mc_top]);
6092 assert(!((long)srcnode&1));
6093 srcpg = NODEPGNO(srcnode);
6094 flags = srcnode->mn_flags;
6095 if (csrc->mc_ki[csrc->mc_top] == 0 && IS_BRANCH(csrc->mc_pg[csrc->mc_top])) {
6096 unsigned int snum = csrc->mc_snum;
6098 /* must find the lowest key below src */
6099 mdb_page_search_lowest(csrc);
6100 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
6101 key.mv_size = csrc->mc_db->md_pad;
6102 key.mv_data = LEAF2KEY(csrc->mc_pg[csrc->mc_top], 0, key.mv_size);
6104 s2 = NODEPTR(csrc->mc_pg[csrc->mc_top], 0);
6105 key.mv_size = NODEKSZ(s2);
6106 key.mv_data = NODEKEY(s2);
6108 csrc->mc_snum = snum--;
6109 csrc->mc_top = snum;
6111 key.mv_size = NODEKSZ(srcnode);
6112 key.mv_data = NODEKEY(srcnode);
6114 data.mv_size = NODEDSZ(srcnode);
6115 data.mv_data = NODEDATA(srcnode);
6117 if (IS_BRANCH(cdst->mc_pg[cdst->mc_top]) && cdst->mc_ki[cdst->mc_top] == 0) {
6118 unsigned int snum = cdst->mc_snum;
6121 /* must find the lowest key below dst */
6122 mdb_page_search_lowest(cdst);
6123 if (IS_LEAF2(cdst->mc_pg[cdst->mc_top])) {
6124 bkey.mv_size = cdst->mc_db->md_pad;
6125 bkey.mv_data = LEAF2KEY(cdst->mc_pg[cdst->mc_top], 0, bkey.mv_size);
6127 s2 = NODEPTR(cdst->mc_pg[cdst->mc_top], 0);
6128 bkey.mv_size = NODEKSZ(s2);
6129 bkey.mv_data = NODEKEY(s2);
6131 cdst->mc_snum = snum--;
6132 cdst->mc_top = snum;
6133 mdb_cursor_copy(cdst, &mn);
6135 rc = mdb_update_key(&mn, &bkey);
6140 DPRINTF("moving %s node %u [%s] on page %zu to node %u on page %zu",
6141 IS_LEAF(csrc->mc_pg[csrc->mc_top]) ? "leaf" : "branch",
6142 csrc->mc_ki[csrc->mc_top],
6144 csrc->mc_pg[csrc->mc_top]->mp_pgno,
6145 cdst->mc_ki[cdst->mc_top], cdst->mc_pg[cdst->mc_top]->mp_pgno);
6147 /* Add the node to the destination page.
6149 rc = mdb_node_add(cdst, cdst->mc_ki[cdst->mc_top], &key, &data, srcpg, flags);
6150 if (rc != MDB_SUCCESS)
6153 /* Delete the node from the source page.
6155 mdb_node_del(csrc->mc_pg[csrc->mc_top], csrc->mc_ki[csrc->mc_top], key.mv_size);
6158 /* Adjust other cursors pointing to mp */
6159 MDB_cursor *m2, *m3;
6160 MDB_dbi dbi = csrc->mc_dbi;
6161 MDB_page *mp = csrc->mc_pg[csrc->mc_top];
6163 if (csrc->mc_flags & C_SUB)
6166 for (m2 = csrc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
6167 if (csrc->mc_flags & C_SUB)
6168 m3 = &m2->mc_xcursor->mx_cursor;
6171 if (m3 == csrc) continue;
6172 if (m3->mc_pg[csrc->mc_top] == mp && m3->mc_ki[csrc->mc_top] ==
6173 csrc->mc_ki[csrc->mc_top]) {
6174 m3->mc_pg[csrc->mc_top] = cdst->mc_pg[cdst->mc_top];
6175 m3->mc_ki[csrc->mc_top] = cdst->mc_ki[cdst->mc_top];
6180 /* Update the parent separators.
6182 if (csrc->mc_ki[csrc->mc_top] == 0) {
6183 if (csrc->mc_ki[csrc->mc_top-1] != 0) {
6184 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
6185 key.mv_data = LEAF2KEY(csrc->mc_pg[csrc->mc_top], 0, key.mv_size);
6187 srcnode = NODEPTR(csrc->mc_pg[csrc->mc_top], 0);
6188 key.mv_size = NODEKSZ(srcnode);
6189 key.mv_data = NODEKEY(srcnode);
6191 DPRINTF("update separator for source page %zu to [%s]",
6192 csrc->mc_pg[csrc->mc_top]->mp_pgno, DKEY(&key));
6193 mdb_cursor_copy(csrc, &mn);
6196 if ((rc = mdb_update_key(&mn, &key)) != MDB_SUCCESS)
6199 if (IS_BRANCH(csrc->mc_pg[csrc->mc_top])) {
6201 indx_t ix = csrc->mc_ki[csrc->mc_top];
6202 nullkey.mv_size = 0;
6203 csrc->mc_ki[csrc->mc_top] = 0;
6204 rc = mdb_update_key(csrc, &nullkey);
6205 csrc->mc_ki[csrc->mc_top] = ix;
6206 assert(rc == MDB_SUCCESS);
6210 if (cdst->mc_ki[cdst->mc_top] == 0) {
6211 if (cdst->mc_ki[cdst->mc_top-1] != 0) {
6212 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
6213 key.mv_data = LEAF2KEY(cdst->mc_pg[cdst->mc_top], 0, key.mv_size);
6215 srcnode = NODEPTR(cdst->mc_pg[cdst->mc_top], 0);
6216 key.mv_size = NODEKSZ(srcnode);
6217 key.mv_data = NODEKEY(srcnode);
6219 DPRINTF("update separator for destination page %zu to [%s]",
6220 cdst->mc_pg[cdst->mc_top]->mp_pgno, DKEY(&key));
6221 mdb_cursor_copy(cdst, &mn);
6224 if ((rc = mdb_update_key(&mn, &key)) != MDB_SUCCESS)
6227 if (IS_BRANCH(cdst->mc_pg[cdst->mc_top])) {
6229 indx_t ix = cdst->mc_ki[cdst->mc_top];
6230 nullkey.mv_size = 0;
6231 cdst->mc_ki[cdst->mc_top] = 0;
6232 rc = mdb_update_key(cdst, &nullkey);
6233 cdst->mc_ki[cdst->mc_top] = ix;
6234 assert(rc == MDB_SUCCESS);
6241 /** Merge one page into another.
6242 * The nodes from the page pointed to by \b csrc will
6243 * be copied to the page pointed to by \b cdst and then
6244 * the \b csrc page will be freed.
6245 * @param[in] csrc Cursor pointing to the source page.
6246 * @param[in] cdst Cursor pointing to the destination page.
6249 mdb_page_merge(MDB_cursor *csrc, MDB_cursor *cdst)
6257 DPRINTF("merging page %zu into %zu", csrc->mc_pg[csrc->mc_top]->mp_pgno,
6258 cdst->mc_pg[cdst->mc_top]->mp_pgno);
6260 assert(csrc->mc_snum > 1); /* can't merge root page */
6261 assert(cdst->mc_snum > 1);
6263 /* Mark dst as dirty. */
6264 if ((rc = mdb_page_touch(cdst)))
6267 /* Move all nodes from src to dst.
6269 j = nkeys = NUMKEYS(cdst->mc_pg[cdst->mc_top]);
6270 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
6271 key.mv_size = csrc->mc_db->md_pad;
6272 key.mv_data = METADATA(csrc->mc_pg[csrc->mc_top]);
6273 for (i = 0; i < NUMKEYS(csrc->mc_pg[csrc->mc_top]); i++, j++) {
6274 rc = mdb_node_add(cdst, j, &key, NULL, 0, 0);
6275 if (rc != MDB_SUCCESS)
6277 key.mv_data = (char *)key.mv_data + key.mv_size;
6280 for (i = 0; i < NUMKEYS(csrc->mc_pg[csrc->mc_top]); i++, j++) {
6281 srcnode = NODEPTR(csrc->mc_pg[csrc->mc_top], i);
6282 if (i == 0 && IS_BRANCH(csrc->mc_pg[csrc->mc_top])) {
6283 unsigned int snum = csrc->mc_snum;
6285 /* must find the lowest key below src */
6286 mdb_page_search_lowest(csrc);
6287 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
6288 key.mv_size = csrc->mc_db->md_pad;
6289 key.mv_data = LEAF2KEY(csrc->mc_pg[csrc->mc_top], 0, key.mv_size);
6291 s2 = NODEPTR(csrc->mc_pg[csrc->mc_top], 0);
6292 key.mv_size = NODEKSZ(s2);
6293 key.mv_data = NODEKEY(s2);
6295 csrc->mc_snum = snum--;
6296 csrc->mc_top = snum;
6298 key.mv_size = srcnode->mn_ksize;
6299 key.mv_data = NODEKEY(srcnode);
6302 data.mv_size = NODEDSZ(srcnode);
6303 data.mv_data = NODEDATA(srcnode);
6304 rc = mdb_node_add(cdst, j, &key, &data, NODEPGNO(srcnode), srcnode->mn_flags);
6305 if (rc != MDB_SUCCESS)
6310 DPRINTF("dst page %zu now has %u keys (%.1f%% filled)",
6311 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);
6313 /* Unlink the src page from parent and add to free list.
6315 mdb_node_del(csrc->mc_pg[csrc->mc_top-1], csrc->mc_ki[csrc->mc_top-1], 0);
6316 if (csrc->mc_ki[csrc->mc_top-1] == 0) {
6319 rc = mdb_update_key(csrc, &key);
6325 rc = mdb_midl_append(&csrc->mc_txn->mt_free_pgs,
6326 csrc->mc_pg[csrc->mc_top]->mp_pgno);
6329 if (IS_LEAF(csrc->mc_pg[csrc->mc_top]))
6330 csrc->mc_db->md_leaf_pages--;
6332 csrc->mc_db->md_branch_pages--;
6334 /* Adjust other cursors pointing to mp */
6335 MDB_cursor *m2, *m3;
6336 MDB_dbi dbi = csrc->mc_dbi;
6337 MDB_page *mp = cdst->mc_pg[cdst->mc_top];
6339 if (csrc->mc_flags & C_SUB)
6342 for (m2 = csrc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
6343 if (csrc->mc_flags & C_SUB)
6344 m3 = &m2->mc_xcursor->mx_cursor;
6347 if (m3 == csrc) continue;
6348 if (m3->mc_snum < csrc->mc_snum) continue;
6349 if (m3->mc_pg[csrc->mc_top] == csrc->mc_pg[csrc->mc_top]) {
6350 m3->mc_pg[csrc->mc_top] = mp;
6351 m3->mc_ki[csrc->mc_top] += nkeys;
6355 mdb_cursor_pop(csrc);
6357 return mdb_rebalance(csrc);
6360 /** Copy the contents of a cursor.
6361 * @param[in] csrc The cursor to copy from.
6362 * @param[out] cdst The cursor to copy to.
6365 mdb_cursor_copy(const MDB_cursor *csrc, MDB_cursor *cdst)
6369 cdst->mc_txn = csrc->mc_txn;
6370 cdst->mc_dbi = csrc->mc_dbi;
6371 cdst->mc_db = csrc->mc_db;
6372 cdst->mc_dbx = csrc->mc_dbx;
6373 cdst->mc_snum = csrc->mc_snum;
6374 cdst->mc_top = csrc->mc_top;
6375 cdst->mc_flags = csrc->mc_flags;
6377 for (i=0; i<csrc->mc_snum; i++) {
6378 cdst->mc_pg[i] = csrc->mc_pg[i];
6379 cdst->mc_ki[i] = csrc->mc_ki[i];
6383 /** Rebalance the tree after a delete operation.
6384 * @param[in] mc Cursor pointing to the page where rebalancing
6386 * @return 0 on success, non-zero on failure.
6389 mdb_rebalance(MDB_cursor *mc)
6393 unsigned int ptop, minkeys;
6396 minkeys = 1 + (IS_BRANCH(mc->mc_pg[mc->mc_top]));
6400 COPY_PGNO(pgno, mc->mc_pg[mc->mc_top]->mp_pgno);
6401 DPRINTF("rebalancing %s page %zu (has %u keys, %.1f%% full)",
6402 IS_LEAF(mc->mc_pg[mc->mc_top]) ? "leaf" : "branch",
6403 pgno, NUMKEYS(mc->mc_pg[mc->mc_top]), (float)PAGEFILL(mc->mc_txn->mt_env, mc->mc_pg[mc->mc_top]) / 10);
6407 if (PAGEFILL(mc->mc_txn->mt_env, mc->mc_pg[mc->mc_top]) >= FILL_THRESHOLD &&
6408 NUMKEYS(mc->mc_pg[mc->mc_top]) >= minkeys) {
6411 COPY_PGNO(pgno, mc->mc_pg[mc->mc_top]->mp_pgno);
6412 DPRINTF("no need to rebalance page %zu, above fill threshold",
6418 if (mc->mc_snum < 2) {
6419 MDB_page *mp = mc->mc_pg[0];
6421 DPUTS("Can't rebalance a subpage, ignoring");
6424 if (NUMKEYS(mp) == 0) {
6425 DPUTS("tree is completely empty");
6426 mc->mc_db->md_root = P_INVALID;
6427 mc->mc_db->md_depth = 0;
6428 mc->mc_db->md_leaf_pages = 0;
6429 rc = mdb_midl_append(&mc->mc_txn->mt_free_pgs, mp->mp_pgno);
6432 /* Adjust cursors pointing to mp */
6436 MDB_cursor *m2, *m3;
6437 MDB_dbi dbi = mc->mc_dbi;
6439 if (mc->mc_flags & C_SUB)
6442 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
6443 if (mc->mc_flags & C_SUB)
6444 m3 = &m2->mc_xcursor->mx_cursor;
6447 if (m3->mc_snum < mc->mc_snum) continue;
6448 if (m3->mc_pg[0] == mp) {
6454 } else if (IS_BRANCH(mp) && NUMKEYS(mp) == 1) {
6455 DPUTS("collapsing root page!");
6456 rc = mdb_midl_append(&mc->mc_txn->mt_free_pgs, mp->mp_pgno);
6459 mc->mc_db->md_root = NODEPGNO(NODEPTR(mp, 0));
6460 rc = mdb_page_get(mc->mc_txn,mc->mc_db->md_root,&mc->mc_pg[0],NULL);
6463 mc->mc_db->md_depth--;
6464 mc->mc_db->md_branch_pages--;
6466 /* Adjust other cursors pointing to mp */
6467 MDB_cursor *m2, *m3;
6468 MDB_dbi dbi = mc->mc_dbi;
6470 if (mc->mc_flags & C_SUB)
6473 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
6474 if (mc->mc_flags & C_SUB)
6475 m3 = &m2->mc_xcursor->mx_cursor;
6478 if (m3 == mc || m3->mc_snum < mc->mc_snum) continue;
6479 if (m3->mc_pg[0] == mp) {
6480 m3->mc_pg[0] = mc->mc_pg[0];
6487 DPUTS("root page doesn't need rebalancing");
6491 /* The parent (branch page) must have at least 2 pointers,
6492 * otherwise the tree is invalid.
6494 ptop = mc->mc_top-1;
6495 assert(NUMKEYS(mc->mc_pg[ptop]) > 1);
6497 /* Leaf page fill factor is below the threshold.
6498 * Try to move keys from left or right neighbor, or
6499 * merge with a neighbor page.
6504 mdb_cursor_copy(mc, &mn);
6505 mn.mc_xcursor = NULL;
6507 if (mc->mc_ki[ptop] == 0) {
6508 /* We're the leftmost leaf in our parent.
6510 DPUTS("reading right neighbor");
6512 node = NODEPTR(mc->mc_pg[ptop], mn.mc_ki[ptop]);
6513 rc = mdb_page_get(mc->mc_txn,NODEPGNO(node),&mn.mc_pg[mn.mc_top],NULL);
6516 mn.mc_ki[mn.mc_top] = 0;
6517 mc->mc_ki[mc->mc_top] = NUMKEYS(mc->mc_pg[mc->mc_top]);
6519 /* There is at least one neighbor to the left.
6521 DPUTS("reading left neighbor");
6523 node = NODEPTR(mc->mc_pg[ptop], mn.mc_ki[ptop]);
6524 rc = mdb_page_get(mc->mc_txn,NODEPGNO(node),&mn.mc_pg[mn.mc_top],NULL);
6527 mn.mc_ki[mn.mc_top] = NUMKEYS(mn.mc_pg[mn.mc_top]) - 1;
6528 mc->mc_ki[mc->mc_top] = 0;
6531 DPRINTF("found neighbor page %zu (%u keys, %.1f%% full)",
6532 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);
6534 /* If the neighbor page is above threshold and has enough keys,
6535 * move one key from it. Otherwise we should try to merge them.
6536 * (A branch page must never have less than 2 keys.)
6538 minkeys = 1 + (IS_BRANCH(mn.mc_pg[mn.mc_top]));
6539 if (PAGEFILL(mc->mc_txn->mt_env, mn.mc_pg[mn.mc_top]) >= FILL_THRESHOLD && NUMKEYS(mn.mc_pg[mn.mc_top]) > minkeys)
6540 return mdb_node_move(&mn, mc);
6542 if (mc->mc_ki[ptop] == 0)
6543 rc = mdb_page_merge(&mn, mc);
6545 rc = mdb_page_merge(mc, &mn);
6546 mc->mc_flags &= ~C_INITIALIZED;
6551 /** Complete a delete operation started by #mdb_cursor_del(). */
6553 mdb_cursor_del0(MDB_cursor *mc, MDB_node *leaf)
6557 /* add overflow pages to free list */
6558 if (!IS_LEAF2(mc->mc_pg[mc->mc_top]) && F_ISSET(leaf->mn_flags, F_BIGDATA)) {
6562 memcpy(&pg, NODEDATA(leaf), sizeof(pg));
6563 if ((rc = mdb_page_get(mc->mc_txn, pg, &omp, NULL)) ||
6564 (rc = mdb_ovpage_free(mc, omp)))
6567 mdb_node_del(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], mc->mc_db->md_pad);
6568 mc->mc_db->md_entries--;
6569 rc = mdb_rebalance(mc);
6570 if (rc != MDB_SUCCESS)
6571 mc->mc_txn->mt_flags |= MDB_TXN_ERROR;
6572 /* if mc points past last node in page, invalidate */
6573 else if (mc->mc_ki[mc->mc_top] >= NUMKEYS(mc->mc_pg[mc->mc_top]))
6574 mc->mc_flags &= ~C_INITIALIZED;
6580 mdb_del(MDB_txn *txn, MDB_dbi dbi,
6581 MDB_val *key, MDB_val *data)
6586 MDB_val rdata, *xdata;
6590 assert(key != NULL);
6592 DPRINTF("====> delete db %u key [%s]", dbi, DKEY(key));
6594 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs || !(txn->mt_dbflags[dbi] & DB_VALID))
6597 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY)) {
6601 if (key->mv_size == 0 || key->mv_size > MDB_MAXKEYSIZE) {
6605 mdb_cursor_init(&mc, txn, dbi, &mx);
6616 rc = mdb_cursor_set(&mc, key, xdata, op, &exact);
6618 /* let mdb_page_split know about this cursor if needed:
6619 * delete will trigger a rebalance; if it needs to move
6620 * a node from one page to another, it will have to
6621 * update the parent's separator key(s). If the new sepkey
6622 * is larger than the current one, the parent page may
6623 * run out of space, triggering a split. We need this
6624 * cursor to be consistent until the end of the rebalance.
6626 mc.mc_next = txn->mt_cursors[dbi];
6627 txn->mt_cursors[dbi] = &mc;
6628 rc = mdb_cursor_del(&mc, data ? 0 : MDB_NODUPDATA);
6629 txn->mt_cursors[dbi] = mc.mc_next;
6634 /** Split a page and insert a new node.
6635 * @param[in,out] mc Cursor pointing to the page and desired insertion index.
6636 * The cursor will be updated to point to the actual page and index where
6637 * the node got inserted after the split.
6638 * @param[in] newkey The key for the newly inserted node.
6639 * @param[in] newdata The data for the newly inserted node.
6640 * @param[in] newpgno The page number, if the new node is a branch node.
6641 * @param[in] nflags The #NODE_ADD_FLAGS for the new node.
6642 * @return 0 on success, non-zero on failure.
6645 mdb_page_split(MDB_cursor *mc, MDB_val *newkey, MDB_val *newdata, pgno_t newpgno,
6646 unsigned int nflags)
6649 int rc = MDB_SUCCESS, ins_new = 0, new_root = 0, newpos = 1, did_split = 0;
6652 unsigned int i, j, split_indx, nkeys, pmax;
6654 MDB_val sepkey, rkey, xdata, *rdata = &xdata;
6656 MDB_page *mp, *rp, *pp;
6661 mp = mc->mc_pg[mc->mc_top];
6662 newindx = mc->mc_ki[mc->mc_top];
6664 DPRINTF("-----> splitting %s page %zu and adding [%s] at index %i",
6665 IS_LEAF(mp) ? "leaf" : "branch", mp->mp_pgno,
6666 DKEY(newkey), mc->mc_ki[mc->mc_top]);
6668 /* Create a right sibling. */
6669 if ((rc = mdb_page_new(mc, mp->mp_flags, 1, &rp)))
6671 DPRINTF("new right sibling: page %zu", rp->mp_pgno);
6673 if (mc->mc_snum < 2) {
6674 if ((rc = mdb_page_new(mc, P_BRANCH, 1, &pp)))
6676 /* shift current top to make room for new parent */
6677 mc->mc_pg[1] = mc->mc_pg[0];
6678 mc->mc_ki[1] = mc->mc_ki[0];
6681 mc->mc_db->md_root = pp->mp_pgno;
6682 DPRINTF("root split! new root = %zu", pp->mp_pgno);
6683 mc->mc_db->md_depth++;
6686 /* Add left (implicit) pointer. */
6687 if ((rc = mdb_node_add(mc, 0, NULL, NULL, mp->mp_pgno, 0)) != MDB_SUCCESS) {
6688 /* undo the pre-push */
6689 mc->mc_pg[0] = mc->mc_pg[1];
6690 mc->mc_ki[0] = mc->mc_ki[1];
6691 mc->mc_db->md_root = mp->mp_pgno;
6692 mc->mc_db->md_depth--;
6699 ptop = mc->mc_top-1;
6700 DPRINTF("parent branch page is %zu", mc->mc_pg[ptop]->mp_pgno);
6703 mc->mc_flags |= C_SPLITTING;
6704 mdb_cursor_copy(mc, &mn);
6705 mn.mc_pg[mn.mc_top] = rp;
6706 mn.mc_ki[ptop] = mc->mc_ki[ptop]+1;
6708 if (nflags & MDB_APPEND) {
6709 mn.mc_ki[mn.mc_top] = 0;
6711 split_indx = newindx;
6716 nkeys = NUMKEYS(mp);
6717 split_indx = nkeys / 2;
6718 if (newindx < split_indx)
6724 unsigned int lsize, rsize, ksize;
6725 /* Move half of the keys to the right sibling */
6727 x = mc->mc_ki[mc->mc_top] - split_indx;
6728 ksize = mc->mc_db->md_pad;
6729 split = LEAF2KEY(mp, split_indx, ksize);
6730 rsize = (nkeys - split_indx) * ksize;
6731 lsize = (nkeys - split_indx) * sizeof(indx_t);
6732 mp->mp_lower -= lsize;
6733 rp->mp_lower += lsize;
6734 mp->mp_upper += rsize - lsize;
6735 rp->mp_upper -= rsize - lsize;
6736 sepkey.mv_size = ksize;
6737 if (newindx == split_indx) {
6738 sepkey.mv_data = newkey->mv_data;
6740 sepkey.mv_data = split;
6743 ins = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], ksize);
6744 memcpy(rp->mp_ptrs, split, rsize);
6745 sepkey.mv_data = rp->mp_ptrs;
6746 memmove(ins+ksize, ins, (split_indx - mc->mc_ki[mc->mc_top]) * ksize);
6747 memcpy(ins, newkey->mv_data, ksize);
6748 mp->mp_lower += sizeof(indx_t);
6749 mp->mp_upper -= ksize - sizeof(indx_t);
6752 memcpy(rp->mp_ptrs, split, x * ksize);
6753 ins = LEAF2KEY(rp, x, ksize);
6754 memcpy(ins, newkey->mv_data, ksize);
6755 memcpy(ins+ksize, split + x * ksize, rsize - x * ksize);
6756 rp->mp_lower += sizeof(indx_t);
6757 rp->mp_upper -= ksize - sizeof(indx_t);
6758 mc->mc_ki[mc->mc_top] = x;
6759 mc->mc_pg[mc->mc_top] = rp;
6764 /* For leaf pages, check the split point based on what
6765 * fits where, since otherwise mdb_node_add can fail.
6767 * This check is only needed when the data items are
6768 * relatively large, such that being off by one will
6769 * make the difference between success or failure.
6771 * It's also relevant if a page happens to be laid out
6772 * such that one half of its nodes are all "small" and
6773 * the other half of its nodes are "large." If the new
6774 * item is also "large" and falls on the half with
6775 * "large" nodes, it also may not fit.
6778 unsigned int psize, nsize;
6779 /* Maximum free space in an empty page */
6780 pmax = mc->mc_txn->mt_env->me_psize - PAGEHDRSZ;
6781 nsize = mdb_leaf_size(mc->mc_txn->mt_env, newkey, newdata);
6782 if ((nkeys < 20) || (nsize > pmax/16)) {
6783 if (newindx <= split_indx) {
6786 for (i=0; i<split_indx; i++) {
6787 node = NODEPTR(mp, i);
6788 psize += NODESIZE + NODEKSZ(node) + sizeof(indx_t);
6789 if (F_ISSET(node->mn_flags, F_BIGDATA))
6790 psize += sizeof(pgno_t);
6792 psize += NODEDSZ(node);
6796 split_indx = newindx;
6807 for (i=nkeys-1; i>=split_indx; i--) {
6808 node = NODEPTR(mp, i);
6809 psize += NODESIZE + NODEKSZ(node) + sizeof(indx_t);
6810 if (F_ISSET(node->mn_flags, F_BIGDATA))
6811 psize += sizeof(pgno_t);
6813 psize += NODEDSZ(node);
6817 split_indx = newindx;
6828 /* First find the separating key between the split pages.
6829 * The case where newindx == split_indx is ambiguous; the
6830 * new item could go to the new page or stay on the original
6831 * page. If newpos == 1 it goes to the new page.
6833 if (newindx == split_indx && newpos) {
6834 sepkey.mv_size = newkey->mv_size;
6835 sepkey.mv_data = newkey->mv_data;
6837 node = NODEPTR(mp, split_indx);
6838 sepkey.mv_size = node->mn_ksize;
6839 sepkey.mv_data = NODEKEY(node);
6843 DPRINTF("separator is [%s]", DKEY(&sepkey));
6845 /* Copy separator key to the parent.
6847 if (SIZELEFT(mn.mc_pg[ptop]) < mdb_branch_size(mc->mc_txn->mt_env, &sepkey)) {
6851 rc = mdb_page_split(&mn, &sepkey, NULL, rp->mp_pgno, 0);
6854 if (mn.mc_snum == mc->mc_snum) {
6855 mc->mc_pg[mc->mc_snum] = mc->mc_pg[mc->mc_top];
6856 mc->mc_ki[mc->mc_snum] = mc->mc_ki[mc->mc_top];
6857 mc->mc_pg[mc->mc_top] = mc->mc_pg[ptop];
6858 mc->mc_ki[mc->mc_top] = mc->mc_ki[ptop];
6863 /* Right page might now have changed parent.
6864 * Check if left page also changed parent.
6866 if (mn.mc_pg[ptop] != mc->mc_pg[ptop] &&
6867 mc->mc_ki[ptop] >= NUMKEYS(mc->mc_pg[ptop])) {
6868 for (i=0; i<ptop; i++) {
6869 mc->mc_pg[i] = mn.mc_pg[i];
6870 mc->mc_ki[i] = mn.mc_ki[i];
6872 mc->mc_pg[ptop] = mn.mc_pg[ptop];
6873 mc->mc_ki[ptop] = mn.mc_ki[ptop] - 1;
6877 rc = mdb_node_add(&mn, mn.mc_ki[ptop], &sepkey, NULL, rp->mp_pgno, 0);
6880 mc->mc_flags ^= C_SPLITTING;
6881 if (rc != MDB_SUCCESS) {
6884 if (nflags & MDB_APPEND) {
6885 mc->mc_pg[mc->mc_top] = rp;
6886 mc->mc_ki[mc->mc_top] = 0;
6887 rc = mdb_node_add(mc, 0, newkey, newdata, newpgno, nflags);
6890 for (i=0; i<mc->mc_top; i++)
6891 mc->mc_ki[i] = mn.mc_ki[i];
6898 /* Move half of the keys to the right sibling. */
6900 /* grab a page to hold a temporary copy */
6901 copy = mdb_page_malloc(mc->mc_txn, 1);
6905 copy->mp_pgno = mp->mp_pgno;
6906 copy->mp_flags = mp->mp_flags;
6907 copy->mp_lower = PAGEHDRSZ;
6908 copy->mp_upper = mc->mc_txn->mt_env->me_psize;
6909 mc->mc_pg[mc->mc_top] = copy;
6910 for (i = j = 0; i <= nkeys; j++) {
6911 if (i == split_indx) {
6912 /* Insert in right sibling. */
6913 /* Reset insert index for right sibling. */
6914 if (i != newindx || (newpos ^ ins_new)) {
6916 mc->mc_pg[mc->mc_top] = rp;
6920 if (i == newindx && !ins_new) {
6921 /* Insert the original entry that caused the split. */
6922 rkey.mv_data = newkey->mv_data;
6923 rkey.mv_size = newkey->mv_size;
6932 /* Update index for the new key. */
6933 mc->mc_ki[mc->mc_top] = j;
6934 } else if (i == nkeys) {
6937 node = NODEPTR(mp, i);
6938 rkey.mv_data = NODEKEY(node);
6939 rkey.mv_size = node->mn_ksize;
6941 xdata.mv_data = NODEDATA(node);
6942 xdata.mv_size = NODEDSZ(node);
6945 pgno = NODEPGNO(node);
6946 flags = node->mn_flags;
6951 if (!IS_LEAF(mp) && j == 0) {
6952 /* First branch index doesn't need key data. */
6956 rc = mdb_node_add(mc, j, &rkey, rdata, pgno, flags);
6960 nkeys = NUMKEYS(copy);
6961 for (i=0; i<nkeys; i++)
6962 mp->mp_ptrs[i] = copy->mp_ptrs[i];
6963 mp->mp_lower = copy->mp_lower;
6964 mp->mp_upper = copy->mp_upper;
6965 memcpy(NODEPTR(mp, nkeys-1), NODEPTR(copy, nkeys-1),
6966 mc->mc_txn->mt_env->me_psize - copy->mp_upper);
6968 /* reset back to original page */
6969 if (newindx < split_indx || (!newpos && newindx == split_indx)) {
6970 mc->mc_pg[mc->mc_top] = mp;
6971 if (nflags & MDB_RESERVE) {
6972 node = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
6973 if (!(node->mn_flags & F_BIGDATA))
6974 newdata->mv_data = NODEDATA(node);
6978 /* Make sure mc_ki is still valid.
6980 if (mn.mc_pg[ptop] != mc->mc_pg[ptop] &&
6981 mc->mc_ki[ptop] >= NUMKEYS(mc->mc_pg[ptop])) {
6982 for (i=0; i<ptop; i++) {
6983 mc->mc_pg[i] = mn.mc_pg[i];
6984 mc->mc_ki[i] = mn.mc_ki[i];
6986 mc->mc_pg[ptop] = mn.mc_pg[ptop];
6987 mc->mc_ki[ptop] = mn.mc_ki[ptop] - 1;
6991 /* return tmp page to freelist */
6992 mdb_page_free(mc->mc_txn->mt_env, copy);
6995 /* Adjust other cursors pointing to mp */
6996 MDB_cursor *m2, *m3;
6997 MDB_dbi dbi = mc->mc_dbi;
6998 int fixup = NUMKEYS(mp);
7000 if (mc->mc_flags & C_SUB)
7003 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
7004 if (mc->mc_flags & C_SUB)
7005 m3 = &m2->mc_xcursor->mx_cursor;
7010 if (!(m3->mc_flags & C_INITIALIZED))
7012 if (m3->mc_flags & C_SPLITTING)
7017 for (k=m3->mc_top; k>=0; k--) {
7018 m3->mc_ki[k+1] = m3->mc_ki[k];
7019 m3->mc_pg[k+1] = m3->mc_pg[k];
7021 if (m3->mc_ki[0] >= split_indx) {
7026 m3->mc_pg[0] = mc->mc_pg[0];
7030 if (m3->mc_pg[mc->mc_top] == mp) {
7031 if (m3->mc_ki[mc->mc_top] >= newindx && !(nflags & MDB_SPLIT_REPLACE))
7032 m3->mc_ki[mc->mc_top]++;
7033 if (m3->mc_ki[mc->mc_top] >= fixup) {
7034 m3->mc_pg[mc->mc_top] = rp;
7035 m3->mc_ki[mc->mc_top] -= fixup;
7036 m3->mc_ki[ptop] = mn.mc_ki[ptop];
7038 } else if (!did_split && m3->mc_pg[ptop] == mc->mc_pg[ptop] &&
7039 m3->mc_ki[ptop] >= mc->mc_ki[ptop]) {
7048 mdb_put(MDB_txn *txn, MDB_dbi dbi,
7049 MDB_val *key, MDB_val *data, unsigned int flags)
7054 assert(key != NULL);
7055 assert(data != NULL);
7057 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs || !(txn->mt_dbflags[dbi] & DB_VALID))
7060 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY)) {
7064 if (key->mv_size == 0 || key->mv_size > MDB_MAXKEYSIZE) {
7068 if ((flags & (MDB_NOOVERWRITE|MDB_NODUPDATA|MDB_RESERVE|MDB_APPEND|MDB_APPENDDUP)) != flags)
7071 mdb_cursor_init(&mc, txn, dbi, &mx);
7072 return mdb_cursor_put(&mc, key, data, flags);
7076 mdb_env_set_flags(MDB_env *env, unsigned int flag, int onoff)
7078 if ((flag & CHANGEABLE) != flag)
7081 env->me_flags |= flag;
7083 env->me_flags &= ~flag;
7088 mdb_env_get_flags(MDB_env *env, unsigned int *arg)
7093 *arg = env->me_flags;
7098 mdb_env_get_path(MDB_env *env, const char **arg)
7103 *arg = env->me_path;
7107 /** Common code for #mdb_stat() and #mdb_env_stat().
7108 * @param[in] env the environment to operate in.
7109 * @param[in] db the #MDB_db record containing the stats to return.
7110 * @param[out] arg the address of an #MDB_stat structure to receive the stats.
7111 * @return 0, this function always succeeds.
7114 mdb_stat0(MDB_env *env, MDB_db *db, MDB_stat *arg)
7116 arg->ms_psize = env->me_psize;
7117 arg->ms_depth = db->md_depth;
7118 arg->ms_branch_pages = db->md_branch_pages;
7119 arg->ms_leaf_pages = db->md_leaf_pages;
7120 arg->ms_overflow_pages = db->md_overflow_pages;
7121 arg->ms_entries = db->md_entries;
7126 mdb_env_stat(MDB_env *env, MDB_stat *arg)
7130 if (env == NULL || arg == NULL)
7133 toggle = mdb_env_pick_meta(env);
7135 return mdb_stat0(env, &env->me_metas[toggle]->mm_dbs[MAIN_DBI], arg);
7139 mdb_env_info(MDB_env *env, MDB_envinfo *arg)
7143 if (env == NULL || arg == NULL)
7146 toggle = mdb_env_pick_meta(env);
7147 arg->me_mapaddr = (env->me_flags & MDB_FIXEDMAP) ? env->me_map : 0;
7148 arg->me_mapsize = env->me_mapsize;
7149 arg->me_maxreaders = env->me_maxreaders;
7150 arg->me_numreaders = env->me_numreaders;
7151 arg->me_last_pgno = env->me_metas[toggle]->mm_last_pg;
7152 arg->me_last_txnid = env->me_metas[toggle]->mm_txnid;
7156 /** Set the default comparison functions for a database.
7157 * Called immediately after a database is opened to set the defaults.
7158 * The user can then override them with #mdb_set_compare() or
7159 * #mdb_set_dupsort().
7160 * @param[in] txn A transaction handle returned by #mdb_txn_begin()
7161 * @param[in] dbi A database handle returned by #mdb_dbi_open()
7164 mdb_default_cmp(MDB_txn *txn, MDB_dbi dbi)
7166 uint16_t f = txn->mt_dbs[dbi].md_flags;
7168 txn->mt_dbxs[dbi].md_cmp =
7169 (f & MDB_REVERSEKEY) ? mdb_cmp_memnr :
7170 (f & MDB_INTEGERKEY) ? mdb_cmp_cint : mdb_cmp_memn;
7172 txn->mt_dbxs[dbi].md_dcmp =
7173 !(f & MDB_DUPSORT) ? 0 :
7174 ((f & MDB_INTEGERDUP)
7175 ? ((f & MDB_DUPFIXED) ? mdb_cmp_int : mdb_cmp_cint)
7176 : ((f & MDB_REVERSEDUP) ? mdb_cmp_memnr : mdb_cmp_memn));
7179 int mdb_dbi_open(MDB_txn *txn, const char *name, unsigned int flags, MDB_dbi *dbi)
7184 int rc, dbflag, exact;
7185 unsigned int unused = 0;
7188 if (txn->mt_dbxs[FREE_DBI].md_cmp == NULL) {
7189 mdb_default_cmp(txn, FREE_DBI);
7192 if ((flags & VALID_FLAGS) != flags)
7198 if (flags & PERSISTENT_FLAGS) {
7199 uint16_t f2 = flags & PERSISTENT_FLAGS;
7200 /* make sure flag changes get committed */
7201 if ((txn->mt_dbs[MAIN_DBI].md_flags | f2) != txn->mt_dbs[MAIN_DBI].md_flags) {
7202 txn->mt_dbs[MAIN_DBI].md_flags |= f2;
7203 txn->mt_flags |= MDB_TXN_DIRTY;
7206 mdb_default_cmp(txn, MAIN_DBI);
7210 if (txn->mt_dbxs[MAIN_DBI].md_cmp == NULL) {
7211 mdb_default_cmp(txn, MAIN_DBI);
7214 /* Is the DB already open? */
7216 for (i=2; i<txn->mt_numdbs; i++) {
7217 if (!txn->mt_dbxs[i].md_name.mv_size) {
7218 /* Remember this free slot */
7219 if (!unused) unused = i;
7222 if (len == txn->mt_dbxs[i].md_name.mv_size &&
7223 !strncmp(name, txn->mt_dbxs[i].md_name.mv_data, len)) {
7229 /* If no free slot and max hit, fail */
7230 if (!unused && txn->mt_numdbs >= txn->mt_env->me_maxdbs)
7231 return MDB_DBS_FULL;
7233 /* Cannot mix named databases with some mainDB flags */
7234 if (txn->mt_dbs[MAIN_DBI].md_flags & (MDB_DUPSORT|MDB_INTEGERKEY))
7235 return (flags & MDB_CREATE) ? MDB_INCOMPATIBLE : MDB_NOTFOUND;
7237 /* Find the DB info */
7238 dbflag = DB_NEW|DB_VALID;
7241 key.mv_data = (void *)name;
7242 mdb_cursor_init(&mc, txn, MAIN_DBI, NULL);
7243 rc = mdb_cursor_set(&mc, &key, &data, MDB_SET, &exact);
7244 if (rc == MDB_SUCCESS) {
7245 /* make sure this is actually a DB */
7246 MDB_node *node = NODEPTR(mc.mc_pg[mc.mc_top], mc.mc_ki[mc.mc_top]);
7247 if (!(node->mn_flags & F_SUBDATA))
7249 } else if (rc == MDB_NOTFOUND && (flags & MDB_CREATE)) {
7250 /* Create if requested */
7252 data.mv_size = sizeof(MDB_db);
7253 data.mv_data = &dummy;
7254 memset(&dummy, 0, sizeof(dummy));
7255 dummy.md_root = P_INVALID;
7256 dummy.md_flags = flags & PERSISTENT_FLAGS;
7257 rc = mdb_cursor_put(&mc, &key, &data, F_SUBDATA);
7261 /* OK, got info, add to table */
7262 if (rc == MDB_SUCCESS) {
7263 unsigned int slot = unused ? unused : txn->mt_numdbs;
7264 txn->mt_dbxs[slot].md_name.mv_data = strdup(name);
7265 txn->mt_dbxs[slot].md_name.mv_size = len;
7266 txn->mt_dbxs[slot].md_rel = NULL;
7267 txn->mt_dbflags[slot] = dbflag;
7268 memcpy(&txn->mt_dbs[slot], data.mv_data, sizeof(MDB_db));
7270 txn->mt_env->me_dbflags[slot] = txn->mt_dbs[slot].md_flags;
7271 mdb_default_cmp(txn, slot);
7280 int mdb_stat(MDB_txn *txn, MDB_dbi dbi, MDB_stat *arg)
7282 if (txn == NULL || arg == NULL || dbi >= txn->mt_numdbs)
7285 if (txn->mt_dbflags[dbi] & DB_STALE) {
7288 /* Stale, must read the DB's root. cursor_init does it for us. */
7289 mdb_cursor_init(&mc, txn, dbi, &mx);
7291 return mdb_stat0(txn->mt_env, &txn->mt_dbs[dbi], arg);
7294 void mdb_dbi_close(MDB_env *env, MDB_dbi dbi)
7297 if (dbi <= MAIN_DBI || dbi >= env->me_maxdbs)
7299 ptr = env->me_dbxs[dbi].md_name.mv_data;
7300 env->me_dbxs[dbi].md_name.mv_data = NULL;
7301 env->me_dbxs[dbi].md_name.mv_size = 0;
7302 env->me_dbflags[dbi] = 0;
7306 /** Add all the DB's pages to the free list.
7307 * @param[in] mc Cursor on the DB to free.
7308 * @param[in] subs non-Zero to check for sub-DBs in this DB.
7309 * @return 0 on success, non-zero on failure.
7312 mdb_drop0(MDB_cursor *mc, int subs)
7316 rc = mdb_page_search(mc, NULL, 0);
7317 if (rc == MDB_SUCCESS) {
7318 MDB_txn *txn = mc->mc_txn;
7323 /* LEAF2 pages have no nodes, cannot have sub-DBs */
7324 if (IS_LEAF2(mc->mc_pg[mc->mc_top]))
7327 mdb_cursor_copy(mc, &mx);
7328 while (mc->mc_snum > 0) {
7329 MDB_page *mp = mc->mc_pg[mc->mc_top];
7330 unsigned n = NUMKEYS(mp);
7332 for (i=0; i<n; i++) {
7333 ni = NODEPTR(mp, i);
7334 if (ni->mn_flags & F_BIGDATA) {
7337 memcpy(&pg, NODEDATA(ni), sizeof(pg));
7338 rc = mdb_page_get(txn, pg, &omp, NULL);
7341 assert(IS_OVERFLOW(omp));
7342 rc = mdb_midl_append_range(&txn->mt_free_pgs,
7346 } else if (subs && (ni->mn_flags & F_SUBDATA)) {
7347 mdb_xcursor_init1(mc, ni);
7348 rc = mdb_drop0(&mc->mc_xcursor->mx_cursor, 0);
7354 if ((rc = mdb_midl_need(&txn->mt_free_pgs, n)) != 0)
7356 for (i=0; i<n; i++) {
7358 ni = NODEPTR(mp, i);
7361 mdb_midl_xappend(txn->mt_free_pgs, pg);
7366 mc->mc_ki[mc->mc_top] = i;
7367 rc = mdb_cursor_sibling(mc, 1);
7369 /* no more siblings, go back to beginning
7370 * of previous level.
7374 for (i=1; i<mc->mc_snum; i++) {
7376 mc->mc_pg[i] = mx.mc_pg[i];
7381 rc = mdb_midl_append(&txn->mt_free_pgs, mc->mc_db->md_root);
7382 } else if (rc == MDB_NOTFOUND) {
7388 int mdb_drop(MDB_txn *txn, MDB_dbi dbi, int del)
7390 MDB_cursor *mc, *m2;
7393 if (!txn || !dbi || dbi >= txn->mt_numdbs || (unsigned)del > 1 || !(txn->mt_dbflags[dbi] & DB_VALID))
7396 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY))
7399 rc = mdb_cursor_open(txn, dbi, &mc);
7403 rc = mdb_drop0(mc, mc->mc_db->md_flags & MDB_DUPSORT);
7404 /* Invalidate the dropped DB's cursors */
7405 for (m2 = txn->mt_cursors[dbi]; m2; m2 = m2->mc_next)
7406 m2->mc_flags &= ~C_INITIALIZED;
7410 /* Can't delete the main DB */
7411 if (del && dbi > MAIN_DBI) {
7412 rc = mdb_del(txn, MAIN_DBI, &mc->mc_dbx->md_name, NULL);
7414 txn->mt_dbflags[dbi] = DB_STALE;
7415 mdb_dbi_close(txn->mt_env, dbi);
7418 /* reset the DB record, mark it dirty */
7419 txn->mt_dbflags[dbi] |= DB_DIRTY;
7420 txn->mt_dbs[dbi].md_depth = 0;
7421 txn->mt_dbs[dbi].md_branch_pages = 0;
7422 txn->mt_dbs[dbi].md_leaf_pages = 0;
7423 txn->mt_dbs[dbi].md_overflow_pages = 0;
7424 txn->mt_dbs[dbi].md_entries = 0;
7425 txn->mt_dbs[dbi].md_root = P_INVALID;
7427 txn->mt_flags |= MDB_TXN_DIRTY;
7430 mdb_cursor_close(mc);
7434 int mdb_set_compare(MDB_txn *txn, MDB_dbi dbi, MDB_cmp_func *cmp)
7436 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs || !(txn->mt_dbflags[dbi] & DB_VALID))
7439 txn->mt_dbxs[dbi].md_cmp = cmp;
7443 int mdb_set_dupsort(MDB_txn *txn, MDB_dbi dbi, MDB_cmp_func *cmp)
7445 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs || !(txn->mt_dbflags[dbi] & DB_VALID))
7448 txn->mt_dbxs[dbi].md_dcmp = cmp;
7452 int mdb_set_relfunc(MDB_txn *txn, MDB_dbi dbi, MDB_rel_func *rel)
7454 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs || !(txn->mt_dbflags[dbi] & DB_VALID))
7457 txn->mt_dbxs[dbi].md_rel = rel;
7461 int mdb_set_relctx(MDB_txn *txn, MDB_dbi dbi, void *ctx)
7463 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs || !(txn->mt_dbflags[dbi] & DB_VALID))
7466 txn->mt_dbxs[dbi].md_relctx = ctx;
projects / openldap / blob