2 * @brief memory-mapped database library
4 * A Btree-based database management library modeled loosely on the
5 * BerkeleyDB API, but much simplified.
8 * Copyright 2011-2013 Howard Chu, Symas Corp.
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted only as authorized by the OpenLDAP
15 * A copy of this license is available in the file LICENSE in the
16 * top-level directory of the distribution or, alternatively, at
17 * <http://www.OpenLDAP.org/license.html>.
19 * This code is derived from btree.c written by Martin Hedenfalk.
21 * Copyright (c) 2009, 2010 Martin Hedenfalk <martin@bzero.se>
23 * Permission to use, copy, modify, and distribute this software for any
24 * purpose with or without fee is hereby granted, provided that the above
25 * copyright notice and this permission notice appear in all copies.
27 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
28 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
29 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
30 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
31 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
32 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
33 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
36 #include <sys/types.h>
38 #include <sys/param.h>
44 #ifdef HAVE_SYS_FILE_H
61 #if !(defined(BYTE_ORDER) || defined(__BYTE_ORDER))
62 #include <resolv.h> /* defines BYTE_ORDER on HPUX and Solaris */
65 #if defined(__APPLE__) || defined (BSD)
66 # define MDB_USE_POSIX_SEM 1
67 # define MDB_FDATASYNC fsync
68 #elif defined(ANDROID)
69 # define MDB_FDATASYNC fsync
74 #ifdef MDB_USE_POSIX_SEM
75 #include <semaphore.h>
80 #include <valgrind/memcheck.h>
81 #define VGMEMP_CREATE(h,r,z) VALGRIND_CREATE_MEMPOOL(h,r,z)
82 #define VGMEMP_ALLOC(h,a,s) VALGRIND_MEMPOOL_ALLOC(h,a,s)
83 #define VGMEMP_FREE(h,a) VALGRIND_MEMPOOL_FREE(h,a)
84 #define VGMEMP_DESTROY(h) VALGRIND_DESTROY_MEMPOOL(h)
85 #define VGMEMP_DEFINED(a,s) VALGRIND_MAKE_MEM_DEFINED(a,s)
87 #define VGMEMP_CREATE(h,r,z)
88 #define VGMEMP_ALLOC(h,a,s)
89 #define VGMEMP_FREE(h,a)
90 #define VGMEMP_DESTROY(h)
91 #define VGMEMP_DEFINED(a,s)
95 # if (defined(_LITTLE_ENDIAN) || defined(_BIG_ENDIAN)) && !(defined(_LITTLE_ENDIAN) && defined(_BIG_ENDIAN))
96 /* Solaris just defines one or the other */
97 # define LITTLE_ENDIAN 1234
98 # define BIG_ENDIAN 4321
99 # ifdef _LITTLE_ENDIAN
100 # define BYTE_ORDER LITTLE_ENDIAN
102 # define BYTE_ORDER BIG_ENDIAN
105 # define BYTE_ORDER __BYTE_ORDER
109 #ifndef LITTLE_ENDIAN
110 #define LITTLE_ENDIAN __LITTLE_ENDIAN
113 #define BIG_ENDIAN __BIG_ENDIAN
116 #if defined(__i386) || defined(__x86_64)
117 #define MISALIGNED_OK 1
123 #if (BYTE_ORDER == LITTLE_ENDIAN) == (BYTE_ORDER == BIG_ENDIAN)
124 # error "Unknown or unsupported endianness (BYTE_ORDER)"
125 #elif (-6 & 5) || CHAR_BIT != 8 || UINT_MAX < 0xffffffff || ULONG_MAX % 0xFFFF
126 # error "Two's complement, reasonably sized integer types, please"
129 /** @defgroup internal MDB Internals
132 /** @defgroup compat Windows Compatibility Macros
133 * A bunch of macros to minimize the amount of platform-specific ifdefs
134 * needed throughout the rest of the code. When the features this library
135 * needs are similar enough to POSIX to be hidden in a one-or-two line
136 * replacement, this macro approach is used.
140 #define pthread_t DWORD
141 #define pthread_mutex_t HANDLE
142 #define pthread_key_t DWORD
143 #define pthread_self() GetCurrentThreadId()
144 #define pthread_key_create(x,y) \
145 ((*(x) = TlsAlloc()) == TLS_OUT_OF_INDEXES ? ErrCode() : 0)
146 #define pthread_key_delete(x) TlsFree(x)
147 #define pthread_getspecific(x) TlsGetValue(x)
148 #define pthread_setspecific(x,y) (TlsSetValue(x,y) ? 0 : ErrCode())
149 #define pthread_mutex_unlock(x) ReleaseMutex(x)
150 #define pthread_mutex_lock(x) WaitForSingleObject(x, INFINITE)
151 #define LOCK_MUTEX_R(env) pthread_mutex_lock((env)->me_rmutex)
152 #define UNLOCK_MUTEX_R(env) pthread_mutex_unlock((env)->me_rmutex)
153 #define LOCK_MUTEX_W(env) pthread_mutex_lock((env)->me_wmutex)
154 #define UNLOCK_MUTEX_W(env) pthread_mutex_unlock((env)->me_wmutex)
155 #define getpid() GetCurrentProcessId()
156 #define MDB_FDATASYNC(fd) (!FlushFileBuffers(fd))
157 #define MDB_MSYNC(addr,len,flags) (!FlushViewOfFile(addr,len))
158 #define ErrCode() GetLastError()
159 #define GET_PAGESIZE(x) {SYSTEM_INFO si; GetSystemInfo(&si); (x) = si.dwPageSize;}
160 #define close(fd) CloseHandle(fd)
161 #define munmap(ptr,len) UnmapViewOfFile(ptr)
164 #ifdef MDB_USE_POSIX_SEM
166 #define LOCK_MUTEX_R(env) mdb_sem_wait((env)->me_rmutex)
167 #define UNLOCK_MUTEX_R(env) sem_post((env)->me_rmutex)
168 #define LOCK_MUTEX_W(env) mdb_sem_wait((env)->me_wmutex)
169 #define UNLOCK_MUTEX_W(env) sem_post((env)->me_wmutex)
172 mdb_sem_wait(sem_t *sem)
175 while ((rc = sem_wait(sem)) && (rc = errno) == EINTR) ;
180 /** Lock the reader mutex.
182 #define LOCK_MUTEX_R(env) pthread_mutex_lock(&(env)->me_txns->mti_mutex)
183 /** Unlock the reader mutex.
185 #define UNLOCK_MUTEX_R(env) pthread_mutex_unlock(&(env)->me_txns->mti_mutex)
187 /** Lock the writer mutex.
188 * Only a single write transaction is allowed at a time. Other writers
189 * will block waiting for this mutex.
191 #define LOCK_MUTEX_W(env) pthread_mutex_lock(&(env)->me_txns->mti_wmutex)
192 /** Unlock the writer mutex.
194 #define UNLOCK_MUTEX_W(env) pthread_mutex_unlock(&(env)->me_txns->mti_wmutex)
195 #endif /* MDB_USE_POSIX_SEM */
197 /** Get the error code for the last failed system function.
199 #define ErrCode() errno
201 /** An abstraction for a file handle.
202 * On POSIX systems file handles are small integers. On Windows
203 * they're opaque pointers.
207 /** A value for an invalid file handle.
208 * Mainly used to initialize file variables and signify that they are
211 #define INVALID_HANDLE_VALUE (-1)
213 /** Get the size of a memory page for the system.
214 * This is the basic size that the platform's memory manager uses, and is
215 * fundamental to the use of memory-mapped files.
217 #define GET_PAGESIZE(x) ((x) = sysconf(_SC_PAGE_SIZE))
220 #if defined(_WIN32) || defined(MDB_USE_POSIX_SEM)
223 #define MNAME_LEN (sizeof(pthread_mutex_t))
229 /** A flag for opening a file and requesting synchronous data writes.
230 * This is only used when writing a meta page. It's not strictly needed;
231 * we could just do a normal write and then immediately perform a flush.
232 * But if this flag is available it saves us an extra system call.
234 * @note If O_DSYNC is undefined but exists in /usr/include,
235 * preferably set some compiler flag to get the definition.
236 * Otherwise compile with the less efficient -DMDB_DSYNC=O_SYNC.
239 # define MDB_DSYNC O_DSYNC
243 /** Function for flushing the data of a file. Define this to fsync
244 * if fdatasync() is not supported.
246 #ifndef MDB_FDATASYNC
247 # define MDB_FDATASYNC fdatasync
251 # define MDB_MSYNC(addr,len,flags) msync(addr,len,flags)
262 /** A page number in the database.
263 * Note that 64 bit page numbers are overkill, since pages themselves
264 * already represent 12-13 bits of addressable memory, and the OS will
265 * always limit applications to a maximum of 63 bits of address space.
267 * @note In the #MDB_node structure, we only store 48 bits of this value,
268 * which thus limits us to only 60 bits of addressable data.
270 typedef MDB_ID pgno_t;
272 /** A transaction ID.
273 * See struct MDB_txn.mt_txnid for details.
275 typedef MDB_ID txnid_t;
277 /** @defgroup debug Debug Macros
281 /** Enable debug output.
282 * Set this to 1 for copious tracing. Set to 2 to add dumps of all IDLs
283 * read from and written to the database (used for free space management).
288 #if !(__STDC_VERSION__ >= 199901L || defined(__GNUC__))
291 # define DPRINTF (void) /* Vararg macros may be unsupported */
293 static int mdb_debug;
294 static txnid_t mdb_debug_start;
296 /** Print a debug message with printf formatting. */
297 # define DPRINTF(fmt, ...) /**< Requires 2 or more args */ \
298 ((void) ((mdb_debug) && \
299 fprintf(stderr, "%s:%d " fmt "\n", __func__, __LINE__, __VA_ARGS__)))
301 # define DPRINTF(fmt, ...) ((void) 0)
302 # define MDB_DEBUG_SKIP
304 /** Print a debug string.
305 * The string is printed literally, with no format processing.
307 #define DPUTS(arg) DPRINTF("%s", arg)
310 /** A default memory page size.
311 * The actual size is platform-dependent, but we use this for
312 * boot-strapping. We probably should not be using this any more.
313 * The #GET_PAGESIZE() macro is used to get the actual size.
315 * Note that we don't currently support Huge pages. On Linux,
316 * regular data files cannot use Huge pages, and in general
317 * Huge pages aren't actually pageable. We rely on the OS
318 * demand-pager to read our data and page it out when memory
319 * pressure from other processes is high. So until OSs have
320 * actual paging support for Huge pages, they're not viable.
322 #define MDB_PAGESIZE 4096
324 /** The minimum number of keys required in a database page.
325 * Setting this to a larger value will place a smaller bound on the
326 * maximum size of a data item. Data items larger than this size will
327 * be pushed into overflow pages instead of being stored directly in
328 * the B-tree node. This value used to default to 4. With a page size
329 * of 4096 bytes that meant that any item larger than 1024 bytes would
330 * go into an overflow page. That also meant that on average 2-3KB of
331 * each overflow page was wasted space. The value cannot be lower than
332 * 2 because then there would no longer be a tree structure. With this
333 * value, items larger than 2KB will go into overflow pages, and on
334 * average only 1KB will be wasted.
336 #define MDB_MINKEYS 2
338 /** A stamp that identifies a file as an MDB file.
339 * There's nothing special about this value other than that it is easily
340 * recognizable, and it will reflect any byte order mismatches.
342 #define MDB_MAGIC 0xBEEFC0DE
344 /** The version number for a database's file format. */
345 #define MDB_VERSION 1
347 /** @brief The maximum size of a key in the database.
349 * We require that keys all fit onto a regular page. This limit
350 * could be raised a bit further if needed; to something just
351 * under #MDB_PAGESIZE / #MDB_MINKEYS.
353 * Note that data items in an #MDB_DUPSORT database are actually keys
354 * of a subDB, so they're also limited to this size.
356 #ifndef MDB_MAXKEYSIZE
357 #define MDB_MAXKEYSIZE 511
360 /** @brief The maximum size of a data item.
362 * We only store a 32 bit value for node sizes.
364 #define MAXDATASIZE 0xffffffffUL
369 * This is used for printing a hex dump of a key's contents.
371 #define DKBUF char kbuf[(MDB_MAXKEYSIZE*2+1)]
372 /** Display a key in hex.
374 * Invoke a function to display a key in hex.
376 #define DKEY(x) mdb_dkey(x, kbuf)
378 #define DKBUF typedef int dummy_kbuf /* so we can put ';' after */
382 /** An invalid page number.
383 * Mainly used to denote an empty tree.
385 #define P_INVALID (~(pgno_t)0)
387 /** Test if the flags \b f are set in a flag word \b w. */
388 #define F_ISSET(w, f) (((w) & (f)) == (f))
390 /** Used for offsets within a single page.
391 * Since memory pages are typically 4 or 8KB in size, 12-13 bits,
394 typedef uint16_t indx_t;
396 /** Default size of memory map.
397 * This is certainly too small for any actual applications. Apps should always set
398 * the size explicitly using #mdb_env_set_mapsize().
400 #define DEFAULT_MAPSIZE 1048576
402 /** @defgroup readers Reader Lock Table
403 * Readers don't acquire any locks for their data access. Instead, they
404 * simply record their transaction ID in the reader table. The reader
405 * mutex is needed just to find an empty slot in the reader table. The
406 * slot's address is saved in thread-specific data so that subsequent read
407 * transactions started by the same thread need no further locking to proceed.
409 * No reader table is used if the database is on a read-only filesystem.
411 * Since the database uses multi-version concurrency control, readers don't
412 * actually need any locking. This table is used to keep track of which
413 * readers are using data from which old transactions, so that we'll know
414 * when a particular old transaction is no longer in use. Old transactions
415 * that have discarded any data pages can then have those pages reclaimed
416 * for use by a later write transaction.
418 * The lock table is constructed such that reader slots are aligned with the
419 * processor's cache line size. Any slot is only ever used by one thread.
420 * This alignment guarantees that there will be no contention or cache
421 * thrashing as threads update their own slot info, and also eliminates
422 * any need for locking when accessing a slot.
424 * A writer thread will scan every slot in the table to determine the oldest
425 * outstanding reader transaction. Any freed pages older than this will be
426 * reclaimed by the writer. The writer doesn't use any locks when scanning
427 * this table. This means that there's no guarantee that the writer will
428 * see the most up-to-date reader info, but that's not required for correct
429 * operation - all we need is to know the upper bound on the oldest reader,
430 * we don't care at all about the newest reader. So the only consequence of
431 * reading stale information here is that old pages might hang around a
432 * while longer before being reclaimed. That's actually good anyway, because
433 * the longer we delay reclaiming old pages, the more likely it is that a
434 * string of contiguous pages can be found after coalescing old pages from
435 * many old transactions together.
438 /** Number of slots in the reader table.
439 * This value was chosen somewhat arbitrarily. 126 readers plus a
440 * couple mutexes fit exactly into 8KB on my development machine.
441 * Applications should set the table size using #mdb_env_set_maxreaders().
443 #define DEFAULT_READERS 126
445 /** The size of a CPU cache line in bytes. We want our lock structures
446 * aligned to this size to avoid false cache line sharing in the
448 * This value works for most CPUs. For Itanium this should be 128.
454 /** The information we store in a single slot of the reader table.
455 * In addition to a transaction ID, we also record the process and
456 * thread ID that owns a slot, so that we can detect stale information,
457 * e.g. threads or processes that went away without cleaning up.
458 * @note We currently don't check for stale records. We simply re-init
459 * the table when we know that we're the only process opening the
462 typedef struct MDB_rxbody {
463 /** Current Transaction ID when this transaction began, or (txnid_t)-1.
464 * Multiple readers that start at the same time will probably have the
465 * same ID here. Again, it's not important to exclude them from
466 * anything; all we need to know is which version of the DB they
467 * started from so we can avoid overwriting any data used in that
468 * particular version.
471 /** The process ID of the process owning this reader txn. */
473 /** The thread ID of the thread owning this txn. */
477 /** The actual reader record, with cacheline padding. */
478 typedef struct MDB_reader {
481 /** shorthand for mrb_txnid */
482 #define mr_txnid mru.mrx.mrb_txnid
483 #define mr_pid mru.mrx.mrb_pid
484 #define mr_tid mru.mrx.mrb_tid
485 /** cache line alignment */
486 char pad[(sizeof(MDB_rxbody)+CACHELINE-1) & ~(CACHELINE-1)];
490 /** The header for the reader table.
491 * The table resides in a memory-mapped file. (This is a different file
492 * than is used for the main database.)
494 * For POSIX the actual mutexes reside in the shared memory of this
495 * mapped file. On Windows, mutexes are named objects allocated by the
496 * kernel; we store the mutex names in this mapped file so that other
497 * processes can grab them. This same approach is also used on
498 * MacOSX/Darwin (using named semaphores) since MacOSX doesn't support
499 * process-shared POSIX mutexes. For these cases where a named object
500 * is used, the object name is derived from a 64 bit FNV hash of the
501 * environment pathname. As such, naming collisions are extremely
502 * unlikely. If a collision occurs, the results are unpredictable.
504 typedef struct MDB_txbody {
505 /** Stamp identifying this as an MDB file. It must be set
508 /** Version number of this lock file. Must be set to #MDB_VERSION. */
509 uint32_t mtb_version;
510 #if defined(_WIN32) || defined(MDB_USE_POSIX_SEM)
511 char mtb_rmname[MNAME_LEN];
513 /** Mutex protecting access to this table.
514 * This is the reader lock that #LOCK_MUTEX_R acquires.
516 pthread_mutex_t mtb_mutex;
518 /** The ID of the last transaction committed to the database.
519 * This is recorded here only for convenience; the value can always
520 * be determined by reading the main database meta pages.
523 /** The number of slots that have been used in the reader table.
524 * This always records the maximum count, it is not decremented
525 * when readers release their slots.
527 unsigned mtb_numreaders;
530 /** The actual reader table definition. */
531 typedef struct MDB_txninfo {
534 #define mti_magic mt1.mtb.mtb_magic
535 #define mti_version mt1.mtb.mtb_version
536 #define mti_mutex mt1.mtb.mtb_mutex
537 #define mti_rmname mt1.mtb.mtb_rmname
538 #define mti_txnid mt1.mtb.mtb_txnid
539 #define mti_numreaders mt1.mtb.mtb_numreaders
540 char pad[(sizeof(MDB_txbody)+CACHELINE-1) & ~(CACHELINE-1)];
543 #if defined(_WIN32) || defined(MDB_USE_POSIX_SEM)
544 char mt2_wmname[MNAME_LEN];
545 #define mti_wmname mt2.mt2_wmname
547 pthread_mutex_t mt2_wmutex;
548 #define mti_wmutex mt2.mt2_wmutex
550 char pad[(MNAME_LEN+CACHELINE-1) & ~(CACHELINE-1)];
552 MDB_reader mti_readers[1];
556 /** Common header for all page types.
557 * Overflow records occupy a number of contiguous pages with no
558 * headers on any page after the first.
560 typedef struct MDB_page {
561 #define mp_pgno mp_p.p_pgno
562 #define mp_next mp_p.p_next
564 pgno_t p_pgno; /**< page number */
565 void * p_next; /**< for in-memory list of freed structs */
568 /** @defgroup mdb_page Page Flags
570 * Flags for the page headers.
573 #define P_BRANCH 0x01 /**< branch page */
574 #define P_LEAF 0x02 /**< leaf page */
575 #define P_OVERFLOW 0x04 /**< overflow page */
576 #define P_META 0x08 /**< meta page */
577 #define P_DIRTY 0x10 /**< dirty page */
578 #define P_LEAF2 0x20 /**< for #MDB_DUPFIXED records */
579 #define P_SUBP 0x40 /**< for #MDB_DUPSORT sub-pages */
581 uint16_t mp_flags; /**< @ref mdb_page */
582 #define mp_lower mp_pb.pb.pb_lower
583 #define mp_upper mp_pb.pb.pb_upper
584 #define mp_pages mp_pb.pb_pages
587 indx_t pb_lower; /**< lower bound of free space */
588 indx_t pb_upper; /**< upper bound of free space */
590 uint32_t pb_pages; /**< number of overflow pages */
592 indx_t mp_ptrs[1]; /**< dynamic size */
595 /** Size of the page header, excluding dynamic data at the end */
596 #define PAGEHDRSZ ((unsigned) offsetof(MDB_page, mp_ptrs))
598 /** Address of first usable data byte in a page, after the header */
599 #define METADATA(p) ((void *)((char *)(p) + PAGEHDRSZ))
601 /** Number of nodes on a page */
602 #define NUMKEYS(p) (((p)->mp_lower - PAGEHDRSZ) >> 1)
604 /** The amount of space remaining in the page */
605 #define SIZELEFT(p) (indx_t)((p)->mp_upper - (p)->mp_lower)
607 /** The percentage of space used in the page, in tenths of a percent. */
608 #define PAGEFILL(env, p) (1000L * ((env)->me_psize - PAGEHDRSZ - SIZELEFT(p)) / \
609 ((env)->me_psize - PAGEHDRSZ))
610 /** The minimum page fill factor, in tenths of a percent.
611 * Pages emptier than this are candidates for merging.
613 #define FILL_THRESHOLD 250
615 /** Test if a page is a leaf page */
616 #define IS_LEAF(p) F_ISSET((p)->mp_flags, P_LEAF)
617 /** Test if a page is a LEAF2 page */
618 #define IS_LEAF2(p) F_ISSET((p)->mp_flags, P_LEAF2)
619 /** Test if a page is a branch page */
620 #define IS_BRANCH(p) F_ISSET((p)->mp_flags, P_BRANCH)
621 /** Test if a page is an overflow page */
622 #define IS_OVERFLOW(p) F_ISSET((p)->mp_flags, P_OVERFLOW)
623 /** Test if a page is a sub page */
624 #define IS_SUBP(p) F_ISSET((p)->mp_flags, P_SUBP)
626 /** The number of overflow pages needed to store the given size. */
627 #define OVPAGES(size, psize) ((PAGEHDRSZ-1 + (size)) / (psize) + 1)
629 /** Header for a single key/data pair within a page.
630 * We guarantee 2-byte alignment for nodes.
632 typedef struct MDB_node {
633 /** lo and hi are used for data size on leaf nodes and for
634 * child pgno on branch nodes. On 64 bit platforms, flags
635 * is also used for pgno. (Branch nodes have no flags).
636 * They are in host byte order in case that lets some
637 * accesses be optimized into a 32-bit word access.
639 #define mn_lo mn_offset[BYTE_ORDER!=LITTLE_ENDIAN]
640 #define mn_hi mn_offset[BYTE_ORDER==LITTLE_ENDIAN] /**< part of dsize or pgno */
641 unsigned short mn_offset[2]; /**< storage for #mn_lo and #mn_hi */
642 /** @defgroup mdb_node Node Flags
644 * Flags for node headers.
647 #define F_BIGDATA 0x01 /**< data put on overflow page */
648 #define F_SUBDATA 0x02 /**< data is a sub-database */
649 #define F_DUPDATA 0x04 /**< data has duplicates */
651 /** valid flags for #mdb_node_add() */
652 #define NODE_ADD_FLAGS (F_DUPDATA|F_SUBDATA|MDB_RESERVE|MDB_APPEND)
655 unsigned short mn_flags; /**< @ref mdb_node */
656 unsigned short mn_ksize; /**< key size */
657 char mn_data[1]; /**< key and data are appended here */
660 /** Size of the node header, excluding dynamic data at the end */
661 #define NODESIZE offsetof(MDB_node, mn_data)
663 /** Bit position of top word in page number, for shifting mn_flags */
664 #define PGNO_TOPWORD ((pgno_t)-1 > 0xffffffffu ? 32 : 0)
666 /** Size of a node in a branch page with a given key.
667 * This is just the node header plus the key, there is no data.
669 #define INDXSIZE(k) (NODESIZE + ((k) == NULL ? 0 : (k)->mv_size))
671 /** Size of a node in a leaf page with a given key and data.
672 * This is node header plus key plus data size.
674 #define LEAFSIZE(k, d) (NODESIZE + (k)->mv_size + (d)->mv_size)
676 /** Address of node \b i in page \b p */
677 #define NODEPTR(p, i) ((MDB_node *)((char *)(p) + (p)->mp_ptrs[i]))
679 /** Address of the key for the node */
680 #define NODEKEY(node) (void *)((node)->mn_data)
682 /** Address of the data for a node */
683 #define NODEDATA(node) (void *)((char *)(node)->mn_data + (node)->mn_ksize)
685 /** Get the page number pointed to by a branch node */
686 #define NODEPGNO(node) \
687 ((node)->mn_lo | ((pgno_t) (node)->mn_hi << 16) | \
688 (PGNO_TOPWORD ? ((pgno_t) (node)->mn_flags << PGNO_TOPWORD) : 0))
689 /** Set the page number in a branch node */
690 #define SETPGNO(node,pgno) do { \
691 (node)->mn_lo = (pgno) & 0xffff; (node)->mn_hi = (pgno) >> 16; \
692 if (PGNO_TOPWORD) (node)->mn_flags = (pgno) >> PGNO_TOPWORD; } while(0)
694 /** Get the size of the data in a leaf node */
695 #define NODEDSZ(node) ((node)->mn_lo | ((unsigned)(node)->mn_hi << 16))
696 /** Set the size of the data for a leaf node */
697 #define SETDSZ(node,size) do { \
698 (node)->mn_lo = (size) & 0xffff; (node)->mn_hi = (size) >> 16;} while(0)
699 /** The size of a key in a node */
700 #define NODEKSZ(node) ((node)->mn_ksize)
702 /** Copy a page number from src to dst */
704 #define COPY_PGNO(dst,src) dst = src
706 #if SIZE_MAX > 4294967295UL
707 #define COPY_PGNO(dst,src) do { \
708 unsigned short *s, *d; \
709 s = (unsigned short *)&(src); \
710 d = (unsigned short *)&(dst); \
717 #define COPY_PGNO(dst,src) do { \
718 unsigned short *s, *d; \
719 s = (unsigned short *)&(src); \
720 d = (unsigned short *)&(dst); \
726 /** The address of a key in a LEAF2 page.
727 * LEAF2 pages are used for #MDB_DUPFIXED sorted-duplicate sub-DBs.
728 * There are no node headers, keys are stored contiguously.
730 #define LEAF2KEY(p, i, ks) ((char *)(p) + PAGEHDRSZ + ((i)*(ks)))
732 /** Set the \b node's key into \b key, if requested. */
733 #define MDB_GET_KEY(node, key) { if ((key) != NULL) { \
734 (key)->mv_size = NODEKSZ(node); (key)->mv_data = NODEKEY(node); } }
736 /** Information about a single database in the environment. */
737 typedef struct MDB_db {
738 uint32_t md_pad; /**< also ksize for LEAF2 pages */
739 uint16_t md_flags; /**< @ref mdb_dbi_open */
740 uint16_t md_depth; /**< depth of this tree */
741 pgno_t md_branch_pages; /**< number of internal pages */
742 pgno_t md_leaf_pages; /**< number of leaf pages */
743 pgno_t md_overflow_pages; /**< number of overflow pages */
744 size_t md_entries; /**< number of data items */
745 pgno_t md_root; /**< the root page of this tree */
748 /** mdb_dbi_open flags */
749 #define PERSISTENT_FLAGS 0x7fff
750 #define VALID_FLAGS (MDB_REVERSEKEY|MDB_DUPSORT|MDB_INTEGERKEY|MDB_DUPFIXED|\
751 MDB_INTEGERDUP|MDB_REVERSEDUP|MDB_CREATE)
753 /** Handle for the DB used to track free pages. */
755 /** Handle for the default DB. */
758 /** Meta page content. */
759 typedef struct MDB_meta {
760 /** Stamp identifying this as an MDB file. It must be set
763 /** Version number of this lock file. Must be set to #MDB_VERSION. */
765 void *mm_address; /**< address for fixed mapping */
766 size_t mm_mapsize; /**< size of mmap region */
767 MDB_db mm_dbs[2]; /**< first is free space, 2nd is main db */
768 /** The size of pages used in this DB */
769 #define mm_psize mm_dbs[0].md_pad
770 /** Any persistent environment flags. @ref mdb_env */
771 #define mm_flags mm_dbs[0].md_flags
772 pgno_t mm_last_pg; /**< last used page in file */
773 txnid_t mm_txnid; /**< txnid that committed this page */
776 /** Buffer for a stack-allocated dirty page.
777 * The members define size and alignment, and silence type
778 * aliasing warnings. They are not used directly; that could
779 * mean incorrectly using several union members in parallel.
781 typedef union MDB_pagebuf {
782 char mb_raw[MDB_PAGESIZE];
785 char mm_pad[PAGEHDRSZ];
790 /** Auxiliary DB info.
791 * The information here is mostly static/read-only. There is
792 * only a single copy of this record in the environment.
794 typedef struct MDB_dbx {
795 MDB_val md_name; /**< name of the database */
796 MDB_cmp_func *md_cmp; /**< function for comparing keys */
797 MDB_cmp_func *md_dcmp; /**< function for comparing data items */
798 MDB_rel_func *md_rel; /**< user relocate function */
799 void *md_relctx; /**< user-provided context for md_rel */
802 /** A database transaction.
803 * Every operation requires a transaction handle.
806 MDB_txn *mt_parent; /**< parent of a nested txn */
807 MDB_txn *mt_child; /**< nested txn under this txn */
808 pgno_t mt_next_pgno; /**< next unallocated page */
809 /** The ID of this transaction. IDs are integers incrementing from 1.
810 * Only committed write transactions increment the ID. If a transaction
811 * aborts, the ID may be re-used by the next writer.
814 MDB_env *mt_env; /**< the DB environment */
815 /** The list of pages that became unused during this transaction.
819 MDB_ID2L dirty_list; /**< for write txns: modified pages */
820 MDB_reader *reader; /**< this thread's reader table slot or NULL */
822 /** Array of records for each DB known in the environment. */
824 /** Array of MDB_db records for each known DB */
826 /** @defgroup mt_dbflag Transaction DB Flags
830 #define DB_DIRTY 0x01 /**< DB was written in this txn */
831 #define DB_STALE 0x02 /**< DB record is older than txnID */
832 #define DB_NEW 0x04 /**< DB handle opened in this txn */
833 #define DB_VALID 0x08 /**< DB handle is valid */
834 #define MDB_VALID 0x8000 /**< DB handle is valid, for me_dbflags */
836 /** In write txns, array of cursors for each DB */
837 MDB_cursor **mt_cursors;
838 /** Array of flags for each DB */
839 unsigned char *mt_dbflags;
840 /** Number of DB records in use. This number only ever increments;
841 * we don't decrement it when individual DB handles are closed.
845 /** @defgroup mdb_txn Transaction Flags
849 #define MDB_TXN_RDONLY 0x01 /**< read-only transaction */
850 #define MDB_TXN_ERROR 0x02 /**< an error has occurred */
851 #define MDB_TXN_DIRTY 0x04 /**< must write, even if dirty list is empty */
853 unsigned int mt_flags; /**< @ref mdb_txn */
854 /** dirty_list maxsize - #allocated pages including in parent txns */
855 unsigned int mt_dirty_room;
856 /** Tracks which of the two meta pages was used at the start
857 * of this transaction.
859 unsigned int mt_toggle;
862 /** Enough space for 2^32 nodes with minimum of 2 keys per node. I.e., plenty.
863 * At 4 keys per node, enough for 2^64 nodes, so there's probably no need to
864 * raise this on a 64 bit machine.
866 #define CURSOR_STACK 32
870 /** Cursors are used for all DB operations */
872 /** Next cursor on this DB in this txn */
874 /** Original cursor if this is a shadow */
876 /** Context used for databases with #MDB_DUPSORT, otherwise NULL */
877 struct MDB_xcursor *mc_xcursor;
878 /** The transaction that owns this cursor */
880 /** The database handle this cursor operates on */
882 /** The database record for this cursor */
884 /** The database auxiliary record for this cursor */
886 /** The @ref mt_dbflag for this database */
887 unsigned char *mc_dbflag;
888 unsigned short mc_snum; /**< number of pushed pages */
889 unsigned short mc_top; /**< index of top page, normally mc_snum-1 */
890 /** @defgroup mdb_cursor Cursor Flags
892 * Cursor state flags.
895 #define C_INITIALIZED 0x01 /**< cursor has been initialized and is valid */
896 #define C_EOF 0x02 /**< No more data */
897 #define C_SUB 0x04 /**< Cursor is a sub-cursor */
898 #define C_SHADOW 0x08 /**< Cursor is a dup from a parent txn */
899 #define C_ALLOCD 0x10 /**< Cursor was malloc'd */
900 #define C_SPLITTING 0x20 /**< Cursor is in page_split */
902 unsigned int mc_flags; /**< @ref mdb_cursor */
903 MDB_page *mc_pg[CURSOR_STACK]; /**< stack of pushed pages */
904 indx_t mc_ki[CURSOR_STACK]; /**< stack of page indices */
907 /** Context for sorted-dup records.
908 * We could have gone to a fully recursive design, with arbitrarily
909 * deep nesting of sub-databases. But for now we only handle these
910 * levels - main DB, optional sub-DB, sorted-duplicate DB.
912 typedef struct MDB_xcursor {
913 /** A sub-cursor for traversing the Dup DB */
914 MDB_cursor mx_cursor;
915 /** The database record for this Dup DB */
917 /** The auxiliary DB record for this Dup DB */
919 /** The @ref mt_dbflag for this Dup DB */
920 unsigned char mx_dbflag;
923 /** State of FreeDB old pages, stored in the MDB_env */
924 typedef struct MDB_pgstate {
925 txnid_t mf_pglast; /**< ID of last old page record we used */
926 pgno_t *mf_pghead; /**< old pages reclaimed from freelist */
927 pgno_t *mf_pgfree; /**< memory to free when dropping me_pghead */
930 /** The database environment. */
932 HANDLE me_fd; /**< The main data file */
933 HANDLE me_lfd; /**< The lock file */
934 HANDLE me_mfd; /**< just for writing the meta pages */
935 /** Failed to update the meta page. Probably an I/O error. */
936 #define MDB_FATAL_ERROR 0x80000000U
937 /** Some fields are initialized. */
938 #define MDB_ENV_ACTIVE 0x20000000U
939 /** me_txkey is set */
940 #define MDB_ENV_TXKEY 0x10000000U
941 uint32_t me_flags; /**< @ref mdb_env */
942 unsigned int me_psize; /**< size of a page, from #GET_PAGESIZE */
943 unsigned int me_maxreaders; /**< size of the reader table */
944 unsigned int me_numreaders; /**< max numreaders set by this env */
945 MDB_dbi me_numdbs; /**< number of DBs opened */
946 MDB_dbi me_maxdbs; /**< size of the DB table */
947 pid_t me_pid; /**< process ID of this env */
948 char *me_path; /**< path to the DB files */
949 char *me_map; /**< the memory map of the data file */
950 MDB_txninfo *me_txns; /**< the memory map of the lock file or NULL */
951 MDB_meta *me_metas[2]; /**< pointers to the two meta pages */
952 MDB_txn *me_txn; /**< current write transaction */
953 size_t me_mapsize; /**< size of the data memory map */
954 off_t me_size; /**< current file size */
955 pgno_t me_maxpg; /**< me_mapsize / me_psize */
956 MDB_dbx *me_dbxs; /**< array of static DB info */
957 uint16_t *me_dbflags; /**< array of flags from MDB_db.md_flags */
958 pthread_key_t me_txkey; /**< thread-key for readers */
959 MDB_pgstate me_pgstate; /**< state of old pages from freeDB */
960 # define me_pglast me_pgstate.mf_pglast
961 # define me_pghead me_pgstate.mf_pghead
962 # define me_pgfree me_pgstate.mf_pgfree
963 MDB_page *me_dpages; /**< list of malloc'd blocks for re-use */
964 /** IDL of pages that became unused in a write txn */
966 /** ID2L of pages written during a write txn. Length MDB_IDL_UM_SIZE. */
967 MDB_ID2L me_dirty_list;
968 /** Max number of freelist items that can fit in a single overflow page */
969 unsigned int me_maxfree_1pg;
970 /** Max size of a node on a page */
971 unsigned int me_nodemax;
973 HANDLE me_rmutex; /* Windows mutexes don't reside in shared mem */
975 #elif defined(MDB_USE_POSIX_SEM)
976 sem_t *me_rmutex; /* Shared mutexes are not supported */
981 /** Nested transaction */
982 typedef struct MDB_ntxn {
983 MDB_txn mnt_txn; /* the transaction */
984 MDB_pgstate mnt_pgstate; /* parent transaction's saved freestate */
987 /** max number of pages to commit in one writev() call */
988 #define MDB_COMMIT_PAGES 64
989 #if defined(IOV_MAX) && IOV_MAX < MDB_COMMIT_PAGES
990 #undef MDB_COMMIT_PAGES
991 #define MDB_COMMIT_PAGES IOV_MAX
994 static int mdb_page_alloc(MDB_cursor *mc, int num, MDB_page **mp);
995 static int mdb_page_new(MDB_cursor *mc, uint32_t flags, int num, MDB_page **mp);
996 static int mdb_page_touch(MDB_cursor *mc);
998 static int mdb_page_get(MDB_txn *txn, pgno_t pgno, MDB_page **mp);
999 static int mdb_page_search_root(MDB_cursor *mc,
1000 MDB_val *key, int modify);
1001 #define MDB_PS_MODIFY 1
1002 #define MDB_PS_ROOTONLY 2
1003 static int mdb_page_search(MDB_cursor *mc,
1004 MDB_val *key, int flags);
1005 static int mdb_page_merge(MDB_cursor *csrc, MDB_cursor *cdst);
1007 #define MDB_SPLIT_REPLACE MDB_APPENDDUP /**< newkey is not new */
1008 static int mdb_page_split(MDB_cursor *mc, MDB_val *newkey, MDB_val *newdata,
1009 pgno_t newpgno, unsigned int nflags);
1011 static int mdb_env_read_header(MDB_env *env, MDB_meta *meta);
1012 static int mdb_env_pick_meta(const MDB_env *env);
1013 static int mdb_env_write_meta(MDB_txn *txn);
1014 static void mdb_env_close0(MDB_env *env, int excl);
1016 static MDB_node *mdb_node_search(MDB_cursor *mc, MDB_val *key, int *exactp);
1017 static int mdb_node_add(MDB_cursor *mc, indx_t indx,
1018 MDB_val *key, MDB_val *data, pgno_t pgno, unsigned int flags);
1019 static void mdb_node_del(MDB_page *mp, indx_t indx, int ksize);
1020 static void mdb_node_shrink(MDB_page *mp, indx_t indx);
1021 static int mdb_node_move(MDB_cursor *csrc, MDB_cursor *cdst);
1022 static int mdb_node_read(MDB_txn *txn, MDB_node *leaf, MDB_val *data);
1023 static size_t mdb_leaf_size(MDB_env *env, MDB_val *key, MDB_val *data);
1024 static size_t mdb_branch_size(MDB_env *env, MDB_val *key);
1026 static int mdb_rebalance(MDB_cursor *mc);
1027 static int mdb_update_key(MDB_cursor *mc, MDB_val *key);
1029 static void mdb_cursor_pop(MDB_cursor *mc);
1030 static int mdb_cursor_push(MDB_cursor *mc, MDB_page *mp);
1032 static int mdb_cursor_del0(MDB_cursor *mc, MDB_node *leaf);
1033 static int mdb_cursor_sibling(MDB_cursor *mc, int move_right);
1034 static int mdb_cursor_next(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op);
1035 static int mdb_cursor_prev(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op);
1036 static int mdb_cursor_set(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op,
1038 static int mdb_cursor_first(MDB_cursor *mc, MDB_val *key, MDB_val *data);
1039 static int mdb_cursor_last(MDB_cursor *mc, MDB_val *key, MDB_val *data);
1041 static void mdb_cursor_init(MDB_cursor *mc, MDB_txn *txn, MDB_dbi dbi, MDB_xcursor *mx);
1042 static void mdb_xcursor_init0(MDB_cursor *mc);
1043 static void mdb_xcursor_init1(MDB_cursor *mc, MDB_node *node);
1045 static int mdb_drop0(MDB_cursor *mc, int subs);
1046 static void mdb_default_cmp(MDB_txn *txn, MDB_dbi dbi);
1049 static MDB_cmp_func mdb_cmp_memn, mdb_cmp_memnr, mdb_cmp_int, mdb_cmp_cint, mdb_cmp_long;
1053 static SECURITY_DESCRIPTOR mdb_null_sd;
1054 static SECURITY_ATTRIBUTES mdb_all_sa;
1055 static int mdb_sec_inited;
1058 /** Return the library version info. */
1060 mdb_version(int *major, int *minor, int *patch)
1062 if (major) *major = MDB_VERSION_MAJOR;
1063 if (minor) *minor = MDB_VERSION_MINOR;
1064 if (patch) *patch = MDB_VERSION_PATCH;
1065 return MDB_VERSION_STRING;
1068 /** Table of descriptions for MDB @ref errors */
1069 static char *const mdb_errstr[] = {
1070 "MDB_KEYEXIST: Key/data pair already exists",
1071 "MDB_NOTFOUND: No matching key/data pair found",
1072 "MDB_PAGE_NOTFOUND: Requested page not found",
1073 "MDB_CORRUPTED: Located page was wrong type",
1074 "MDB_PANIC: Update of meta page failed",
1075 "MDB_VERSION_MISMATCH: Database environment version mismatch",
1076 "MDB_INVALID: File is not an MDB file",
1077 "MDB_MAP_FULL: Environment mapsize limit reached",
1078 "MDB_DBS_FULL: Environment maxdbs limit reached",
1079 "MDB_READERS_FULL: Environment maxreaders limit reached",
1080 "MDB_TLS_FULL: Thread-local storage keys full - too many environments open",
1081 "MDB_TXN_FULL: Transaction has too many dirty pages - transaction too big",
1082 "MDB_CURSOR_FULL: Internal error - cursor stack limit reached",
1083 "MDB_PAGE_FULL: Internal error - page has no more space",
1084 "MDB_MAP_RESIZED: Database contents grew beyond environment mapsize",
1085 "MDB_INCOMPATIBLE: Database flags changed or would change",
1089 mdb_strerror(int err)
1093 return ("Successful return: 0");
1095 if (err >= MDB_KEYEXIST && err <= MDB_LAST_ERRCODE) {
1096 i = err - MDB_KEYEXIST;
1097 return mdb_errstr[i];
1100 return strerror(err);
1104 /** Display a key in hexadecimal and return the address of the result.
1105 * @param[in] key the key to display
1106 * @param[in] buf the buffer to write into. Should always be #DKBUF.
1107 * @return The key in hexadecimal form.
1110 mdb_dkey(MDB_val *key, char *buf)
1113 unsigned char *c = key->mv_data;
1119 if (key->mv_size > MDB_MAXKEYSIZE)
1120 return "MDB_MAXKEYSIZE";
1121 /* may want to make this a dynamic check: if the key is mostly
1122 * printable characters, print it as-is instead of converting to hex.
1126 for (i=0; i<key->mv_size; i++)
1127 ptr += sprintf(ptr, "%02x", *c++);
1129 sprintf(buf, "%.*s", key->mv_size, key->mv_data);
1134 /** Display all the keys in the page. */
1136 mdb_page_list(MDB_page *mp)
1139 unsigned int i, nkeys, nsize;
1143 nkeys = NUMKEYS(mp);
1144 fprintf(stderr, "Page %zu numkeys %d\n", mp->mp_pgno, nkeys);
1145 for (i=0; i<nkeys; i++) {
1146 node = NODEPTR(mp, i);
1147 key.mv_size = node->mn_ksize;
1148 key.mv_data = node->mn_data;
1149 nsize = NODESIZE + NODEKSZ(node) + sizeof(indx_t);
1150 if (IS_BRANCH(mp)) {
1151 fprintf(stderr, "key %d: page %zu, %s\n", i, NODEPGNO(node),
1154 if (F_ISSET(node->mn_flags, F_BIGDATA))
1155 nsize += sizeof(pgno_t);
1157 nsize += NODEDSZ(node);
1158 fprintf(stderr, "key %d: nsize %d, %s\n", i, nsize, DKEY(&key));
1164 mdb_cursor_chk(MDB_cursor *mc)
1170 if (!mc->mc_snum && !(mc->mc_flags & C_INITIALIZED)) return;
1171 for (i=0; i<mc->mc_top; i++) {
1173 node = NODEPTR(mp, mc->mc_ki[i]);
1174 if (NODEPGNO(node) != mc->mc_pg[i+1]->mp_pgno)
1177 if (mc->mc_ki[i] >= NUMKEYS(mc->mc_pg[i]))
1183 /** Count all the pages in each DB and in the freelist
1184 * and make sure it matches the actual number of pages
1187 static void mdb_audit(MDB_txn *txn)
1191 MDB_ID freecount, count;
1196 mdb_cursor_init(&mc, txn, FREE_DBI, NULL);
1197 while ((rc = mdb_cursor_get(&mc, &key, &data, MDB_NEXT)) == 0)
1198 freecount += *(MDB_ID *)data.mv_data;
1201 for (i = 0; i<txn->mt_numdbs; i++) {
1202 MDB_xcursor mx, *mxp;
1203 mxp = (txn->mt_dbs[i].md_flags & MDB_DUPSORT) ? &mx : NULL;
1204 mdb_cursor_init(&mc, txn, i, mxp);
1205 if (txn->mt_dbs[i].md_root == P_INVALID)
1207 count += txn->mt_dbs[i].md_branch_pages +
1208 txn->mt_dbs[i].md_leaf_pages +
1209 txn->mt_dbs[i].md_overflow_pages;
1210 if (txn->mt_dbs[i].md_flags & MDB_DUPSORT) {
1211 mdb_page_search(&mc, NULL, 0);
1215 mp = mc.mc_pg[mc.mc_top];
1216 for (j=0; j<NUMKEYS(mp); j++) {
1217 MDB_node *leaf = NODEPTR(mp, j);
1218 if (leaf->mn_flags & F_SUBDATA) {
1220 memcpy(&db, NODEDATA(leaf), sizeof(db));
1221 count += db.md_branch_pages + db.md_leaf_pages +
1222 db.md_overflow_pages;
1226 while (mdb_cursor_sibling(&mc, 1) == 0);
1229 if (freecount + count + 2 /* metapages */ != txn->mt_next_pgno) {
1230 fprintf(stderr, "audit: %lu freecount: %lu count: %lu total: %lu next_pgno: %lu\n",
1231 txn->mt_txnid, freecount, count+2, freecount+count+2, txn->mt_next_pgno);
1237 mdb_cmp(MDB_txn *txn, MDB_dbi dbi, const MDB_val *a, const MDB_val *b)
1239 return txn->mt_dbxs[dbi].md_cmp(a, b);
1243 mdb_dcmp(MDB_txn *txn, MDB_dbi dbi, const MDB_val *a, const MDB_val *b)
1245 if (txn->mt_dbxs[dbi].md_dcmp)
1246 return txn->mt_dbxs[dbi].md_dcmp(a, b);
1248 return EINVAL; /* too bad you can't distinguish this from a valid result */
1251 /** Allocate a single page.
1252 * Re-use old malloc'd pages first, otherwise just malloc.
1255 mdb_page_malloc(MDB_cursor *mc) {
1257 size_t sz = mc->mc_txn->mt_env->me_psize;
1258 if ((ret = mc->mc_txn->mt_env->me_dpages) != NULL) {
1259 VGMEMP_ALLOC(mc->mc_txn->mt_env, ret, sz);
1260 VGMEMP_DEFINED(ret, sizeof(ret->mp_next));
1261 mc->mc_txn->mt_env->me_dpages = ret->mp_next;
1262 } else if ((ret = malloc(sz)) != NULL) {
1263 VGMEMP_ALLOC(mc->mc_txn->mt_env, ret, sz);
1269 mdb_page_free(MDB_env *env, MDB_page *mp)
1271 mp->mp_next = env->me_dpages;
1272 VGMEMP_FREE(env, mp);
1273 env->me_dpages = mp;
1276 /** Allocate pages for writing.
1277 * If there are free pages available from older transactions, they
1278 * will be re-used first. Otherwise a new page will be allocated.
1279 * @param[in] mc cursor A cursor handle identifying the transaction and
1280 * database for which we are allocating.
1281 * @param[in] num the number of pages to allocate.
1282 * @param[out] mp Address of the allocated page(s). Requests for multiple pages
1283 * will always be satisfied by a single contiguous chunk of memory.
1284 * @return 0 on success, non-zero on failure.
1287 mdb_page_alloc(MDB_cursor *mc, int num, MDB_page **mp)
1289 MDB_txn *txn = mc->mc_txn;
1291 pgno_t pgno = P_INVALID;
1293 txnid_t oldest = 0, last;
1298 /* If our dirty list is already full, we can't do anything */
1299 if (txn->mt_dirty_room == 0)
1300 return MDB_TXN_FULL;
1302 /* The free list won't have any content at all until txn 2 has
1303 * committed. The pages freed by txn 2 will be unreferenced
1304 * after txn 3 commits, and so will be safe to re-use in txn 4.
1306 if (txn->mt_txnid > 3) {
1307 if (!txn->mt_env->me_pghead &&
1308 txn->mt_dbs[FREE_DBI].md_root != P_INVALID) {
1309 /* See if there's anything in the free DB */
1316 mdb_cursor_init(&m2, txn, FREE_DBI, NULL);
1317 if (!txn->mt_env->me_pglast) {
1318 mdb_page_search(&m2, NULL, 0);
1319 leaf = NODEPTR(m2.mc_pg[m2.mc_top], 0);
1320 kptr = (txnid_t *)NODEKEY(leaf);
1325 last = txn->mt_env->me_pglast + 1;
1327 key.mv_data = &last;
1328 key.mv_size = sizeof(last);
1329 rc = mdb_cursor_set(&m2, &key, &data, MDB_SET_RANGE, NULL);
1332 last = *(txnid_t *)key.mv_data;
1338 oldest = txn->mt_txnid - 1;
1339 nr = txn->mt_env->me_txns->mti_numreaders;
1340 r = txn->mt_env->me_txns->mti_readers;
1341 for (i=0; i<nr; i++) {
1342 if (!r[i].mr_pid) continue;
1349 if (oldest > last) {
1350 /* It's usable, grab it.
1354 if (!txn->mt_env->me_pglast) {
1355 mdb_node_read(txn, leaf, &data);
1357 idl = (MDB_ID *) data.mv_data;
1358 /* We might have a zero-length IDL due to freelist growth
1359 * during a prior commit
1362 txn->mt_env->me_pglast = last;
1365 mop = malloc(MDB_IDL_SIZEOF(idl));
1368 txn->mt_env->me_pglast = last;
1369 txn->mt_env->me_pghead = txn->mt_env->me_pgfree = mop;
1370 memcpy(mop, idl, MDB_IDL_SIZEOF(idl));
1375 DPRINTF("IDL read txn %zu root %zu num %zu",
1376 last, txn->mt_dbs[FREE_DBI].md_root, idl[0]);
1377 for (i=0; i<idl[0]; i++) {
1378 DPRINTF("IDL %zu", idl[i+1]);
1385 if (txn->mt_env->me_pghead) {
1386 pgno_t *mop = txn->mt_env->me_pghead;
1389 int retry = 1, readit = 0, n2 = num-1;
1390 unsigned int i, j, k;
1392 /* If current list is too short, must fetch more and coalesce */
1393 if (mop[0] < (unsigned)num)
1396 mdb_cursor_init(&m2, txn, FREE_DBI, NULL);
1398 /* If on freelist, don't try to read more. If what we have
1399 * right now isn't enough just use new pages.
1400 * TODO: get all of this working. Many circular dependencies...
1402 if (mc->mc_dbi == FREE_DBI) {
1410 last = txn->mt_env->me_pglast + 1;
1412 /* We haven't hit the readers list yet? */
1418 oldest = txn->mt_txnid - 1;
1419 nr = txn->mt_env->me_txns->mti_numreaders;
1420 r = txn->mt_env->me_txns->mti_readers;
1421 for (i=0; i<nr; i++) {
1422 if (!r[i].mr_pid) continue;
1429 /* There's nothing we can use on the freelist */
1430 if (oldest - last < 1)
1433 key.mv_data = &last;
1434 key.mv_size = sizeof(last);
1435 rc = mdb_cursor_set(&m2,&key,&data,MDB_SET_RANGE,NULL);
1437 if (rc == MDB_NOTFOUND)
1441 last = *(txnid_t*)key.mv_data;
1444 idl = (MDB_ID *) data.mv_data;
1445 mop2 = malloc(MDB_IDL_SIZEOF(idl) + MDB_IDL_SIZEOF(mop));
1448 /* merge in sorted order */
1449 i = idl[0]; j = mop[0]; mop2[0] = k = i+j;
1451 while (i>0 || j>0) {
1452 if (i && idl[i] < mop[j])
1453 mop2[k--] = idl[i--];
1455 mop2[k--] = mop[j--];
1457 txn->mt_env->me_pglast = last;
1458 free(txn->mt_env->me_pgfree);
1459 txn->mt_env->me_pghead = txn->mt_env->me_pgfree = mop2;
1461 /* Keep trying to read until we have enough */
1462 if (mop[0] < (unsigned)num) {
1467 /* current list has enough pages, but are they contiguous? */
1468 for (i=mop[0]; i>=(unsigned)num; i--) {
1469 if (mop[i-n2] == mop[i] + n2) {
1472 /* move any stragglers down */
1473 for (j=i+num; j<=mop[0]; j++)
1480 /* Stop if we succeeded, or no retries */
1481 if (!retry || pgno != P_INVALID)
1487 /* peel pages off tail, so we only have to truncate the list */
1488 pgno = MDB_IDL_LAST(mop);
1491 if (MDB_IDL_IS_ZERO(mop)) {
1492 free(txn->mt_env->me_pgfree);
1493 txn->mt_env->me_pghead = txn->mt_env->me_pgfree = NULL;
1498 if (pgno == P_INVALID) {
1499 /* DB size is maxed out */
1500 if (txn->mt_next_pgno + num >= txn->mt_env->me_maxpg) {
1501 DPUTS("DB size maxed out");
1502 return MDB_MAP_FULL;
1505 if (txn->mt_env->me_flags & MDB_WRITEMAP) {
1506 if (pgno == P_INVALID) {
1507 pgno = txn->mt_next_pgno;
1508 txn->mt_next_pgno += num;
1510 np = (MDB_page *)(txn->mt_env->me_map + txn->mt_env->me_psize * pgno);
1513 if (txn->mt_env->me_dpages && num == 1) {
1514 np = txn->mt_env->me_dpages;
1515 VGMEMP_ALLOC(txn->mt_env, np, txn->mt_env->me_psize);
1516 VGMEMP_DEFINED(np, sizeof(np->mp_next));
1517 txn->mt_env->me_dpages = np->mp_next;
1519 size_t sz = txn->mt_env->me_psize * num;
1520 if ((np = malloc(sz)) == NULL)
1522 VGMEMP_ALLOC(txn->mt_env, np, sz);
1524 if (pgno == P_INVALID) {
1525 np->mp_pgno = txn->mt_next_pgno;
1526 txn->mt_next_pgno += num;
1531 mid.mid = np->mp_pgno;
1533 if (txn->mt_env->me_flags & MDB_WRITEMAP) {
1534 mdb_mid2l_append(txn->mt_u.dirty_list, &mid);
1536 mdb_mid2l_insert(txn->mt_u.dirty_list, &mid);
1538 txn->mt_dirty_room--;
1544 /** Copy a page: avoid copying unused portions of the page.
1545 * @param[in] dst page to copy into
1546 * @param[in] src page to copy from
1549 mdb_page_copy(MDB_page *dst, MDB_page *src, unsigned int psize)
1551 dst->mp_flags = src->mp_flags | P_DIRTY;
1552 dst->mp_pages = src->mp_pages;
1554 if (IS_LEAF2(src)) {
1555 memcpy(dst->mp_ptrs, src->mp_ptrs, psize - PAGEHDRSZ - SIZELEFT(src));
1557 unsigned int i, nkeys = NUMKEYS(src);
1558 for (i=0; i<nkeys; i++)
1559 dst->mp_ptrs[i] = src->mp_ptrs[i];
1560 memcpy((char *)dst+src->mp_upper, (char *)src+src->mp_upper,
1561 psize - src->mp_upper);
1565 /** Touch a page: make it dirty and re-insert into tree with updated pgno.
1566 * @param[in] mc cursor pointing to the page to be touched
1567 * @return 0 on success, non-zero on failure.
1570 mdb_page_touch(MDB_cursor *mc)
1572 MDB_page *mp = mc->mc_pg[mc->mc_top];
1576 if (!F_ISSET(mp->mp_flags, P_DIRTY)) {
1578 if ((rc = mdb_page_alloc(mc, 1, &np)))
1580 DPRINTF("touched db %u page %zu -> %zu", mc->mc_dbi, mp->mp_pgno, np->mp_pgno);
1581 assert(mp->mp_pgno != np->mp_pgno);
1582 mdb_midl_append(&mc->mc_txn->mt_free_pgs, mp->mp_pgno);
1584 /* If page isn't full, just copy the used portion */
1585 mdb_page_copy(np, mp, mc->mc_txn->mt_env->me_psize);
1588 memcpy(np, mp, mc->mc_txn->mt_env->me_psize);
1590 np->mp_flags |= P_DIRTY;
1595 /* Adjust other cursors pointing to mp */
1596 if (mc->mc_flags & C_SUB) {
1597 MDB_cursor *m2, *m3;
1598 MDB_dbi dbi = mc->mc_dbi-1;
1600 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
1601 if (m2 == mc) continue;
1602 m3 = &m2->mc_xcursor->mx_cursor;
1603 if (m3->mc_snum < mc->mc_snum) continue;
1604 if (m3->mc_pg[mc->mc_top] == mc->mc_pg[mc->mc_top]) {
1605 m3->mc_pg[mc->mc_top] = mp;
1611 for (m2 = mc->mc_txn->mt_cursors[mc->mc_dbi]; m2; m2=m2->mc_next) {
1612 if (m2 == mc || m2->mc_snum < mc->mc_snum) continue;
1613 if (m2->mc_pg[mc->mc_top] == mc->mc_pg[mc->mc_top]) {
1614 m2->mc_pg[mc->mc_top] = mp;
1618 mc->mc_pg[mc->mc_top] = mp;
1619 /** If this page has a parent, update the parent to point to
1623 SETPGNO(NODEPTR(mc->mc_pg[mc->mc_top-1], mc->mc_ki[mc->mc_top-1]), mp->mp_pgno);
1625 mc->mc_db->md_root = mp->mp_pgno;
1626 } else if (mc->mc_txn->mt_parent) {
1629 /* If txn has a parent, make sure the page is in our
1632 if (mc->mc_txn->mt_u.dirty_list[0].mid) {
1633 unsigned x = mdb_mid2l_search(mc->mc_txn->mt_u.dirty_list, mp->mp_pgno);
1634 if (x <= mc->mc_txn->mt_u.dirty_list[0].mid &&
1635 mc->mc_txn->mt_u.dirty_list[x].mid == mp->mp_pgno) {
1636 if (mc->mc_txn->mt_u.dirty_list[x].mptr != mp) {
1637 mp = mc->mc_txn->mt_u.dirty_list[x].mptr;
1638 mc->mc_pg[mc->mc_top] = mp;
1643 assert(mc->mc_txn->mt_u.dirty_list[0].mid < MDB_IDL_UM_MAX);
1645 np = mdb_page_malloc(mc);
1648 memcpy(np, mp, mc->mc_txn->mt_env->me_psize);
1649 mid.mid = np->mp_pgno;
1651 mdb_mid2l_insert(mc->mc_txn->mt_u.dirty_list, &mid);
1659 mdb_env_sync(MDB_env *env, int force)
1662 if (force || !F_ISSET(env->me_flags, MDB_NOSYNC)) {
1663 if (env->me_flags & MDB_WRITEMAP) {
1664 int flags = ((env->me_flags & MDB_MAPASYNC) && !force)
1665 ? MS_ASYNC : MS_SYNC;
1666 if (MDB_MSYNC(env->me_map, env->me_mapsize, flags))
1669 else if (flags == MS_SYNC && MDB_FDATASYNC(env->me_fd))
1673 if (MDB_FDATASYNC(env->me_fd))
1680 /** Make shadow copies of all of parent txn's cursors */
1682 mdb_cursor_shadow(MDB_txn *src, MDB_txn *dst)
1684 MDB_cursor *mc, *m2;
1685 unsigned int i, j, size;
1687 for (i=0;i<src->mt_numdbs; i++) {
1688 if (src->mt_cursors[i]) {
1689 size = sizeof(MDB_cursor);
1690 if (src->mt_cursors[i]->mc_xcursor)
1691 size += sizeof(MDB_xcursor);
1692 for (m2 = src->mt_cursors[i]; m2; m2=m2->mc_next) {
1699 mc->mc_db = &dst->mt_dbs[i];
1700 mc->mc_dbx = m2->mc_dbx;
1701 mc->mc_dbflag = &dst->mt_dbflags[i];
1702 mc->mc_snum = m2->mc_snum;
1703 mc->mc_top = m2->mc_top;
1704 mc->mc_flags = m2->mc_flags | C_SHADOW;
1705 for (j=0; j<mc->mc_snum; j++) {
1706 mc->mc_pg[j] = m2->mc_pg[j];
1707 mc->mc_ki[j] = m2->mc_ki[j];
1709 if (m2->mc_xcursor) {
1710 MDB_xcursor *mx, *mx2;
1711 mx = (MDB_xcursor *)(mc+1);
1712 mc->mc_xcursor = mx;
1713 mx2 = m2->mc_xcursor;
1714 mx->mx_db = mx2->mx_db;
1715 mx->mx_dbx = mx2->mx_dbx;
1716 mx->mx_dbflag = mx2->mx_dbflag;
1717 mx->mx_cursor.mc_txn = dst;
1718 mx->mx_cursor.mc_dbi = mx2->mx_cursor.mc_dbi;
1719 mx->mx_cursor.mc_db = &mx->mx_db;
1720 mx->mx_cursor.mc_dbx = &mx->mx_dbx;
1721 mx->mx_cursor.mc_dbflag = &mx->mx_dbflag;
1722 mx->mx_cursor.mc_snum = mx2->mx_cursor.mc_snum;
1723 mx->mx_cursor.mc_top = mx2->mx_cursor.mc_top;
1724 mx->mx_cursor.mc_flags = mx2->mx_cursor.mc_flags | C_SHADOW;
1725 for (j=0; j<mx2->mx_cursor.mc_snum; j++) {
1726 mx->mx_cursor.mc_pg[j] = mx2->mx_cursor.mc_pg[j];
1727 mx->mx_cursor.mc_ki[j] = mx2->mx_cursor.mc_ki[j];
1730 mc->mc_xcursor = NULL;
1732 mc->mc_next = dst->mt_cursors[i];
1733 dst->mt_cursors[i] = mc;
1740 /** Merge shadow cursors back into parent's */
1742 mdb_cursor_merge(MDB_txn *txn)
1745 for (i=0; i<txn->mt_numdbs; i++) {
1746 if (txn->mt_cursors[i]) {
1748 while ((mc = txn->mt_cursors[i])) {
1749 txn->mt_cursors[i] = mc->mc_next;
1750 if (mc->mc_flags & C_SHADOW) {
1751 MDB_cursor *m2 = mc->mc_orig;
1753 m2->mc_snum = mc->mc_snum;
1754 m2->mc_top = mc->mc_top;
1755 for (j=0; j<mc->mc_snum; j++) {
1756 m2->mc_pg[j] = mc->mc_pg[j];
1757 m2->mc_ki[j] = mc->mc_ki[j];
1760 if (mc->mc_flags & C_ALLOCD)
1768 mdb_txn_reset0(MDB_txn *txn);
1770 /** Common code for #mdb_txn_begin() and #mdb_txn_renew().
1771 * @param[in] txn the transaction handle to initialize
1772 * @return 0 on success, non-zero on failure. This can only
1773 * fail for read-only transactions, and then only if the
1774 * reader table is full.
1777 mdb_txn_renew0(MDB_txn *txn)
1779 MDB_env *env = txn->mt_env;
1785 txn->mt_numdbs = env->me_numdbs;
1786 txn->mt_dbxs = env->me_dbxs; /* mostly static anyway */
1788 if (txn->mt_flags & MDB_TXN_RDONLY) {
1789 if (!env->me_txns) {
1790 i = mdb_env_pick_meta(env);
1791 txn->mt_txnid = env->me_metas[i]->mm_txnid;
1792 txn->mt_u.reader = NULL;
1794 MDB_reader *r = pthread_getspecific(env->me_txkey);
1796 pid_t pid = env->me_pid;
1797 pthread_t tid = pthread_self();
1800 for (i=0; i<env->me_txns->mti_numreaders; i++)
1801 if (env->me_txns->mti_readers[i].mr_pid == 0)
1803 if (i == env->me_maxreaders) {
1804 UNLOCK_MUTEX_R(env);
1805 return MDB_READERS_FULL;
1807 env->me_txns->mti_readers[i].mr_pid = pid;
1808 env->me_txns->mti_readers[i].mr_tid = tid;
1809 if (i >= env->me_txns->mti_numreaders)
1810 env->me_txns->mti_numreaders = i+1;
1811 /* Save numreaders for un-mutexed mdb_env_close() */
1812 env->me_numreaders = env->me_txns->mti_numreaders;
1813 UNLOCK_MUTEX_R(env);
1814 r = &env->me_txns->mti_readers[i];
1815 if ((rc = pthread_setspecific(env->me_txkey, r)) != 0) {
1816 env->me_txns->mti_readers[i].mr_pid = 0;
1820 txn->mt_txnid = r->mr_txnid = env->me_txns->mti_txnid;
1821 txn->mt_u.reader = r;
1823 txn->mt_toggle = txn->mt_txnid & 1;
1824 txn->mt_next_pgno = env->me_metas[txn->mt_toggle]->mm_last_pg+1;
1828 txn->mt_txnid = env->me_txns->mti_txnid;
1829 txn->mt_toggle = txn->mt_txnid & 1;
1830 txn->mt_next_pgno = env->me_metas[txn->mt_toggle]->mm_last_pg+1;
1833 if (txn->mt_txnid == mdb_debug_start)
1836 txn->mt_dirty_room = MDB_IDL_UM_MAX;
1837 txn->mt_u.dirty_list = env->me_dirty_list;
1838 txn->mt_u.dirty_list[0].mid = 0;
1839 txn->mt_free_pgs = env->me_free_pgs;
1840 txn->mt_free_pgs[0] = 0;
1844 /* Copy the DB info and flags */
1845 memcpy(txn->mt_dbs, env->me_metas[txn->mt_toggle]->mm_dbs, 2 * sizeof(MDB_db));
1846 for (i=2; i<txn->mt_numdbs; i++) {
1847 x = env->me_dbflags[i];
1848 txn->mt_dbs[i].md_flags = x & PERSISTENT_FLAGS;
1849 txn->mt_dbflags[i] = (x & MDB_VALID) ? DB_VALID|DB_STALE : 0;
1851 txn->mt_dbflags[0] = txn->mt_dbflags[1] = DB_VALID;
1853 if (env->me_maxpg < txn->mt_next_pgno) {
1854 mdb_txn_reset0(txn);
1855 return MDB_MAP_RESIZED;
1862 mdb_txn_renew(MDB_txn *txn)
1866 if (! (txn && (txn->mt_flags & MDB_TXN_RDONLY)))
1869 if (txn->mt_env->me_flags & MDB_FATAL_ERROR) {
1870 DPUTS("environment had fatal error, must shutdown!");
1874 rc = mdb_txn_renew0(txn);
1875 if (rc == MDB_SUCCESS) {
1876 DPRINTF("renew txn %zu%c %p on mdbenv %p, root page %zu",
1877 txn->mt_txnid, (txn->mt_flags & MDB_TXN_RDONLY) ? 'r' : 'w',
1878 (void *)txn, (void *)txn->mt_env, txn->mt_dbs[MAIN_DBI].md_root);
1884 mdb_txn_begin(MDB_env *env, MDB_txn *parent, unsigned int flags, MDB_txn **ret)
1888 int rc, size, tsize = sizeof(MDB_txn);
1890 if (env->me_flags & MDB_FATAL_ERROR) {
1891 DPUTS("environment had fatal error, must shutdown!");
1894 if ((env->me_flags & MDB_RDONLY) && !(flags & MDB_RDONLY))
1897 /* Nested transactions: Max 1 child, write txns only, no writemap */
1898 if (parent->mt_child ||
1899 (flags & MDB_RDONLY) || (parent->mt_flags & MDB_TXN_RDONLY) ||
1900 (env->me_flags & MDB_WRITEMAP))
1904 tsize = sizeof(MDB_ntxn);
1906 size = tsize + env->me_maxdbs * (sizeof(MDB_db)+1);
1907 if (!(flags & MDB_RDONLY))
1908 size += env->me_maxdbs * sizeof(MDB_cursor *);
1910 if ((txn = calloc(1, size)) == NULL) {
1911 DPRINTF("calloc: %s", strerror(ErrCode()));
1914 txn->mt_dbs = (MDB_db *) ((char *)txn + tsize);
1915 if (flags & MDB_RDONLY) {
1916 txn->mt_flags |= MDB_TXN_RDONLY;
1917 txn->mt_dbflags = (unsigned char *)(txn->mt_dbs + env->me_maxdbs);
1919 txn->mt_cursors = (MDB_cursor **)(txn->mt_dbs + env->me_maxdbs);
1920 txn->mt_dbflags = (unsigned char *)(txn->mt_cursors + env->me_maxdbs);
1926 txn->mt_free_pgs = mdb_midl_alloc();
1927 if (!txn->mt_free_pgs) {
1931 txn->mt_u.dirty_list = malloc(sizeof(MDB_ID2)*MDB_IDL_UM_SIZE);
1932 if (!txn->mt_u.dirty_list) {
1933 free(txn->mt_free_pgs);
1937 txn->mt_txnid = parent->mt_txnid;
1938 txn->mt_toggle = parent->mt_toggle;
1939 txn->mt_dirty_room = parent->mt_dirty_room;
1940 txn->mt_u.dirty_list[0].mid = 0;
1941 txn->mt_free_pgs[0] = 0;
1942 txn->mt_next_pgno = parent->mt_next_pgno;
1943 parent->mt_child = txn;
1944 txn->mt_parent = parent;
1945 txn->mt_numdbs = parent->mt_numdbs;
1946 txn->mt_dbxs = parent->mt_dbxs;
1947 memcpy(txn->mt_dbs, parent->mt_dbs, txn->mt_numdbs * sizeof(MDB_db));
1948 /* Copy parent's mt_dbflags, but clear DB_NEW */
1949 for (i=0; i<txn->mt_numdbs; i++)
1950 txn->mt_dbflags[i] = parent->mt_dbflags[i] & ~DB_NEW;
1952 ntxn = (MDB_ntxn *)txn;
1953 ntxn->mnt_pgstate = env->me_pgstate; /* save parent me_pghead & co */
1954 if (env->me_pghead) {
1955 size = MDB_IDL_SIZEOF(env->me_pghead);
1956 env->me_pghead = malloc(size);
1958 memcpy(env->me_pghead, ntxn->mnt_pgstate.mf_pghead, size);
1962 env->me_pgfree = env->me_pghead;
1964 rc = mdb_cursor_shadow(parent, txn);
1966 mdb_txn_reset0(txn);
1968 rc = mdb_txn_renew0(txn);
1974 DPRINTF("begin txn %zu%c %p on mdbenv %p, root page %zu",
1975 txn->mt_txnid, (txn->mt_flags & MDB_TXN_RDONLY) ? 'r' : 'w',
1976 (void *) txn, (void *) env, txn->mt_dbs[MAIN_DBI].md_root);
1982 /** Common code for #mdb_txn_reset() and #mdb_txn_abort().
1983 * May be called twice for readonly txns: First reset it, then abort.
1984 * @param[in] txn the transaction handle to reset
1987 mdb_txn_reset0(MDB_txn *txn)
1989 MDB_env *env = txn->mt_env;
1992 /* Close any DBI handles opened in this txn */
1993 for (i=2; i<txn->mt_numdbs; i++) {
1994 if (txn->mt_dbflags[i] & DB_NEW) {
1995 char *ptr = env->me_dbxs[i].md_name.mv_data;
1996 env->me_dbxs[i].md_name.mv_data = NULL;
1997 env->me_dbxs[i].md_name.mv_size = 0;
2002 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY)) {
2003 if (txn->mt_u.reader) {
2004 txn->mt_u.reader->mr_txnid = (txnid_t)-1;
2005 txn->mt_u.reader = NULL; /* do not touch mr_txnid again */
2007 txn->mt_numdbs = 0; /* mark txn as reset, do not close DBs again */
2011 /* close(free) all cursors */
2012 for (i=0; i<txn->mt_numdbs; i++) {
2013 if (txn->mt_cursors[i]) {
2015 while ((mc = txn->mt_cursors[i])) {
2016 txn->mt_cursors[i] = mc->mc_next;
2017 if (mc->mc_flags & C_ALLOCD)
2023 if (!(env->me_flags & MDB_WRITEMAP)) {
2024 /* return all dirty pages to dpage list */
2025 for (i=1; i<=txn->mt_u.dirty_list[0].mid; i++) {
2026 dp = txn->mt_u.dirty_list[i].mptr;
2027 if (!IS_OVERFLOW(dp) || dp->mp_pages == 1) {
2028 mdb_page_free(txn->mt_env, dp);
2030 /* large pages just get freed directly */
2031 VGMEMP_FREE(txn->mt_env, dp);
2037 free(env->me_pgfree);
2039 if (txn->mt_parent) {
2040 txn->mt_parent->mt_child = NULL;
2041 env->me_pgstate = ((MDB_ntxn *)txn)->mnt_pgstate;
2042 mdb_midl_free(txn->mt_free_pgs);
2043 free(txn->mt_u.dirty_list);
2046 if (mdb_midl_shrink(&txn->mt_free_pgs))
2047 env->me_free_pgs = txn->mt_free_pgs;
2050 txn->mt_env->me_pghead = txn->mt_env->me_pgfree = NULL;
2051 txn->mt_env->me_pglast = 0;
2054 /* The writer mutex was locked in mdb_txn_begin. */
2055 UNLOCK_MUTEX_W(env);
2060 mdb_txn_reset(MDB_txn *txn)
2065 DPRINTF("reset txn %zu%c %p on mdbenv %p, root page %zu",
2066 txn->mt_txnid, (txn->mt_flags & MDB_TXN_RDONLY) ? 'r' : 'w',
2067 (void *) txn, (void *)txn->mt_env, txn->mt_dbs[MAIN_DBI].md_root);
2069 mdb_txn_reset0(txn);
2073 mdb_txn_abort(MDB_txn *txn)
2078 DPRINTF("abort txn %zu%c %p on mdbenv %p, root page %zu",
2079 txn->mt_txnid, (txn->mt_flags & MDB_TXN_RDONLY) ? 'r' : 'w',
2080 (void *)txn, (void *)txn->mt_env, txn->mt_dbs[MAIN_DBI].md_root);
2083 mdb_txn_abort(txn->mt_child);
2085 mdb_txn_reset0(txn);
2090 mdb_txn_commit(MDB_txn *txn)
2098 pgno_t next, freecnt;
2099 txnid_t oldpg_txnid, id;
2102 assert(txn != NULL);
2103 assert(txn->mt_env != NULL);
2105 if (txn->mt_child) {
2106 mdb_txn_commit(txn->mt_child);
2107 txn->mt_child = NULL;
2112 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY)) {
2113 /* update the DB flags */
2114 for (i = 2; i<txn->mt_numdbs; i++) {
2115 if (txn->mt_dbflags[i] & DB_NEW)
2116 env->me_dbflags[i] = txn->mt_dbs[i].md_flags | MDB_VALID;
2118 if (txn->mt_numdbs > env->me_numdbs)
2119 env->me_numdbs = txn->mt_numdbs;
2120 txn->mt_numdbs = 2; /* so txn_abort() doesn't close any new handles */
2125 if (F_ISSET(txn->mt_flags, MDB_TXN_ERROR)) {
2126 DPUTS("error flag is set, can't commit");
2128 txn->mt_parent->mt_flags |= MDB_TXN_ERROR;
2133 if (txn->mt_parent) {
2134 MDB_txn *parent = txn->mt_parent;
2138 /* Append our free list to parent's */
2139 if (mdb_midl_append_list(&parent->mt_free_pgs, txn->mt_free_pgs)) {
2143 mdb_midl_free(txn->mt_free_pgs);
2145 parent->mt_next_pgno = txn->mt_next_pgno;
2146 parent->mt_flags = txn->mt_flags;
2148 /* Merge (and close) our cursors with parent's */
2149 mdb_cursor_merge(txn);
2151 /* Update parent's DB table. */
2152 memcpy(parent->mt_dbs, txn->mt_dbs, txn->mt_numdbs * sizeof(MDB_db));
2153 txn->mt_parent->mt_numdbs = txn->mt_numdbs;
2154 txn->mt_parent->mt_dbflags[0] = txn->mt_dbflags[0];
2155 txn->mt_parent->mt_dbflags[1] = txn->mt_dbflags[1];
2156 for (i=2; i<txn->mt_numdbs; i++) {
2157 /* preserve parent's DB_NEW status */
2158 x = txn->mt_parent->mt_dbflags[i] & DB_NEW;
2159 txn->mt_parent->mt_dbflags[i] = txn->mt_dbflags[i] | x;
2162 dst = txn->mt_parent->mt_u.dirty_list;
2163 src = txn->mt_u.dirty_list;
2164 /* Find len = length of merging our dirty list with parent's */
2166 dst[0].mid = 0; /* simplify loops */
2167 if (parent->mt_parent) {
2168 len = x + src[0].mid;
2169 y = mdb_mid2l_search(src, dst[x].mid + 1) - 1;
2170 for (i = x; y && i; y--) {
2171 pgno_t yp = src[y].mid;
2172 while (yp < dst[i].mid)
2174 if (yp == dst[i].mid) {
2179 } else { /* Simplify the above for single-ancestor case */
2180 len = MDB_IDL_UM_MAX - txn->mt_dirty_room;
2182 /* Merge our dirty list with parent's */
2184 for (i = len; y; dst[i--] = src[y--]) {
2185 pgno_t yp = src[y].mid;
2186 while (yp < dst[x].mid)
2187 dst[i--] = dst[x--];
2188 if (yp == dst[x].mid)
2189 free(dst[x--].mptr);
2193 free(txn->mt_u.dirty_list);
2194 parent->mt_dirty_room = txn->mt_dirty_room;
2196 txn->mt_parent->mt_child = NULL;
2197 free(((MDB_ntxn *)txn)->mnt_pgstate.mf_pgfree);
2202 if (txn != env->me_txn) {
2203 DPUTS("attempt to commit unknown transaction");
2208 if (!txn->mt_u.dirty_list[0].mid && !(txn->mt_flags & MDB_TXN_DIRTY))
2211 DPRINTF("committing txn %zu %p on mdbenv %p, root page %zu",
2212 txn->mt_txnid, (void *)txn, (void *)env, txn->mt_dbs[MAIN_DBI].md_root);
2214 /* Update DB root pointers */
2215 if (txn->mt_numdbs > 2) {
2218 data.mv_size = sizeof(MDB_db);
2220 mdb_cursor_init(&mc, txn, MAIN_DBI, NULL);
2221 for (i = 2; i < txn->mt_numdbs; i++) {
2222 if (txn->mt_dbflags[i] & DB_DIRTY) {
2223 data.mv_data = &txn->mt_dbs[i];
2224 rc = mdb_cursor_put(&mc, &txn->mt_dbxs[i].md_name, &data, 0);
2231 /* Save the freelist as of this transaction to the freeDB. This
2232 * can change the freelist, so keep trying until it stabilizes.
2234 * env->me_pglast and the length of txn->mt_free_pgs cannot decrease,
2235 * except the code below can decrease env->me_pglast to split pghead.
2236 * Page numbers cannot disappear from txn->mt_free_pgs. New pages
2237 * can only appear in env->me_pghead when env->me_pglast increases.
2238 * Until then, the me_pghead pointer won't move but can become NULL.
2241 mdb_cursor_init(&mc, txn, FREE_DBI, NULL);
2242 oldpg_txnid = id = 0;
2245 /* should only be one record now */
2246 if (env->me_pghead || env->me_pglast) {
2247 /* make sure first page of freeDB is touched and on freelist */
2248 rc = mdb_page_search(&mc, NULL, MDB_PS_MODIFY);
2249 if (rc && rc != MDB_NOTFOUND) {
2256 /* Delete IDLs we used from the free list */
2257 if (env->me_pglast) {
2262 rc = mdb_cursor_first(&mc, &key, NULL);
2265 oldpg_txnid = *(txnid_t *)key.mv_data;
2267 assert(oldpg_txnid <= env->me_pglast);
2269 rc = mdb_cursor_del(&mc, 0);
2272 } while (oldpg_txnid < env->me_pglast);
2275 /* Save IDL of pages freed by this txn, to freeDB */
2277 if (freecnt != txn->mt_free_pgs[0]) {
2280 /* make sure last page of freeDB is touched and on freelist */
2281 key.mv_size = MDB_MAXKEYSIZE+1;
2283 rc = mdb_page_search(&mc, &key, MDB_PS_MODIFY);
2284 if (rc && rc != MDB_NOTFOUND)
2290 MDB_IDL idl = txn->mt_free_pgs;
2291 mdb_midl_sort(txn->mt_free_pgs);
2292 DPRINTF("IDL write txn %zu root %zu num %zu",
2293 txn->mt_txnid, txn->mt_dbs[FREE_DBI].md_root, idl[0]);
2294 for (i=1; i<=idl[0]; i++) {
2295 DPRINTF("IDL %zu", idl[i]);
2299 /* write to last page of freeDB */
2300 key.mv_size = sizeof(pgno_t);
2301 key.mv_data = &txn->mt_txnid;
2302 /* The free list can still grow during this call,
2303 * despite the pre-emptive touches above. So retry
2304 * until the reserved space remains big enough.
2307 assert(freecnt < txn->mt_free_pgs[0]);
2308 freecnt = txn->mt_free_pgs[0];
2309 data.mv_size = MDB_IDL_SIZEOF(txn->mt_free_pgs);
2310 rc = mdb_cursor_put(&mc, &key, &data, MDB_RESERVE);
2313 } while (freecnt != txn->mt_free_pgs[0]);
2314 mdb_midl_sort(txn->mt_free_pgs);
2315 memcpy(data.mv_data, txn->mt_free_pgs, data.mv_size);
2316 if (oldpg_txnid < env->me_pglast || (!env->me_pghead && id))
2317 goto free_pgfirst; /* used up freeDB[oldpg_txnid] */
2320 /* Put back page numbers we took from freeDB but did not use */
2321 if (env->me_pghead) {
2326 mop = env->me_pghead;
2327 id = env->me_pglast;
2328 key.mv_size = sizeof(id);
2330 /* These steps may grow the freelist again
2331 * due to freed overflow pages...
2336 if (orig > env->me_maxfree_1pg && id > 4)
2337 orig = env->me_maxfree_1pg; /* Do not use more than 1 page */
2338 data.mv_size = (orig + 1) * sizeof(pgno_t);
2339 rc = mdb_cursor_put(&mc, &key, &data, MDB_RESERVE);
2342 assert(!env->me_pghead || env->me_pglast);
2343 /* mop could have been used again here */
2344 if (id != env->me_pglast || env->me_pghead == NULL)
2345 goto again; /* was completely used up */
2346 assert(mop == env->me_pghead);
2347 } while (mop[0] < orig && --i);
2348 memcpy(data.mv_data, mop, data.mv_size);
2351 *(pgno_t *)data.mv_data = orig;
2352 mop[orig] = mop[0] - orig;
2353 env->me_pghead = mop += orig;
2354 /* Save more oldpages at the previous txnid. */
2355 assert(env->me_pglast == id && id == oldpg_txnid);
2356 env->me_pglast = --oldpg_txnid;
2360 /* Check for growth of freelist again */
2361 if (freecnt != txn->mt_free_pgs[0])
2364 free(env->me_pgfree);
2365 env->me_pghead = env->me_pgfree = NULL;
2367 if (!MDB_IDL_IS_ZERO(txn->mt_free_pgs)) {
2368 if (mdb_midl_shrink(&txn->mt_free_pgs))
2369 env->me_free_pgs = txn->mt_free_pgs;
2376 if (env->me_flags & MDB_WRITEMAP) {
2377 for (i=1; i<=txn->mt_u.dirty_list[0].mid; i++) {
2378 dp = txn->mt_u.dirty_list[i].mptr;
2379 /* clear dirty flag */
2380 dp->mp_flags &= ~P_DIRTY;
2381 txn->mt_u.dirty_list[i].mid = 0;
2383 txn->mt_u.dirty_list[0].mid = 0;
2387 /* Commit up to MDB_COMMIT_PAGES dirty pages to disk until done.
2393 /* Windows actually supports scatter/gather I/O, but only on
2394 * unbuffered file handles. Since we're relying on the OS page
2395 * cache for all our data, that's self-defeating. So we just
2396 * write pages one at a time. We use the ov structure to set
2397 * the write offset, to at least save the overhead of a Seek
2401 memset(&ov, 0, sizeof(ov));
2402 for (; i<=txn->mt_u.dirty_list[0].mid; i++) {
2404 dp = txn->mt_u.dirty_list[i].mptr;
2405 DPRINTF("committing page %zu", dp->mp_pgno);
2406 size = dp->mp_pgno * env->me_psize;
2407 ov.Offset = size & 0xffffffff;
2408 ov.OffsetHigh = size >> 16;
2409 ov.OffsetHigh >>= 16;
2410 /* clear dirty flag */
2411 dp->mp_flags &= ~P_DIRTY;
2412 wsize = env->me_psize;
2413 if (IS_OVERFLOW(dp)) wsize *= dp->mp_pages;
2414 rc = WriteFile(env->me_fd, dp, wsize, NULL, &ov);
2417 DPRINTF("WriteFile: %d", n);
2424 struct iovec iov[MDB_COMMIT_PAGES];
2428 for (; i<=txn->mt_u.dirty_list[0].mid; i++) {
2429 dp = txn->mt_u.dirty_list[i].mptr;
2430 if (dp->mp_pgno != next) {
2432 rc = writev(env->me_fd, iov, n);
2436 DPUTS("short write, filesystem full?");
2438 DPRINTF("writev: %s", strerror(n));
2445 lseek(env->me_fd, dp->mp_pgno * env->me_psize, SEEK_SET);
2448 DPRINTF("committing page %zu", dp->mp_pgno);
2449 iov[n].iov_len = env->me_psize;
2450 if (IS_OVERFLOW(dp)) iov[n].iov_len *= dp->mp_pages;
2451 iov[n].iov_base = (char *)dp;
2452 size += iov[n].iov_len;
2453 next = dp->mp_pgno + (IS_OVERFLOW(dp) ? dp->mp_pages : 1);
2454 /* clear dirty flag */
2455 dp->mp_flags &= ~P_DIRTY;
2456 if (++n >= MDB_COMMIT_PAGES) {
2466 rc = writev(env->me_fd, iov, n);
2470 DPUTS("short write, filesystem full?");
2472 DPRINTF("writev: %s", strerror(n));
2479 /* Drop the dirty pages.
2481 for (i=1; i<=txn->mt_u.dirty_list[0].mid; i++) {
2482 dp = txn->mt_u.dirty_list[i].mptr;
2483 if (!IS_OVERFLOW(dp) || dp->mp_pages == 1) {
2484 mdb_page_free(txn->mt_env, dp);
2486 VGMEMP_FREE(txn->mt_env, dp);
2489 txn->mt_u.dirty_list[i].mid = 0;
2491 txn->mt_u.dirty_list[0].mid = 0;
2494 if ((n = mdb_env_sync(env, 0)) != 0 ||
2495 (n = mdb_env_write_meta(txn)) != MDB_SUCCESS) {
2503 /* update the DB flags */
2504 for (i = 2; i<txn->mt_numdbs; i++) {
2505 if (txn->mt_dbflags[i] & DB_NEW)
2506 env->me_dbflags[i] = txn->mt_dbs[i].md_flags | MDB_VALID;
2508 if (txn->mt_numdbs > env->me_numdbs)
2509 env->me_numdbs = txn->mt_numdbs;
2511 UNLOCK_MUTEX_W(env);
2517 /** Read the environment parameters of a DB environment before
2518 * mapping it into memory.
2519 * @param[in] env the environment handle
2520 * @param[out] meta address of where to store the meta information
2521 * @return 0 on success, non-zero on failure.
2524 mdb_env_read_header(MDB_env *env, MDB_meta *meta)
2531 /* We don't know the page size yet, so use a minimum value.
2532 * Read both meta pages so we can use the latest one.
2535 for (i=0; i<2; i++) {
2537 if (!ReadFile(env->me_fd, &pbuf, MDB_PAGESIZE, (DWORD *)&rc, NULL) || rc == 0)
2539 if ((rc = read(env->me_fd, &pbuf, MDB_PAGESIZE)) == 0)
2544 else if (rc != MDB_PAGESIZE) {
2548 DPRINTF("read: %s", strerror(err));
2552 p = (MDB_page *)&pbuf;
2554 if (!F_ISSET(p->mp_flags, P_META)) {
2555 DPRINTF("page %zu not a meta page", p->mp_pgno);
2560 if (m->mm_magic != MDB_MAGIC) {
2561 DPUTS("meta has invalid magic");
2565 if (m->mm_version != MDB_VERSION) {
2566 DPRINTF("database is version %u, expected version %u",
2567 m->mm_version, MDB_VERSION);
2568 return MDB_VERSION_MISMATCH;
2572 if (m->mm_txnid > meta->mm_txnid)
2573 memcpy(meta, m, sizeof(*m));
2575 memcpy(meta, m, sizeof(*m));
2577 if (SetFilePointer(env->me_fd, meta->mm_psize, NULL, FILE_BEGIN) != meta->mm_psize)
2579 if (lseek(env->me_fd, meta->mm_psize, SEEK_SET) != meta->mm_psize)
2587 /** Write the environment parameters of a freshly created DB environment.
2588 * @param[in] env the environment handle
2589 * @param[out] meta address of where to store the meta information
2590 * @return 0 on success, non-zero on failure.
2593 mdb_env_init_meta(MDB_env *env, MDB_meta *meta)
2600 DPUTS("writing new meta page");
2602 GET_PAGESIZE(psize);
2604 meta->mm_magic = MDB_MAGIC;
2605 meta->mm_version = MDB_VERSION;
2606 meta->mm_mapsize = env->me_mapsize;
2607 meta->mm_psize = psize;
2608 meta->mm_last_pg = 1;
2609 meta->mm_flags = env->me_flags & 0xffff;
2610 meta->mm_flags |= MDB_INTEGERKEY;
2611 meta->mm_dbs[0].md_root = P_INVALID;
2612 meta->mm_dbs[1].md_root = P_INVALID;
2614 p = calloc(2, psize);
2616 p->mp_flags = P_META;
2619 memcpy(m, meta, sizeof(*meta));
2621 q = (MDB_page *)((char *)p + psize);
2624 q->mp_flags = P_META;
2627 memcpy(m, meta, sizeof(*meta));
2632 SetFilePointer(env->me_fd, 0, NULL, FILE_BEGIN);
2633 rc = WriteFile(env->me_fd, p, psize * 2, &len, NULL);
2634 rc = (len == psize * 2) ? MDB_SUCCESS : ErrCode();
2637 lseek(env->me_fd, 0, SEEK_SET);
2638 rc = write(env->me_fd, p, psize * 2);
2639 rc = (rc == (int)psize * 2) ? MDB_SUCCESS : ErrCode();
2645 /** Update the environment info to commit a transaction.
2646 * @param[in] txn the transaction that's being committed
2647 * @return 0 on success, non-zero on failure.
2650 mdb_env_write_meta(MDB_txn *txn)
2653 MDB_meta meta, metab, *mp;
2655 int rc, len, toggle;
2662 assert(txn != NULL);
2663 assert(txn->mt_env != NULL);
2665 toggle = !txn->mt_toggle;
2666 DPRINTF("writing meta page %d for root page %zu",
2667 toggle, txn->mt_dbs[MAIN_DBI].md_root);
2670 mp = env->me_metas[toggle];
2672 if (env->me_flags & MDB_WRITEMAP) {
2673 /* Persist any increases of mapsize config */
2674 if (env->me_mapsize > mp->mm_mapsize)
2675 mp->mm_mapsize = env->me_mapsize;
2676 mp->mm_dbs[0] = txn->mt_dbs[0];
2677 mp->mm_dbs[1] = txn->mt_dbs[1];
2678 mp->mm_last_pg = txn->mt_next_pgno - 1;
2679 mp->mm_txnid = txn->mt_txnid;
2680 if (!(env->me_flags & (MDB_NOMETASYNC|MDB_NOSYNC))) {
2681 rc = (env->me_flags & MDB_MAPASYNC) ? MS_ASYNC : MS_SYNC;
2684 ptr += env->me_psize;
2685 if (MDB_MSYNC(ptr, env->me_psize, rc)) {
2692 metab.mm_txnid = env->me_metas[toggle]->mm_txnid;
2693 metab.mm_last_pg = env->me_metas[toggle]->mm_last_pg;
2695 ptr = (char *)&meta;
2696 if (env->me_mapsize > mp->mm_mapsize) {
2697 /* Persist any increases of mapsize config */
2698 meta.mm_mapsize = env->me_mapsize;
2699 off = offsetof(MDB_meta, mm_mapsize);
2701 off = offsetof(MDB_meta, mm_dbs[0].md_depth);
2703 len = sizeof(MDB_meta) - off;
2706 meta.mm_dbs[0] = txn->mt_dbs[0];
2707 meta.mm_dbs[1] = txn->mt_dbs[1];
2708 meta.mm_last_pg = txn->mt_next_pgno - 1;
2709 meta.mm_txnid = txn->mt_txnid;
2712 off += env->me_psize;
2715 /* Write to the SYNC fd */
2716 mfd = env->me_flags & (MDB_NOSYNC|MDB_NOMETASYNC) ?
2717 env->me_fd : env->me_mfd;
2720 memset(&ov, 0, sizeof(ov));
2722 WriteFile(mfd, ptr, len, (DWORD *)&rc, &ov);
2725 rc = pwrite(mfd, ptr, len, off);
2730 DPUTS("write failed, disk error?");
2731 /* On a failure, the pagecache still contains the new data.
2732 * Write some old data back, to prevent it from being used.
2733 * Use the non-SYNC fd; we know it will fail anyway.
2735 meta.mm_last_pg = metab.mm_last_pg;
2736 meta.mm_txnid = metab.mm_txnid;
2738 WriteFile(env->me_fd, ptr, len, NULL, &ov);
2740 r2 = pwrite(env->me_fd, ptr, len, off);
2743 env->me_flags |= MDB_FATAL_ERROR;
2747 /* Memory ordering issues are irrelevant; since the entire writer
2748 * is wrapped by wmutex, all of these changes will become visible
2749 * after the wmutex is unlocked. Since the DB is multi-version,
2750 * readers will get consistent data regardless of how fresh or
2751 * how stale their view of these values is.
2753 txn->mt_env->me_txns->mti_txnid = txn->mt_txnid;
2758 /** Check both meta pages to see which one is newer.
2759 * @param[in] env the environment handle
2760 * @return meta toggle (0 or 1).
2763 mdb_env_pick_meta(const MDB_env *env)
2765 return (env->me_metas[0]->mm_txnid < env->me_metas[1]->mm_txnid);
2769 mdb_env_create(MDB_env **env)
2773 e = calloc(1, sizeof(MDB_env));
2777 e->me_maxreaders = DEFAULT_READERS;
2778 e->me_maxdbs = e->me_numdbs = 2;
2779 e->me_fd = INVALID_HANDLE_VALUE;
2780 e->me_lfd = INVALID_HANDLE_VALUE;
2781 e->me_mfd = INVALID_HANDLE_VALUE;
2782 #ifdef MDB_USE_POSIX_SEM
2783 e->me_rmutex = SEM_FAILED;
2784 e->me_wmutex = SEM_FAILED;
2786 e->me_pid = getpid();
2787 VGMEMP_CREATE(e,0,0);
2793 mdb_env_set_mapsize(MDB_env *env, size_t size)
2797 env->me_mapsize = size;
2799 env->me_maxpg = env->me_mapsize / env->me_psize;
2804 mdb_env_set_maxdbs(MDB_env *env, MDB_dbi dbs)
2808 env->me_maxdbs = dbs + 2; /* Named databases + main and free DB */
2813 mdb_env_set_maxreaders(MDB_env *env, unsigned int readers)
2815 if (env->me_map || readers < 1)
2817 env->me_maxreaders = readers;
2822 mdb_env_get_maxreaders(MDB_env *env, unsigned int *readers)
2824 if (!env || !readers)
2826 *readers = env->me_maxreaders;
2830 /** Further setup required for opening an MDB environment
2833 mdb_env_open2(MDB_env *env)
2835 unsigned int flags = env->me_flags;
2836 int i, newenv = 0, prot;
2840 memset(&meta, 0, sizeof(meta));
2842 if ((i = mdb_env_read_header(env, &meta)) != 0) {
2845 DPUTS("new mdbenv");
2849 /* Was a mapsize configured? */
2850 if (!env->me_mapsize) {
2851 /* If this is a new environment, take the default,
2852 * else use the size recorded in the existing env.
2854 env->me_mapsize = newenv ? DEFAULT_MAPSIZE : meta.mm_mapsize;
2855 } else if (env->me_mapsize < meta.mm_mapsize) {
2856 /* If the configured size is smaller, make sure it's
2857 * still big enough. Silently round up to minimum if not.
2859 size_t minsize = (meta.mm_last_pg + 1) * meta.mm_psize;
2860 if (env->me_mapsize < minsize)
2861 env->me_mapsize = minsize;
2867 LONG sizelo, sizehi;
2868 sizelo = env->me_mapsize & 0xffffffff;
2869 sizehi = env->me_mapsize >> 16; /* pointless on WIN32, only needed on W64 */
2871 /* Windows won't create mappings for zero length files.
2872 * Just allocate the maxsize right now.
2875 SetFilePointer(env->me_fd, sizelo, sizehi ? &sizehi : NULL, 0);
2876 if (!SetEndOfFile(env->me_fd))
2878 SetFilePointer(env->me_fd, 0, NULL, 0);
2880 mh = CreateFileMapping(env->me_fd, NULL, flags & MDB_WRITEMAP ?
2881 PAGE_READWRITE : PAGE_READONLY,
2882 sizehi, sizelo, NULL);
2885 env->me_map = MapViewOfFileEx(mh, flags & MDB_WRITEMAP ?
2886 FILE_MAP_WRITE : FILE_MAP_READ,
2887 0, 0, env->me_mapsize, meta.mm_address);
2895 if (flags & MDB_WRITEMAP) {
2897 if (ftruncate(env->me_fd, env->me_mapsize) < 0)
2900 env->me_map = mmap(meta.mm_address, env->me_mapsize, prot, i,
2902 if (env->me_map == MAP_FAILED) {
2906 /* Turn off readahead. It's harmful when the DB is larger than RAM. */
2908 madvise(env->me_map, env->me_mapsize, MADV_RANDOM);
2910 #ifdef POSIX_MADV_RANDOM
2911 posix_madvise(env->me_map, env->me_mapsize, POSIX_MADV_RANDOM);
2912 #endif /* POSIX_MADV_RANDOM */
2913 #endif /* MADV_RANDOM */
2917 if (flags & MDB_FIXEDMAP)
2918 meta.mm_address = env->me_map;
2919 i = mdb_env_init_meta(env, &meta);
2920 if (i != MDB_SUCCESS) {
2923 } else if (meta.mm_address && env->me_map != meta.mm_address) {
2924 /* Can happen because the address argument to mmap() is just a
2925 * hint. mmap() can pick another, e.g. if the range is in use.
2926 * The MAP_FIXED flag would prevent that, but then mmap could
2927 * instead unmap existing pages to make room for the new map.
2929 return EBUSY; /* TODO: Make a new MDB_* error code? */
2931 env->me_psize = meta.mm_psize;
2932 env->me_maxfree_1pg = (env->me_psize - PAGEHDRSZ) / sizeof(pgno_t) - 1;
2933 env->me_nodemax = (env->me_psize - PAGEHDRSZ) / MDB_MINKEYS;
2935 env->me_maxpg = env->me_mapsize / env->me_psize;
2937 p = (MDB_page *)env->me_map;
2938 env->me_metas[0] = METADATA(p);
2939 env->me_metas[1] = (MDB_meta *)((char *)env->me_metas[0] + meta.mm_psize);
2943 int toggle = mdb_env_pick_meta(env);
2944 MDB_db *db = &env->me_metas[toggle]->mm_dbs[MAIN_DBI];
2946 DPRINTF("opened database version %u, pagesize %u",
2947 env->me_metas[0]->mm_version, env->me_psize);
2948 DPRINTF("using meta page %d", toggle);
2949 DPRINTF("depth: %u", db->md_depth);
2950 DPRINTF("entries: %zu", db->md_entries);
2951 DPRINTF("branch pages: %zu", db->md_branch_pages);
2952 DPRINTF("leaf pages: %zu", db->md_leaf_pages);
2953 DPRINTF("overflow pages: %zu", db->md_overflow_pages);
2954 DPRINTF("root: %zu", db->md_root);
2962 /** Release a reader thread's slot in the reader lock table.
2963 * This function is called automatically when a thread exits.
2964 * @param[in] ptr This points to the slot in the reader lock table.
2967 mdb_env_reader_dest(void *ptr)
2969 MDB_reader *reader = ptr;
2975 /** Junk for arranging thread-specific callbacks on Windows. This is
2976 * necessarily platform and compiler-specific. Windows supports up
2977 * to 1088 keys. Let's assume nobody opens more than 64 environments
2978 * in a single process, for now. They can override this if needed.
2980 #ifndef MAX_TLS_KEYS
2981 #define MAX_TLS_KEYS 64
2983 static pthread_key_t mdb_tls_keys[MAX_TLS_KEYS];
2984 static int mdb_tls_nkeys;
2986 static void NTAPI mdb_tls_callback(PVOID module, DWORD reason, PVOID ptr)
2990 case DLL_PROCESS_ATTACH: break;
2991 case DLL_THREAD_ATTACH: break;
2992 case DLL_THREAD_DETACH:
2993 for (i=0; i<mdb_tls_nkeys; i++) {
2994 MDB_reader *r = pthread_getspecific(mdb_tls_keys[i]);
2995 mdb_env_reader_dest(r);
2998 case DLL_PROCESS_DETACH: break;
3003 const PIMAGE_TLS_CALLBACK mdb_tls_cbp __attribute__((section (".CRT$XLB"))) = mdb_tls_callback;
3005 PIMAGE_TLS_CALLBACK mdb_tls_cbp __attribute__((section (".CRT$XLB"))) = mdb_tls_callback;
3009 /* Force some symbol references.
3010 * _tls_used forces the linker to create the TLS directory if not already done
3011 * mdb_tls_cbp prevents whole-program-optimizer from dropping the symbol.
3013 #pragma comment(linker, "/INCLUDE:_tls_used")
3014 #pragma comment(linker, "/INCLUDE:mdb_tls_cbp")
3015 #pragma const_seg(".CRT$XLB")
3016 extern const PIMAGE_TLS_CALLBACK mdb_tls_callback;
3017 const PIMAGE_TLS_CALLBACK mdb_tls_cbp = mdb_tls_callback;
3020 #pragma comment(linker, "/INCLUDE:__tls_used")
3021 #pragma comment(linker, "/INCLUDE:_mdb_tls_cbp")
3022 #pragma data_seg(".CRT$XLB")
3023 PIMAGE_TLS_CALLBACK mdb_tls_cbp = mdb_tls_callback;
3025 #endif /* WIN 32/64 */
3026 #endif /* !__GNUC__ */
3029 /** Downgrade the exclusive lock on the region back to shared */
3031 mdb_env_share_locks(MDB_env *env, int *excl)
3033 int rc = 0, toggle = mdb_env_pick_meta(env);
3035 env->me_txns->mti_txnid = env->me_metas[toggle]->mm_txnid;
3040 /* First acquire a shared lock. The Unlock will
3041 * then release the existing exclusive lock.
3043 memset(&ov, 0, sizeof(ov));
3044 if (!LockFileEx(env->me_lfd, 0, 0, 1, 0, &ov)) {
3047 UnlockFile(env->me_lfd, 0, 0, 1, 0);
3053 struct flock lock_info;
3054 /* The shared lock replaces the existing lock */
3055 memset((void *)&lock_info, 0, sizeof(lock_info));
3056 lock_info.l_type = F_RDLCK;
3057 lock_info.l_whence = SEEK_SET;
3058 lock_info.l_start = 0;
3059 lock_info.l_len = 1;
3060 while ((rc = fcntl(env->me_lfd, F_SETLK, &lock_info)) &&
3061 (rc = ErrCode()) == EINTR) ;
3062 *excl = rc ? -1 : 0; /* error may mean we lost the lock */
3069 /** Try to get exlusive lock, otherwise shared.
3070 * Maintain *excl = -1: no/unknown lock, 0: shared, 1: exclusive.
3073 mdb_env_excl_lock(MDB_env *env, int *excl)
3077 if (LockFile(env->me_lfd, 0, 0, 1, 0)) {
3081 memset(&ov, 0, sizeof(ov));
3082 if (LockFileEx(env->me_lfd, 0, 0, 1, 0, &ov)) {
3089 struct flock lock_info;
3090 memset((void *)&lock_info, 0, sizeof(lock_info));
3091 lock_info.l_type = F_WRLCK;
3092 lock_info.l_whence = SEEK_SET;
3093 lock_info.l_start = 0;
3094 lock_info.l_len = 1;
3095 while ((rc = fcntl(env->me_lfd, F_SETLK, &lock_info)) &&
3096 (rc = ErrCode()) == EINTR) ;
3100 # ifdef MDB_USE_POSIX_SEM
3101 if (*excl < 0) /* always true when !MDB_USE_POSIX_SEM */
3104 lock_info.l_type = F_RDLCK;
3105 while ((rc = fcntl(env->me_lfd, F_SETLKW, &lock_info)) &&
3106 (rc = ErrCode()) == EINTR) ;
3114 #if defined(_WIN32) || defined(MDB_USE_POSIX_SEM)
3116 * hash_64 - 64 bit Fowler/Noll/Vo-0 FNV-1a hash code
3118 * @(#) $Revision: 5.1 $
3119 * @(#) $Id: hash_64a.c,v 5.1 2009/06/30 09:01:38 chongo Exp $
3120 * @(#) $Source: /usr/local/src/cmd/fnv/RCS/hash_64a.c,v $
3122 * http://www.isthe.com/chongo/tech/comp/fnv/index.html
3126 * Please do not copyright this code. This code is in the public domain.
3128 * LANDON CURT NOLL DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
3129 * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO
3130 * EVENT SHALL LANDON CURT NOLL BE LIABLE FOR ANY SPECIAL, INDIRECT OR
3131 * CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF
3132 * USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
3133 * OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
3134 * PERFORMANCE OF THIS SOFTWARE.
3137 * chongo <Landon Curt Noll> /\oo/\
3138 * http://www.isthe.com/chongo/
3140 * Share and Enjoy! :-)
3143 typedef unsigned long long mdb_hash_t;
3144 #define MDB_HASH_INIT ((mdb_hash_t)0xcbf29ce484222325ULL)
3146 /** perform a 64 bit Fowler/Noll/Vo FNV-1a hash on a buffer
3147 * @param[in] str string to hash
3148 * @param[in] hval initial value for hash
3149 * @return 64 bit hash
3151 * NOTE: To use the recommended 64 bit FNV-1a hash, use MDB_HASH_INIT as the
3152 * hval arg on the first call.
3155 mdb_hash_val(MDB_val *val, mdb_hash_t hval)
3157 unsigned char *s = (unsigned char *)val->mv_data; /* unsigned string */
3158 unsigned char *end = s + val->mv_size;
3160 * FNV-1a hash each octet of the string
3163 /* xor the bottom with the current octet */
3164 hval ^= (mdb_hash_t)*s++;
3166 /* multiply by the 64 bit FNV magic prime mod 2^64 */
3167 hval += (hval << 1) + (hval << 4) + (hval << 5) +
3168 (hval << 7) + (hval << 8) + (hval << 40);
3170 /* return our new hash value */
3174 /** Hash the string and output the hash in hex.
3175 * @param[in] str string to hash
3176 * @param[out] hexbuf an array of 17 chars to hold the hash
3179 mdb_hash_hex(MDB_val *val, char *hexbuf)
3182 mdb_hash_t h = mdb_hash_val(val, MDB_HASH_INIT);
3183 for (i=0; i<8; i++) {
3184 hexbuf += sprintf(hexbuf, "%02x", (unsigned int)h & 0xff);
3190 /** Open and/or initialize the lock region for the environment.
3191 * @param[in] env The MDB environment.
3192 * @param[in] lpath The pathname of the file used for the lock region.
3193 * @param[in] mode The Unix permissions for the file, if we create it.
3194 * @param[out] excl Resulting file lock type: -1 none, 0 shared, 1 exclusive
3195 * @param[in,out] excl In -1, out lock type: -1 none, 0 shared, 1 exclusive
3196 * @return 0 on success, non-zero on failure.
3199 mdb_env_setup_locks(MDB_env *env, char *lpath, int mode, int *excl)
3202 # define MDB_ERRCODE_ROFS ERROR_WRITE_PROTECT
3204 # define MDB_ERRCODE_ROFS EROFS
3205 #ifdef O_CLOEXEC /* Linux: Open file and set FD_CLOEXEC atomically */
3206 # define MDB_CLOEXEC O_CLOEXEC
3209 # define MDB_CLOEXEC 0
3216 env->me_lfd = CreateFile(lpath, GENERIC_READ|GENERIC_WRITE,
3217 FILE_SHARE_READ|FILE_SHARE_WRITE, NULL, OPEN_ALWAYS,
3218 FILE_ATTRIBUTE_NORMAL, NULL);
3220 env->me_lfd = open(lpath, O_RDWR|O_CREAT|MDB_CLOEXEC, mode);
3222 if (env->me_lfd == INVALID_HANDLE_VALUE) {
3224 if (rc == MDB_ERRCODE_ROFS && (env->me_flags & MDB_RDONLY)) {
3229 #if ! ((MDB_CLOEXEC) || defined(_WIN32))
3230 /* Lose record locks when exec*() */
3231 if ((fdflags = fcntl(env->me_lfd, F_GETFD) | FD_CLOEXEC) >= 0)
3232 fcntl(env->me_lfd, F_SETFD, fdflags);
3236 rc = pthread_key_create(&env->me_txkey, mdb_env_reader_dest);
3239 env->me_flags |= MDB_ENV_TXKEY;
3241 /* Windows TLS callbacks need help finding their TLS info. */
3242 if (mdb_tls_nkeys >= MAX_TLS_KEYS) {
3246 mdb_tls_keys[mdb_tls_nkeys++] = env->me_txkey;
3250 /* Try to get exclusive lock. If we succeed, then
3251 * nobody is using the lock region and we should initialize it.
3253 if ((rc = mdb_env_excl_lock(env, excl))) goto fail;
3256 size = GetFileSize(env->me_lfd, NULL);
3258 size = lseek(env->me_lfd, 0, SEEK_END);
3260 rsize = (env->me_maxreaders-1) * sizeof(MDB_reader) + sizeof(MDB_txninfo);
3261 if (size < rsize && *excl > 0) {
3263 SetFilePointer(env->me_lfd, rsize, NULL, 0);
3264 if (!SetEndOfFile(env->me_lfd)) goto fail_errno;
3266 if (ftruncate(env->me_lfd, rsize) != 0) goto fail_errno;
3270 size = rsize - sizeof(MDB_txninfo);
3271 env->me_maxreaders = size/sizeof(MDB_reader) + 1;
3276 mh = CreateFileMapping(env->me_lfd, NULL, PAGE_READWRITE,
3278 if (!mh) goto fail_errno;
3279 env->me_txns = MapViewOfFileEx(mh, FILE_MAP_WRITE, 0, 0, rsize, NULL);
3281 if (!env->me_txns) goto fail_errno;
3283 void *m = mmap(NULL, rsize, PROT_READ|PROT_WRITE, MAP_SHARED,
3285 if (m == MAP_FAILED) goto fail_errno;
3291 BY_HANDLE_FILE_INFORMATION stbuf;
3300 if (!mdb_sec_inited) {
3301 InitializeSecurityDescriptor(&mdb_null_sd,
3302 SECURITY_DESCRIPTOR_REVISION);
3303 SetSecurityDescriptorDacl(&mdb_null_sd, TRUE, 0, FALSE);
3304 mdb_all_sa.nLength = sizeof(SECURITY_ATTRIBUTES);
3305 mdb_all_sa.bInheritHandle = FALSE;
3306 mdb_all_sa.lpSecurityDescriptor = &mdb_null_sd;
3309 if (!GetFileInformationByHandle(env->me_lfd, &stbuf)) goto fail_errno;
3310 idbuf.volume = stbuf.dwVolumeSerialNumber;
3311 idbuf.nhigh = stbuf.nFileIndexHigh;
3312 idbuf.nlow = stbuf.nFileIndexLow;
3313 val.mv_data = &idbuf;
3314 val.mv_size = sizeof(idbuf);
3315 mdb_hash_hex(&val, hexbuf);
3316 sprintf(env->me_txns->mti_rmname, "Global\\MDBr%s", hexbuf);
3317 sprintf(env->me_txns->mti_wmname, "Global\\MDBw%s", hexbuf);
3318 env->me_rmutex = CreateMutex(&mdb_all_sa, FALSE, env->me_txns->mti_rmname);
3319 if (!env->me_rmutex) goto fail_errno;
3320 env->me_wmutex = CreateMutex(&mdb_all_sa, FALSE, env->me_txns->mti_wmname);
3321 if (!env->me_wmutex) goto fail_errno;
3322 #elif defined(MDB_USE_POSIX_SEM)
3331 if (fstat(env->me_lfd, &stbuf)) goto fail_errno;
3332 idbuf.dev = stbuf.st_dev;
3333 idbuf.ino = stbuf.st_ino;
3334 val.mv_data = &idbuf;
3335 val.mv_size = sizeof(idbuf);
3336 mdb_hash_hex(&val, hexbuf);
3337 sprintf(env->me_txns->mti_rmname, "/MDBr%s", hexbuf);
3338 sprintf(env->me_txns->mti_wmname, "/MDBw%s", hexbuf);
3339 /* Clean up after a previous run, if needed: Try to
3340 * remove both semaphores before doing anything else.
3342 sem_unlink(env->me_txns->mti_rmname);
3343 sem_unlink(env->me_txns->mti_wmname);
3344 env->me_rmutex = sem_open(env->me_txns->mti_rmname,
3345 O_CREAT|O_EXCL, mode, 1);
3346 if (env->me_rmutex == SEM_FAILED) goto fail_errno;
3347 env->me_wmutex = sem_open(env->me_txns->mti_wmname,
3348 O_CREAT|O_EXCL, mode, 1);
3349 if (env->me_wmutex == SEM_FAILED) goto fail_errno;
3350 #else /* MDB_USE_POSIX_SEM */
3351 pthread_mutexattr_t mattr;
3353 if ((rc = pthread_mutexattr_init(&mattr))
3354 || (rc = pthread_mutexattr_setpshared(&mattr, PTHREAD_PROCESS_SHARED))
3355 || (rc = pthread_mutex_init(&env->me_txns->mti_mutex, &mattr))
3356 || (rc = pthread_mutex_init(&env->me_txns->mti_wmutex, &mattr)))
3358 pthread_mutexattr_destroy(&mattr);
3359 #endif /* _WIN32 || MDB_USE_POSIX_SEM */
3361 env->me_txns->mti_version = MDB_VERSION;
3362 env->me_txns->mti_magic = MDB_MAGIC;
3363 env->me_txns->mti_txnid = 0;
3364 env->me_txns->mti_numreaders = 0;
3367 if (env->me_txns->mti_magic != MDB_MAGIC) {
3368 DPUTS("lock region has invalid magic");
3372 if (env->me_txns->mti_version != MDB_VERSION) {
3373 DPRINTF("lock region is version %u, expected version %u",
3374 env->me_txns->mti_version, MDB_VERSION);
3375 rc = MDB_VERSION_MISMATCH;
3379 if (rc != EACCES && rc != EAGAIN) {
3383 env->me_rmutex = OpenMutex(SYNCHRONIZE, FALSE, env->me_txns->mti_rmname);
3384 if (!env->me_rmutex) goto fail_errno;
3385 env->me_wmutex = OpenMutex(SYNCHRONIZE, FALSE, env->me_txns->mti_wmname);
3386 if (!env->me_wmutex) goto fail_errno;
3387 #elif defined(MDB_USE_POSIX_SEM)
3388 env->me_rmutex = sem_open(env->me_txns->mti_rmname, 0);
3389 if (env->me_rmutex == SEM_FAILED) goto fail_errno;
3390 env->me_wmutex = sem_open(env->me_txns->mti_wmname, 0);
3391 if (env->me_wmutex == SEM_FAILED) goto fail_errno;
3402 /** The name of the lock file in the DB environment */
3403 #define LOCKNAME "/lock.mdb"
3404 /** The name of the data file in the DB environment */
3405 #define DATANAME "/data.mdb"
3406 /** The suffix of the lock file when no subdir is used */
3407 #define LOCKSUFF "-lock"
3408 /** Only a subset of the @ref mdb_env flags can be changed
3409 * at runtime. Changing other flags requires closing the
3410 * environment and re-opening it with the new flags.
3412 #define CHANGEABLE (MDB_NOSYNC|MDB_NOMETASYNC|MDB_MAPASYNC)
3413 #define CHANGELESS (MDB_FIXEDMAP|MDB_NOSUBDIR|MDB_RDONLY|MDB_WRITEMAP)
3416 mdb_env_open(MDB_env *env, const char *path, unsigned int flags, mdb_mode_t mode)
3418 int oflags, rc, len, excl = -1;
3419 char *lpath, *dpath;
3421 if (env->me_fd!=INVALID_HANDLE_VALUE || (flags & ~(CHANGEABLE|CHANGELESS)))
3425 if (flags & MDB_NOSUBDIR) {
3426 rc = len + sizeof(LOCKSUFF) + len + 1;
3428 rc = len + sizeof(LOCKNAME) + len + sizeof(DATANAME);
3433 if (flags & MDB_NOSUBDIR) {
3434 dpath = lpath + len + sizeof(LOCKSUFF);
3435 sprintf(lpath, "%s" LOCKSUFF, path);
3436 strcpy(dpath, path);
3438 dpath = lpath + len + sizeof(LOCKNAME);
3439 sprintf(lpath, "%s" LOCKNAME, path);
3440 sprintf(dpath, "%s" DATANAME, path);
3444 flags |= env->me_flags;
3445 if (flags & MDB_RDONLY) {
3446 /* silently ignore WRITEMAP when we're only getting read access */
3447 flags &= ~MDB_WRITEMAP;
3449 if (!((env->me_free_pgs = mdb_midl_alloc()) &&
3450 (env->me_dirty_list = calloc(MDB_IDL_UM_SIZE, sizeof(MDB_ID2)))))
3453 env->me_flags = flags |= MDB_ENV_ACTIVE;
3457 env->me_path = strdup(path);
3458 env->me_dbxs = calloc(env->me_maxdbs, sizeof(MDB_dbx));
3459 env->me_dbflags = calloc(env->me_maxdbs, sizeof(uint16_t));
3460 if (!(env->me_dbxs && env->me_path && env->me_dbflags)) {
3465 rc = mdb_env_setup_locks(env, lpath, mode, &excl);
3470 if (F_ISSET(flags, MDB_RDONLY)) {
3471 oflags = GENERIC_READ;
3472 len = OPEN_EXISTING;
3474 oflags = GENERIC_READ|GENERIC_WRITE;
3477 mode = FILE_ATTRIBUTE_NORMAL;
3478 env->me_fd = CreateFile(dpath, oflags, FILE_SHARE_READ|FILE_SHARE_WRITE,
3479 NULL, len, mode, NULL);
3481 if (F_ISSET(flags, MDB_RDONLY))
3484 oflags = O_RDWR | O_CREAT;
3486 env->me_fd = open(dpath, oflags, mode);
3488 if (env->me_fd == INVALID_HANDLE_VALUE) {
3493 if ((rc = mdb_env_open2(env)) == MDB_SUCCESS) {
3494 if (flags & (MDB_RDONLY|MDB_WRITEMAP)) {
3495 env->me_mfd = env->me_fd;
3497 /* Synchronous fd for meta writes. Needed even with
3498 * MDB_NOSYNC/MDB_NOMETASYNC, in case these get reset.
3501 env->me_mfd = CreateFile(dpath, oflags,
3502 FILE_SHARE_READ|FILE_SHARE_WRITE, NULL, len,
3503 mode | FILE_FLAG_WRITE_THROUGH, NULL);
3505 env->me_mfd = open(dpath, oflags | MDB_DSYNC, mode);
3507 if (env->me_mfd == INVALID_HANDLE_VALUE) {
3512 DPRINTF("opened dbenv %p", (void *) env);
3514 rc = mdb_env_share_locks(env, &excl);
3520 mdb_env_close0(env, excl);
3526 /** Destroy resources from mdb_env_open() and clear our readers */
3528 mdb_env_close0(MDB_env *env, int excl)
3532 if (!(env->me_flags & MDB_ENV_ACTIVE))
3535 free(env->me_dbflags);
3538 free(env->me_dirty_list);
3539 if (env->me_free_pgs)
3540 mdb_midl_free(env->me_free_pgs);
3542 if (env->me_flags & MDB_ENV_TXKEY) {
3543 pthread_key_delete(env->me_txkey);
3545 /* Delete our key from the global list */
3546 for (i=0; i<mdb_tls_nkeys; i++)
3547 if (mdb_tls_keys[i] == env->me_txkey) {
3548 mdb_tls_keys[i] = mdb_tls_keys[mdb_tls_nkeys-1];
3556 munmap(env->me_map, env->me_mapsize);
3558 if (env->me_mfd != env->me_fd && env->me_mfd != INVALID_HANDLE_VALUE)
3560 if (env->me_fd != INVALID_HANDLE_VALUE)
3563 pid_t pid = env->me_pid;
3564 /* Clearing readers is done in this function because
3565 * me_txkey with its destructor must be disabled first.
3567 for (i = env->me_numreaders; --i >= 0; )
3568 if (env->me_txns->mti_readers[i].mr_pid == pid)
3569 env->me_txns->mti_readers[i].mr_pid = 0;
3571 if (env->me_rmutex) {
3572 CloseHandle(env->me_rmutex);
3573 if (env->me_wmutex) CloseHandle(env->me_wmutex);
3575 /* Windows automatically destroys the mutexes when
3576 * the last handle closes.
3578 #elif defined(MDB_USE_POSIX_SEM)
3579 if (env->me_rmutex != SEM_FAILED) {
3580 sem_close(env->me_rmutex);
3581 if (env->me_wmutex != SEM_FAILED)
3582 sem_close(env->me_wmutex);
3583 /* If we have the filelock: If we are the
3584 * only remaining user, clean up semaphores.
3587 mdb_env_excl_lock(env, &excl);
3589 sem_unlink(env->me_txns->mti_rmname);
3590 sem_unlink(env->me_txns->mti_wmname);
3594 munmap((void *)env->me_txns, (env->me_maxreaders-1)*sizeof(MDB_reader)+sizeof(MDB_txninfo));
3596 if (env->me_lfd != INVALID_HANDLE_VALUE) {
3599 /* Unlock the lockfile. Windows would have unlocked it
3600 * after closing anyway, but not necessarily at once.
3602 UnlockFile(env->me_lfd, 0, 0, 1, 0);
3608 env->me_flags &= ~(MDB_ENV_ACTIVE|MDB_ENV_TXKEY);
3612 mdb_env_copy(MDB_env *env, const char *path)
3614 MDB_txn *txn = NULL;
3618 HANDLE newfd = INVALID_HANDLE_VALUE;
3620 if (env->me_flags & MDB_NOSUBDIR) {
3621 lpath = (char *)path;
3624 len += sizeof(DATANAME);
3625 lpath = malloc(len);
3628 sprintf(lpath, "%s" DATANAME, path);
3631 /* The destination path must exist, but the destination file must not.
3632 * We don't want the OS to cache the writes, since the source data is
3633 * already in the OS cache.
3636 newfd = CreateFile(lpath, GENERIC_WRITE, 0, NULL, CREATE_NEW,
3637 FILE_FLAG_NO_BUFFERING|FILE_FLAG_WRITE_THROUGH, NULL);
3639 newfd = open(lpath, O_WRONLY|O_CREAT|O_EXCL
3645 if (!(env->me_flags & MDB_NOSUBDIR))
3647 if (newfd == INVALID_HANDLE_VALUE) {
3652 #ifdef F_NOCACHE /* __APPLE__ */
3653 rc = fcntl(newfd, F_NOCACHE, 1);
3660 /* Do the lock/unlock of the reader mutex before starting the
3661 * write txn. Otherwise other read txns could block writers.
3663 rc = mdb_txn_begin(env, NULL, MDB_RDONLY, &txn);
3668 /* We must start the actual read txn after blocking writers */
3669 mdb_txn_reset0(txn);
3671 /* Temporarily block writers until we snapshot the meta pages */
3674 rc = mdb_txn_renew0(txn);
3676 UNLOCK_MUTEX_W(env);
3681 wsize = env->me_psize * 2;
3685 rc = WriteFile(newfd, env->me_map, wsize, &len, NULL);
3686 rc = (len == wsize) ? MDB_SUCCESS : ErrCode();
3689 rc = write(newfd, env->me_map, wsize);
3690 rc = (rc == (int)wsize) ? MDB_SUCCESS : ErrCode();
3693 UNLOCK_MUTEX_W(env);
3698 ptr = env->me_map + wsize;
3699 wsize = txn->mt_next_pgno * env->me_psize - wsize;
3700 #define MAX_WRITE 2147483648U
3704 if (wsize > MAX_WRITE)
3708 rc = WriteFile(newfd, ptr, w2, &len, NULL);
3709 rc = (len == w2) ? MDB_SUCCESS : ErrCode();
3718 if (wsize > MAX_WRITE)
3722 wres = write(newfd, ptr, w2);
3723 rc = (wres > 0) ? MDB_SUCCESS : ErrCode();
3732 if (newfd != INVALID_HANDLE_VALUE)
3739 mdb_env_close(MDB_env *env)
3747 for (i = env->me_numdbs; --i > MAIN_DBI; )
3748 free(env->me_dbxs[i].md_name.mv_data);
3750 VGMEMP_DESTROY(env);
3751 while ((dp = env->me_dpages) != NULL) {
3752 VGMEMP_DEFINED(&dp->mp_next, sizeof(dp->mp_next));
3753 env->me_dpages = dp->mp_next;
3757 mdb_env_close0(env, 0);
3761 /** Compare two items pointing at aligned size_t's */
3763 mdb_cmp_long(const MDB_val *a, const MDB_val *b)
3765 return (*(size_t *)a->mv_data < *(size_t *)b->mv_data) ? -1 :
3766 *(size_t *)a->mv_data > *(size_t *)b->mv_data;
3769 /** Compare two items pointing at aligned int's */
3771 mdb_cmp_int(const MDB_val *a, const MDB_val *b)
3773 return (*(unsigned int *)a->mv_data < *(unsigned int *)b->mv_data) ? -1 :
3774 *(unsigned int *)a->mv_data > *(unsigned int *)b->mv_data;
3777 /** Compare two items pointing at ints of unknown alignment.
3778 * Nodes and keys are guaranteed to be 2-byte aligned.
3781 mdb_cmp_cint(const MDB_val *a, const MDB_val *b)
3783 #if BYTE_ORDER == LITTLE_ENDIAN
3784 unsigned short *u, *c;
3787 u = (unsigned short *) ((char *) a->mv_data + a->mv_size);
3788 c = (unsigned short *) ((char *) b->mv_data + a->mv_size);
3791 } while(!x && u > (unsigned short *)a->mv_data);
3794 return memcmp(a->mv_data, b->mv_data, a->mv_size);
3798 /** Compare two items lexically */
3800 mdb_cmp_memn(const MDB_val *a, const MDB_val *b)
3807 len_diff = (ssize_t) a->mv_size - (ssize_t) b->mv_size;
3813 diff = memcmp(a->mv_data, b->mv_data, len);
3814 return diff ? diff : len_diff<0 ? -1 : len_diff;
3817 /** Compare two items in reverse byte order */
3819 mdb_cmp_memnr(const MDB_val *a, const MDB_val *b)
3821 const unsigned char *p1, *p2, *p1_lim;
3825 p1_lim = (const unsigned char *)a->mv_data;
3826 p1 = (const unsigned char *)a->mv_data + a->mv_size;
3827 p2 = (const unsigned char *)b->mv_data + b->mv_size;
3829 len_diff = (ssize_t) a->mv_size - (ssize_t) b->mv_size;
3835 while (p1 > p1_lim) {
3836 diff = *--p1 - *--p2;
3840 return len_diff<0 ? -1 : len_diff;
3843 /** Search for key within a page, using binary search.
3844 * Returns the smallest entry larger or equal to the key.
3845 * If exactp is non-null, stores whether the found entry was an exact match
3846 * in *exactp (1 or 0).
3847 * Updates the cursor index with the index of the found entry.
3848 * If no entry larger or equal to the key is found, returns NULL.
3851 mdb_node_search(MDB_cursor *mc, MDB_val *key, int *exactp)
3853 unsigned int i = 0, nkeys;
3856 MDB_page *mp = mc->mc_pg[mc->mc_top];
3857 MDB_node *node = NULL;
3862 nkeys = NUMKEYS(mp);
3867 COPY_PGNO(pgno, mp->mp_pgno);
3868 DPRINTF("searching %u keys in %s %spage %zu",
3869 nkeys, IS_LEAF(mp) ? "leaf" : "branch", IS_SUBP(mp) ? "sub-" : "",
3876 low = IS_LEAF(mp) ? 0 : 1;
3878 cmp = mc->mc_dbx->md_cmp;
3880 /* Branch pages have no data, so if using integer keys,
3881 * alignment is guaranteed. Use faster mdb_cmp_int.
3883 if (cmp == mdb_cmp_cint && IS_BRANCH(mp)) {
3884 if (NODEPTR(mp, 1)->mn_ksize == sizeof(size_t))
3891 nodekey.mv_size = mc->mc_db->md_pad;
3892 node = NODEPTR(mp, 0); /* fake */
3893 while (low <= high) {
3894 i = (low + high) >> 1;
3895 nodekey.mv_data = LEAF2KEY(mp, i, nodekey.mv_size);
3896 rc = cmp(key, &nodekey);
3897 DPRINTF("found leaf index %u [%s], rc = %i",
3898 i, DKEY(&nodekey), rc);
3907 while (low <= high) {
3908 i = (low + high) >> 1;
3910 node = NODEPTR(mp, i);
3911 nodekey.mv_size = NODEKSZ(node);
3912 nodekey.mv_data = NODEKEY(node);
3914 rc = cmp(key, &nodekey);
3917 DPRINTF("found leaf index %u [%s], rc = %i",
3918 i, DKEY(&nodekey), rc);
3920 DPRINTF("found branch index %u [%s -> %zu], rc = %i",
3921 i, DKEY(&nodekey), NODEPGNO(node), rc);
3932 if (rc > 0) { /* Found entry is less than the key. */
3933 i++; /* Skip to get the smallest entry larger than key. */
3935 node = NODEPTR(mp, i);
3938 *exactp = (rc == 0);
3939 /* store the key index */
3940 mc->mc_ki[mc->mc_top] = i;
3942 /* There is no entry larger or equal to the key. */
3945 /* nodeptr is fake for LEAF2 */
3951 mdb_cursor_adjust(MDB_cursor *mc, func)
3955 for (m2 = mc->mc_txn->mt_cursors[mc->mc_dbi]; m2; m2=m2->mc_next) {
3956 if (m2->mc_pg[m2->mc_top] == mc->mc_pg[mc->mc_top]) {
3963 /** Pop a page off the top of the cursor's stack. */
3965 mdb_cursor_pop(MDB_cursor *mc)
3968 #ifndef MDB_DEBUG_SKIP
3969 MDB_page *top = mc->mc_pg[mc->mc_top];
3975 DPRINTF("popped page %zu off db %u cursor %p", top->mp_pgno,
3976 mc->mc_dbi, (void *) mc);
3980 /** Push a page onto the top of the cursor's stack. */
3982 mdb_cursor_push(MDB_cursor *mc, MDB_page *mp)
3984 DPRINTF("pushing page %zu on db %u cursor %p", mp->mp_pgno,
3985 mc->mc_dbi, (void *) mc);
3987 if (mc->mc_snum >= CURSOR_STACK) {
3988 assert(mc->mc_snum < CURSOR_STACK);
3989 return MDB_CURSOR_FULL;
3992 mc->mc_top = mc->mc_snum++;
3993 mc->mc_pg[mc->mc_top] = mp;
3994 mc->mc_ki[mc->mc_top] = 0;
3999 /** Find the address of the page corresponding to a given page number.
4000 * @param[in] txn the transaction for this access.
4001 * @param[in] pgno the page number for the page to retrieve.
4002 * @param[out] ret address of a pointer where the page's address will be stored.
4003 * @return 0 on success, non-zero on failure.
4006 mdb_page_get(MDB_txn *txn, pgno_t pgno, MDB_page **ret)
4010 if (!((txn->mt_flags & MDB_TXN_RDONLY) |
4011 (txn->mt_env->me_flags & MDB_WRITEMAP)))
4015 MDB_ID2L dl = tx2->mt_u.dirty_list;
4017 unsigned x = mdb_mid2l_search(dl, pgno);
4018 if (x <= dl[0].mid && dl[x].mid == pgno) {
4023 } while ((tx2 = tx2->mt_parent) != NULL);
4026 if (pgno < txn->mt_next_pgno) {
4027 p = (MDB_page *)(txn->mt_env->me_map + txn->mt_env->me_psize * pgno);
4029 DPRINTF("page %zu not found", pgno);
4035 return (p != NULL) ? MDB_SUCCESS : MDB_PAGE_NOTFOUND;
4038 /** Search for the page a given key should be in.
4039 * Pushes parent pages on the cursor stack. This function continues a
4040 * search on a cursor that has already been initialized. (Usually by
4041 * #mdb_page_search() but also by #mdb_node_move().)
4042 * @param[in,out] mc the cursor for this operation.
4043 * @param[in] key the key to search for. If NULL, search for the lowest
4044 * page. (This is used by #mdb_cursor_first().)
4045 * @param[in] flags If MDB_PS_MODIFY set, visited pages are updated with new page numbers.
4046 * If MDB_PS_ROOTONLY set, just fetch root node, no further lookups.
4047 * @return 0 on success, non-zero on failure.
4050 mdb_page_search_root(MDB_cursor *mc, MDB_val *key, int modify)
4052 MDB_page *mp = mc->mc_pg[mc->mc_top];
4057 while (IS_BRANCH(mp)) {
4061 DPRINTF("branch page %zu has %u keys", mp->mp_pgno, NUMKEYS(mp));
4062 assert(NUMKEYS(mp) > 1);
4063 DPRINTF("found index 0 to page %zu", NODEPGNO(NODEPTR(mp, 0)));
4065 if (key == NULL) /* Initialize cursor to first page. */
4067 else if (key->mv_size > MDB_MAXKEYSIZE && key->mv_data == NULL) {
4068 /* cursor to last page */
4072 node = mdb_node_search(mc, key, &exact);
4074 i = NUMKEYS(mp) - 1;
4076 i = mc->mc_ki[mc->mc_top];
4085 DPRINTF("following index %u for key [%s]",
4087 assert(i < NUMKEYS(mp));
4088 node = NODEPTR(mp, i);
4090 if ((rc = mdb_page_get(mc->mc_txn, NODEPGNO(node), &mp)))
4093 mc->mc_ki[mc->mc_top] = i;
4094 if ((rc = mdb_cursor_push(mc, mp)))
4098 if ((rc = mdb_page_touch(mc)) != 0)
4100 mp = mc->mc_pg[mc->mc_top];
4105 DPRINTF("internal error, index points to a %02X page!?",
4107 return MDB_CORRUPTED;
4110 DPRINTF("found leaf page %zu for key [%s]", mp->mp_pgno,
4111 key ? DKEY(key) : NULL);
4116 /** Search for the page a given key should be in.
4117 * Pushes parent pages on the cursor stack. This function just sets up
4118 * the search; it finds the root page for \b mc's database and sets this
4119 * as the root of the cursor's stack. Then #mdb_page_search_root() is
4120 * called to complete the search.
4121 * @param[in,out] mc the cursor for this operation.
4122 * @param[in] key the key to search for. If NULL, search for the lowest
4123 * page. (This is used by #mdb_cursor_first().)
4124 * @param[in] modify If true, visited pages are updated with new page numbers.
4125 * @return 0 on success, non-zero on failure.
4128 mdb_page_search(MDB_cursor *mc, MDB_val *key, int flags)
4133 /* Make sure the txn is still viable, then find the root from
4134 * the txn's db table.
4136 if (F_ISSET(mc->mc_txn->mt_flags, MDB_TXN_ERROR)) {
4137 DPUTS("transaction has failed, must abort");
4140 /* Make sure we're using an up-to-date root */
4141 if (mc->mc_dbi > MAIN_DBI) {
4142 if ((*mc->mc_dbflag & DB_STALE) ||
4143 ((flags & MDB_PS_MODIFY) && !(*mc->mc_dbflag & DB_DIRTY))) {
4145 unsigned char dbflag = 0;
4146 mdb_cursor_init(&mc2, mc->mc_txn, MAIN_DBI, NULL);
4147 rc = mdb_page_search(&mc2, &mc->mc_dbx->md_name, flags & MDB_PS_MODIFY);
4150 if (*mc->mc_dbflag & DB_STALE) {
4154 MDB_node *leaf = mdb_node_search(&mc2,
4155 &mc->mc_dbx->md_name, &exact);
4157 return MDB_NOTFOUND;
4158 mdb_node_read(mc->mc_txn, leaf, &data);
4159 memcpy(&flags, ((char *) data.mv_data + offsetof(MDB_db, md_flags)),
4161 /* The txn may not know this DBI, or another process may
4162 * have dropped and recreated the DB with other flags.
4164 if ((mc->mc_db->md_flags & PERSISTENT_FLAGS) != flags)
4165 return MDB_INCOMPATIBLE;
4166 memcpy(mc->mc_db, data.mv_data, sizeof(MDB_db));
4168 if (flags & MDB_PS_MODIFY)
4170 *mc->mc_dbflag &= ~DB_STALE;
4171 *mc->mc_dbflag |= dbflag;
4174 root = mc->mc_db->md_root;
4176 if (root == P_INVALID) { /* Tree is empty. */
4177 DPUTS("tree is empty");
4178 return MDB_NOTFOUND;
4183 if (!mc->mc_pg[0] || mc->mc_pg[0]->mp_pgno != root)
4184 if ((rc = mdb_page_get(mc->mc_txn, root, &mc->mc_pg[0])))
4190 DPRINTF("db %u root page %zu has flags 0x%X",
4191 mc->mc_dbi, root, mc->mc_pg[0]->mp_flags);
4193 if (flags & MDB_PS_MODIFY) {
4194 if ((rc = mdb_page_touch(mc)))
4198 if (flags & MDB_PS_ROOTONLY)
4201 return mdb_page_search_root(mc, key, flags);
4204 /** Return the data associated with a given node.
4205 * @param[in] txn The transaction for this operation.
4206 * @param[in] leaf The node being read.
4207 * @param[out] data Updated to point to the node's data.
4208 * @return 0 on success, non-zero on failure.
4211 mdb_node_read(MDB_txn *txn, MDB_node *leaf, MDB_val *data)
4213 MDB_page *omp; /* overflow page */
4217 if (!F_ISSET(leaf->mn_flags, F_BIGDATA)) {
4218 data->mv_size = NODEDSZ(leaf);
4219 data->mv_data = NODEDATA(leaf);
4223 /* Read overflow data.
4225 data->mv_size = NODEDSZ(leaf);
4226 memcpy(&pgno, NODEDATA(leaf), sizeof(pgno));
4227 if ((rc = mdb_page_get(txn, pgno, &omp))) {
4228 DPRINTF("read overflow page %zu failed", pgno);
4231 data->mv_data = METADATA(omp);
4237 mdb_get(MDB_txn *txn, MDB_dbi dbi,
4238 MDB_val *key, MDB_val *data)
4247 DPRINTF("===> get db %u key [%s]", dbi, DKEY(key));
4249 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs || !(txn->mt_dbflags[dbi] & DB_VALID))
4252 if (key->mv_size == 0 || key->mv_size > MDB_MAXKEYSIZE) {
4256 mdb_cursor_init(&mc, txn, dbi, &mx);
4257 return mdb_cursor_set(&mc, key, data, MDB_SET, &exact);
4260 /** Find a sibling for a page.
4261 * Replaces the page at the top of the cursor's stack with the
4262 * specified sibling, if one exists.
4263 * @param[in] mc The cursor for this operation.
4264 * @param[in] move_right Non-zero if the right sibling is requested,
4265 * otherwise the left sibling.
4266 * @return 0 on success, non-zero on failure.
4269 mdb_cursor_sibling(MDB_cursor *mc, int move_right)
4275 if (mc->mc_snum < 2) {
4276 return MDB_NOTFOUND; /* root has no siblings */
4280 DPRINTF("parent page is page %zu, index %u",
4281 mc->mc_pg[mc->mc_top]->mp_pgno, mc->mc_ki[mc->mc_top]);
4283 if (move_right ? (mc->mc_ki[mc->mc_top] + 1u >= NUMKEYS(mc->mc_pg[mc->mc_top]))
4284 : (mc->mc_ki[mc->mc_top] == 0)) {
4285 DPRINTF("no more keys left, moving to %s sibling",
4286 move_right ? "right" : "left");
4287 if ((rc = mdb_cursor_sibling(mc, move_right)) != MDB_SUCCESS) {
4288 /* undo cursor_pop before returning */
4295 mc->mc_ki[mc->mc_top]++;
4297 mc->mc_ki[mc->mc_top]--;
4298 DPRINTF("just moving to %s index key %u",
4299 move_right ? "right" : "left", mc->mc_ki[mc->mc_top]);
4301 assert(IS_BRANCH(mc->mc_pg[mc->mc_top]));
4303 indx = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
4304 if ((rc = mdb_page_get(mc->mc_txn, NODEPGNO(indx), &mp)))
4307 mdb_cursor_push(mc, mp);
4309 mc->mc_ki[mc->mc_top] = NUMKEYS(mp)-1;
4314 /** Move the cursor to the next data item. */
4316 mdb_cursor_next(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op)
4322 if (mc->mc_flags & C_EOF) {
4323 return MDB_NOTFOUND;
4326 assert(mc->mc_flags & C_INITIALIZED);
4328 mp = mc->mc_pg[mc->mc_top];
4330 if (mc->mc_db->md_flags & MDB_DUPSORT) {
4331 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
4332 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4333 if (op == MDB_NEXT || op == MDB_NEXT_DUP) {
4334 rc = mdb_cursor_next(&mc->mc_xcursor->mx_cursor, data, NULL, MDB_NEXT);
4335 if (op != MDB_NEXT || rc == MDB_SUCCESS)
4339 mc->mc_xcursor->mx_cursor.mc_flags &= ~C_INITIALIZED;
4340 if (op == MDB_NEXT_DUP)
4341 return MDB_NOTFOUND;
4345 DPRINTF("cursor_next: top page is %zu in cursor %p", mp->mp_pgno, (void *) mc);
4347 if (mc->mc_ki[mc->mc_top] + 1u >= NUMKEYS(mp)) {
4348 DPUTS("=====> move to next sibling page");
4349 if (mdb_cursor_sibling(mc, 1) != MDB_SUCCESS) {
4350 mc->mc_flags |= C_EOF;
4351 mc->mc_flags &= ~C_INITIALIZED;
4352 return MDB_NOTFOUND;
4354 mp = mc->mc_pg[mc->mc_top];
4355 DPRINTF("next page is %zu, key index %u", mp->mp_pgno, mc->mc_ki[mc->mc_top]);
4357 mc->mc_ki[mc->mc_top]++;
4359 DPRINTF("==> cursor points to page %zu with %u keys, key index %u",
4360 mp->mp_pgno, NUMKEYS(mp), mc->mc_ki[mc->mc_top]);
4363 key->mv_size = mc->mc_db->md_pad;
4364 key->mv_data = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], key->mv_size);
4368 assert(IS_LEAF(mp));
4369 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
4371 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4372 mdb_xcursor_init1(mc, leaf);
4375 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
4378 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4379 rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
4380 if (rc != MDB_SUCCESS)
4385 MDB_GET_KEY(leaf, key);
4389 /** Move the cursor to the previous data item. */
4391 mdb_cursor_prev(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op)
4397 assert(mc->mc_flags & C_INITIALIZED);
4399 mp = mc->mc_pg[mc->mc_top];
4401 if (mc->mc_db->md_flags & MDB_DUPSORT) {
4402 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
4403 if (op == MDB_PREV || op == MDB_PREV_DUP) {
4404 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4405 rc = mdb_cursor_prev(&mc->mc_xcursor->mx_cursor, data, NULL, MDB_PREV);
4406 if (op != MDB_PREV || rc == MDB_SUCCESS)
4409 mc->mc_xcursor->mx_cursor.mc_flags &= ~C_INITIALIZED;
4410 if (op == MDB_PREV_DUP)
4411 return MDB_NOTFOUND;
4416 DPRINTF("cursor_prev: top page is %zu in cursor %p", mp->mp_pgno, (void *) mc);
4418 if (mc->mc_ki[mc->mc_top] == 0) {
4419 DPUTS("=====> move to prev sibling page");
4420 if (mdb_cursor_sibling(mc, 0) != MDB_SUCCESS) {
4421 mc->mc_flags &= ~C_INITIALIZED;
4422 return MDB_NOTFOUND;
4424 mp = mc->mc_pg[mc->mc_top];
4425 mc->mc_ki[mc->mc_top] = NUMKEYS(mp) - 1;
4426 DPRINTF("prev page is %zu, key index %u", mp->mp_pgno, mc->mc_ki[mc->mc_top]);
4428 mc->mc_ki[mc->mc_top]--;
4430 mc->mc_flags &= ~C_EOF;
4432 DPRINTF("==> cursor points to page %zu with %u keys, key index %u",
4433 mp->mp_pgno, NUMKEYS(mp), mc->mc_ki[mc->mc_top]);
4436 key->mv_size = mc->mc_db->md_pad;
4437 key->mv_data = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], key->mv_size);
4441 assert(IS_LEAF(mp));
4442 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
4444 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4445 mdb_xcursor_init1(mc, leaf);
4448 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
4451 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4452 rc = mdb_cursor_last(&mc->mc_xcursor->mx_cursor, data, NULL);
4453 if (rc != MDB_SUCCESS)
4458 MDB_GET_KEY(leaf, key);
4462 /** Set the cursor on a specific data item. */
4464 mdb_cursor_set(MDB_cursor *mc, MDB_val *key, MDB_val *data,
4465 MDB_cursor_op op, int *exactp)
4469 MDB_node *leaf = NULL;
4474 assert(key->mv_size > 0);
4476 /* See if we're already on the right page */
4477 if (mc->mc_flags & C_INITIALIZED) {
4480 mp = mc->mc_pg[mc->mc_top];
4482 mc->mc_ki[mc->mc_top] = 0;
4483 return MDB_NOTFOUND;
4485 if (mp->mp_flags & P_LEAF2) {
4486 nodekey.mv_size = mc->mc_db->md_pad;
4487 nodekey.mv_data = LEAF2KEY(mp, 0, nodekey.mv_size);
4489 leaf = NODEPTR(mp, 0);
4490 MDB_GET_KEY(leaf, &nodekey);
4492 rc = mc->mc_dbx->md_cmp(key, &nodekey);
4494 /* Probably happens rarely, but first node on the page
4495 * was the one we wanted.
4497 mc->mc_ki[mc->mc_top] = 0;
4504 unsigned int nkeys = NUMKEYS(mp);
4506 if (mp->mp_flags & P_LEAF2) {
4507 nodekey.mv_data = LEAF2KEY(mp,
4508 nkeys-1, nodekey.mv_size);
4510 leaf = NODEPTR(mp, nkeys-1);
4511 MDB_GET_KEY(leaf, &nodekey);
4513 rc = mc->mc_dbx->md_cmp(key, &nodekey);
4515 /* last node was the one we wanted */
4516 mc->mc_ki[mc->mc_top] = nkeys-1;
4522 if (mc->mc_ki[mc->mc_top] < NUMKEYS(mp)) {
4523 /* This is definitely the right page, skip search_page */
4524 if (mp->mp_flags & P_LEAF2) {
4525 nodekey.mv_data = LEAF2KEY(mp,
4526 mc->mc_ki[mc->mc_top], nodekey.mv_size);
4528 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
4529 MDB_GET_KEY(leaf, &nodekey);
4531 rc = mc->mc_dbx->md_cmp(key, &nodekey);
4533 /* current node was the one we wanted */
4543 /* If any parents have right-sibs, search.
4544 * Otherwise, there's nothing further.
4546 for (i=0; i<mc->mc_top; i++)
4548 NUMKEYS(mc->mc_pg[i])-1)
4550 if (i == mc->mc_top) {
4551 /* There are no other pages */
4552 mc->mc_ki[mc->mc_top] = nkeys;
4553 return MDB_NOTFOUND;
4557 /* There are no other pages */
4558 mc->mc_ki[mc->mc_top] = 0;
4559 return MDB_NOTFOUND;
4563 rc = mdb_page_search(mc, key, 0);
4564 if (rc != MDB_SUCCESS)
4567 mp = mc->mc_pg[mc->mc_top];
4568 assert(IS_LEAF(mp));
4571 leaf = mdb_node_search(mc, key, exactp);
4572 if (exactp != NULL && !*exactp) {
4573 /* MDB_SET specified and not an exact match. */
4574 return MDB_NOTFOUND;
4578 DPUTS("===> inexact leaf not found, goto sibling");
4579 if ((rc = mdb_cursor_sibling(mc, 1)) != MDB_SUCCESS)
4580 return rc; /* no entries matched */
4581 mp = mc->mc_pg[mc->mc_top];
4582 assert(IS_LEAF(mp));
4583 leaf = NODEPTR(mp, 0);
4587 mc->mc_flags |= C_INITIALIZED;
4588 mc->mc_flags &= ~C_EOF;
4591 key->mv_size = mc->mc_db->md_pad;
4592 key->mv_data = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], key->mv_size);
4596 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4597 mdb_xcursor_init1(mc, leaf);
4600 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4601 if (op == MDB_SET || op == MDB_SET_KEY || op == MDB_SET_RANGE) {
4602 rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
4605 if (op == MDB_GET_BOTH) {
4611 rc = mdb_cursor_set(&mc->mc_xcursor->mx_cursor, data, NULL, MDB_SET_RANGE, ex2p);
4612 if (rc != MDB_SUCCESS)
4615 } else if (op == MDB_GET_BOTH || op == MDB_GET_BOTH_RANGE) {
4617 if ((rc = mdb_node_read(mc->mc_txn, leaf, &d2)) != MDB_SUCCESS)
4619 rc = mc->mc_dbx->md_dcmp(data, &d2);
4621 if (op == MDB_GET_BOTH || rc > 0)
4622 return MDB_NOTFOUND;
4627 mc->mc_xcursor->mx_cursor.mc_flags &= ~C_INITIALIZED;
4628 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
4633 /* The key already matches in all other cases */
4634 if (op == MDB_SET_RANGE || op == MDB_SET_KEY)
4635 MDB_GET_KEY(leaf, key);
4636 DPRINTF("==> cursor placed on key [%s]", DKEY(key));
4641 /** Move the cursor to the first item in the database. */
4643 mdb_cursor_first(MDB_cursor *mc, MDB_val *key, MDB_val *data)
4648 if (!(mc->mc_flags & C_INITIALIZED) || mc->mc_top) {
4649 rc = mdb_page_search(mc, NULL, 0);
4650 if (rc != MDB_SUCCESS)
4653 assert(IS_LEAF(mc->mc_pg[mc->mc_top]));
4655 leaf = NODEPTR(mc->mc_pg[mc->mc_top], 0);
4656 mc->mc_flags |= C_INITIALIZED;
4657 mc->mc_flags &= ~C_EOF;
4659 mc->mc_ki[mc->mc_top] = 0;
4661 if (IS_LEAF2(mc->mc_pg[mc->mc_top])) {
4662 key->mv_size = mc->mc_db->md_pad;
4663 key->mv_data = LEAF2KEY(mc->mc_pg[mc->mc_top], 0, key->mv_size);
4668 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4669 mdb_xcursor_init1(mc, leaf);
4670 rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
4675 mc->mc_xcursor->mx_cursor.mc_flags &= ~C_INITIALIZED;
4676 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
4680 MDB_GET_KEY(leaf, key);
4684 /** Move the cursor to the last item in the database. */
4686 mdb_cursor_last(MDB_cursor *mc, MDB_val *key, MDB_val *data)
4691 if (!(mc->mc_flags & C_EOF)) {
4693 if (!(mc->mc_flags & C_INITIALIZED) || mc->mc_top) {
4696 lkey.mv_size = MDB_MAXKEYSIZE+1;
4697 lkey.mv_data = NULL;
4698 rc = mdb_page_search(mc, &lkey, 0);
4699 if (rc != MDB_SUCCESS)
4702 assert(IS_LEAF(mc->mc_pg[mc->mc_top]));
4704 mc->mc_ki[mc->mc_top] = NUMKEYS(mc->mc_pg[mc->mc_top]) - 1;
4706 mc->mc_flags |= C_INITIALIZED|C_EOF;
4707 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
4709 if (IS_LEAF2(mc->mc_pg[mc->mc_top])) {
4710 key->mv_size = mc->mc_db->md_pad;
4711 key->mv_data = LEAF2KEY(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], key->mv_size);
4716 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4717 mdb_xcursor_init1(mc, leaf);
4718 rc = mdb_cursor_last(&mc->mc_xcursor->mx_cursor, data, NULL);
4723 mc->mc_xcursor->mx_cursor.mc_flags &= ~C_INITIALIZED;
4724 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
4729 MDB_GET_KEY(leaf, key);
4734 mdb_cursor_get(MDB_cursor *mc, MDB_val *key, MDB_val *data,
4743 case MDB_GET_CURRENT:
4744 if (!(mc->mc_flags & C_INITIALIZED)) {
4747 MDB_page *mp = mc->mc_pg[mc->mc_top];
4749 mc->mc_ki[mc->mc_top] = 0;
4755 key->mv_size = mc->mc_db->md_pad;
4756 key->mv_data = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], key->mv_size);
4758 MDB_node *leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
4759 MDB_GET_KEY(leaf, key);
4761 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4762 rc = mdb_cursor_get(&mc->mc_xcursor->mx_cursor, data, NULL, MDB_GET_CURRENT);
4764 rc = mdb_node_read(mc->mc_txn, leaf, data);
4771 case MDB_GET_BOTH_RANGE:
4772 if (data == NULL || mc->mc_xcursor == NULL) {
4780 if (key == NULL || key->mv_size == 0 || key->mv_size > MDB_MAXKEYSIZE) {
4782 } else if (op == MDB_SET_RANGE)
4783 rc = mdb_cursor_set(mc, key, data, op, NULL);
4785 rc = mdb_cursor_set(mc, key, data, op, &exact);
4787 case MDB_GET_MULTIPLE:
4789 !(mc->mc_db->md_flags & MDB_DUPFIXED) ||
4790 !(mc->mc_flags & C_INITIALIZED)) {
4795 if (!(mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED) ||
4796 (mc->mc_xcursor->mx_cursor.mc_flags & C_EOF))
4799 case MDB_NEXT_MULTIPLE:
4801 !(mc->mc_db->md_flags & MDB_DUPFIXED)) {
4805 if (!(mc->mc_flags & C_INITIALIZED))
4806 rc = mdb_cursor_first(mc, key, data);
4808 rc = mdb_cursor_next(mc, key, data, MDB_NEXT_DUP);
4809 if (rc == MDB_SUCCESS) {
4810 if (mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED) {
4813 mx = &mc->mc_xcursor->mx_cursor;
4814 data->mv_size = NUMKEYS(mx->mc_pg[mx->mc_top]) *
4816 data->mv_data = METADATA(mx->mc_pg[mx->mc_top]);
4817 mx->mc_ki[mx->mc_top] = NUMKEYS(mx->mc_pg[mx->mc_top])-1;
4825 case MDB_NEXT_NODUP:
4826 if (!(mc->mc_flags & C_INITIALIZED))
4827 rc = mdb_cursor_first(mc, key, data);
4829 rc = mdb_cursor_next(mc, key, data, op);
4833 case MDB_PREV_NODUP:
4834 if (!(mc->mc_flags & C_INITIALIZED)) {
4835 rc = mdb_cursor_last(mc, key, data);
4836 mc->mc_flags |= C_INITIALIZED;
4837 mc->mc_ki[mc->mc_top]++;
4839 rc = mdb_cursor_prev(mc, key, data, op);
4842 rc = mdb_cursor_first(mc, key, data);
4846 !(mc->mc_db->md_flags & MDB_DUPSORT) ||
4847 !(mc->mc_flags & C_INITIALIZED) ||
4848 !(mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED)) {
4852 rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
4855 rc = mdb_cursor_last(mc, key, data);
4859 !(mc->mc_db->md_flags & MDB_DUPSORT) ||
4860 !(mc->mc_flags & C_INITIALIZED) ||
4861 !(mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED)) {
4865 rc = mdb_cursor_last(&mc->mc_xcursor->mx_cursor, data, NULL);
4868 DPRINTF("unhandled/unimplemented cursor operation %u", op);
4876 /** Touch all the pages in the cursor stack.
4877 * Makes sure all the pages are writable, before attempting a write operation.
4878 * @param[in] mc The cursor to operate on.
4881 mdb_cursor_touch(MDB_cursor *mc)
4885 if (mc->mc_dbi > MAIN_DBI && !(*mc->mc_dbflag & DB_DIRTY)) {
4888 mdb_cursor_init(&mc2, mc->mc_txn, MAIN_DBI,
4889 mc->mc_txn->mt_dbs[MAIN_DBI].md_flags & MDB_DUPSORT ? &mcx : NULL);
4890 rc = mdb_page_search(&mc2, &mc->mc_dbx->md_name, MDB_PS_MODIFY);
4893 *mc->mc_dbflag |= DB_DIRTY;
4895 for (mc->mc_top = 0; mc->mc_top < mc->mc_snum; mc->mc_top++) {
4896 rc = mdb_page_touch(mc);
4900 mc->mc_top = mc->mc_snum-1;
4905 mdb_cursor_put(MDB_cursor *mc, MDB_val *key, MDB_val *data,
4908 MDB_node *leaf = NULL;
4909 MDB_val xdata, *rdata, dkey;
4912 int do_sub = 0, insert = 0;
4913 unsigned int mcount = 0;
4917 char dbuf[MDB_MAXKEYSIZE+1];
4918 unsigned int nflags;
4921 if (F_ISSET(mc->mc_txn->mt_flags, MDB_TXN_RDONLY))
4924 if (flags != MDB_CURRENT && (key->mv_size == 0 || key->mv_size > MDB_MAXKEYSIZE))
4927 if (F_ISSET(mc->mc_db->md_flags, MDB_DUPSORT) && data->mv_size > MDB_MAXKEYSIZE)
4930 #if SIZE_MAX > MAXDATASIZE
4931 if (data->mv_size > MAXDATASIZE)
4935 DPRINTF("==> put db %u key [%s], size %zu, data size %zu",
4936 mc->mc_dbi, DKEY(key), key ? key->mv_size:0, data->mv_size);
4940 if (flags == MDB_CURRENT) {
4941 if (!(mc->mc_flags & C_INITIALIZED))
4944 } else if (mc->mc_db->md_root == P_INVALID) {
4946 /* new database, write a root leaf page */
4947 DPUTS("allocating new root leaf page");
4948 if ((rc = mdb_page_new(mc, P_LEAF, 1, &np))) {
4952 mdb_cursor_push(mc, np);
4953 mc->mc_db->md_root = np->mp_pgno;
4954 mc->mc_db->md_depth++;
4955 *mc->mc_dbflag |= DB_DIRTY;
4956 if ((mc->mc_db->md_flags & (MDB_DUPSORT|MDB_DUPFIXED))
4958 np->mp_flags |= P_LEAF2;
4959 mc->mc_flags |= C_INITIALIZED;
4965 if (flags & MDB_APPEND) {
4967 rc = mdb_cursor_last(mc, &k2, &d2);
4969 rc = mc->mc_dbx->md_cmp(key, &k2);
4972 mc->mc_ki[mc->mc_top]++;
4974 /* new key is <= last key */
4979 rc = mdb_cursor_set(mc, key, &d2, MDB_SET, &exact);
4981 if ((flags & MDB_NOOVERWRITE) && rc == 0) {
4982 DPRINTF("duplicate key [%s]", DKEY(key));
4984 return MDB_KEYEXIST;
4986 if (rc && rc != MDB_NOTFOUND)
4990 /* Cursor is positioned, now make sure all pages are writable */
4991 rc2 = mdb_cursor_touch(mc);
4996 /* The key already exists */
4997 if (rc == MDB_SUCCESS) {
4998 /* there's only a key anyway, so this is a no-op */
4999 if (IS_LEAF2(mc->mc_pg[mc->mc_top])) {
5000 unsigned int ksize = mc->mc_db->md_pad;
5001 if (key->mv_size != ksize)
5003 if (flags == MDB_CURRENT) {
5004 char *ptr = LEAF2KEY(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], ksize);
5005 memcpy(ptr, key->mv_data, ksize);
5010 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
5013 if (F_ISSET(mc->mc_db->md_flags, MDB_DUPSORT)) {
5014 /* Was a single item before, must convert now */
5016 if (!F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5017 /* Just overwrite the current item */
5018 if (flags == MDB_CURRENT)
5021 dkey.mv_size = NODEDSZ(leaf);
5022 dkey.mv_data = NODEDATA(leaf);
5023 #if UINT_MAX < SIZE_MAX
5024 if (mc->mc_dbx->md_dcmp == mdb_cmp_int && dkey.mv_size == sizeof(size_t))
5025 #ifdef MISALIGNED_OK
5026 mc->mc_dbx->md_dcmp = mdb_cmp_long;
5028 mc->mc_dbx->md_dcmp = mdb_cmp_cint;
5031 /* if data matches, ignore it */
5032 if (!mc->mc_dbx->md_dcmp(data, &dkey))
5033 return (flags == MDB_NODUPDATA) ? MDB_KEYEXIST : MDB_SUCCESS;
5035 /* create a fake page for the dup items */
5036 memcpy(dbuf, dkey.mv_data, dkey.mv_size);
5037 dkey.mv_data = dbuf;
5038 fp = (MDB_page *)&pbuf;
5039 fp->mp_pgno = mc->mc_pg[mc->mc_top]->mp_pgno;
5040 fp->mp_flags = P_LEAF|P_DIRTY|P_SUBP;
5041 fp->mp_lower = PAGEHDRSZ;
5042 fp->mp_upper = PAGEHDRSZ + dkey.mv_size + data->mv_size;
5043 if (mc->mc_db->md_flags & MDB_DUPFIXED) {
5044 fp->mp_flags |= P_LEAF2;
5045 fp->mp_pad = data->mv_size;
5046 fp->mp_upper += 2 * data->mv_size; /* leave space for 2 more */
5048 fp->mp_upper += 2 * sizeof(indx_t) + 2 * NODESIZE +
5049 (dkey.mv_size & 1) + (data->mv_size & 1);
5051 mdb_node_del(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], 0);
5054 xdata.mv_size = fp->mp_upper;
5059 if (!F_ISSET(leaf->mn_flags, F_SUBDATA)) {
5060 /* See if we need to convert from fake page to subDB */
5062 unsigned int offset;
5065 fp = NODEDATA(leaf);
5066 if (flags == MDB_CURRENT) {
5068 fp->mp_flags |= P_DIRTY;
5069 COPY_PGNO(fp->mp_pgno, mc->mc_pg[mc->mc_top]->mp_pgno);
5070 mc->mc_xcursor->mx_cursor.mc_pg[0] = fp;
5074 if (mc->mc_db->md_flags & MDB_DUPFIXED) {
5075 offset = fp->mp_pad;
5076 if (SIZELEFT(fp) >= offset)
5078 offset *= 4; /* space for 4 more */
5080 offset = NODESIZE + sizeof(indx_t) + data->mv_size;
5082 offset += offset & 1;
5083 if (NODESIZE + sizeof(indx_t) + NODEKSZ(leaf) + NODEDSZ(leaf) +
5084 offset >= mc->mc_txn->mt_env->me_nodemax) {
5085 /* yes, convert it */
5087 if (mc->mc_db->md_flags & MDB_DUPFIXED) {
5088 dummy.md_pad = fp->mp_pad;
5089 dummy.md_flags = MDB_DUPFIXED;
5090 if (mc->mc_db->md_flags & MDB_INTEGERDUP)
5091 dummy.md_flags |= MDB_INTEGERKEY;
5094 dummy.md_branch_pages = 0;
5095 dummy.md_leaf_pages = 1;
5096 dummy.md_overflow_pages = 0;
5097 dummy.md_entries = NUMKEYS(fp);
5099 xdata.mv_size = sizeof(MDB_db);
5100 xdata.mv_data = &dummy;
5101 if ((rc = mdb_page_alloc(mc, 1, &mp)))
5103 offset = mc->mc_txn->mt_env->me_psize - NODEDSZ(leaf);
5104 flags |= F_DUPDATA|F_SUBDATA;
5105 dummy.md_root = mp->mp_pgno;
5107 /* no, just grow it */
5109 xdata.mv_size = NODEDSZ(leaf) + offset;
5110 xdata.mv_data = &pbuf;
5111 mp = (MDB_page *)&pbuf;
5112 mp->mp_pgno = mc->mc_pg[mc->mc_top]->mp_pgno;
5115 mp->mp_flags = fp->mp_flags | P_DIRTY;
5116 mp->mp_pad = fp->mp_pad;
5117 mp->mp_lower = fp->mp_lower;
5118 mp->mp_upper = fp->mp_upper + offset;
5120 memcpy(METADATA(mp), METADATA(fp), NUMKEYS(fp) * fp->mp_pad);
5122 nsize = NODEDSZ(leaf) - fp->mp_upper;
5123 memcpy((char *)mp + mp->mp_upper, (char *)fp + fp->mp_upper, nsize);
5124 for (i=0; i<NUMKEYS(fp); i++)
5125 mp->mp_ptrs[i] = fp->mp_ptrs[i] + offset;
5127 mdb_node_del(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], 0);
5131 /* data is on sub-DB, just store it */
5132 flags |= F_DUPDATA|F_SUBDATA;
5136 /* overflow page overwrites need special handling */
5137 if (F_ISSET(leaf->mn_flags, F_BIGDATA)) {
5140 int ovpages, dpages;
5142 ovpages = OVPAGES(NODEDSZ(leaf), mc->mc_txn->mt_env->me_psize);
5143 dpages = OVPAGES(data->mv_size, mc->mc_txn->mt_env->me_psize);
5144 memcpy(&pg, NODEDATA(leaf), sizeof(pg));
5145 mdb_page_get(mc->mc_txn, pg, &omp);
5146 /* Is the ov page writable and large enough? */
5147 if ((omp->mp_flags & P_DIRTY) && ovpages >= dpages) {
5148 /* yes, overwrite it. Note in this case we don't
5149 * bother to try shrinking the node if the new data
5150 * is smaller than the overflow threshold.
5152 if (F_ISSET(flags, MDB_RESERVE))
5153 data->mv_data = METADATA(omp);
5155 memcpy(METADATA(omp), data->mv_data, data->mv_size);
5158 /* no, free ovpages */
5160 mc->mc_db->md_overflow_pages -= ovpages;
5161 for (i=0; i<ovpages; i++) {
5162 DPRINTF("freed ov page %zu", pg);
5163 mdb_midl_append(&mc->mc_txn->mt_free_pgs, pg);
5167 } else if (NODEDSZ(leaf) == data->mv_size) {
5168 /* same size, just replace it. Note that we could
5169 * also reuse this node if the new data is smaller,
5170 * but instead we opt to shrink the node in that case.
5172 if (F_ISSET(flags, MDB_RESERVE))
5173 data->mv_data = NODEDATA(leaf);
5174 else if (data->mv_size)
5175 memcpy(NODEDATA(leaf), data->mv_data, data->mv_size);
5177 memcpy(NODEKEY(leaf), key->mv_data, key->mv_size);
5180 mdb_node_del(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], 0);
5181 mc->mc_db->md_entries--;
5183 DPRINTF("inserting key at index %i", mc->mc_ki[mc->mc_top]);
5190 nflags = flags & NODE_ADD_FLAGS;
5191 nsize = IS_LEAF2(mc->mc_pg[mc->mc_top]) ? key->mv_size : mdb_leaf_size(mc->mc_txn->mt_env, key, rdata);
5192 if (SIZELEFT(mc->mc_pg[mc->mc_top]) < nsize) {
5193 if (( flags & (F_DUPDATA|F_SUBDATA)) == F_DUPDATA )
5194 nflags &= ~MDB_APPEND;
5196 nflags |= MDB_SPLIT_REPLACE;
5197 rc = mdb_page_split(mc, key, rdata, P_INVALID, nflags);
5199 /* There is room already in this leaf page. */
5200 rc = mdb_node_add(mc, mc->mc_ki[mc->mc_top], key, rdata, 0, nflags);
5201 if (rc == 0 && !do_sub && insert) {
5202 /* Adjust other cursors pointing to mp */
5203 MDB_cursor *m2, *m3;
5204 MDB_dbi dbi = mc->mc_dbi;
5205 unsigned i = mc->mc_top;
5206 MDB_page *mp = mc->mc_pg[i];
5208 if (mc->mc_flags & C_SUB)
5211 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
5212 if (mc->mc_flags & C_SUB)
5213 m3 = &m2->mc_xcursor->mx_cursor;
5216 if (m3 == mc || m3->mc_snum < mc->mc_snum) continue;
5217 if (m3->mc_pg[i] == mp && m3->mc_ki[i] >= mc->mc_ki[i]) {
5224 if (rc != MDB_SUCCESS)
5225 mc->mc_txn->mt_flags |= MDB_TXN_ERROR;
5227 /* Now store the actual data in the child DB. Note that we're
5228 * storing the user data in the keys field, so there are strict
5229 * size limits on dupdata. The actual data fields of the child
5230 * DB are all zero size.
5237 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
5238 if (flags & MDB_CURRENT) {
5239 xflags = MDB_CURRENT;
5241 mdb_xcursor_init1(mc, leaf);
5242 xflags = (flags & MDB_NODUPDATA) ? MDB_NOOVERWRITE : 0;
5244 /* converted, write the original data first */
5246 rc = mdb_cursor_put(&mc->mc_xcursor->mx_cursor, &dkey, &xdata, xflags);
5250 /* Adjust other cursors pointing to mp */
5252 unsigned i = mc->mc_top;
5253 MDB_page *mp = mc->mc_pg[i];
5255 for (m2 = mc->mc_txn->mt_cursors[mc->mc_dbi]; m2; m2=m2->mc_next) {
5256 if (m2 == mc || m2->mc_snum < mc->mc_snum) continue;
5257 if (m2->mc_pg[i] == mp && m2->mc_ki[i] == mc->mc_ki[i]) {
5258 mdb_xcursor_init1(m2, leaf);
5262 /* we've done our job */
5265 if (flags & MDB_APPENDDUP)
5266 xflags |= MDB_APPEND;
5267 rc = mdb_cursor_put(&mc->mc_xcursor->mx_cursor, data, &xdata, xflags);
5268 if (flags & F_SUBDATA) {
5269 void *db = NODEDATA(leaf);
5270 memcpy(db, &mc->mc_xcursor->mx_db, sizeof(MDB_db));
5273 /* sub-writes might have failed so check rc again.
5274 * Don't increment count if we just replaced an existing item.
5276 if (!rc && !(flags & MDB_CURRENT))
5277 mc->mc_db->md_entries++;
5278 if (flags & MDB_MULTIPLE) {
5280 if (mcount < data[1].mv_size) {
5281 data[0].mv_data = (char *)data[0].mv_data + data[0].mv_size;
5282 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
5288 /* If we succeeded and the key didn't exist before, make sure
5289 * the cursor is marked valid.
5292 mc->mc_flags |= C_INITIALIZED;
5297 mdb_cursor_del(MDB_cursor *mc, unsigned int flags)
5302 if (F_ISSET(mc->mc_txn->mt_flags, MDB_TXN_RDONLY))
5305 if (!(mc->mc_flags & C_INITIALIZED))
5308 rc = mdb_cursor_touch(mc);
5312 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
5314 if (!IS_LEAF2(mc->mc_pg[mc->mc_top]) && F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5315 if (flags != MDB_NODUPDATA) {
5316 if (!F_ISSET(leaf->mn_flags, F_SUBDATA)) {
5317 mc->mc_xcursor->mx_cursor.mc_pg[0] = NODEDATA(leaf);
5319 rc = mdb_cursor_del(&mc->mc_xcursor->mx_cursor, 0);
5320 /* If sub-DB still has entries, we're done */
5321 if (mc->mc_xcursor->mx_db.md_entries) {
5322 if (leaf->mn_flags & F_SUBDATA) {
5323 /* update subDB info */
5324 void *db = NODEDATA(leaf);
5325 memcpy(db, &mc->mc_xcursor->mx_db, sizeof(MDB_db));
5327 /* shrink fake page */
5328 mdb_node_shrink(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
5330 mc->mc_db->md_entries--;
5333 /* otherwise fall thru and delete the sub-DB */
5336 if (leaf->mn_flags & F_SUBDATA) {
5337 /* add all the child DB's pages to the free list */
5338 rc = mdb_drop0(&mc->mc_xcursor->mx_cursor, 0);
5339 if (rc == MDB_SUCCESS) {
5340 mc->mc_db->md_entries -=
5341 mc->mc_xcursor->mx_db.md_entries;
5346 return mdb_cursor_del0(mc, leaf);
5349 /** Allocate and initialize new pages for a database.
5350 * @param[in] mc a cursor on the database being added to.
5351 * @param[in] flags flags defining what type of page is being allocated.
5352 * @param[in] num the number of pages to allocate. This is usually 1,
5353 * unless allocating overflow pages for a large record.
5354 * @param[out] mp Address of a page, or NULL on failure.
5355 * @return 0 on success, non-zero on failure.
5358 mdb_page_new(MDB_cursor *mc, uint32_t flags, int num, MDB_page **mp)
5363 if ((rc = mdb_page_alloc(mc, num, &np)))
5365 DPRINTF("allocated new mpage %zu, page size %u",
5366 np->mp_pgno, mc->mc_txn->mt_env->me_psize);
5367 np->mp_flags = flags | P_DIRTY;
5368 np->mp_lower = PAGEHDRSZ;
5369 np->mp_upper = mc->mc_txn->mt_env->me_psize;
5372 mc->mc_db->md_branch_pages++;
5373 else if (IS_LEAF(np))
5374 mc->mc_db->md_leaf_pages++;
5375 else if (IS_OVERFLOW(np)) {
5376 mc->mc_db->md_overflow_pages += num;
5384 /** Calculate the size of a leaf node.
5385 * The size depends on the environment's page size; if a data item
5386 * is too large it will be put onto an overflow page and the node
5387 * size will only include the key and not the data. Sizes are always
5388 * rounded up to an even number of bytes, to guarantee 2-byte alignment
5389 * of the #MDB_node headers.
5390 * @param[in] env The environment handle.
5391 * @param[in] key The key for the node.
5392 * @param[in] data The data for the node.
5393 * @return The number of bytes needed to store the node.
5396 mdb_leaf_size(MDB_env *env, MDB_val *key, MDB_val *data)
5400 sz = LEAFSIZE(key, data);
5401 if (sz >= env->me_nodemax) {
5402 /* put on overflow page */
5403 sz -= data->mv_size - sizeof(pgno_t);
5407 return sz + sizeof(indx_t);
5410 /** Calculate the size of a branch node.
5411 * The size should depend on the environment's page size but since
5412 * we currently don't support spilling large keys onto overflow
5413 * pages, it's simply the size of the #MDB_node header plus the
5414 * size of the key. Sizes are always rounded up to an even number
5415 * of bytes, to guarantee 2-byte alignment of the #MDB_node headers.
5416 * @param[in] env The environment handle.
5417 * @param[in] key The key for the node.
5418 * @return The number of bytes needed to store the node.
5421 mdb_branch_size(MDB_env *env, MDB_val *key)
5426 if (sz >= env->me_nodemax) {
5427 /* put on overflow page */
5428 /* not implemented */
5429 /* sz -= key->size - sizeof(pgno_t); */
5432 return sz + sizeof(indx_t);
5435 /** Add a node to the page pointed to by the cursor.
5436 * @param[in] mc The cursor for this operation.
5437 * @param[in] indx The index on the page where the new node should be added.
5438 * @param[in] key The key for the new node.
5439 * @param[in] data The data for the new node, if any.
5440 * @param[in] pgno The page number, if adding a branch node.
5441 * @param[in] flags Flags for the node.
5442 * @return 0 on success, non-zero on failure. Possible errors are:
5444 * <li>ENOMEM - failed to allocate overflow pages for the node.
5445 * <li>MDB_PAGE_FULL - there is insufficient room in the page. This error
5446 * should never happen since all callers already calculate the
5447 * page's free space before calling this function.
5451 mdb_node_add(MDB_cursor *mc, indx_t indx,
5452 MDB_val *key, MDB_val *data, pgno_t pgno, unsigned int flags)
5455 size_t node_size = NODESIZE;
5458 MDB_page *mp = mc->mc_pg[mc->mc_top];
5459 MDB_page *ofp = NULL; /* overflow page */
5462 assert(mp->mp_upper >= mp->mp_lower);
5464 DPRINTF("add to %s %spage %zu index %i, data size %zu key size %zu [%s]",
5465 IS_LEAF(mp) ? "leaf" : "branch",
5466 IS_SUBP(mp) ? "sub-" : "",
5467 mp->mp_pgno, indx, data ? data->mv_size : 0,
5468 key ? key->mv_size : 0, key ? DKEY(key) : NULL);
5471 /* Move higher keys up one slot. */
5472 int ksize = mc->mc_db->md_pad, dif;
5473 char *ptr = LEAF2KEY(mp, indx, ksize);
5474 dif = NUMKEYS(mp) - indx;
5476 memmove(ptr+ksize, ptr, dif*ksize);
5477 /* insert new key */
5478 memcpy(ptr, key->mv_data, ksize);
5480 /* Just using these for counting */
5481 mp->mp_lower += sizeof(indx_t);
5482 mp->mp_upper -= ksize - sizeof(indx_t);
5487 node_size += key->mv_size;
5491 if (F_ISSET(flags, F_BIGDATA)) {
5492 /* Data already on overflow page. */
5493 node_size += sizeof(pgno_t);
5494 } else if (node_size + data->mv_size >= mc->mc_txn->mt_env->me_nodemax) {
5495 int ovpages = OVPAGES(data->mv_size, mc->mc_txn->mt_env->me_psize);
5497 /* Put data on overflow page. */
5498 DPRINTF("data size is %zu, node would be %zu, put data on overflow page",
5499 data->mv_size, node_size+data->mv_size);
5500 node_size += sizeof(pgno_t);
5501 if ((rc = mdb_page_new(mc, P_OVERFLOW, ovpages, &ofp)))
5503 DPRINTF("allocated overflow page %zu", ofp->mp_pgno);
5506 node_size += data->mv_size;
5509 node_size += node_size & 1;
5511 if (node_size + sizeof(indx_t) > SIZELEFT(mp)) {
5512 DPRINTF("not enough room in page %zu, got %u ptrs",
5513 mp->mp_pgno, NUMKEYS(mp));
5514 DPRINTF("upper - lower = %u - %u = %u", mp->mp_upper, mp->mp_lower,
5515 mp->mp_upper - mp->mp_lower);
5516 DPRINTF("node size = %zu", node_size);
5517 return MDB_PAGE_FULL;
5520 /* Move higher pointers up one slot. */
5521 for (i = NUMKEYS(mp); i > indx; i--)
5522 mp->mp_ptrs[i] = mp->mp_ptrs[i - 1];
5524 /* Adjust free space offsets. */
5525 ofs = mp->mp_upper - node_size;
5526 assert(ofs >= mp->mp_lower + sizeof(indx_t));
5527 mp->mp_ptrs[indx] = ofs;
5529 mp->mp_lower += sizeof(indx_t);
5531 /* Write the node data. */
5532 node = NODEPTR(mp, indx);
5533 node->mn_ksize = (key == NULL) ? 0 : key->mv_size;
5534 node->mn_flags = flags;
5536 SETDSZ(node,data->mv_size);
5541 memcpy(NODEKEY(node), key->mv_data, key->mv_size);
5546 if (F_ISSET(flags, F_BIGDATA))
5547 memcpy(node->mn_data + key->mv_size, data->mv_data,
5549 else if (F_ISSET(flags, MDB_RESERVE))
5550 data->mv_data = node->mn_data + key->mv_size;
5552 memcpy(node->mn_data + key->mv_size, data->mv_data,
5555 memcpy(node->mn_data + key->mv_size, &ofp->mp_pgno,
5557 if (F_ISSET(flags, MDB_RESERVE))
5558 data->mv_data = METADATA(ofp);
5560 memcpy(METADATA(ofp), data->mv_data, data->mv_size);
5567 /** Delete the specified node from a page.
5568 * @param[in] mp The page to operate on.
5569 * @param[in] indx The index of the node to delete.
5570 * @param[in] ksize The size of a node. Only used if the page is
5571 * part of a #MDB_DUPFIXED database.
5574 mdb_node_del(MDB_page *mp, indx_t indx, int ksize)
5577 indx_t i, j, numkeys, ptr;
5584 COPY_PGNO(pgno, mp->mp_pgno);
5585 DPRINTF("delete node %u on %s page %zu", indx,
5586 IS_LEAF(mp) ? "leaf" : "branch", pgno);
5589 assert(indx < NUMKEYS(mp));
5592 int x = NUMKEYS(mp) - 1 - indx;
5593 base = LEAF2KEY(mp, indx, ksize);
5595 memmove(base, base + ksize, x * ksize);
5596 mp->mp_lower -= sizeof(indx_t);
5597 mp->mp_upper += ksize - sizeof(indx_t);
5601 node = NODEPTR(mp, indx);
5602 sz = NODESIZE + node->mn_ksize;
5604 if (F_ISSET(node->mn_flags, F_BIGDATA))
5605 sz += sizeof(pgno_t);
5607 sz += NODEDSZ(node);
5611 ptr = mp->mp_ptrs[indx];
5612 numkeys = NUMKEYS(mp);
5613 for (i = j = 0; i < numkeys; i++) {
5615 mp->mp_ptrs[j] = mp->mp_ptrs[i];
5616 if (mp->mp_ptrs[i] < ptr)
5617 mp->mp_ptrs[j] += sz;
5622 base = (char *)mp + mp->mp_upper;
5623 memmove(base + sz, base, ptr - mp->mp_upper);
5625 mp->mp_lower -= sizeof(indx_t);
5629 /** Compact the main page after deleting a node on a subpage.
5630 * @param[in] mp The main page to operate on.
5631 * @param[in] indx The index of the subpage on the main page.
5634 mdb_node_shrink(MDB_page *mp, indx_t indx)
5641 indx_t i, numkeys, ptr;
5643 node = NODEPTR(mp, indx);
5644 sp = (MDB_page *)NODEDATA(node);
5645 osize = NODEDSZ(node);
5647 delta = sp->mp_upper - sp->mp_lower;
5648 SETDSZ(node, osize - delta);
5649 xp = (MDB_page *)((char *)sp + delta);
5651 /* shift subpage upward */
5653 nsize = NUMKEYS(sp) * sp->mp_pad;
5654 memmove(METADATA(xp), METADATA(sp), nsize);
5657 nsize = osize - sp->mp_upper;
5658 numkeys = NUMKEYS(sp);
5659 for (i=numkeys-1; i>=0; i--)
5660 xp->mp_ptrs[i] = sp->mp_ptrs[i] - delta;
5662 xp->mp_upper = sp->mp_lower;
5663 xp->mp_lower = sp->mp_lower;
5664 xp->mp_flags = sp->mp_flags;
5665 xp->mp_pad = sp->mp_pad;
5666 COPY_PGNO(xp->mp_pgno, mp->mp_pgno);
5668 /* shift lower nodes upward */
5669 ptr = mp->mp_ptrs[indx];
5670 numkeys = NUMKEYS(mp);
5671 for (i = 0; i < numkeys; i++) {
5672 if (mp->mp_ptrs[i] <= ptr)
5673 mp->mp_ptrs[i] += delta;
5676 base = (char *)mp + mp->mp_upper;
5677 memmove(base + delta, base, ptr - mp->mp_upper + NODESIZE + NODEKSZ(node));
5678 mp->mp_upper += delta;
5681 /** Initial setup of a sorted-dups cursor.
5682 * Sorted duplicates are implemented as a sub-database for the given key.
5683 * The duplicate data items are actually keys of the sub-database.
5684 * Operations on the duplicate data items are performed using a sub-cursor
5685 * initialized when the sub-database is first accessed. This function does
5686 * the preliminary setup of the sub-cursor, filling in the fields that
5687 * depend only on the parent DB.
5688 * @param[in] mc The main cursor whose sorted-dups cursor is to be initialized.
5691 mdb_xcursor_init0(MDB_cursor *mc)
5693 MDB_xcursor *mx = mc->mc_xcursor;
5695 mx->mx_cursor.mc_xcursor = NULL;
5696 mx->mx_cursor.mc_txn = mc->mc_txn;
5697 mx->mx_cursor.mc_db = &mx->mx_db;
5698 mx->mx_cursor.mc_dbx = &mx->mx_dbx;
5699 mx->mx_cursor.mc_dbi = mc->mc_dbi+1;
5700 mx->mx_cursor.mc_dbflag = &mx->mx_dbflag;
5701 mx->mx_cursor.mc_snum = 0;
5702 mx->mx_cursor.mc_top = 0;
5703 mx->mx_cursor.mc_flags = C_SUB;
5704 mx->mx_dbx.md_cmp = mc->mc_dbx->md_dcmp;
5705 mx->mx_dbx.md_dcmp = NULL;
5706 mx->mx_dbx.md_rel = mc->mc_dbx->md_rel;
5709 /** Final setup of a sorted-dups cursor.
5710 * Sets up the fields that depend on the data from the main cursor.
5711 * @param[in] mc The main cursor whose sorted-dups cursor is to be initialized.
5712 * @param[in] node The data containing the #MDB_db record for the
5713 * sorted-dup database.
5716 mdb_xcursor_init1(MDB_cursor *mc, MDB_node *node)
5718 MDB_xcursor *mx = mc->mc_xcursor;
5720 if (node->mn_flags & F_SUBDATA) {
5721 memcpy(&mx->mx_db, NODEDATA(node), sizeof(MDB_db));
5722 mx->mx_cursor.mc_pg[0] = 0;
5723 mx->mx_cursor.mc_snum = 0;
5724 mx->mx_cursor.mc_flags = C_SUB;
5726 MDB_page *fp = NODEDATA(node);
5727 mx->mx_db.md_pad = mc->mc_pg[mc->mc_top]->mp_pad;
5728 mx->mx_db.md_flags = 0;
5729 mx->mx_db.md_depth = 1;
5730 mx->mx_db.md_branch_pages = 0;
5731 mx->mx_db.md_leaf_pages = 1;
5732 mx->mx_db.md_overflow_pages = 0;
5733 mx->mx_db.md_entries = NUMKEYS(fp);
5734 COPY_PGNO(mx->mx_db.md_root, fp->mp_pgno);
5735 mx->mx_cursor.mc_snum = 1;
5736 mx->mx_cursor.mc_flags = C_INITIALIZED|C_SUB;
5737 mx->mx_cursor.mc_top = 0;
5738 mx->mx_cursor.mc_pg[0] = fp;
5739 mx->mx_cursor.mc_ki[0] = 0;
5740 if (mc->mc_db->md_flags & MDB_DUPFIXED) {
5741 mx->mx_db.md_flags = MDB_DUPFIXED;
5742 mx->mx_db.md_pad = fp->mp_pad;
5743 if (mc->mc_db->md_flags & MDB_INTEGERDUP)
5744 mx->mx_db.md_flags |= MDB_INTEGERKEY;
5747 DPRINTF("Sub-db %u for db %u root page %zu", mx->mx_cursor.mc_dbi, mc->mc_dbi,
5749 mx->mx_dbflag = DB_VALID | (F_ISSET(mc->mc_pg[mc->mc_top]->mp_flags, P_DIRTY) ?
5751 mx->mx_dbx.md_name.mv_data = NODEKEY(node);
5752 mx->mx_dbx.md_name.mv_size = node->mn_ksize;
5753 #if UINT_MAX < SIZE_MAX
5754 if (mx->mx_dbx.md_cmp == mdb_cmp_int && mx->mx_db.md_pad == sizeof(size_t))
5755 #ifdef MISALIGNED_OK
5756 mx->mx_dbx.md_cmp = mdb_cmp_long;
5758 mx->mx_dbx.md_cmp = mdb_cmp_cint;
5763 /** Initialize a cursor for a given transaction and database. */
5765 mdb_cursor_init(MDB_cursor *mc, MDB_txn *txn, MDB_dbi dbi, MDB_xcursor *mx)
5770 mc->mc_db = &txn->mt_dbs[dbi];
5771 mc->mc_dbx = &txn->mt_dbxs[dbi];
5772 mc->mc_dbflag = &txn->mt_dbflags[dbi];
5777 if (txn->mt_dbs[dbi].md_flags & MDB_DUPSORT) {
5779 mc->mc_xcursor = mx;
5780 mdb_xcursor_init0(mc);
5782 mc->mc_xcursor = NULL;
5784 if (*mc->mc_dbflag & DB_STALE) {
5785 mdb_page_search(mc, NULL, MDB_PS_ROOTONLY);
5790 mdb_cursor_open(MDB_txn *txn, MDB_dbi dbi, MDB_cursor **ret)
5793 MDB_xcursor *mx = NULL;
5794 size_t size = sizeof(MDB_cursor);
5796 if (txn == NULL || ret == NULL || dbi >= txn->mt_numdbs || !(txn->mt_dbflags[dbi] & DB_VALID))
5799 /* Allow read access to the freelist */
5800 if (!dbi && !F_ISSET(txn->mt_flags, MDB_TXN_RDONLY))
5803 if (txn->mt_dbs[dbi].md_flags & MDB_DUPSORT)
5804 size += sizeof(MDB_xcursor);
5806 if ((mc = malloc(size)) != NULL) {
5807 if (txn->mt_dbs[dbi].md_flags & MDB_DUPSORT) {
5808 mx = (MDB_xcursor *)(mc + 1);
5810 mdb_cursor_init(mc, txn, dbi, mx);
5811 if (txn->mt_cursors) {
5812 mc->mc_next = txn->mt_cursors[dbi];
5813 txn->mt_cursors[dbi] = mc;
5815 mc->mc_flags |= C_ALLOCD;
5826 mdb_cursor_renew(MDB_txn *txn, MDB_cursor *mc)
5828 if (txn == NULL || mc == NULL || mc->mc_dbi >= txn->mt_numdbs)
5831 if (txn->mt_cursors)
5834 mdb_cursor_init(mc, txn, mc->mc_dbi, mc->mc_xcursor);
5838 /* Return the count of duplicate data items for the current key */
5840 mdb_cursor_count(MDB_cursor *mc, size_t *countp)
5844 if (mc == NULL || countp == NULL)
5847 if (!(mc->mc_db->md_flags & MDB_DUPSORT))
5850 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
5851 if (!F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5854 if (!(mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED))
5857 *countp = mc->mc_xcursor->mx_db.md_entries;
5863 mdb_cursor_close(MDB_cursor *mc)
5866 /* remove from txn, if tracked */
5867 if (mc->mc_txn->mt_cursors) {
5868 MDB_cursor **prev = &mc->mc_txn->mt_cursors[mc->mc_dbi];
5869 while (*prev && *prev != mc) prev = &(*prev)->mc_next;
5871 *prev = mc->mc_next;
5873 if (mc->mc_flags & C_ALLOCD)
5879 mdb_cursor_txn(MDB_cursor *mc)
5881 if (!mc) return NULL;
5886 mdb_cursor_dbi(MDB_cursor *mc)
5892 /** Replace the key for a node with a new key.
5893 * @param[in] mp The page containing the node to operate on.
5894 * @param[in] indx The index of the node to operate on.
5895 * @param[in] key The new key to use.
5896 * @return 0 on success, non-zero on failure.
5899 mdb_update_key(MDB_cursor *mc, MDB_val *key)
5906 indx_t ptr, i, numkeys, indx;
5909 indx = mc->mc_ki[mc->mc_top];
5910 mp = mc->mc_pg[mc->mc_top];
5911 node = NODEPTR(mp, indx);
5912 ptr = mp->mp_ptrs[indx];
5916 char kbuf2[(MDB_MAXKEYSIZE*2+1)];
5917 k2.mv_data = NODEKEY(node);
5918 k2.mv_size = node->mn_ksize;
5919 DPRINTF("update key %u (ofs %u) [%s] to [%s] on page %zu",
5921 mdb_dkey(&k2, kbuf2),
5927 delta0 = delta = key->mv_size - node->mn_ksize;
5929 /* Must be 2-byte aligned. If new key is
5930 * shorter by 1, the shift will be skipped.
5932 delta += (delta & 1);
5934 if (delta > 0 && SIZELEFT(mp) < delta) {
5936 /* not enough space left, do a delete and split */
5937 DPRINTF("Not enough room, delta = %d, splitting...", delta);
5938 pgno = NODEPGNO(node);
5939 mdb_node_del(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], 0);
5940 return mdb_page_split(mc, key, NULL, pgno, MDB_SPLIT_REPLACE);
5943 numkeys = NUMKEYS(mp);
5944 for (i = 0; i < numkeys; i++) {
5945 if (mp->mp_ptrs[i] <= ptr)
5946 mp->mp_ptrs[i] -= delta;
5949 base = (char *)mp + mp->mp_upper;
5950 len = ptr - mp->mp_upper + NODESIZE;
5951 memmove(base - delta, base, len);
5952 mp->mp_upper -= delta;
5954 node = NODEPTR(mp, indx);
5957 /* But even if no shift was needed, update ksize */
5959 node->mn_ksize = key->mv_size;
5962 memcpy(NODEKEY(node), key->mv_data, key->mv_size);
5968 mdb_cursor_copy(const MDB_cursor *csrc, MDB_cursor *cdst);
5970 /** Move a node from csrc to cdst.
5973 mdb_node_move(MDB_cursor *csrc, MDB_cursor *cdst)
5980 unsigned short flags;
5984 /* Mark src and dst as dirty. */
5985 if ((rc = mdb_page_touch(csrc)) ||
5986 (rc = mdb_page_touch(cdst)))
5989 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
5990 srcnode = NODEPTR(csrc->mc_pg[csrc->mc_top], 0); /* fake */
5991 key.mv_size = csrc->mc_db->md_pad;
5992 key.mv_data = LEAF2KEY(csrc->mc_pg[csrc->mc_top], csrc->mc_ki[csrc->mc_top], key.mv_size);
5994 data.mv_data = NULL;
5998 srcnode = NODEPTR(csrc->mc_pg[csrc->mc_top], csrc->mc_ki[csrc->mc_top]);
5999 assert(!((long)srcnode&1));
6000 srcpg = NODEPGNO(srcnode);
6001 flags = srcnode->mn_flags;
6002 if (csrc->mc_ki[csrc->mc_top] == 0 && IS_BRANCH(csrc->mc_pg[csrc->mc_top])) {
6003 unsigned int snum = csrc->mc_snum;
6005 /* must find the lowest key below src */
6006 mdb_page_search_root(csrc, NULL, 0);
6007 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
6008 key.mv_size = csrc->mc_db->md_pad;
6009 key.mv_data = LEAF2KEY(csrc->mc_pg[csrc->mc_top], 0, key.mv_size);
6011 s2 = NODEPTR(csrc->mc_pg[csrc->mc_top], 0);
6012 key.mv_size = NODEKSZ(s2);
6013 key.mv_data = NODEKEY(s2);
6015 csrc->mc_snum = snum--;
6016 csrc->mc_top = snum;
6018 key.mv_size = NODEKSZ(srcnode);
6019 key.mv_data = NODEKEY(srcnode);
6021 data.mv_size = NODEDSZ(srcnode);
6022 data.mv_data = NODEDATA(srcnode);
6024 if (IS_BRANCH(cdst->mc_pg[cdst->mc_top]) && cdst->mc_ki[cdst->mc_top] == 0) {
6025 unsigned int snum = cdst->mc_snum;
6028 /* must find the lowest key below dst */
6029 mdb_page_search_root(cdst, NULL, 0);
6030 if (IS_LEAF2(cdst->mc_pg[cdst->mc_top])) {
6031 bkey.mv_size = cdst->mc_db->md_pad;
6032 bkey.mv_data = LEAF2KEY(cdst->mc_pg[cdst->mc_top], 0, bkey.mv_size);
6034 s2 = NODEPTR(cdst->mc_pg[cdst->mc_top], 0);
6035 bkey.mv_size = NODEKSZ(s2);
6036 bkey.mv_data = NODEKEY(s2);
6038 cdst->mc_snum = snum--;
6039 cdst->mc_top = snum;
6040 mdb_cursor_copy(cdst, &mn);
6042 rc = mdb_update_key(&mn, &bkey);
6047 DPRINTF("moving %s node %u [%s] on page %zu to node %u on page %zu",
6048 IS_LEAF(csrc->mc_pg[csrc->mc_top]) ? "leaf" : "branch",
6049 csrc->mc_ki[csrc->mc_top],
6051 csrc->mc_pg[csrc->mc_top]->mp_pgno,
6052 cdst->mc_ki[cdst->mc_top], cdst->mc_pg[cdst->mc_top]->mp_pgno);
6054 /* Add the node to the destination page.
6056 rc = mdb_node_add(cdst, cdst->mc_ki[cdst->mc_top], &key, &data, srcpg, flags);
6057 if (rc != MDB_SUCCESS)
6060 /* Delete the node from the source page.
6062 mdb_node_del(csrc->mc_pg[csrc->mc_top], csrc->mc_ki[csrc->mc_top], key.mv_size);
6065 /* Adjust other cursors pointing to mp */
6066 MDB_cursor *m2, *m3;
6067 MDB_dbi dbi = csrc->mc_dbi;
6068 MDB_page *mp = csrc->mc_pg[csrc->mc_top];
6070 if (csrc->mc_flags & C_SUB)
6073 for (m2 = csrc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
6074 if (m2 == csrc) continue;
6075 if (csrc->mc_flags & C_SUB)
6076 m3 = &m2->mc_xcursor->mx_cursor;
6079 if (m3->mc_pg[csrc->mc_top] == mp && m3->mc_ki[csrc->mc_top] ==
6080 csrc->mc_ki[csrc->mc_top]) {
6081 m3->mc_pg[csrc->mc_top] = cdst->mc_pg[cdst->mc_top];
6082 m3->mc_ki[csrc->mc_top] = cdst->mc_ki[cdst->mc_top];
6087 /* Update the parent separators.
6089 if (csrc->mc_ki[csrc->mc_top] == 0) {
6090 if (csrc->mc_ki[csrc->mc_top-1] != 0) {
6091 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
6092 key.mv_data = LEAF2KEY(csrc->mc_pg[csrc->mc_top], 0, key.mv_size);
6094 srcnode = NODEPTR(csrc->mc_pg[csrc->mc_top], 0);
6095 key.mv_size = NODEKSZ(srcnode);
6096 key.mv_data = NODEKEY(srcnode);
6098 DPRINTF("update separator for source page %zu to [%s]",
6099 csrc->mc_pg[csrc->mc_top]->mp_pgno, DKEY(&key));
6100 mdb_cursor_copy(csrc, &mn);
6103 if ((rc = mdb_update_key(&mn, &key)) != MDB_SUCCESS)
6106 if (IS_BRANCH(csrc->mc_pg[csrc->mc_top])) {
6108 indx_t ix = csrc->mc_ki[csrc->mc_top];
6109 nullkey.mv_size = 0;
6110 csrc->mc_ki[csrc->mc_top] = 0;
6111 rc = mdb_update_key(csrc, &nullkey);
6112 csrc->mc_ki[csrc->mc_top] = ix;
6113 assert(rc == MDB_SUCCESS);
6117 if (cdst->mc_ki[cdst->mc_top] == 0) {
6118 if (cdst->mc_ki[cdst->mc_top-1] != 0) {
6119 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
6120 key.mv_data = LEAF2KEY(cdst->mc_pg[cdst->mc_top], 0, key.mv_size);
6122 srcnode = NODEPTR(cdst->mc_pg[cdst->mc_top], 0);
6123 key.mv_size = NODEKSZ(srcnode);
6124 key.mv_data = NODEKEY(srcnode);
6126 DPRINTF("update separator for destination page %zu to [%s]",
6127 cdst->mc_pg[cdst->mc_top]->mp_pgno, DKEY(&key));
6128 mdb_cursor_copy(cdst, &mn);
6131 if ((rc = mdb_update_key(&mn, &key)) != MDB_SUCCESS)
6134 if (IS_BRANCH(cdst->mc_pg[cdst->mc_top])) {
6136 indx_t ix = cdst->mc_ki[cdst->mc_top];
6137 nullkey.mv_size = 0;
6138 cdst->mc_ki[cdst->mc_top] = 0;
6139 rc = mdb_update_key(cdst, &nullkey);
6140 cdst->mc_ki[cdst->mc_top] = ix;
6141 assert(rc == MDB_SUCCESS);
6148 /** Merge one page into another.
6149 * The nodes from the page pointed to by \b csrc will
6150 * be copied to the page pointed to by \b cdst and then
6151 * the \b csrc page will be freed.
6152 * @param[in] csrc Cursor pointing to the source page.
6153 * @param[in] cdst Cursor pointing to the destination page.
6156 mdb_page_merge(MDB_cursor *csrc, MDB_cursor *cdst)
6164 DPRINTF("merging page %zu into %zu", csrc->mc_pg[csrc->mc_top]->mp_pgno,
6165 cdst->mc_pg[cdst->mc_top]->mp_pgno);
6167 assert(csrc->mc_snum > 1); /* can't merge root page */
6168 assert(cdst->mc_snum > 1);
6170 /* Mark dst as dirty. */
6171 if ((rc = mdb_page_touch(cdst)))
6174 /* Move all nodes from src to dst.
6176 j = nkeys = NUMKEYS(cdst->mc_pg[cdst->mc_top]);
6177 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
6178 key.mv_size = csrc->mc_db->md_pad;
6179 key.mv_data = METADATA(csrc->mc_pg[csrc->mc_top]);
6180 for (i = 0; i < NUMKEYS(csrc->mc_pg[csrc->mc_top]); i++, j++) {
6181 rc = mdb_node_add(cdst, j, &key, NULL, 0, 0);
6182 if (rc != MDB_SUCCESS)
6184 key.mv_data = (char *)key.mv_data + key.mv_size;
6187 for (i = 0; i < NUMKEYS(csrc->mc_pg[csrc->mc_top]); i++, j++) {
6188 srcnode = NODEPTR(csrc->mc_pg[csrc->mc_top], i);
6189 if (i == 0 && IS_BRANCH(csrc->mc_pg[csrc->mc_top])) {
6190 unsigned int snum = csrc->mc_snum;
6192 /* must find the lowest key below src */
6193 mdb_page_search_root(csrc, NULL, 0);
6194 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
6195 key.mv_size = csrc->mc_db->md_pad;
6196 key.mv_data = LEAF2KEY(csrc->mc_pg[csrc->mc_top], 0, key.mv_size);
6198 s2 = NODEPTR(csrc->mc_pg[csrc->mc_top], 0);
6199 key.mv_size = NODEKSZ(s2);
6200 key.mv_data = NODEKEY(s2);
6202 csrc->mc_snum = snum--;
6203 csrc->mc_top = snum;
6205 key.mv_size = srcnode->mn_ksize;
6206 key.mv_data = NODEKEY(srcnode);
6209 data.mv_size = NODEDSZ(srcnode);
6210 data.mv_data = NODEDATA(srcnode);
6211 rc = mdb_node_add(cdst, j, &key, &data, NODEPGNO(srcnode), srcnode->mn_flags);
6212 if (rc != MDB_SUCCESS)
6217 DPRINTF("dst page %zu now has %u keys (%.1f%% filled)",
6218 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);
6220 /* Unlink the src page from parent and add to free list.
6222 mdb_node_del(csrc->mc_pg[csrc->mc_top-1], csrc->mc_ki[csrc->mc_top-1], 0);
6223 if (csrc->mc_ki[csrc->mc_top-1] == 0) {
6226 rc = mdb_update_key(csrc, &key);
6232 mdb_midl_append(&csrc->mc_txn->mt_free_pgs, csrc->mc_pg[csrc->mc_top]->mp_pgno);
6233 if (IS_LEAF(csrc->mc_pg[csrc->mc_top]))
6234 csrc->mc_db->md_leaf_pages--;
6236 csrc->mc_db->md_branch_pages--;
6238 /* Adjust other cursors pointing to mp */
6239 MDB_cursor *m2, *m3;
6240 MDB_dbi dbi = csrc->mc_dbi;
6241 MDB_page *mp = cdst->mc_pg[cdst->mc_top];
6243 if (csrc->mc_flags & C_SUB)
6246 for (m2 = csrc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
6247 if (csrc->mc_flags & C_SUB)
6248 m3 = &m2->mc_xcursor->mx_cursor;
6251 if (m3 == csrc) continue;
6252 if (m3->mc_snum < csrc->mc_snum) continue;
6253 if (m3->mc_pg[csrc->mc_top] == csrc->mc_pg[csrc->mc_top]) {
6254 m3->mc_pg[csrc->mc_top] = mp;
6255 m3->mc_ki[csrc->mc_top] += nkeys;
6259 mdb_cursor_pop(csrc);
6261 return mdb_rebalance(csrc);
6264 /** Copy the contents of a cursor.
6265 * @param[in] csrc The cursor to copy from.
6266 * @param[out] cdst The cursor to copy to.
6269 mdb_cursor_copy(const MDB_cursor *csrc, MDB_cursor *cdst)
6273 cdst->mc_txn = csrc->mc_txn;
6274 cdst->mc_dbi = csrc->mc_dbi;
6275 cdst->mc_db = csrc->mc_db;
6276 cdst->mc_dbx = csrc->mc_dbx;
6277 cdst->mc_snum = csrc->mc_snum;
6278 cdst->mc_top = csrc->mc_top;
6279 cdst->mc_flags = csrc->mc_flags;
6281 for (i=0; i<csrc->mc_snum; i++) {
6282 cdst->mc_pg[i] = csrc->mc_pg[i];
6283 cdst->mc_ki[i] = csrc->mc_ki[i];
6287 /** Rebalance the tree after a delete operation.
6288 * @param[in] mc Cursor pointing to the page where rebalancing
6290 * @return 0 on success, non-zero on failure.
6293 mdb_rebalance(MDB_cursor *mc)
6297 unsigned int ptop, minkeys;
6300 minkeys = 1 + (IS_BRANCH(mc->mc_pg[mc->mc_top]));
6304 COPY_PGNO(pgno, mc->mc_pg[mc->mc_top]->mp_pgno);
6305 DPRINTF("rebalancing %s page %zu (has %u keys, %.1f%% full)",
6306 IS_LEAF(mc->mc_pg[mc->mc_top]) ? "leaf" : "branch",
6307 pgno, NUMKEYS(mc->mc_pg[mc->mc_top]), (float)PAGEFILL(mc->mc_txn->mt_env, mc->mc_pg[mc->mc_top]) / 10);
6311 if (PAGEFILL(mc->mc_txn->mt_env, mc->mc_pg[mc->mc_top]) >= FILL_THRESHOLD &&
6312 NUMKEYS(mc->mc_pg[mc->mc_top]) >= minkeys) {
6315 COPY_PGNO(pgno, mc->mc_pg[mc->mc_top]->mp_pgno);
6316 DPRINTF("no need to rebalance page %zu, above fill threshold",
6322 if (mc->mc_snum < 2) {
6323 MDB_page *mp = mc->mc_pg[0];
6325 DPUTS("Can't rebalance a subpage, ignoring");
6328 if (NUMKEYS(mp) == 0) {
6329 DPUTS("tree is completely empty");
6330 mc->mc_db->md_root = P_INVALID;
6331 mc->mc_db->md_depth = 0;
6332 mc->mc_db->md_leaf_pages = 0;
6333 mdb_midl_append(&mc->mc_txn->mt_free_pgs, mp->mp_pgno);
6337 /* Adjust other cursors pointing to mp */
6338 MDB_cursor *m2, *m3;
6339 MDB_dbi dbi = mc->mc_dbi;
6341 if (mc->mc_flags & C_SUB)
6344 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
6345 if (m2 == mc) continue;
6346 if (mc->mc_flags & C_SUB)
6347 m3 = &m2->mc_xcursor->mx_cursor;
6350 if (m3->mc_snum < mc->mc_snum) continue;
6351 if (m3->mc_pg[0] == mp) {
6357 } else if (IS_BRANCH(mp) && NUMKEYS(mp) == 1) {
6358 DPUTS("collapsing root page!");
6359 mdb_midl_append(&mc->mc_txn->mt_free_pgs, mp->mp_pgno);
6360 mc->mc_db->md_root = NODEPGNO(NODEPTR(mp, 0));
6361 if ((rc = mdb_page_get(mc->mc_txn, mc->mc_db->md_root,
6364 mc->mc_db->md_depth--;
6365 mc->mc_db->md_branch_pages--;
6367 /* Adjust other cursors pointing to mp */
6368 MDB_cursor *m2, *m3;
6369 MDB_dbi dbi = mc->mc_dbi;
6371 if (mc->mc_flags & C_SUB)
6374 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
6375 if (m2 == mc) continue;
6376 if (mc->mc_flags & C_SUB)
6377 m3 = &m2->mc_xcursor->mx_cursor;
6380 if (m3->mc_snum < mc->mc_snum) continue;
6381 if (m3->mc_pg[0] == mp) {
6382 m3->mc_pg[0] = mc->mc_pg[0];
6389 DPUTS("root page doesn't need rebalancing");
6393 /* The parent (branch page) must have at least 2 pointers,
6394 * otherwise the tree is invalid.
6396 ptop = mc->mc_top-1;
6397 assert(NUMKEYS(mc->mc_pg[ptop]) > 1);
6399 /* Leaf page fill factor is below the threshold.
6400 * Try to move keys from left or right neighbor, or
6401 * merge with a neighbor page.
6406 mdb_cursor_copy(mc, &mn);
6407 mn.mc_xcursor = NULL;
6409 if (mc->mc_ki[ptop] == 0) {
6410 /* We're the leftmost leaf in our parent.
6412 DPUTS("reading right neighbor");
6414 node = NODEPTR(mc->mc_pg[ptop], mn.mc_ki[ptop]);
6415 if ((rc = mdb_page_get(mc->mc_txn, NODEPGNO(node), &mn.mc_pg[mn.mc_top])))
6417 mn.mc_ki[mn.mc_top] = 0;
6418 mc->mc_ki[mc->mc_top] = NUMKEYS(mc->mc_pg[mc->mc_top]);
6420 /* There is at least one neighbor to the left.
6422 DPUTS("reading left neighbor");
6424 node = NODEPTR(mc->mc_pg[ptop], mn.mc_ki[ptop]);
6425 if ((rc = mdb_page_get(mc->mc_txn, NODEPGNO(node), &mn.mc_pg[mn.mc_top])))
6427 mn.mc_ki[mn.mc_top] = NUMKEYS(mn.mc_pg[mn.mc_top]) - 1;
6428 mc->mc_ki[mc->mc_top] = 0;
6431 DPRINTF("found neighbor page %zu (%u keys, %.1f%% full)",
6432 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);
6434 /* If the neighbor page is above threshold and has enough keys,
6435 * move one key from it. Otherwise we should try to merge them.
6436 * (A branch page must never have less than 2 keys.)
6438 minkeys = 1 + (IS_BRANCH(mn.mc_pg[mn.mc_top]));
6439 if (PAGEFILL(mc->mc_txn->mt_env, mn.mc_pg[mn.mc_top]) >= FILL_THRESHOLD && NUMKEYS(mn.mc_pg[mn.mc_top]) > minkeys)
6440 return mdb_node_move(&mn, mc);
6442 if (mc->mc_ki[ptop] == 0)
6443 rc = mdb_page_merge(&mn, mc);
6445 rc = mdb_page_merge(mc, &mn);
6446 mc->mc_flags &= ~C_INITIALIZED;
6451 /** Complete a delete operation started by #mdb_cursor_del(). */
6453 mdb_cursor_del0(MDB_cursor *mc, MDB_node *leaf)
6457 /* add overflow pages to free list */
6458 if (!IS_LEAF2(mc->mc_pg[mc->mc_top]) && F_ISSET(leaf->mn_flags, F_BIGDATA)) {
6462 memcpy(&pg, NODEDATA(leaf), sizeof(pg));
6463 ovpages = OVPAGES(NODEDSZ(leaf), mc->mc_txn->mt_env->me_psize);
6464 mc->mc_db->md_overflow_pages -= ovpages;
6465 for (i=0; i<ovpages; i++) {
6466 DPRINTF("freed ov page %zu", pg);
6467 mdb_midl_append(&mc->mc_txn->mt_free_pgs, pg);
6471 mdb_node_del(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], mc->mc_db->md_pad);
6472 mc->mc_db->md_entries--;
6473 rc = mdb_rebalance(mc);
6474 if (rc != MDB_SUCCESS)
6475 mc->mc_txn->mt_flags |= MDB_TXN_ERROR;
6476 /* if mc points past last node in page, invalidate */
6477 else if (mc->mc_ki[mc->mc_top] >= NUMKEYS(mc->mc_pg[mc->mc_top]))
6478 mc->mc_flags &= ~C_INITIALIZED;
6484 mdb_del(MDB_txn *txn, MDB_dbi dbi,
6485 MDB_val *key, MDB_val *data)
6490 MDB_val rdata, *xdata;
6494 assert(key != NULL);
6496 DPRINTF("====> delete db %u key [%s]", dbi, DKEY(key));
6498 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs || !(txn->mt_dbflags[dbi] & DB_VALID))
6501 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY)) {
6505 if (key->mv_size == 0 || key->mv_size > MDB_MAXKEYSIZE) {
6509 mdb_cursor_init(&mc, txn, dbi, &mx);
6520 rc = mdb_cursor_set(&mc, key, xdata, op, &exact);
6522 /* let mdb_page_split know about this cursor if needed:
6523 * delete will trigger a rebalance; if it needs to move
6524 * a node from one page to another, it will have to
6525 * update the parent's separator key(s). If the new sepkey
6526 * is larger than the current one, the parent page may
6527 * run out of space, triggering a split. We need this
6528 * cursor to be consistent until the end of the rebalance.
6530 mc.mc_next = txn->mt_cursors[dbi];
6531 txn->mt_cursors[dbi] = &mc;
6532 rc = mdb_cursor_del(&mc, data ? 0 : MDB_NODUPDATA);
6533 txn->mt_cursors[dbi] = mc.mc_next;
6538 /** Split a page and insert a new node.
6539 * @param[in,out] mc Cursor pointing to the page and desired insertion index.
6540 * The cursor will be updated to point to the actual page and index where
6541 * the node got inserted after the split.
6542 * @param[in] newkey The key for the newly inserted node.
6543 * @param[in] newdata The data for the newly inserted node.
6544 * @param[in] newpgno The page number, if the new node is a branch node.
6545 * @param[in] nflags The #NODE_ADD_FLAGS for the new node.
6546 * @return 0 on success, non-zero on failure.
6549 mdb_page_split(MDB_cursor *mc, MDB_val *newkey, MDB_val *newdata, pgno_t newpgno,
6550 unsigned int nflags)
6553 int rc = MDB_SUCCESS, ins_new = 0, new_root = 0, newpos = 1, did_split = 0;
6556 unsigned int i, j, split_indx, nkeys, pmax;
6558 MDB_val sepkey, rkey, xdata, *rdata = &xdata;
6560 MDB_page *mp, *rp, *pp;
6565 mp = mc->mc_pg[mc->mc_top];
6566 newindx = mc->mc_ki[mc->mc_top];
6568 DPRINTF("-----> splitting %s page %zu and adding [%s] at index %i",
6569 IS_LEAF(mp) ? "leaf" : "branch", mp->mp_pgno,
6570 DKEY(newkey), mc->mc_ki[mc->mc_top]);
6572 /* Create a right sibling. */
6573 if ((rc = mdb_page_new(mc, mp->mp_flags, 1, &rp)))
6575 DPRINTF("new right sibling: page %zu", rp->mp_pgno);
6577 if (mc->mc_snum < 2) {
6578 if ((rc = mdb_page_new(mc, P_BRANCH, 1, &pp)))
6580 /* shift current top to make room for new parent */
6581 mc->mc_pg[1] = mc->mc_pg[0];
6582 mc->mc_ki[1] = mc->mc_ki[0];
6585 mc->mc_db->md_root = pp->mp_pgno;
6586 DPRINTF("root split! new root = %zu", pp->mp_pgno);
6587 mc->mc_db->md_depth++;
6590 /* Add left (implicit) pointer. */
6591 if ((rc = mdb_node_add(mc, 0, NULL, NULL, mp->mp_pgno, 0)) != MDB_SUCCESS) {
6592 /* undo the pre-push */
6593 mc->mc_pg[0] = mc->mc_pg[1];
6594 mc->mc_ki[0] = mc->mc_ki[1];
6595 mc->mc_db->md_root = mp->mp_pgno;
6596 mc->mc_db->md_depth--;
6603 ptop = mc->mc_top-1;
6604 DPRINTF("parent branch page is %zu", mc->mc_pg[ptop]->mp_pgno);
6607 mc->mc_flags |= C_SPLITTING;
6608 mdb_cursor_copy(mc, &mn);
6609 mn.mc_pg[mn.mc_top] = rp;
6610 mn.mc_ki[ptop] = mc->mc_ki[ptop]+1;
6612 if (nflags & MDB_APPEND) {
6613 mn.mc_ki[mn.mc_top] = 0;
6615 split_indx = newindx;
6620 nkeys = NUMKEYS(mp);
6621 split_indx = nkeys / 2;
6622 if (newindx < split_indx)
6628 unsigned int lsize, rsize, ksize;
6629 /* Move half of the keys to the right sibling */
6631 x = mc->mc_ki[mc->mc_top] - split_indx;
6632 ksize = mc->mc_db->md_pad;
6633 split = LEAF2KEY(mp, split_indx, ksize);
6634 rsize = (nkeys - split_indx) * ksize;
6635 lsize = (nkeys - split_indx) * sizeof(indx_t);
6636 mp->mp_lower -= lsize;
6637 rp->mp_lower += lsize;
6638 mp->mp_upper += rsize - lsize;
6639 rp->mp_upper -= rsize - lsize;
6640 sepkey.mv_size = ksize;
6641 if (newindx == split_indx) {
6642 sepkey.mv_data = newkey->mv_data;
6644 sepkey.mv_data = split;
6647 ins = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], ksize);
6648 memcpy(rp->mp_ptrs, split, rsize);
6649 sepkey.mv_data = rp->mp_ptrs;
6650 memmove(ins+ksize, ins, (split_indx - mc->mc_ki[mc->mc_top]) * ksize);
6651 memcpy(ins, newkey->mv_data, ksize);
6652 mp->mp_lower += sizeof(indx_t);
6653 mp->mp_upper -= ksize - sizeof(indx_t);
6656 memcpy(rp->mp_ptrs, split, x * ksize);
6657 ins = LEAF2KEY(rp, x, ksize);
6658 memcpy(ins, newkey->mv_data, ksize);
6659 memcpy(ins+ksize, split + x * ksize, rsize - x * ksize);
6660 rp->mp_lower += sizeof(indx_t);
6661 rp->mp_upper -= ksize - sizeof(indx_t);
6662 mc->mc_ki[mc->mc_top] = x;
6663 mc->mc_pg[mc->mc_top] = rp;
6668 /* For leaf pages, check the split point based on what
6669 * fits where, since otherwise mdb_node_add can fail.
6671 * This check is only needed when the data items are
6672 * relatively large, such that being off by one will
6673 * make the difference between success or failure.
6675 * It's also relevant if a page happens to be laid out
6676 * such that one half of its nodes are all "small" and
6677 * the other half of its nodes are "large." If the new
6678 * item is also "large" and falls on the half with
6679 * "large" nodes, it also may not fit.
6682 unsigned int psize, nsize;
6683 /* Maximum free space in an empty page */
6684 pmax = mc->mc_txn->mt_env->me_psize - PAGEHDRSZ;
6685 nsize = mdb_leaf_size(mc->mc_txn->mt_env, newkey, newdata);
6686 if ((nkeys < 20) || (nsize > pmax/16)) {
6687 if (newindx <= split_indx) {
6690 for (i=0; i<split_indx; i++) {
6691 node = NODEPTR(mp, i);
6692 psize += NODESIZE + NODEKSZ(node) + sizeof(indx_t);
6693 if (F_ISSET(node->mn_flags, F_BIGDATA))
6694 psize += sizeof(pgno_t);
6696 psize += NODEDSZ(node);
6700 split_indx = newindx;
6711 for (i=nkeys-1; i>=split_indx; i--) {
6712 node = NODEPTR(mp, i);
6713 psize += NODESIZE + NODEKSZ(node) + sizeof(indx_t);
6714 if (F_ISSET(node->mn_flags, F_BIGDATA))
6715 psize += sizeof(pgno_t);
6717 psize += NODEDSZ(node);
6721 split_indx = newindx;
6732 /* First find the separating key between the split pages.
6733 * The case where newindx == split_indx is ambiguous; the
6734 * new item could go to the new page or stay on the original
6735 * page. If newpos == 1 it goes to the new page.
6737 if (newindx == split_indx && newpos) {
6738 sepkey.mv_size = newkey->mv_size;
6739 sepkey.mv_data = newkey->mv_data;
6741 node = NODEPTR(mp, split_indx);
6742 sepkey.mv_size = node->mn_ksize;
6743 sepkey.mv_data = NODEKEY(node);
6747 DPRINTF("separator is [%s]", DKEY(&sepkey));
6749 /* Copy separator key to the parent.
6751 if (SIZELEFT(mn.mc_pg[ptop]) < mdb_branch_size(mc->mc_txn->mt_env, &sepkey)) {
6755 rc = mdb_page_split(&mn, &sepkey, NULL, rp->mp_pgno, 0);
6758 if (mn.mc_snum == mc->mc_snum) {
6759 mc->mc_pg[mc->mc_snum] = mc->mc_pg[mc->mc_top];
6760 mc->mc_ki[mc->mc_snum] = mc->mc_ki[mc->mc_top];
6761 mc->mc_pg[mc->mc_top] = mc->mc_pg[ptop];
6762 mc->mc_ki[mc->mc_top] = mc->mc_ki[ptop];
6767 /* Right page might now have changed parent.
6768 * Check if left page also changed parent.
6770 if (mn.mc_pg[ptop] != mc->mc_pg[ptop] &&
6771 mc->mc_ki[ptop] >= NUMKEYS(mc->mc_pg[ptop])) {
6772 for (i=0; i<ptop; i++) {
6773 mc->mc_pg[i] = mn.mc_pg[i];
6774 mc->mc_ki[i] = mn.mc_ki[i];
6776 mc->mc_pg[ptop] = mn.mc_pg[ptop];
6777 mc->mc_ki[ptop] = mn.mc_ki[ptop] - 1;
6781 rc = mdb_node_add(&mn, mn.mc_ki[ptop], &sepkey, NULL, rp->mp_pgno, 0);
6784 mc->mc_flags ^= C_SPLITTING;
6785 if (rc != MDB_SUCCESS) {
6788 if (nflags & MDB_APPEND) {
6789 mc->mc_pg[mc->mc_top] = rp;
6790 mc->mc_ki[mc->mc_top] = 0;
6791 rc = mdb_node_add(mc, 0, newkey, newdata, newpgno, nflags);
6794 for (i=0; i<mc->mc_top; i++)
6795 mc->mc_ki[i] = mn.mc_ki[i];
6802 /* Move half of the keys to the right sibling. */
6804 /* grab a page to hold a temporary copy */
6805 copy = mdb_page_malloc(mc);
6809 copy->mp_pgno = mp->mp_pgno;
6810 copy->mp_flags = mp->mp_flags;
6811 copy->mp_lower = PAGEHDRSZ;
6812 copy->mp_upper = mc->mc_txn->mt_env->me_psize;
6813 mc->mc_pg[mc->mc_top] = copy;
6814 for (i = j = 0; i <= nkeys; j++) {
6815 if (i == split_indx) {
6816 /* Insert in right sibling. */
6817 /* Reset insert index for right sibling. */
6818 if (i != newindx || (newpos ^ ins_new)) {
6820 mc->mc_pg[mc->mc_top] = rp;
6824 if (i == newindx && !ins_new) {
6825 /* Insert the original entry that caused the split. */
6826 rkey.mv_data = newkey->mv_data;
6827 rkey.mv_size = newkey->mv_size;
6836 /* Update index for the new key. */
6837 mc->mc_ki[mc->mc_top] = j;
6838 } else if (i == nkeys) {
6841 node = NODEPTR(mp, i);
6842 rkey.mv_data = NODEKEY(node);
6843 rkey.mv_size = node->mn_ksize;
6845 xdata.mv_data = NODEDATA(node);
6846 xdata.mv_size = NODEDSZ(node);
6849 pgno = NODEPGNO(node);
6850 flags = node->mn_flags;
6855 if (!IS_LEAF(mp) && j == 0) {
6856 /* First branch index doesn't need key data. */
6860 rc = mdb_node_add(mc, j, &rkey, rdata, pgno, flags);
6864 nkeys = NUMKEYS(copy);
6865 for (i=0; i<nkeys; i++)
6866 mp->mp_ptrs[i] = copy->mp_ptrs[i];
6867 mp->mp_lower = copy->mp_lower;
6868 mp->mp_upper = copy->mp_upper;
6869 memcpy(NODEPTR(mp, nkeys-1), NODEPTR(copy, nkeys-1),
6870 mc->mc_txn->mt_env->me_psize - copy->mp_upper);
6872 /* reset back to original page */
6873 if (newindx < split_indx || (!newpos && newindx == split_indx)) {
6874 mc->mc_pg[mc->mc_top] = mp;
6875 if (nflags & MDB_RESERVE) {
6876 node = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
6877 if (!(node->mn_flags & F_BIGDATA))
6878 newdata->mv_data = NODEDATA(node);
6884 /* return tmp page to freelist */
6885 mdb_page_free(mc->mc_txn->mt_env, copy);
6888 /* Adjust other cursors pointing to mp */
6889 MDB_cursor *m2, *m3;
6890 MDB_dbi dbi = mc->mc_dbi;
6891 int fixup = NUMKEYS(mp);
6893 if (mc->mc_flags & C_SUB)
6896 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
6897 if (m2 == mc) continue;
6898 if (mc->mc_flags & C_SUB)
6899 m3 = &m2->mc_xcursor->mx_cursor;
6902 if (!(m3->mc_flags & C_INITIALIZED))
6904 if (m3->mc_flags & C_SPLITTING)
6909 for (k=m3->mc_top; k>=0; k--) {
6910 m3->mc_ki[k+1] = m3->mc_ki[k];
6911 m3->mc_pg[k+1] = m3->mc_pg[k];
6913 if (m3->mc_ki[0] >= split_indx) {
6918 m3->mc_pg[0] = mc->mc_pg[0];
6922 if (m3->mc_pg[mc->mc_top] == mp) {
6923 if (m3->mc_ki[mc->mc_top] >= newindx && !(nflags & MDB_SPLIT_REPLACE))
6924 m3->mc_ki[mc->mc_top]++;
6925 if (m3->mc_ki[mc->mc_top] >= fixup) {
6926 m3->mc_pg[mc->mc_top] = rp;
6927 m3->mc_ki[mc->mc_top] -= fixup;
6928 m3->mc_ki[ptop] = mn.mc_ki[ptop];
6930 } else if (!did_split && m3->mc_pg[ptop] == mc->mc_pg[ptop] &&
6931 m3->mc_ki[ptop] >= mc->mc_ki[ptop]) {
6940 mdb_put(MDB_txn *txn, MDB_dbi dbi,
6941 MDB_val *key, MDB_val *data, unsigned int flags)
6946 assert(key != NULL);
6947 assert(data != NULL);
6949 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs || !(txn->mt_dbflags[dbi] & DB_VALID))
6952 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY)) {
6956 if (key->mv_size == 0 || key->mv_size > MDB_MAXKEYSIZE) {
6960 if ((flags & (MDB_NOOVERWRITE|MDB_NODUPDATA|MDB_RESERVE|MDB_APPEND|MDB_APPENDDUP)) != flags)
6963 mdb_cursor_init(&mc, txn, dbi, &mx);
6964 return mdb_cursor_put(&mc, key, data, flags);
6968 mdb_env_set_flags(MDB_env *env, unsigned int flag, int onoff)
6970 if ((flag & CHANGEABLE) != flag)
6973 env->me_flags |= flag;
6975 env->me_flags &= ~flag;
6980 mdb_env_get_flags(MDB_env *env, unsigned int *arg)
6985 *arg = env->me_flags;
6990 mdb_env_get_path(MDB_env *env, const char **arg)
6995 *arg = env->me_path;
6999 /** Common code for #mdb_stat() and #mdb_env_stat().
7000 * @param[in] env the environment to operate in.
7001 * @param[in] db the #MDB_db record containing the stats to return.
7002 * @param[out] arg the address of an #MDB_stat structure to receive the stats.
7003 * @return 0, this function always succeeds.
7006 mdb_stat0(MDB_env *env, MDB_db *db, MDB_stat *arg)
7008 arg->ms_psize = env->me_psize;
7009 arg->ms_depth = db->md_depth;
7010 arg->ms_branch_pages = db->md_branch_pages;
7011 arg->ms_leaf_pages = db->md_leaf_pages;
7012 arg->ms_overflow_pages = db->md_overflow_pages;
7013 arg->ms_entries = db->md_entries;
7018 mdb_env_stat(MDB_env *env, MDB_stat *arg)
7022 if (env == NULL || arg == NULL)
7025 toggle = mdb_env_pick_meta(env);
7027 return mdb_stat0(env, &env->me_metas[toggle]->mm_dbs[MAIN_DBI], arg);
7031 mdb_env_info(MDB_env *env, MDB_envinfo *arg)
7035 if (env == NULL || arg == NULL)
7038 toggle = mdb_env_pick_meta(env);
7039 arg->me_mapaddr = (env->me_flags & MDB_FIXEDMAP) ? env->me_map : 0;
7040 arg->me_mapsize = env->me_mapsize;
7041 arg->me_maxreaders = env->me_maxreaders;
7042 arg->me_numreaders = env->me_numreaders;
7043 arg->me_last_pgno = env->me_metas[toggle]->mm_last_pg;
7044 arg->me_last_txnid = env->me_metas[toggle]->mm_txnid;
7048 /** Set the default comparison functions for a database.
7049 * Called immediately after a database is opened to set the defaults.
7050 * The user can then override them with #mdb_set_compare() or
7051 * #mdb_set_dupsort().
7052 * @param[in] txn A transaction handle returned by #mdb_txn_begin()
7053 * @param[in] dbi A database handle returned by #mdb_dbi_open()
7056 mdb_default_cmp(MDB_txn *txn, MDB_dbi dbi)
7058 uint16_t f = txn->mt_dbs[dbi].md_flags;
7060 txn->mt_dbxs[dbi].md_cmp =
7061 (f & MDB_REVERSEKEY) ? mdb_cmp_memnr :
7062 (f & MDB_INTEGERKEY) ? mdb_cmp_cint : mdb_cmp_memn;
7064 txn->mt_dbxs[dbi].md_dcmp =
7065 !(f & MDB_DUPSORT) ? 0 :
7066 ((f & MDB_INTEGERDUP)
7067 ? ((f & MDB_DUPFIXED) ? mdb_cmp_int : mdb_cmp_cint)
7068 : ((f & MDB_REVERSEDUP) ? mdb_cmp_memnr : mdb_cmp_memn));
7071 int mdb_dbi_open(MDB_txn *txn, const char *name, unsigned int flags, MDB_dbi *dbi)
7076 int rc, dbflag, exact;
7077 unsigned int unused = 0;
7080 if (txn->mt_dbxs[FREE_DBI].md_cmp == NULL) {
7081 mdb_default_cmp(txn, FREE_DBI);
7084 if ((flags & VALID_FLAGS) != flags)
7090 if (flags & PERSISTENT_FLAGS) {
7091 uint16_t f2 = flags & PERSISTENT_FLAGS;
7092 /* make sure flag changes get committed */
7093 if ((txn->mt_dbs[MAIN_DBI].md_flags | f2) != txn->mt_dbs[MAIN_DBI].md_flags) {
7094 txn->mt_dbs[MAIN_DBI].md_flags |= f2;
7095 txn->mt_flags |= MDB_TXN_DIRTY;
7098 mdb_default_cmp(txn, MAIN_DBI);
7102 if (txn->mt_dbxs[MAIN_DBI].md_cmp == NULL) {
7103 mdb_default_cmp(txn, MAIN_DBI);
7106 /* Is the DB already open? */
7108 for (i=2; i<txn->mt_numdbs; i++) {
7109 if (!txn->mt_dbxs[i].md_name.mv_size) {
7110 /* Remember this free slot */
7111 if (!unused) unused = i;
7114 if (len == txn->mt_dbxs[i].md_name.mv_size &&
7115 !strncmp(name, txn->mt_dbxs[i].md_name.mv_data, len)) {
7121 /* If no free slot and max hit, fail */
7122 if (!unused && txn->mt_numdbs >= txn->mt_env->me_maxdbs)
7123 return MDB_DBS_FULL;
7125 /* Find the DB info */
7126 dbflag = DB_NEW|DB_VALID;
7129 key.mv_data = (void *)name;
7130 mdb_cursor_init(&mc, txn, MAIN_DBI, NULL);
7131 rc = mdb_cursor_set(&mc, &key, &data, MDB_SET, &exact);
7132 if (rc == MDB_SUCCESS) {
7133 /* make sure this is actually a DB */
7134 MDB_node *node = NODEPTR(mc.mc_pg[mc.mc_top], mc.mc_ki[mc.mc_top]);
7135 if (!(node->mn_flags & F_SUBDATA))
7137 } else if (rc == MDB_NOTFOUND && (flags & MDB_CREATE)) {
7138 /* Create if requested */
7140 data.mv_size = sizeof(MDB_db);
7141 data.mv_data = &dummy;
7142 memset(&dummy, 0, sizeof(dummy));
7143 dummy.md_root = P_INVALID;
7144 dummy.md_flags = flags & PERSISTENT_FLAGS;
7145 rc = mdb_cursor_put(&mc, &key, &data, F_SUBDATA);
7149 /* OK, got info, add to table */
7150 if (rc == MDB_SUCCESS) {
7151 unsigned int slot = unused ? unused : txn->mt_numdbs;
7152 txn->mt_dbxs[slot].md_name.mv_data = strdup(name);
7153 txn->mt_dbxs[slot].md_name.mv_size = len;
7154 txn->mt_dbxs[slot].md_rel = NULL;
7155 txn->mt_dbflags[slot] = dbflag;
7156 memcpy(&txn->mt_dbs[slot], data.mv_data, sizeof(MDB_db));
7158 txn->mt_env->me_dbflags[slot] = txn->mt_dbs[slot].md_flags;
7159 mdb_default_cmp(txn, slot);
7168 int mdb_stat(MDB_txn *txn, MDB_dbi dbi, MDB_stat *arg)
7170 if (txn == NULL || arg == NULL || dbi >= txn->mt_numdbs)
7173 return mdb_stat0(txn->mt_env, &txn->mt_dbs[dbi], arg);
7176 void mdb_dbi_close(MDB_env *env, MDB_dbi dbi)
7179 if (dbi <= MAIN_DBI || dbi >= env->me_maxdbs)
7181 ptr = env->me_dbxs[dbi].md_name.mv_data;
7182 env->me_dbxs[dbi].md_name.mv_data = NULL;
7183 env->me_dbxs[dbi].md_name.mv_size = 0;
7187 /** Add all the DB's pages to the free list.
7188 * @param[in] mc Cursor on the DB to free.
7189 * @param[in] subs non-Zero to check for sub-DBs in this DB.
7190 * @return 0 on success, non-zero on failure.
7193 mdb_drop0(MDB_cursor *mc, int subs)
7197 rc = mdb_page_search(mc, NULL, 0);
7198 if (rc == MDB_SUCCESS) {
7203 /* LEAF2 pages have no nodes, cannot have sub-DBs */
7204 if (IS_LEAF2(mc->mc_pg[mc->mc_top]))
7207 mdb_cursor_copy(mc, &mx);
7208 while (mc->mc_snum > 0) {
7209 if (IS_LEAF(mc->mc_pg[mc->mc_top])) {
7210 for (i=0; i<NUMKEYS(mc->mc_pg[mc->mc_top]); i++) {
7211 ni = NODEPTR(mc->mc_pg[mc->mc_top], i);
7212 if (ni->mn_flags & F_BIGDATA) {
7213 int j, ovpages = OVPAGES(NODEDSZ(ni), mc->mc_txn->mt_env->me_psize);
7215 memcpy(&pg, NODEDATA(ni), sizeof(pg));
7216 for (j=0; j<ovpages; j++) {
7217 mdb_midl_append(&mc->mc_txn->mt_free_pgs, pg);
7220 } else if (subs && (ni->mn_flags & F_SUBDATA)) {
7221 mdb_xcursor_init1(mc, ni);
7222 rc = mdb_drop0(&mc->mc_xcursor->mx_cursor, 0);
7228 for (i=0; i<NUMKEYS(mc->mc_pg[mc->mc_top]); i++) {
7230 ni = NODEPTR(mc->mc_pg[mc->mc_top], i);
7233 mdb_midl_append(&mc->mc_txn->mt_free_pgs, pg);
7238 mc->mc_ki[mc->mc_top] = i;
7239 rc = mdb_cursor_sibling(mc, 1);
7241 /* no more siblings, go back to beginning
7242 * of previous level.
7246 for (i=1; i<mc->mc_snum; i++) {
7248 mc->mc_pg[i] = mx.mc_pg[i];
7253 mdb_midl_append(&mc->mc_txn->mt_free_pgs,
7254 mc->mc_db->md_root);
7259 int mdb_drop(MDB_txn *txn, MDB_dbi dbi, int del)
7264 if (!txn || !dbi || dbi >= txn->mt_numdbs || (unsigned)del > 1 || !(txn->mt_dbflags[dbi] & DB_VALID))
7267 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY))
7270 rc = mdb_cursor_open(txn, dbi, &mc);
7274 rc = mdb_drop0(mc, mc->mc_db->md_flags & MDB_DUPSORT);
7278 /* Can't delete the main DB */
7279 if (del && dbi > MAIN_DBI) {
7280 rc = mdb_del(txn, MAIN_DBI, &mc->mc_dbx->md_name, NULL);
7282 txn->mt_dbflags[dbi] = DB_STALE;
7283 mdb_dbi_close(txn->mt_env, dbi);
7286 /* reset the DB record, mark it dirty */
7287 txn->mt_dbflags[dbi] |= DB_DIRTY;
7288 txn->mt_dbs[dbi].md_depth = 0;
7289 txn->mt_dbs[dbi].md_branch_pages = 0;
7290 txn->mt_dbs[dbi].md_leaf_pages = 0;
7291 txn->mt_dbs[dbi].md_overflow_pages = 0;
7292 txn->mt_dbs[dbi].md_entries = 0;
7293 txn->mt_dbs[dbi].md_root = P_INVALID;
7295 txn->mt_flags |= MDB_TXN_DIRTY;
7298 mdb_cursor_close(mc);
7302 int mdb_set_compare(MDB_txn *txn, MDB_dbi dbi, MDB_cmp_func *cmp)
7304 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs || !(txn->mt_dbflags[dbi] & DB_VALID))
7307 txn->mt_dbxs[dbi].md_cmp = cmp;
7311 int mdb_set_dupsort(MDB_txn *txn, MDB_dbi dbi, MDB_cmp_func *cmp)
7313 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs || !(txn->mt_dbflags[dbi] & DB_VALID))
7316 txn->mt_dbxs[dbi].md_dcmp = cmp;
7320 int mdb_set_relfunc(MDB_txn *txn, MDB_dbi dbi, MDB_rel_func *rel)
7322 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs || !(txn->mt_dbflags[dbi] & DB_VALID))
7325 txn->mt_dbxs[dbi].md_rel = rel;
7329 int mdb_set_relctx(MDB_txn *txn, MDB_dbi dbi, void *ctx)
7331 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs || !(txn->mt_dbflags[dbi] & DB_VALID))
7334 txn->mt_dbxs[dbi].md_relctx = ctx;
projects / openldap / blob