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-2012 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.
35 #include <sys/types.h>
37 #include <sys/param.h>
43 #ifdef HAVE_SYS_FILE_H
60 #if !(defined(BYTE_ORDER) || defined(__BYTE_ORDER))
61 #include <resolv.h> /* defines BYTE_ORDER on HPUX and Solaris */
64 #if defined(__APPLE__) || defined (BSD)
71 #include <semaphore.h>
76 #include <valgrind/memcheck.h>
77 #define VGMEMP_CREATE(h,r,z) VALGRIND_CREATE_MEMPOOL(h,r,z)
78 #define VGMEMP_ALLOC(h,a,s) VALGRIND_MEMPOOL_ALLOC(h,a,s)
79 #define VGMEMP_FREE(h,a) VALGRIND_MEMPOOL_FREE(h,a)
80 #define VGMEMP_DESTROY(h) VALGRIND_DESTROY_MEMPOOL(h)
81 #define VGMEMP_DEFINED(a,s) VALGRIND_MAKE_MEM_DEFINED(a,s)
83 #define VGMEMP_CREATE(h,r,z)
84 #define VGMEMP_ALLOC(h,a,s)
85 #define VGMEMP_FREE(h,a)
86 #define VGMEMP_DESTROY(h)
87 #define VGMEMP_DEFINED(a,s)
91 # if (defined(_LITTLE_ENDIAN) || defined(_BIG_ENDIAN)) && !(defined(_LITTLE_ENDIAN) && defined(_BIG_ENDIAN))
92 /* Solaris just defines one or the other */
93 # define LITTLE_ENDIAN 1234
94 # define BIG_ENDIAN 4321
95 # ifdef _LITTLE_ENDIAN
96 # define BYTE_ORDER LITTLE_ENDIAN
98 # define BYTE_ORDER BIG_ENDIAN
101 # define BYTE_ORDER __BYTE_ORDER
105 #ifndef LITTLE_ENDIAN
106 #define LITTLE_ENDIAN __LITTLE_ENDIAN
109 #define BIG_ENDIAN __BIG_ENDIAN
112 #if defined(__i386) || defined(__x86_64)
113 #define MISALIGNED_OK 1
119 #if (BYTE_ORDER == LITTLE_ENDIAN) == (BYTE_ORDER == BIG_ENDIAN)
120 # error "Unknown or unsupported endianness (BYTE_ORDER)"
121 #elif (-6 & 5) || CHAR_BIT != 8 || UINT_MAX < 0xffffffff || ULONG_MAX % 0xFFFF
122 # error "Two's complement, reasonably sized integer types, please"
125 /** @defgroup internal MDB Internals
128 /** @defgroup compat Windows Compatibility Macros
129 * A bunch of macros to minimize the amount of platform-specific ifdefs
130 * needed throughout the rest of the code. When the features this library
131 * needs are similar enough to POSIX to be hidden in a one-or-two line
132 * replacement, this macro approach is used.
136 #define pthread_t DWORD
137 #define pthread_mutex_t HANDLE
138 #define pthread_key_t DWORD
139 #define pthread_self() GetCurrentThreadId()
140 #define pthread_key_create(x,y) (*(x) = TlsAlloc())
141 #define pthread_key_delete(x) TlsFree(x)
142 #define pthread_getspecific(x) TlsGetValue(x)
143 #define pthread_setspecific(x,y) TlsSetValue(x,y)
144 #define pthread_mutex_unlock(x) ReleaseMutex(x)
145 #define pthread_mutex_lock(x) WaitForSingleObject(x, INFINITE)
146 #define LOCK_MUTEX_R(env) pthread_mutex_lock((env)->me_rmutex)
147 #define UNLOCK_MUTEX_R(env) pthread_mutex_unlock((env)->me_rmutex)
148 #define LOCK_MUTEX_W(env) pthread_mutex_lock((env)->me_wmutex)
149 #define UNLOCK_MUTEX_W(env) pthread_mutex_unlock((env)->me_wmutex)
150 #define getpid() GetCurrentProcessId()
151 #define MDB_FDATASYNC(fd) (!FlushFileBuffers(fd))
152 #define MDB_MSYNC(addr,len,flags) (!FlushViewOfFile(addr,len))
153 #define ErrCode() GetLastError()
154 #define GET_PAGESIZE(x) {SYSTEM_INFO si; GetSystemInfo(&si); (x) = si.dwPageSize;}
155 #define close(fd) CloseHandle(fd)
156 #define munmap(ptr,len) UnmapViewOfFile(ptr)
159 #define LOCK_MUTEX_R(env) sem_wait((env)->me_rmutex)
160 #define UNLOCK_MUTEX_R(env) sem_post((env)->me_rmutex)
161 #define LOCK_MUTEX_W(env) sem_wait((env)->me_wmutex)
162 #define UNLOCK_MUTEX_W(env) sem_post((env)->me_wmutex)
163 #define MDB_FDATASYNC(fd) fsync(fd)
166 #define MDB_FDATASYNC(fd) fsync(fd)
168 /** Lock the reader mutex.
170 #define LOCK_MUTEX_R(env) pthread_mutex_lock(&(env)->me_txns->mti_mutex)
171 /** Unlock the reader mutex.
173 #define UNLOCK_MUTEX_R(env) pthread_mutex_unlock(&(env)->me_txns->mti_mutex)
175 /** Lock the writer mutex.
176 * Only a single write transaction is allowed at a time. Other writers
177 * will block waiting for this mutex.
179 #define LOCK_MUTEX_W(env) pthread_mutex_lock(&(env)->me_txns->mti_wmutex)
180 /** Unlock the writer mutex.
182 #define UNLOCK_MUTEX_W(env) pthread_mutex_unlock(&(env)->me_txns->mti_wmutex)
183 #endif /* USE_POSIX_SEM */
185 /** Get the error code for the last failed system function.
187 #define ErrCode() errno
189 /** An abstraction for a file handle.
190 * On POSIX systems file handles are small integers. On Windows
191 * they're opaque pointers.
195 /** A value for an invalid file handle.
196 * Mainly used to initialize file variables and signify that they are
199 #define INVALID_HANDLE_VALUE (-1)
201 /** Get the size of a memory page for the system.
202 * This is the basic size that the platform's memory manager uses, and is
203 * fundamental to the use of memory-mapped files.
205 #define GET_PAGESIZE(x) ((x) = sysconf(_SC_PAGE_SIZE))
208 #if defined(_WIN32) || defined(USE_POSIX_SEM)
211 #define MNAME_LEN (sizeof(pthread_mutex_t))
217 /** A flag for opening a file and requesting synchronous data writes.
218 * This is only used when writing a meta page. It's not strictly needed;
219 * we could just do a normal write and then immediately perform a flush.
220 * But if this flag is available it saves us an extra system call.
222 * @note If O_DSYNC is undefined but exists in /usr/include,
223 * preferably set some compiler flag to get the definition.
224 * Otherwise compile with the less efficient -DMDB_DSYNC=O_SYNC.
227 # define MDB_DSYNC O_DSYNC
231 /** Function for flushing the data of a file. Define this to fsync
232 * if fdatasync() is not supported.
234 #ifndef MDB_FDATASYNC
235 # define MDB_FDATASYNC fdatasync
239 # define MDB_MSYNC(addr,len,flags) msync(addr,len,flags)
250 /** A page number in the database.
251 * Note that 64 bit page numbers are overkill, since pages themselves
252 * already represent 12-13 bits of addressable memory, and the OS will
253 * always limit applications to a maximum of 63 bits of address space.
255 * @note In the #MDB_node structure, we only store 48 bits of this value,
256 * which thus limits us to only 60 bits of addressable data.
258 typedef MDB_ID pgno_t;
260 /** A transaction ID.
261 * See struct MDB_txn.mt_txnid for details.
263 typedef MDB_ID txnid_t;
265 /** @defgroup debug Debug Macros
269 /** Enable debug output.
270 * Set this to 1 for copious tracing. Set to 2 to add dumps of all IDLs
271 * read from and written to the database (used for free space management).
276 #if !(__STDC_VERSION__ >= 199901L || defined(__GNUC__))
277 # define DPRINTF (void) /* Vararg macros may be unsupported */
279 static int mdb_debug;
280 static txnid_t mdb_debug_start;
282 /** Print a debug message with printf formatting. */
283 # define DPRINTF(fmt, ...) /**< Requires 2 or more args */ \
284 ((void) ((mdb_debug) && \
285 fprintf(stderr, "%s:%d " fmt "\n", __func__, __LINE__, __VA_ARGS__)))
287 # define DPRINTF(fmt, ...) ((void) 0)
289 /** Print a debug string.
290 * The string is printed literally, with no format processing.
292 #define DPUTS(arg) DPRINTF("%s", arg)
295 /** A default memory page size.
296 * The actual size is platform-dependent, but we use this for
297 * boot-strapping. We probably should not be using this any more.
298 * The #GET_PAGESIZE() macro is used to get the actual size.
300 * Note that we don't currently support Huge pages. On Linux,
301 * regular data files cannot use Huge pages, and in general
302 * Huge pages aren't actually pageable. We rely on the OS
303 * demand-pager to read our data and page it out when memory
304 * pressure from other processes is high. So until OSs have
305 * actual paging support for Huge pages, they're not viable.
307 #define MDB_PAGESIZE 4096
309 /** The minimum number of keys required in a database page.
310 * Setting this to a larger value will place a smaller bound on the
311 * maximum size of a data item. Data items larger than this size will
312 * be pushed into overflow pages instead of being stored directly in
313 * the B-tree node. This value used to default to 4. With a page size
314 * of 4096 bytes that meant that any item larger than 1024 bytes would
315 * go into an overflow page. That also meant that on average 2-3KB of
316 * each overflow page was wasted space. The value cannot be lower than
317 * 2 because then there would no longer be a tree structure. With this
318 * value, items larger than 2KB will go into overflow pages, and on
319 * average only 1KB will be wasted.
321 #define MDB_MINKEYS 2
323 /** A stamp that identifies a file as an MDB file.
324 * There's nothing special about this value other than that it is easily
325 * recognizable, and it will reflect any byte order mismatches.
327 #define MDB_MAGIC 0xBEEFC0DE
329 /** The version number for a database's file format. */
330 #define MDB_VERSION 1
332 /** The maximum size of a key in the database.
333 * While data items have essentially unbounded size, we require that
334 * keys all fit onto a regular page. This limit could be raised a bit
335 * further if needed; to something just under #MDB_PAGESIZE / #MDB_MINKEYS.
337 #define MAXKEYSIZE 511
342 * This is used for printing a hex dump of a key's contents.
344 #define DKBUF char kbuf[(MAXKEYSIZE*2+1)]
345 /** Display a key in hex.
347 * Invoke a function to display a key in hex.
349 #define DKEY(x) mdb_dkey(x, kbuf)
351 #define DKBUF typedef int dummy_kbuf /* so we can put ';' after */
355 /** An invalid page number.
356 * Mainly used to denote an empty tree.
358 #define P_INVALID (~(pgno_t)0)
360 /** Test if a flag \b f is set in a flag word \b w. */
361 #define F_ISSET(w, f) (((w) & (f)) == (f))
363 /** Used for offsets within a single page.
364 * Since memory pages are typically 4 or 8KB in size, 12-13 bits,
367 typedef uint16_t indx_t;
369 /** Default size of memory map.
370 * This is certainly too small for any actual applications. Apps should always set
371 * the size explicitly using #mdb_env_set_mapsize().
373 #define DEFAULT_MAPSIZE 1048576
375 /** @defgroup readers Reader Lock Table
376 * Readers don't acquire any locks for their data access. Instead, they
377 * simply record their transaction ID in the reader table. The reader
378 * mutex is needed just to find an empty slot in the reader table. The
379 * slot's address is saved in thread-specific data so that subsequent read
380 * transactions started by the same thread need no further locking to proceed.
382 * Since the database uses multi-version concurrency control, readers don't
383 * actually need any locking. This table is used to keep track of which
384 * readers are using data from which old transactions, so that we'll know
385 * when a particular old transaction is no longer in use. Old transactions
386 * that have discarded any data pages can then have those pages reclaimed
387 * for use by a later write transaction.
389 * The lock table is constructed such that reader slots are aligned with the
390 * processor's cache line size. Any slot is only ever used by one thread.
391 * This alignment guarantees that there will be no contention or cache
392 * thrashing as threads update their own slot info, and also eliminates
393 * any need for locking when accessing a slot.
395 * A writer thread will scan every slot in the table to determine the oldest
396 * outstanding reader transaction. Any freed pages older than this will be
397 * reclaimed by the writer. The writer doesn't use any locks when scanning
398 * this table. This means that there's no guarantee that the writer will
399 * see the most up-to-date reader info, but that's not required for correct
400 * operation - all we need is to know the upper bound on the oldest reader,
401 * we don't care at all about the newest reader. So the only consequence of
402 * reading stale information here is that old pages might hang around a
403 * while longer before being reclaimed. That's actually good anyway, because
404 * the longer we delay reclaiming old pages, the more likely it is that a
405 * string of contiguous pages can be found after coalescing old pages from
406 * many old transactions together.
408 * @todo We don't actually do such coalescing yet, we grab pages from one
409 * old transaction at a time.
412 /** Number of slots in the reader table.
413 * This value was chosen somewhat arbitrarily. 126 readers plus a
414 * couple mutexes fit exactly into 8KB on my development machine.
415 * Applications should set the table size using #mdb_env_set_maxreaders().
417 #define DEFAULT_READERS 126
419 /** The size of a CPU cache line in bytes. We want our lock structures
420 * aligned to this size to avoid false cache line sharing in the
422 * This value works for most CPUs. For Itanium this should be 128.
428 /** The information we store in a single slot of the reader table.
429 * In addition to a transaction ID, we also record the process and
430 * thread ID that owns a slot, so that we can detect stale information,
431 * e.g. threads or processes that went away without cleaning up.
432 * @note We currently don't check for stale records. We simply re-init
433 * the table when we know that we're the only process opening the
436 typedef struct MDB_rxbody {
437 /** The current Transaction ID when this transaction began.
438 * Multiple readers that start at the same time will probably have the
439 * same ID here. Again, it's not important to exclude them from
440 * anything; all we need to know is which version of the DB they
441 * started from so we can avoid overwriting any data used in that
442 * particular version.
445 /** The process ID of the process owning this reader txn. */
447 /** The thread ID of the thread owning this txn. */
451 /** The actual reader record, with cacheline padding. */
452 typedef struct MDB_reader {
455 /** shorthand for mrb_txnid */
456 #define mr_txnid mru.mrx.mrb_txnid
457 #define mr_pid mru.mrx.mrb_pid
458 #define mr_tid mru.mrx.mrb_tid
459 /** cache line alignment */
460 char pad[(sizeof(MDB_rxbody)+CACHELINE-1) & ~(CACHELINE-1)];
464 /** The header for the reader table.
465 * The table resides in a memory-mapped file. (This is a different file
466 * than is used for the main database.)
468 * For POSIX the actual mutexes reside in the shared memory of this
469 * mapped file. On Windows, mutexes are named objects allocated by the
470 * kernel; we store the mutex names in this mapped file so that other
471 * processes can grab them. This same approach is also used on
472 * MacOSX/Darwin (using named semaphores) since MacOSX doesn't support
473 * process-shared POSIX mutexes. For these cases where a named object
474 * is used, the object name is derived from a 64 bit FNV hash of the
475 * environment pathname. As such, naming collisions are extremely
476 * unlikely. If a collision occurs, the results are unpredictable.
478 typedef struct MDB_txbody {
479 /** Stamp identifying this as an MDB file. It must be set
482 /** Version number of this lock file. Must be set to #MDB_VERSION. */
483 uint32_t mtb_version;
484 #if defined(_WIN32) || defined(USE_POSIX_SEM)
485 char mtb_rmname[MNAME_LEN];
487 /** Mutex protecting access to this table.
488 * This is the reader lock that #LOCK_MUTEX_R acquires.
490 pthread_mutex_t mtb_mutex;
492 /** The ID of the last transaction committed to the database.
493 * This is recorded here only for convenience; the value can always
494 * be determined by reading the main database meta pages.
497 /** The number of slots that have been used in the reader table.
498 * This always records the maximum count, it is not decremented
499 * when readers release their slots.
501 unsigned mtb_numreaders;
504 /** The actual reader table definition. */
505 typedef struct MDB_txninfo {
508 #define mti_magic mt1.mtb.mtb_magic
509 #define mti_version mt1.mtb.mtb_version
510 #define mti_mutex mt1.mtb.mtb_mutex
511 #define mti_rmname mt1.mtb.mtb_rmname
512 #define mti_txnid mt1.mtb.mtb_txnid
513 #define mti_numreaders mt1.mtb.mtb_numreaders
514 char pad[(sizeof(MDB_txbody)+CACHELINE-1) & ~(CACHELINE-1)];
517 #if defined(_WIN32) || defined(USE_POSIX_SEM)
518 char mt2_wmname[MNAME_LEN];
519 #define mti_wmname mt2.mt2_wmname
521 pthread_mutex_t mt2_wmutex;
522 #define mti_wmutex mt2.mt2_wmutex
524 char pad[(MNAME_LEN+CACHELINE-1) & ~(CACHELINE-1)];
526 MDB_reader mti_readers[1];
530 /** Common header for all page types.
531 * Overflow records occupy a number of contiguous pages with no
532 * headers on any page after the first.
534 typedef struct MDB_page {
535 #define mp_pgno mp_p.p_pgno
536 #define mp_next mp_p.p_next
538 pgno_t p_pgno; /**< page number */
539 void * p_next; /**< for in-memory list of freed structs */
542 /** @defgroup mdb_page Page Flags
544 * Flags for the page headers.
547 #define P_BRANCH 0x01 /**< branch page */
548 #define P_LEAF 0x02 /**< leaf page */
549 #define P_OVERFLOW 0x04 /**< overflow page */
550 #define P_META 0x08 /**< meta page */
551 #define P_DIRTY 0x10 /**< dirty page */
552 #define P_LEAF2 0x20 /**< for #MDB_DUPFIXED records */
553 #define P_SUBP 0x40 /**< for #MDB_DUPSORT sub-pages */
555 uint16_t mp_flags; /**< @ref mdb_page */
556 #define mp_lower mp_pb.pb.pb_lower
557 #define mp_upper mp_pb.pb.pb_upper
558 #define mp_pages mp_pb.pb_pages
561 indx_t pb_lower; /**< lower bound of free space */
562 indx_t pb_upper; /**< upper bound of free space */
564 uint32_t pb_pages; /**< number of overflow pages */
566 indx_t mp_ptrs[1]; /**< dynamic size */
569 /** Size of the page header, excluding dynamic data at the end */
570 #define PAGEHDRSZ ((unsigned) offsetof(MDB_page, mp_ptrs))
572 /** Address of first usable data byte in a page, after the header */
573 #define METADATA(p) ((void *)((char *)(p) + PAGEHDRSZ))
575 /** Number of nodes on a page */
576 #define NUMKEYS(p) (((p)->mp_lower - PAGEHDRSZ) >> 1)
578 /** The amount of space remaining in the page */
579 #define SIZELEFT(p) (indx_t)((p)->mp_upper - (p)->mp_lower)
581 /** The percentage of space used in the page, in tenths of a percent. */
582 #define PAGEFILL(env, p) (1000L * ((env)->me_psize - PAGEHDRSZ - SIZELEFT(p)) / \
583 ((env)->me_psize - PAGEHDRSZ))
584 /** The minimum page fill factor, in tenths of a percent.
585 * Pages emptier than this are candidates for merging.
587 #define FILL_THRESHOLD 250
589 /** Test if a page is a leaf page */
590 #define IS_LEAF(p) F_ISSET((p)->mp_flags, P_LEAF)
591 /** Test if a page is a LEAF2 page */
592 #define IS_LEAF2(p) F_ISSET((p)->mp_flags, P_LEAF2)
593 /** Test if a page is a branch page */
594 #define IS_BRANCH(p) F_ISSET((p)->mp_flags, P_BRANCH)
595 /** Test if a page is an overflow page */
596 #define IS_OVERFLOW(p) F_ISSET((p)->mp_flags, P_OVERFLOW)
597 /** Test if a page is a sub page */
598 #define IS_SUBP(p) F_ISSET((p)->mp_flags, P_SUBP)
600 /** The number of overflow pages needed to store the given size. */
601 #define OVPAGES(size, psize) ((PAGEHDRSZ-1 + (size)) / (psize) + 1)
603 /** Header for a single key/data pair within a page.
604 * We guarantee 2-byte alignment for nodes.
606 typedef struct MDB_node {
607 /** lo and hi are used for data size on leaf nodes and for
608 * child pgno on branch nodes. On 64 bit platforms, flags
609 * is also used for pgno. (Branch nodes have no flags).
610 * They are in host byte order in case that lets some
611 * accesses be optimized into a 32-bit word access.
613 #define mn_lo mn_offset[BYTE_ORDER!=LITTLE_ENDIAN]
614 #define mn_hi mn_offset[BYTE_ORDER==LITTLE_ENDIAN] /**< part of dsize or pgno */
615 unsigned short mn_offset[2]; /**< storage for #mn_lo and #mn_hi */
616 /** @defgroup mdb_node Node Flags
618 * Flags for node headers.
621 #define F_BIGDATA 0x01 /**< data put on overflow page */
622 #define F_SUBDATA 0x02 /**< data is a sub-database */
623 #define F_DUPDATA 0x04 /**< data has duplicates */
625 /** valid flags for #mdb_node_add() */
626 #define NODE_ADD_FLAGS (F_DUPDATA|F_SUBDATA|MDB_RESERVE|MDB_APPEND)
629 unsigned short mn_flags; /**< @ref mdb_node */
630 unsigned short mn_ksize; /**< key size */
631 char mn_data[1]; /**< key and data are appended here */
634 /** Size of the node header, excluding dynamic data at the end */
635 #define NODESIZE offsetof(MDB_node, mn_data)
637 /** Bit position of top word in page number, for shifting mn_flags */
638 #define PGNO_TOPWORD ((pgno_t)-1 > 0xffffffffu ? 32 : 0)
640 /** Size of a node in a branch page with a given key.
641 * This is just the node header plus the key, there is no data.
643 #define INDXSIZE(k) (NODESIZE + ((k) == NULL ? 0 : (k)->mv_size))
645 /** Size of a node in a leaf page with a given key and data.
646 * This is node header plus key plus data size.
648 #define LEAFSIZE(k, d) (NODESIZE + (k)->mv_size + (d)->mv_size)
650 /** Address of node \b i in page \b p */
651 #define NODEPTR(p, i) ((MDB_node *)((char *)(p) + (p)->mp_ptrs[i]))
653 /** Address of the key for the node */
654 #define NODEKEY(node) (void *)((node)->mn_data)
656 /** Address of the data for a node */
657 #define NODEDATA(node) (void *)((char *)(node)->mn_data + (node)->mn_ksize)
659 /** Get the page number pointed to by a branch node */
660 #define NODEPGNO(node) \
661 ((node)->mn_lo | ((pgno_t) (node)->mn_hi << 16) | \
662 (PGNO_TOPWORD ? ((pgno_t) (node)->mn_flags << PGNO_TOPWORD) : 0))
663 /** Set the page number in a branch node */
664 #define SETPGNO(node,pgno) do { \
665 (node)->mn_lo = (pgno) & 0xffff; (node)->mn_hi = (pgno) >> 16; \
666 if (PGNO_TOPWORD) (node)->mn_flags = (pgno) >> PGNO_TOPWORD; } while(0)
668 /** Get the size of the data in a leaf node */
669 #define NODEDSZ(node) ((node)->mn_lo | ((unsigned)(node)->mn_hi << 16))
670 /** Set the size of the data for a leaf node */
671 #define SETDSZ(node,size) do { \
672 (node)->mn_lo = (size) & 0xffff; (node)->mn_hi = (size) >> 16;} while(0)
673 /** The size of a key in a node */
674 #define NODEKSZ(node) ((node)->mn_ksize)
676 /** Copy a page number from src to dst */
678 #define COPY_PGNO(dst,src) dst = src
680 #if SIZE_MAX > 4294967295UL
681 #define COPY_PGNO(dst,src) do { \
682 unsigned short *s, *d; \
683 s = (unsigned short *)&(src); \
684 d = (unsigned short *)&(dst); \
691 #define COPY_PGNO(dst,src) do { \
692 unsigned short *s, *d; \
693 s = (unsigned short *)&(src); \
694 d = (unsigned short *)&(dst); \
700 /** The address of a key in a LEAF2 page.
701 * LEAF2 pages are used for #MDB_DUPFIXED sorted-duplicate sub-DBs.
702 * There are no node headers, keys are stored contiguously.
704 #define LEAF2KEY(p, i, ks) ((char *)(p) + PAGEHDRSZ + ((i)*(ks)))
706 /** Set the \b node's key into \b key, if requested. */
707 #define MDB_SET_KEY(node, key) { if ((key) != NULL) { \
708 (key)->mv_size = NODEKSZ(node); (key)->mv_data = NODEKEY(node); } }
710 /** Information about a single database in the environment. */
711 typedef struct MDB_db {
712 uint32_t md_pad; /**< also ksize for LEAF2 pages */
713 uint16_t md_flags; /**< @ref mdb_open */
714 uint16_t md_depth; /**< depth of this tree */
715 pgno_t md_branch_pages; /**< number of internal pages */
716 pgno_t md_leaf_pages; /**< number of leaf pages */
717 pgno_t md_overflow_pages; /**< number of overflow pages */
718 size_t md_entries; /**< number of data items */
719 pgno_t md_root; /**< the root page of this tree */
722 /** Handle for the DB used to track free pages. */
724 /** Handle for the default DB. */
727 /** Meta page content. */
728 typedef struct MDB_meta {
729 /** Stamp identifying this as an MDB file. It must be set
732 /** Version number of this lock file. Must be set to #MDB_VERSION. */
734 void *mm_address; /**< address for fixed mapping */
735 size_t mm_mapsize; /**< size of mmap region */
736 MDB_db mm_dbs[2]; /**< first is free space, 2nd is main db */
737 /** The size of pages used in this DB */
738 #define mm_psize mm_dbs[0].md_pad
739 /** Any persistent environment flags. @ref mdb_env */
740 #define mm_flags mm_dbs[0].md_flags
741 pgno_t mm_last_pg; /**< last used page in file */
742 txnid_t mm_txnid; /**< txnid that committed this page */
745 /** Buffer for a stack-allocated dirty page.
746 * The members define size and alignment, and silence type
747 * aliasing warnings. They are not used directly; that could
748 * mean incorrectly using several union members in parallel.
750 typedef union MDB_pagebuf {
751 char mb_raw[MDB_PAGESIZE];
754 char mm_pad[PAGEHDRSZ];
759 /** Auxiliary DB info.
760 * The information here is mostly static/read-only. There is
761 * only a single copy of this record in the environment.
763 typedef struct MDB_dbx {
764 MDB_val md_name; /**< name of the database */
765 MDB_cmp_func *md_cmp; /**< function for comparing keys */
766 MDB_cmp_func *md_dcmp; /**< function for comparing data items */
767 MDB_rel_func *md_rel; /**< user relocate function */
768 void *md_relctx; /**< user-provided context for md_rel */
771 /** A database transaction.
772 * Every operation requires a transaction handle.
775 MDB_txn *mt_parent; /**< parent of a nested txn */
776 MDB_txn *mt_child; /**< nested txn under this txn */
777 pgno_t mt_next_pgno; /**< next unallocated page */
778 /** The ID of this transaction. IDs are integers incrementing from 1.
779 * Only committed write transactions increment the ID. If a transaction
780 * aborts, the ID may be re-used by the next writer.
783 MDB_env *mt_env; /**< the DB environment */
784 /** The list of pages that became unused during this transaction.
788 MDB_ID2L dirty_list; /**< modified pages */
789 MDB_reader *reader; /**< this thread's slot in the reader table */
791 /** Array of records for each DB known in the environment. */
793 /** Array of MDB_db records for each known DB */
795 /** @defgroup mt_dbflag Transaction DB Flags
799 #define DB_DIRTY 0x01 /**< DB was written in this txn */
800 #define DB_STALE 0x02 /**< DB record is older than txnID */
802 /** Array of cursors for each DB */
803 MDB_cursor **mt_cursors;
804 /** Array of flags for each DB */
805 unsigned char *mt_dbflags;
806 /** Number of DB records in use. This number only ever increments;
807 * we don't decrement it when individual DB handles are closed.
811 /** @defgroup mdb_txn Transaction Flags
815 #define MDB_TXN_RDONLY 0x01 /**< read-only transaction */
816 #define MDB_TXN_ERROR 0x02 /**< an error has occurred */
818 unsigned int mt_flags; /**< @ref mdb_txn */
819 /** Tracks which of the two meta pages was used at the start
820 * of this transaction.
822 unsigned int mt_toggle;
825 /** Enough space for 2^32 nodes with minimum of 2 keys per node. I.e., plenty.
826 * At 4 keys per node, enough for 2^64 nodes, so there's probably no need to
827 * raise this on a 64 bit machine.
829 #define CURSOR_STACK 32
833 /** Cursors are used for all DB operations */
835 /** Next cursor on this DB in this txn */
837 /** Original cursor if this is a shadow */
839 /** Context used for databases with #MDB_DUPSORT, otherwise NULL */
840 struct MDB_xcursor *mc_xcursor;
841 /** The transaction that owns this cursor */
843 /** The database handle this cursor operates on */
845 /** The database record for this cursor */
847 /** The database auxiliary record for this cursor */
849 /** The @ref mt_dbflag for this database */
850 unsigned char *mc_dbflag;
851 unsigned short mc_snum; /**< number of pushed pages */
852 unsigned short mc_top; /**< index of top page, normally mc_snum-1 */
853 /** @defgroup mdb_cursor Cursor Flags
855 * Cursor state flags.
858 #define C_INITIALIZED 0x01 /**< cursor has been initialized and is valid */
859 #define C_EOF 0x02 /**< No more data */
860 #define C_SUB 0x04 /**< Cursor is a sub-cursor */
861 #define C_SHADOW 0x08 /**< Cursor is a dup from a parent txn */
862 #define C_ALLOCD 0x10 /**< Cursor was malloc'd */
863 #define C_SPLITTING 0x20 /**< Cursor is in page_split */
865 unsigned int mc_flags; /**< @ref mdb_cursor */
866 MDB_page *mc_pg[CURSOR_STACK]; /**< stack of pushed pages */
867 indx_t mc_ki[CURSOR_STACK]; /**< stack of page indices */
870 /** Context for sorted-dup records.
871 * We could have gone to a fully recursive design, with arbitrarily
872 * deep nesting of sub-databases. But for now we only handle these
873 * levels - main DB, optional sub-DB, sorted-duplicate DB.
875 typedef struct MDB_xcursor {
876 /** A sub-cursor for traversing the Dup DB */
877 MDB_cursor mx_cursor;
878 /** The database record for this Dup DB */
880 /** The auxiliary DB record for this Dup DB */
882 /** The @ref mt_dbflag for this Dup DB */
883 unsigned char mx_dbflag;
886 /** A set of pages freed by an earlier transaction. */
887 typedef struct MDB_oldpages {
888 /** Usually we only read one record from the FREEDB at a time, but
889 * in case we read more, this will chain them together.
891 struct MDB_oldpages *mo_next;
892 /** The ID of the transaction in which these pages were freed. */
894 /** An #MDB_IDL of the pages */
895 pgno_t mo_pages[1]; /* dynamic */
898 /** The database environment. */
900 HANDLE me_fd; /**< The main data file */
901 HANDLE me_lfd; /**< The lock file */
902 HANDLE me_mfd; /**< just for writing the meta pages */
903 /** Failed to update the meta page. Probably an I/O error. */
904 #define MDB_FATAL_ERROR 0x80000000U
905 uint32_t me_flags; /**< @ref mdb_env */
906 unsigned int me_psize; /**< size of a page, from #GET_PAGESIZE */
907 unsigned int me_maxreaders; /**< size of the reader table */
908 MDB_dbi me_numdbs; /**< number of DBs opened */
909 MDB_dbi me_maxdbs; /**< size of the DB table */
910 char *me_path; /**< path to the DB files */
911 char *me_map; /**< the memory map of the data file */
912 MDB_txninfo *me_txns; /**< the memory map of the lock file */
913 MDB_meta *me_metas[2]; /**< pointers to the two meta pages */
914 MDB_txn *me_txn; /**< current write transaction */
915 size_t me_mapsize; /**< size of the data memory map */
916 off_t me_size; /**< current file size */
917 pgno_t me_maxpg; /**< me_mapsize / me_psize */
918 txnid_t me_pgfirst; /**< ID of first old page record we used */
919 txnid_t me_pglast; /**< ID of last old page record we used */
920 MDB_dbx *me_dbxs; /**< array of static DB info */
921 uint16_t *me_dbflags; /**< array of DB flags */
922 MDB_oldpages *me_pghead; /**< list of old page records */
923 MDB_oldpages *me_pgfree; /**< list of page records to free */
924 pthread_key_t me_txkey; /**< thread-key for readers */
925 MDB_page *me_dpages; /**< list of malloc'd blocks for re-use */
926 /** IDL of pages that became unused in a write txn */
928 /** ID2L of pages that were written during a write txn */
929 MDB_ID2 me_dirty_list[MDB_IDL_UM_SIZE];
931 HANDLE me_rmutex; /* Windows mutexes don't reside in shared mem */
935 sem_t *me_rmutex; /* Apple doesn't support shared mutexes */
939 /** max number of pages to commit in one writev() call */
940 #define MDB_COMMIT_PAGES 64
941 #if defined(IOV_MAX) && IOV_MAX < MDB_COMMIT_PAGES
942 #undef MDB_COMMIT_PAGES
943 #define MDB_COMMIT_PAGES IOV_MAX
946 static MDB_page *mdb_page_alloc(MDB_cursor *mc, int num);
947 static MDB_page *mdb_page_new(MDB_cursor *mc, uint32_t flags, int num);
948 static int mdb_page_touch(MDB_cursor *mc);
950 static int mdb_page_get(MDB_txn *txn, pgno_t pgno, MDB_page **mp);
951 static int mdb_page_search_root(MDB_cursor *mc,
952 MDB_val *key, int modify);
953 #define MDB_PS_MODIFY 1
954 #define MDB_PS_ROOTONLY 2
955 static int mdb_page_search(MDB_cursor *mc,
956 MDB_val *key, int flags);
957 static int mdb_page_merge(MDB_cursor *csrc, MDB_cursor *cdst);
959 #define MDB_SPLIT_REPLACE MDB_APPENDDUP /**< newkey is not new */
960 static int mdb_page_split(MDB_cursor *mc, MDB_val *newkey, MDB_val *newdata,
961 pgno_t newpgno, unsigned int nflags);
963 static int mdb_env_read_header(MDB_env *env, MDB_meta *meta);
964 static int mdb_env_pick_meta(const MDB_env *env);
965 static int mdb_env_write_meta(MDB_txn *txn);
967 static MDB_node *mdb_node_search(MDB_cursor *mc, MDB_val *key, int *exactp);
968 static int mdb_node_add(MDB_cursor *mc, indx_t indx,
969 MDB_val *key, MDB_val *data, pgno_t pgno, unsigned int flags);
970 static void mdb_node_del(MDB_page *mp, indx_t indx, int ksize);
971 static void mdb_node_shrink(MDB_page *mp, indx_t indx);
972 static int mdb_node_move(MDB_cursor *csrc, MDB_cursor *cdst);
973 static int mdb_node_read(MDB_txn *txn, MDB_node *leaf, MDB_val *data);
974 static size_t mdb_leaf_size(MDB_env *env, MDB_val *key, MDB_val *data);
975 static size_t mdb_branch_size(MDB_env *env, MDB_val *key);
977 static int mdb_rebalance(MDB_cursor *mc);
978 static int mdb_update_key(MDB_page *mp, indx_t indx, MDB_val *key);
980 static void mdb_cursor_pop(MDB_cursor *mc);
981 static int mdb_cursor_push(MDB_cursor *mc, MDB_page *mp);
983 static int mdb_cursor_del0(MDB_cursor *mc, MDB_node *leaf);
984 static int mdb_cursor_sibling(MDB_cursor *mc, int move_right);
985 static int mdb_cursor_next(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op);
986 static int mdb_cursor_prev(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op);
987 static int mdb_cursor_set(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op,
989 static int mdb_cursor_first(MDB_cursor *mc, MDB_val *key, MDB_val *data);
990 static int mdb_cursor_last(MDB_cursor *mc, MDB_val *key, MDB_val *data);
992 static void mdb_cursor_init(MDB_cursor *mc, MDB_txn *txn, MDB_dbi dbi, MDB_xcursor *mx);
993 static void mdb_xcursor_init0(MDB_cursor *mc);
994 static void mdb_xcursor_init1(MDB_cursor *mc, MDB_node *node);
996 static int mdb_drop0(MDB_cursor *mc, int subs);
997 static void mdb_default_cmp(MDB_txn *txn, MDB_dbi dbi);
1000 static MDB_cmp_func mdb_cmp_memn, mdb_cmp_memnr, mdb_cmp_int, mdb_cmp_cint, mdb_cmp_long;
1004 static SECURITY_DESCRIPTOR mdb_null_sd;
1005 static SECURITY_ATTRIBUTES mdb_all_sa;
1006 static int mdb_sec_inited;
1009 /** Return the library version info. */
1011 mdb_version(int *major, int *minor, int *patch)
1013 if (major) *major = MDB_VERSION_MAJOR;
1014 if (minor) *minor = MDB_VERSION_MINOR;
1015 if (patch) *patch = MDB_VERSION_PATCH;
1016 return MDB_VERSION_STRING;
1019 /** Table of descriptions for MDB @ref errors */
1020 static char *const mdb_errstr[] = {
1021 "MDB_KEYEXIST: Key/data pair already exists",
1022 "MDB_NOTFOUND: No matching key/data pair found",
1023 "MDB_PAGE_NOTFOUND: Requested page not found",
1024 "MDB_CORRUPTED: Located page was wrong type",
1025 "MDB_PANIC: Update of meta page failed",
1026 "MDB_VERSION_MISMATCH: Database environment version mismatch"
1030 mdb_strerror(int err)
1033 return ("Successful return: 0");
1035 if (err >= MDB_KEYEXIST && err <= MDB_VERSION_MISMATCH)
1036 return mdb_errstr[err - MDB_KEYEXIST];
1038 return strerror(err);
1042 /** Display a key in hexadecimal and return the address of the result.
1043 * @param[in] key the key to display
1044 * @param[in] buf the buffer to write into. Should always be #DKBUF.
1045 * @return The key in hexadecimal form.
1048 mdb_dkey(MDB_val *key, char *buf)
1051 unsigned char *c = key->mv_data;
1053 if (key->mv_size > MAXKEYSIZE)
1054 return "MAXKEYSIZE";
1055 /* may want to make this a dynamic check: if the key is mostly
1056 * printable characters, print it as-is instead of converting to hex.
1060 for (i=0; i<key->mv_size; i++)
1061 ptr += sprintf(ptr, "%02x", *c++);
1063 sprintf(buf, "%.*s", key->mv_size, key->mv_data);
1068 /** Display all the keys in the page. */
1070 mdb_page_list(MDB_page *mp)
1073 unsigned int i, nkeys, nsize;
1077 nkeys = NUMKEYS(mp);
1078 fprintf(stderr, "numkeys %d\n", nkeys);
1079 for (i=0; i<nkeys; i++) {
1080 node = NODEPTR(mp, i);
1081 key.mv_size = node->mn_ksize;
1082 key.mv_data = node->mn_data;
1083 nsize = NODESIZE + NODEKSZ(node) + sizeof(indx_t);
1084 if (F_ISSET(node->mn_flags, F_BIGDATA))
1085 nsize += sizeof(pgno_t);
1087 nsize += NODEDSZ(node);
1088 fprintf(stderr, "key %d: nsize %d, %s\n", i, nsize, DKEY(&key));
1093 mdb_cursor_chk(MDB_cursor *mc)
1099 if (!mc->mc_snum && !(mc->mc_flags & C_INITIALIZED)) return;
1100 for (i=0; i<mc->mc_top; i++) {
1102 node = NODEPTR(mp, mc->mc_ki[i]);
1103 if (NODEPGNO(node) != mc->mc_pg[i+1]->mp_pgno)
1106 if (mc->mc_ki[i] >= NUMKEYS(mc->mc_pg[i]))
1112 /** Count all the pages in each DB and in the freelist
1113 * and make sure it matches the actual number of pages
1116 static void mdb_audit(MDB_txn *txn)
1120 MDB_ID freecount, count;
1125 mdb_cursor_init(&mc, txn, FREE_DBI, NULL);
1126 while ((rc = mdb_cursor_get(&mc, &key, &data, MDB_NEXT)) == 0)
1127 freecount += *(MDB_ID *)data.mv_data;
1130 for (i = 0; i<txn->mt_numdbs; i++) {
1131 MDB_xcursor mx, *mxp;
1132 mxp = (txn->mt_dbs[i].md_flags & MDB_DUPSORT) ? &mx : NULL;
1133 mdb_cursor_init(&mc, txn, i, mxp);
1134 if (txn->mt_dbs[i].md_root == P_INVALID)
1136 count += txn->mt_dbs[i].md_branch_pages +
1137 txn->mt_dbs[i].md_leaf_pages +
1138 txn->mt_dbs[i].md_overflow_pages;
1139 if (txn->mt_dbs[i].md_flags & MDB_DUPSORT) {
1140 mdb_page_search(&mc, NULL, 0);
1144 mp = mc.mc_pg[mc.mc_top];
1145 for (j=0; j<NUMKEYS(mp); j++) {
1146 MDB_node *leaf = NODEPTR(mp, j);
1147 if (leaf->mn_flags & F_SUBDATA) {
1149 memcpy(&db, NODEDATA(leaf), sizeof(db));
1150 count += db.md_branch_pages + db.md_leaf_pages +
1151 db.md_overflow_pages;
1155 while (mdb_cursor_sibling(&mc, 1) == 0);
1158 if (freecount + count + 2 /* metapages */ != txn->mt_next_pgno) {
1159 fprintf(stderr, "audit: %lu freecount: %lu count: %lu total: %lu next_pgno: %lu\n",
1160 txn->mt_txnid, freecount, count+2, freecount+count+2, txn->mt_next_pgno);
1166 mdb_cmp(MDB_txn *txn, MDB_dbi dbi, const MDB_val *a, const MDB_val *b)
1168 return txn->mt_dbxs[dbi].md_cmp(a, b);
1172 mdb_dcmp(MDB_txn *txn, MDB_dbi dbi, const MDB_val *a, const MDB_val *b)
1174 if (txn->mt_dbxs[dbi].md_dcmp)
1175 return txn->mt_dbxs[dbi].md_dcmp(a, b);
1177 return EINVAL; /* too bad you can't distinguish this from a valid result */
1180 /** Allocate a single page.
1181 * Re-use old malloc'd pages first, otherwise just malloc.
1184 mdb_page_malloc(MDB_cursor *mc) {
1186 size_t sz = mc->mc_txn->mt_env->me_psize;
1187 if ((ret = mc->mc_txn->mt_env->me_dpages) != NULL) {
1188 VGMEMP_ALLOC(mc->mc_txn->mt_env, ret, sz);
1189 VGMEMP_DEFINED(ret, sizeof(ret->mp_next));
1190 mc->mc_txn->mt_env->me_dpages = ret->mp_next;
1191 } else if ((ret = malloc(sz)) != NULL) {
1192 VGMEMP_ALLOC(mc->mc_txn->mt_env, ret, sz);
1197 /** Allocate pages for writing.
1198 * If there are free pages available from older transactions, they
1199 * will be re-used first. Otherwise a new page will be allocated.
1200 * @param[in] mc cursor A cursor handle identifying the transaction and
1201 * database for which we are allocating.
1202 * @param[in] num the number of pages to allocate.
1203 * @return Address of the allocated page(s). Requests for multiple pages
1204 * will always be satisfied by a single contiguous chunk of memory.
1207 mdb_page_alloc(MDB_cursor *mc, int num)
1209 MDB_txn *txn = mc->mc_txn;
1211 pgno_t pgno = P_INVALID;
1214 /* The free list won't have any content at all until txn 2 has
1215 * committed. The pages freed by txn 2 will be unreferenced
1216 * after txn 3 commits, and so will be safe to re-use in txn 4.
1218 if (txn->mt_txnid > 3) {
1220 if (!txn->mt_env->me_pghead &&
1221 txn->mt_dbs[FREE_DBI].md_root != P_INVALID) {
1222 /* See if there's anything in the free DB */
1226 txnid_t *kptr, oldest, last;
1228 mdb_cursor_init(&m2, txn, FREE_DBI, NULL);
1229 if (!txn->mt_env->me_pgfirst) {
1230 mdb_page_search(&m2, NULL, 0);
1231 leaf = NODEPTR(m2.mc_pg[m2.mc_top], 0);
1232 kptr = (txnid_t *)NODEKEY(leaf);
1239 last = txn->mt_env->me_pglast + 1;
1241 key.mv_data = &last;
1242 key.mv_size = sizeof(last);
1243 rc = mdb_cursor_set(&m2, &key, &data, MDB_SET, &exact);
1246 last = *(txnid_t *)key.mv_data;
1251 oldest = txn->mt_txnid - 1;
1252 for (i=0; i<txn->mt_env->me_txns->mti_numreaders; i++) {
1253 txnid_t mr = txn->mt_env->me_txns->mti_readers[i].mr_txnid;
1254 if (mr && mr < oldest)
1259 if (oldest > last) {
1260 /* It's usable, grab it.
1265 if (!txn->mt_env->me_pgfirst) {
1266 mdb_node_read(txn, leaf, &data);
1268 txn->mt_env->me_pglast = last;
1269 if (!txn->mt_env->me_pgfirst)
1270 txn->mt_env->me_pgfirst = last;
1271 idl = (MDB_ID *) data.mv_data;
1272 /* We might have a zero-length IDL due to freelist growth
1273 * during a prior commit
1275 if (!idl[0]) goto again;
1276 mop = malloc(sizeof(MDB_oldpages) + MDB_IDL_SIZEOF(idl) - sizeof(pgno_t));
1277 mop->mo_next = txn->mt_env->me_pghead;
1278 mop->mo_txnid = last;
1279 txn->mt_env->me_pghead = mop;
1280 memcpy(mop->mo_pages, idl, MDB_IDL_SIZEOF(idl));
1285 DPRINTF("IDL read txn %zu root %zu num %zu",
1286 mop->mo_txnid, txn->mt_dbs[FREE_DBI].md_root, idl[0]);
1287 for (i=0; i<idl[0]; i++) {
1288 DPRINTF("IDL %zu", idl[i+1]);
1295 if (txn->mt_env->me_pghead) {
1296 MDB_oldpages *mop = txn->mt_env->me_pghead;
1298 /* FIXME: For now, always use fresh pages. We
1299 * really ought to search the free list for a
1304 /* peel pages off tail, so we only have to truncate the list */
1305 pgno = MDB_IDL_LAST(mop->mo_pages);
1306 if (MDB_IDL_IS_RANGE(mop->mo_pages)) {
1308 if (mop->mo_pages[2] > mop->mo_pages[1])
1309 mop->mo_pages[0] = 0;
1313 if (MDB_IDL_IS_ZERO(mop->mo_pages)) {
1314 txn->mt_env->me_pghead = mop->mo_next;
1315 if (mc->mc_dbi == FREE_DBI) {
1316 mop->mo_next = txn->mt_env->me_pgfree;
1317 txn->mt_env->me_pgfree = mop;
1326 if (pgno == P_INVALID) {
1327 /* DB size is maxed out */
1328 if (txn->mt_next_pgno + num >= txn->mt_env->me_maxpg) {
1329 DPUTS("DB size maxed out");
1333 if (txn->mt_env->me_flags & MDB_WRITEMAP) {
1334 if (pgno == P_INVALID) {
1335 pgno = txn->mt_next_pgno;
1336 txn->mt_next_pgno += num;
1338 np = (MDB_page *)(txn->mt_env->me_map + txn->mt_env->me_psize * pgno);
1341 if (txn->mt_env->me_dpages && num == 1) {
1342 np = txn->mt_env->me_dpages;
1343 VGMEMP_ALLOC(txn->mt_env, np, txn->mt_env->me_psize);
1344 VGMEMP_DEFINED(np, sizeof(np->mp_next));
1345 txn->mt_env->me_dpages = np->mp_next;
1347 size_t sz = txn->mt_env->me_psize * num;
1348 if ((np = malloc(sz)) == NULL)
1350 VGMEMP_ALLOC(txn->mt_env, np, sz);
1352 if (pgno == P_INVALID) {
1353 np->mp_pgno = txn->mt_next_pgno;
1354 txn->mt_next_pgno += num;
1359 mid.mid = np->mp_pgno;
1361 if (txn->mt_env->me_flags & MDB_WRITEMAP) {
1362 mdb_mid2l_append(txn->mt_u.dirty_list, &mid);
1364 mdb_mid2l_insert(txn->mt_u.dirty_list, &mid);
1370 /** Copy a page: avoid copying unused portions of the page.
1371 * @param[in] dst page to copy into
1372 * @param[in] src page to copy from
1375 mdb_page_copy(MDB_page *dst, MDB_page *src, unsigned int psize)
1377 dst->mp_flags = src->mp_flags | P_DIRTY;
1378 dst->mp_pages = src->mp_pages;
1380 if (IS_LEAF2(src)) {
1381 memcpy(dst->mp_ptrs, src->mp_ptrs, psize - PAGEHDRSZ - SIZELEFT(src));
1383 unsigned int i, nkeys = NUMKEYS(src);
1384 for (i=0; i<nkeys; i++)
1385 dst->mp_ptrs[i] = src->mp_ptrs[i];
1386 memcpy((char *)dst+src->mp_upper, (char *)src+src->mp_upper,
1387 psize - src->mp_upper);
1391 /** Touch a page: make it dirty and re-insert into tree with updated pgno.
1392 * @param[in] mc cursor pointing to the page to be touched
1393 * @return 0 on success, non-zero on failure.
1396 mdb_page_touch(MDB_cursor *mc)
1398 MDB_page *mp = mc->mc_pg[mc->mc_top];
1401 if (!F_ISSET(mp->mp_flags, P_DIRTY)) {
1403 if ((np = mdb_page_alloc(mc, 1)) == NULL)
1405 DPRINTF("touched db %u page %zu -> %zu", mc->mc_dbi, mp->mp_pgno, np->mp_pgno);
1406 assert(mp->mp_pgno != np->mp_pgno);
1407 mdb_midl_append(&mc->mc_txn->mt_free_pgs, mp->mp_pgno);
1409 /* If page isn't full, just copy the used portion */
1410 mdb_page_copy(np, mp, mc->mc_txn->mt_env->me_psize);
1413 memcpy(np, mp, mc->mc_txn->mt_env->me_psize);
1415 np->mp_flags |= P_DIRTY;
1420 /* Adjust other cursors pointing to mp */
1421 if (mc->mc_flags & C_SUB) {
1422 MDB_cursor *m2, *m3;
1423 MDB_dbi dbi = mc->mc_dbi-1;
1425 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
1426 if (m2 == mc) continue;
1427 m3 = &m2->mc_xcursor->mx_cursor;
1428 if (m3->mc_snum < mc->mc_snum) continue;
1429 if (m3->mc_pg[mc->mc_top] == mc->mc_pg[mc->mc_top]) {
1430 m3->mc_pg[mc->mc_top] = mp;
1436 for (m2 = mc->mc_txn->mt_cursors[mc->mc_dbi]; m2; m2=m2->mc_next) {
1437 if (m2 == mc || m2->mc_snum < mc->mc_snum) continue;
1438 if (m2->mc_pg[mc->mc_top] == mc->mc_pg[mc->mc_top]) {
1439 m2->mc_pg[mc->mc_top] = mp;
1443 mc->mc_pg[mc->mc_top] = mp;
1444 /** If this page has a parent, update the parent to point to
1448 SETPGNO(NODEPTR(mc->mc_pg[mc->mc_top-1], mc->mc_ki[mc->mc_top-1]), mp->mp_pgno);
1450 mc->mc_db->md_root = mp->mp_pgno;
1451 } else if (mc->mc_txn->mt_parent) {
1454 /* If txn has a parent, make sure the page is in our
1457 if (mc->mc_txn->mt_u.dirty_list[0].mid) {
1458 unsigned x = mdb_mid2l_search(mc->mc_txn->mt_u.dirty_list, mp->mp_pgno);
1459 if (x <= mc->mc_txn->mt_u.dirty_list[0].mid &&
1460 mc->mc_txn->mt_u.dirty_list[x].mid == mp->mp_pgno) {
1461 if (mc->mc_txn->mt_u.dirty_list[x].mptr != mp) {
1462 mp = mc->mc_txn->mt_u.dirty_list[x].mptr;
1463 mc->mc_pg[mc->mc_top] = mp;
1469 np = mdb_page_malloc(mc);
1470 memcpy(np, mp, mc->mc_txn->mt_env->me_psize);
1471 mid.mid = np->mp_pgno;
1473 mdb_mid2l_insert(mc->mc_txn->mt_u.dirty_list, &mid);
1481 mdb_env_sync(MDB_env *env, int force)
1484 if (force || !F_ISSET(env->me_flags, MDB_NOSYNC)) {
1485 if (env->me_flags & MDB_WRITEMAP) {
1486 int flags = (env->me_flags & MDB_MAPASYNC) ? MS_ASYNC : MS_SYNC;
1487 if (MDB_MSYNC(env->me_map, env->me_mapsize, flags))
1490 else if (flags == MS_SYNC && MDB_FDATASYNC(env->me_fd))
1494 if (MDB_FDATASYNC(env->me_fd))
1501 /** Make shadow copies of all of parent txn's cursors */
1503 mdb_cursor_shadow(MDB_txn *src, MDB_txn *dst)
1505 MDB_cursor *mc, *m2;
1506 unsigned int i, j, size;
1508 for (i=0;i<src->mt_numdbs; i++) {
1509 if (src->mt_cursors[i]) {
1510 size = sizeof(MDB_cursor);
1511 if (src->mt_cursors[i]->mc_xcursor)
1512 size += sizeof(MDB_xcursor);
1513 for (m2 = src->mt_cursors[i]; m2; m2=m2->mc_next) {
1520 mc->mc_db = &dst->mt_dbs[i];
1521 mc->mc_dbx = m2->mc_dbx;
1522 mc->mc_dbflag = &dst->mt_dbflags[i];
1523 mc->mc_snum = m2->mc_snum;
1524 mc->mc_top = m2->mc_top;
1525 mc->mc_flags = m2->mc_flags | C_SHADOW;
1526 for (j=0; j<mc->mc_snum; j++) {
1527 mc->mc_pg[j] = m2->mc_pg[j];
1528 mc->mc_ki[j] = m2->mc_ki[j];
1530 if (m2->mc_xcursor) {
1531 MDB_xcursor *mx, *mx2;
1532 mx = (MDB_xcursor *)(mc+1);
1533 mc->mc_xcursor = mx;
1534 mx2 = m2->mc_xcursor;
1535 mx->mx_db = mx2->mx_db;
1536 mx->mx_dbx = mx2->mx_dbx;
1537 mx->mx_dbflag = mx2->mx_dbflag;
1538 mx->mx_cursor.mc_txn = dst;
1539 mx->mx_cursor.mc_dbi = mx2->mx_cursor.mc_dbi;
1540 mx->mx_cursor.mc_db = &mx->mx_db;
1541 mx->mx_cursor.mc_dbx = &mx->mx_dbx;
1542 mx->mx_cursor.mc_dbflag = &mx->mx_dbflag;
1543 mx->mx_cursor.mc_snum = mx2->mx_cursor.mc_snum;
1544 mx->mx_cursor.mc_top = mx2->mx_cursor.mc_top;
1545 mx->mx_cursor.mc_flags = mx2->mx_cursor.mc_flags | C_SHADOW;
1546 for (j=0; j<mx2->mx_cursor.mc_snum; j++) {
1547 mx->mx_cursor.mc_pg[j] = mx2->mx_cursor.mc_pg[j];
1548 mx->mx_cursor.mc_ki[j] = mx2->mx_cursor.mc_ki[j];
1551 mc->mc_xcursor = NULL;
1553 mc->mc_next = dst->mt_cursors[i];
1554 dst->mt_cursors[i] = mc;
1561 /** Merge shadow cursors back into parent's */
1563 mdb_cursor_merge(MDB_txn *txn)
1566 for (i=0; i<txn->mt_numdbs; i++) {
1567 if (txn->mt_cursors[i]) {
1569 while ((mc = txn->mt_cursors[i])) {
1570 txn->mt_cursors[i] = mc->mc_next;
1571 if (mc->mc_flags & C_SHADOW) {
1572 MDB_cursor *m2 = mc->mc_orig;
1574 m2->mc_snum = mc->mc_snum;
1575 m2->mc_top = mc->mc_top;
1576 for (j=0; j<mc->mc_snum; j++) {
1577 m2->mc_pg[j] = mc->mc_pg[j];
1578 m2->mc_ki[j] = mc->mc_ki[j];
1581 if (mc->mc_flags & C_ALLOCD)
1589 mdb_txn_reset0(MDB_txn *txn);
1591 /** Common code for #mdb_txn_begin() and #mdb_txn_renew().
1592 * @param[in] txn the transaction handle to initialize
1593 * @return 0 on success, non-zero on failure. This can only
1594 * fail for read-only transactions, and then only if the
1595 * reader table is full.
1598 mdb_txn_renew0(MDB_txn *txn)
1600 MDB_env *env = txn->mt_env;
1604 txn->mt_numdbs = env->me_numdbs;
1605 txn->mt_dbxs = env->me_dbxs; /* mostly static anyway */
1607 if (txn->mt_flags & MDB_TXN_RDONLY) {
1608 MDB_reader *r = pthread_getspecific(env->me_txkey);
1610 pid_t pid = getpid();
1611 pthread_t tid = pthread_self();
1614 for (i=0; i<env->me_txns->mti_numreaders; i++)
1615 if (env->me_txns->mti_readers[i].mr_pid == 0)
1617 if (i == env->me_maxreaders) {
1618 UNLOCK_MUTEX_R(env);
1621 env->me_txns->mti_readers[i].mr_pid = pid;
1622 env->me_txns->mti_readers[i].mr_tid = tid;
1623 if (i >= env->me_txns->mti_numreaders)
1624 env->me_txns->mti_numreaders = i+1;
1625 UNLOCK_MUTEX_R(env);
1626 r = &env->me_txns->mti_readers[i];
1627 pthread_setspecific(env->me_txkey, r);
1629 txn->mt_txnid = r->mr_txnid = env->me_txns->mti_txnid;
1630 txn->mt_toggle = txn->mt_txnid & 1;
1631 txn->mt_next_pgno = env->me_metas[txn->mt_toggle]->mm_last_pg+1;
1632 txn->mt_u.reader = r;
1636 txn->mt_txnid = env->me_txns->mti_txnid;
1637 txn->mt_toggle = txn->mt_txnid & 1;
1638 txn->mt_next_pgno = env->me_metas[txn->mt_toggle]->mm_last_pg+1;
1641 if (txn->mt_txnid == mdb_debug_start)
1644 txn->mt_u.dirty_list = env->me_dirty_list;
1645 txn->mt_u.dirty_list[0].mid = 0;
1646 txn->mt_free_pgs = env->me_free_pgs;
1647 txn->mt_free_pgs[0] = 0;
1651 /* Copy the DB info and flags */
1652 memcpy(txn->mt_dbs, env->me_metas[txn->mt_toggle]->mm_dbs, 2 * sizeof(MDB_db));
1653 for (i=2; i<txn->mt_numdbs; i++)
1654 txn->mt_dbs[i].md_flags = env->me_dbflags[i];
1655 txn->mt_dbflags[0] = txn->mt_dbflags[1] = 0;
1656 if (txn->mt_numdbs > 2)
1657 memset(txn->mt_dbflags+2, DB_STALE, txn->mt_numdbs-2);
1663 mdb_txn_renew(MDB_txn *txn)
1670 if (txn->mt_env->me_flags & MDB_FATAL_ERROR) {
1671 DPUTS("environment had fatal error, must shutdown!");
1675 rc = mdb_txn_renew0(txn);
1676 if (rc == MDB_SUCCESS) {
1677 DPRINTF("renew txn %zu%c %p on mdbenv %p, root page %zu",
1678 txn->mt_txnid, (txn->mt_flags & MDB_TXN_RDONLY) ? 'r' : 'w',
1679 (void *)txn, (void *)txn->mt_env, txn->mt_dbs[MAIN_DBI].md_root);
1685 mdb_txn_begin(MDB_env *env, MDB_txn *parent, unsigned int flags, MDB_txn **ret)
1690 if (env->me_flags & MDB_FATAL_ERROR) {
1691 DPUTS("environment had fatal error, must shutdown!");
1695 /* parent already has an active child txn */
1696 if (parent->mt_child) {
1699 /* nested TXNs not supported here */
1700 if (env->me_flags & MDB_WRITEMAP)
1703 size = sizeof(MDB_txn) + env->me_maxdbs * (sizeof(MDB_db)+1);
1704 if (!(flags & MDB_RDONLY))
1705 size += env->me_maxdbs * sizeof(MDB_cursor *);
1707 if ((txn = calloc(1, size)) == NULL) {
1708 DPRINTF("calloc: %s", strerror(ErrCode()));
1711 txn->mt_dbs = (MDB_db *)(txn+1);
1712 if (flags & MDB_RDONLY) {
1713 txn->mt_flags |= MDB_TXN_RDONLY;
1714 txn->mt_dbflags = (unsigned char *)(txn->mt_dbs + env->me_maxdbs);
1716 txn->mt_cursors = (MDB_cursor **)(txn->mt_dbs + env->me_maxdbs);
1717 txn->mt_dbflags = (unsigned char *)(txn->mt_cursors + env->me_maxdbs);
1722 txn->mt_free_pgs = mdb_midl_alloc();
1723 if (!txn->mt_free_pgs) {
1727 txn->mt_u.dirty_list = malloc(sizeof(MDB_ID2)*MDB_IDL_UM_SIZE);
1728 if (!txn->mt_u.dirty_list) {
1729 free(txn->mt_free_pgs);
1733 txn->mt_txnid = parent->mt_txnid;
1734 txn->mt_toggle = parent->mt_toggle;
1735 txn->mt_u.dirty_list[0].mid = 0;
1736 txn->mt_free_pgs[0] = 0;
1737 txn->mt_next_pgno = parent->mt_next_pgno;
1738 parent->mt_child = txn;
1739 txn->mt_parent = parent;
1740 txn->mt_numdbs = parent->mt_numdbs;
1741 txn->mt_dbxs = parent->mt_dbxs;
1742 memcpy(txn->mt_dbs, parent->mt_dbs, txn->mt_numdbs * sizeof(MDB_db));
1743 memcpy(txn->mt_dbflags, parent->mt_dbflags, txn->mt_numdbs);
1744 mdb_cursor_shadow(parent, txn);
1747 rc = mdb_txn_renew0(txn);
1753 DPRINTF("begin txn %zu%c %p on mdbenv %p, root page %zu",
1754 txn->mt_txnid, (txn->mt_flags & MDB_TXN_RDONLY) ? 'r' : 'w',
1755 (void *) txn, (void *) env, txn->mt_dbs[MAIN_DBI].md_root);
1761 /** Common code for #mdb_txn_reset() and #mdb_txn_abort().
1762 * @param[in] txn the transaction handle to reset
1765 mdb_txn_reset0(MDB_txn *txn)
1767 MDB_env *env = txn->mt_env;
1769 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY)) {
1770 txn->mt_u.reader->mr_txnid = 0;
1776 /* close(free) all cursors */
1777 for (i=0; i<txn->mt_numdbs; i++) {
1778 if (txn->mt_cursors[i]) {
1780 while ((mc = txn->mt_cursors[i])) {
1781 txn->mt_cursors[i] = mc->mc_next;
1782 if (mc->mc_flags & C_ALLOCD)
1788 if (!(env->me_flags & MDB_WRITEMAP)) {
1789 /* return all dirty pages to dpage list */
1790 for (i=1; i<=txn->mt_u.dirty_list[0].mid; i++) {
1791 dp = txn->mt_u.dirty_list[i].mptr;
1792 if (!IS_OVERFLOW(dp) || dp->mp_pages == 1) {
1793 dp->mp_next = txn->mt_env->me_dpages;
1794 VGMEMP_FREE(txn->mt_env, dp);
1795 txn->mt_env->me_dpages = dp;
1797 /* large pages just get freed directly */
1798 VGMEMP_FREE(txn->mt_env, dp);
1804 if (txn->mt_parent) {
1805 txn->mt_parent->mt_child = NULL;
1806 mdb_midl_free(txn->mt_free_pgs);
1807 free(txn->mt_u.dirty_list);
1810 if (mdb_midl_shrink(&txn->mt_free_pgs))
1811 env->me_free_pgs = txn->mt_free_pgs;
1814 while ((mop = txn->mt_env->me_pghead)) {
1815 txn->mt_env->me_pghead = mop->mo_next;
1818 txn->mt_env->me_pgfirst = 0;
1819 txn->mt_env->me_pglast = 0;
1822 /* The writer mutex was locked in mdb_txn_begin. */
1823 UNLOCK_MUTEX_W(env);
1828 mdb_txn_reset(MDB_txn *txn)
1833 DPRINTF("reset txn %zu%c %p on mdbenv %p, root page %zu",
1834 txn->mt_txnid, (txn->mt_flags & MDB_TXN_RDONLY) ? 'r' : 'w',
1835 (void *) txn, (void *)txn->mt_env, txn->mt_dbs[MAIN_DBI].md_root);
1837 mdb_txn_reset0(txn);
1841 mdb_txn_abort(MDB_txn *txn)
1846 DPRINTF("abort txn %zu%c %p on mdbenv %p, root page %zu",
1847 txn->mt_txnid, (txn->mt_flags & MDB_TXN_RDONLY) ? 'r' : 'w',
1848 (void *)txn, (void *)txn->mt_env, txn->mt_dbs[MAIN_DBI].md_root);
1851 mdb_txn_abort(txn->mt_child);
1853 mdb_txn_reset0(txn);
1858 mdb_txn_commit(MDB_txn *txn)
1866 pgno_t next, freecnt;
1869 assert(txn != NULL);
1870 assert(txn->mt_env != NULL);
1872 if (txn->mt_child) {
1873 mdb_txn_commit(txn->mt_child);
1874 txn->mt_child = NULL;
1879 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY)) {
1880 if (txn->mt_numdbs > env->me_numdbs) {
1881 /* update the DB flags */
1883 for (i = env->me_numdbs; i<txn->mt_numdbs; i++)
1884 env->me_dbflags[i] = txn->mt_dbs[i].md_flags;
1891 if (F_ISSET(txn->mt_flags, MDB_TXN_ERROR)) {
1892 DPUTS("error flag is set, can't commit");
1894 txn->mt_parent->mt_flags |= MDB_TXN_ERROR;
1899 /* Merge (and close) our cursors with parent's */
1900 mdb_cursor_merge(txn);
1902 if (txn->mt_parent) {
1908 /* Update parent's DB table */
1909 ip = &txn->mt_parent->mt_dbs[2];
1910 jp = &txn->mt_dbs[2];
1911 for (i = 2; i < txn->mt_numdbs; i++) {
1912 if (ip->md_root != jp->md_root)
1916 txn->mt_parent->mt_numdbs = txn->mt_numdbs;
1918 /* Append our free list to parent's */
1919 mdb_midl_append_list(&txn->mt_parent->mt_free_pgs,
1921 mdb_midl_free(txn->mt_free_pgs);
1923 /* Merge our dirty list with parent's */
1924 dst = txn->mt_parent->mt_u.dirty_list;
1925 src = txn->mt_u.dirty_list;
1926 x = mdb_mid2l_search(dst, src[1].mid);
1927 for (y=1; y<=src[0].mid; y++) {
1928 while (x <= dst[0].mid && dst[x].mid != src[y].mid) x++;
1932 dst[x].mptr = src[y].mptr;
1935 for (; y<=src[0].mid; y++) {
1936 if (++x >= MDB_IDL_UM_MAX) {
1943 free(txn->mt_u.dirty_list);
1944 txn->mt_parent->mt_child = NULL;
1949 if (txn != env->me_txn) {
1950 DPUTS("attempt to commit unknown transaction");
1955 if (!txn->mt_u.dirty_list[0].mid)
1958 DPRINTF("committing txn %zu %p on mdbenv %p, root page %zu",
1959 txn->mt_txnid, (void *)txn, (void *)env, txn->mt_dbs[MAIN_DBI].md_root);
1961 /* Update DB root pointers. Their pages have already been
1962 * touched so this is all in-place and cannot fail.
1964 if (txn->mt_numdbs > 2) {
1967 data.mv_size = sizeof(MDB_db);
1969 mdb_cursor_init(&mc, txn, MAIN_DBI, NULL);
1970 for (i = 2; i < txn->mt_numdbs; i++) {
1971 if (txn->mt_dbflags[i] & DB_DIRTY) {
1972 data.mv_data = &txn->mt_dbs[i];
1973 mdb_cursor_put(&mc, &txn->mt_dbxs[i].md_name, &data, 0);
1978 mdb_cursor_init(&mc, txn, FREE_DBI, NULL);
1980 /* should only be one record now */
1981 if (env->me_pghead) {
1982 /* make sure first page of freeDB is touched and on freelist */
1983 mdb_page_search(&mc, NULL, MDB_PS_MODIFY);
1986 /* Delete IDLs we used from the free list */
1987 if (env->me_pgfirst) {
1992 key.mv_size = sizeof(cur);
1993 for (cur = env->me_pgfirst; cur <= env->me_pglast; cur++) {
1996 mdb_cursor_set(&mc, &key, NULL, MDB_SET, &exact);
1997 rc = mdb_cursor_del(&mc, 0);
2003 env->me_pgfirst = 0;
2007 /* save to free list */
2009 freecnt = txn->mt_free_pgs[0];
2010 if (!MDB_IDL_IS_ZERO(txn->mt_free_pgs)) {
2013 /* make sure last page of freeDB is touched and on freelist */
2014 key.mv_size = MAXKEYSIZE+1;
2016 mdb_page_search(&mc, &key, MDB_PS_MODIFY);
2018 mdb_midl_sort(txn->mt_free_pgs);
2022 MDB_IDL idl = txn->mt_free_pgs;
2023 DPRINTF("IDL write txn %zu root %zu num %zu",
2024 txn->mt_txnid, txn->mt_dbs[FREE_DBI].md_root, idl[0]);
2025 for (i=0; i<idl[0]; i++) {
2026 DPRINTF("IDL %zu", idl[i+1]);
2030 /* write to last page of freeDB */
2031 key.mv_size = sizeof(pgno_t);
2032 key.mv_data = &txn->mt_txnid;
2033 data.mv_data = txn->mt_free_pgs;
2034 /* The free list can still grow during this call,
2035 * despite the pre-emptive touches above. So check
2036 * and make sure the entire thing got written.
2039 freecnt = txn->mt_free_pgs[0];
2040 data.mv_size = MDB_IDL_SIZEOF(txn->mt_free_pgs);
2041 rc = mdb_cursor_put(&mc, &key, &data, 0);
2046 } while (freecnt != txn->mt_free_pgs[0]);
2048 /* should only be one record now */
2050 if (env->me_pghead) {
2056 mop = env->me_pghead;
2058 key.mv_size = sizeof(id);
2060 data.mv_size = MDB_IDL_SIZEOF(mop->mo_pages);
2061 data.mv_data = mop->mo_pages;
2062 orig = mop->mo_pages[0];
2063 /* These steps may grow the freelist again
2064 * due to freed overflow pages...
2066 mdb_cursor_put(&mc, &key, &data, 0);
2067 if (mop == env->me_pghead && env->me_pghead->mo_txnid == id) {
2068 /* could have been used again here */
2069 if (mop->mo_pages[0] != orig) {
2070 data.mv_size = MDB_IDL_SIZEOF(mop->mo_pages);
2071 data.mv_data = mop->mo_pages;
2073 mdb_cursor_put(&mc, &key, &data, 0);
2075 env->me_pghead = NULL;
2078 /* was completely used up */
2079 mdb_cursor_del(&mc, 0);
2083 env->me_pgfirst = 0;
2087 while (env->me_pgfree) {
2088 MDB_oldpages *mop = env->me_pgfree;
2089 env->me_pgfree = mop->mo_next;
2093 /* Check for growth of freelist again */
2094 if (freecnt != txn->mt_free_pgs[0])
2097 if (!MDB_IDL_IS_ZERO(txn->mt_free_pgs)) {
2098 if (mdb_midl_shrink(&txn->mt_free_pgs))
2099 env->me_free_pgs = txn->mt_free_pgs;
2106 if (env->me_flags & MDB_WRITEMAP) {
2107 for (i=1; i<=txn->mt_u.dirty_list[0].mid; i++) {
2108 dp = txn->mt_u.dirty_list[i].mptr;
2109 /* clear dirty flag */
2110 dp->mp_flags &= ~P_DIRTY;
2111 txn->mt_u.dirty_list[i].mid = 0;
2113 txn->mt_u.dirty_list[0].mid = 0;
2117 /* Commit up to MDB_COMMIT_PAGES dirty pages to disk until done.
2123 /* Windows actually supports scatter/gather I/O, but only on
2124 * unbuffered file handles. Since we're relying on the OS page
2125 * cache for all our data, that's self-defeating. So we just
2126 * write pages one at a time. We use the ov structure to set
2127 * the write offset, to at least save the overhead of a Seek
2131 memset(&ov, 0, sizeof(ov));
2132 for (; i<=txn->mt_u.dirty_list[0].mid; i++) {
2134 dp = txn->mt_u.dirty_list[i].mptr;
2135 DPRINTF("committing page %zu", dp->mp_pgno);
2136 size = dp->mp_pgno * env->me_psize;
2137 ov.Offset = size & 0xffffffff;
2138 ov.OffsetHigh = size >> 16;
2139 ov.OffsetHigh >>= 16;
2140 /* clear dirty flag */
2141 dp->mp_flags &= ~P_DIRTY;
2142 wsize = env->me_psize;
2143 if (IS_OVERFLOW(dp)) wsize *= dp->mp_pages;
2144 rc = WriteFile(env->me_fd, dp, wsize, NULL, &ov);
2147 DPRINTF("WriteFile: %d", n);
2154 struct iovec iov[MDB_COMMIT_PAGES];
2158 for (; i<=txn->mt_u.dirty_list[0].mid; i++) {
2159 dp = txn->mt_u.dirty_list[i].mptr;
2160 if (dp->mp_pgno != next) {
2162 rc = writev(env->me_fd, iov, n);
2166 DPUTS("short write, filesystem full?");
2168 DPRINTF("writev: %s", strerror(n));
2175 lseek(env->me_fd, dp->mp_pgno * env->me_psize, SEEK_SET);
2178 DPRINTF("committing page %zu", dp->mp_pgno);
2179 iov[n].iov_len = env->me_psize;
2180 if (IS_OVERFLOW(dp)) iov[n].iov_len *= dp->mp_pages;
2181 iov[n].iov_base = (char *)dp;
2182 size += iov[n].iov_len;
2183 next = dp->mp_pgno + (IS_OVERFLOW(dp) ? dp->mp_pages : 1);
2184 /* clear dirty flag */
2185 dp->mp_flags &= ~P_DIRTY;
2186 if (++n >= MDB_COMMIT_PAGES) {
2196 rc = writev(env->me_fd, iov, n);
2200 DPUTS("short write, filesystem full?");
2202 DPRINTF("writev: %s", strerror(n));
2209 /* Drop the dirty pages.
2211 for (i=1; i<=txn->mt_u.dirty_list[0].mid; i++) {
2212 dp = txn->mt_u.dirty_list[i].mptr;
2213 if (!IS_OVERFLOW(dp) || dp->mp_pages == 1) {
2214 dp->mp_next = txn->mt_env->me_dpages;
2215 VGMEMP_FREE(txn->mt_env, dp);
2216 txn->mt_env->me_dpages = dp;
2218 VGMEMP_FREE(txn->mt_env, dp);
2221 txn->mt_u.dirty_list[i].mid = 0;
2223 txn->mt_u.dirty_list[0].mid = 0;
2226 if ((n = mdb_env_sync(env, 0)) != 0 ||
2227 (n = mdb_env_write_meta(txn)) != MDB_SUCCESS) {
2234 if (txn->mt_numdbs > env->me_numdbs) {
2235 /* update the DB flags */
2237 for (i = env->me_numdbs; i<txn->mt_numdbs; i++)
2238 env->me_dbflags[i] = txn->mt_dbs[i].md_flags;
2242 UNLOCK_MUTEX_W(env);
2248 /** Read the environment parameters of a DB environment before
2249 * mapping it into memory.
2250 * @param[in] env the environment handle
2251 * @param[out] meta address of where to store the meta information
2252 * @return 0 on success, non-zero on failure.
2255 mdb_env_read_header(MDB_env *env, MDB_meta *meta)
2262 /* We don't know the page size yet, so use a minimum value.
2266 if (!ReadFile(env->me_fd, &pbuf, MDB_PAGESIZE, (DWORD *)&rc, NULL) || rc == 0)
2268 if ((rc = read(env->me_fd, &pbuf, MDB_PAGESIZE)) == 0)
2273 else if (rc != MDB_PAGESIZE) {
2277 DPRINTF("read: %s", strerror(err));
2281 p = (MDB_page *)&pbuf;
2283 if (!F_ISSET(p->mp_flags, P_META)) {
2284 DPRINTF("page %zu not a meta page", p->mp_pgno);
2289 if (m->mm_magic != MDB_MAGIC) {
2290 DPUTS("meta has invalid magic");
2294 if (m->mm_version != MDB_VERSION) {
2295 DPRINTF("database is version %u, expected version %u",
2296 m->mm_version, MDB_VERSION);
2297 return MDB_VERSION_MISMATCH;
2300 memcpy(meta, m, sizeof(*m));
2304 /** Write the environment parameters of a freshly created DB environment.
2305 * @param[in] env the environment handle
2306 * @param[out] meta address of where to store the meta information
2307 * @return 0 on success, non-zero on failure.
2310 mdb_env_init_meta(MDB_env *env, MDB_meta *meta)
2317 DPUTS("writing new meta page");
2319 GET_PAGESIZE(psize);
2321 meta->mm_magic = MDB_MAGIC;
2322 meta->mm_version = MDB_VERSION;
2323 meta->mm_psize = psize;
2324 meta->mm_last_pg = 1;
2325 meta->mm_flags = env->me_flags & 0xffff;
2326 meta->mm_flags |= MDB_INTEGERKEY;
2327 meta->mm_dbs[0].md_root = P_INVALID;
2328 meta->mm_dbs[1].md_root = P_INVALID;
2330 p = calloc(2, psize);
2332 p->mp_flags = P_META;
2335 memcpy(m, meta, sizeof(*meta));
2337 q = (MDB_page *)((char *)p + psize);
2340 q->mp_flags = P_META;
2343 memcpy(m, meta, sizeof(*meta));
2348 rc = WriteFile(env->me_fd, p, psize * 2, &len, NULL);
2349 rc = (len == psize * 2) ? MDB_SUCCESS : ErrCode();
2352 rc = write(env->me_fd, p, psize * 2);
2353 rc = (rc == (int)psize * 2) ? MDB_SUCCESS : ErrCode();
2359 /** Update the environment info to commit a transaction.
2360 * @param[in] txn the transaction that's being committed
2361 * @return 0 on success, non-zero on failure.
2364 mdb_env_write_meta(MDB_txn *txn)
2367 MDB_meta meta, metab;
2369 int rc, len, toggle;
2375 assert(txn != NULL);
2376 assert(txn->mt_env != NULL);
2378 toggle = !txn->mt_toggle;
2379 DPRINTF("writing meta page %d for root page %zu",
2380 toggle, txn->mt_dbs[MAIN_DBI].md_root);
2384 if (env->me_flags & MDB_WRITEMAP) {
2385 MDB_meta *mp = env->me_metas[toggle];
2386 mp->mm_dbs[0] = txn->mt_dbs[0];
2387 mp->mm_dbs[1] = txn->mt_dbs[1];
2388 mp->mm_last_pg = txn->mt_next_pgno - 1;
2389 mp->mm_txnid = txn->mt_txnid;
2390 if (!(env->me_flags & (MDB_NOMETASYNC|MDB_NOSYNC))) {
2391 rc = (env->me_flags & MDB_MAPASYNC) ? MS_ASYNC : MS_SYNC;
2394 ptr += env->me_psize;
2395 if (MDB_MSYNC(ptr, env->me_psize, rc)) {
2402 metab.mm_txnid = env->me_metas[toggle]->mm_txnid;
2403 metab.mm_last_pg = env->me_metas[toggle]->mm_last_pg;
2405 ptr = (char *)&meta;
2406 off = offsetof(MDB_meta, mm_dbs[0].md_depth);
2407 len = sizeof(MDB_meta) - off;
2410 meta.mm_dbs[0] = txn->mt_dbs[0];
2411 meta.mm_dbs[1] = txn->mt_dbs[1];
2412 meta.mm_last_pg = txn->mt_next_pgno - 1;
2413 meta.mm_txnid = txn->mt_txnid;
2416 off += env->me_psize;
2419 /* Write to the SYNC fd */
2422 memset(&ov, 0, sizeof(ov));
2424 WriteFile(env->me_mfd, ptr, len, (DWORD *)&rc, &ov);
2427 rc = pwrite(env->me_mfd, ptr, len, off);
2432 DPUTS("write failed, disk error?");
2433 /* On a failure, the pagecache still contains the new data.
2434 * Write some old data back, to prevent it from being used.
2435 * Use the non-SYNC fd; we know it will fail anyway.
2437 meta.mm_last_pg = metab.mm_last_pg;
2438 meta.mm_txnid = metab.mm_txnid;
2440 WriteFile(env->me_fd, ptr, len, NULL, &ov);
2442 r2 = pwrite(env->me_fd, ptr, len, off);
2445 env->me_flags |= MDB_FATAL_ERROR;
2449 /* Memory ordering issues are irrelevant; since the entire writer
2450 * is wrapped by wmutex, all of these changes will become visible
2451 * after the wmutex is unlocked. Since the DB is multi-version,
2452 * readers will get consistent data regardless of how fresh or
2453 * how stale their view of these values is.
2455 txn->mt_env->me_txns->mti_txnid = txn->mt_txnid;
2460 /** Check both meta pages to see which one is newer.
2461 * @param[in] env the environment handle
2462 * @return meta toggle (0 or 1).
2465 mdb_env_pick_meta(const MDB_env *env)
2467 return (env->me_metas[0]->mm_txnid < env->me_metas[1]->mm_txnid);
2471 mdb_env_create(MDB_env **env)
2475 e = calloc(1, sizeof(MDB_env));
2479 e->me_free_pgs = mdb_midl_alloc();
2480 if (!e->me_free_pgs) {
2484 e->me_maxreaders = DEFAULT_READERS;
2486 e->me_fd = INVALID_HANDLE_VALUE;
2487 e->me_lfd = INVALID_HANDLE_VALUE;
2488 e->me_mfd = INVALID_HANDLE_VALUE;
2489 VGMEMP_CREATE(e,0,0);
2495 mdb_env_set_mapsize(MDB_env *env, size_t size)
2499 env->me_mapsize = size;
2501 env->me_maxpg = env->me_mapsize / env->me_psize;
2506 mdb_env_set_maxdbs(MDB_env *env, MDB_dbi dbs)
2510 env->me_maxdbs = dbs;
2515 mdb_env_set_maxreaders(MDB_env *env, unsigned int readers)
2517 if (env->me_map || readers < 1)
2519 env->me_maxreaders = readers;
2524 mdb_env_get_maxreaders(MDB_env *env, unsigned int *readers)
2526 if (!env || !readers)
2528 *readers = env->me_maxreaders;
2532 /** Further setup required for opening an MDB environment
2535 mdb_env_open2(MDB_env *env, unsigned int flags)
2537 int i, newenv = 0, prot;
2541 env->me_flags = flags;
2543 memset(&meta, 0, sizeof(meta));
2545 if ((i = mdb_env_read_header(env, &meta)) != 0) {
2548 DPUTS("new mdbenv");
2552 if (!env->me_mapsize) {
2553 env->me_mapsize = newenv ? DEFAULT_MAPSIZE : meta.mm_mapsize;
2559 LONG sizelo, sizehi;
2560 sizelo = env->me_mapsize & 0xffffffff;
2561 sizehi = env->me_mapsize >> 16; /* pointless on WIN32, only needed on W64 */
2563 /* Windows won't create mappings for zero length files.
2564 * Just allocate the maxsize right now.
2567 SetFilePointer(env->me_fd, sizelo, sizehi ? &sizehi : NULL, 0);
2568 if (!SetEndOfFile(env->me_fd))
2570 SetFilePointer(env->me_fd, 0, NULL, 0);
2572 mh = CreateFileMapping(env->me_fd, NULL, flags & MDB_WRITEMAP ?
2573 PAGE_READWRITE : PAGE_READONLY,
2574 sizehi, sizelo, NULL);
2577 env->me_map = MapViewOfFileEx(mh, flags & MDB_WRITEMAP ?
2578 FILE_MAP_WRITE : FILE_MAP_READ,
2579 0, 0, env->me_mapsize, meta.mm_address);
2586 if (meta.mm_address && (flags & MDB_FIXEDMAP))
2589 if (flags & MDB_WRITEMAP) {
2591 ftruncate(env->me_fd, env->me_mapsize);
2593 env->me_map = mmap(meta.mm_address, env->me_mapsize, prot, i,
2595 if (env->me_map == MAP_FAILED) {
2602 meta.mm_mapsize = env->me_mapsize;
2603 if (flags & MDB_FIXEDMAP)
2604 meta.mm_address = env->me_map;
2605 i = mdb_env_init_meta(env, &meta);
2606 if (i != MDB_SUCCESS) {
2607 munmap(env->me_map, env->me_mapsize);
2611 env->me_psize = meta.mm_psize;
2613 env->me_maxpg = env->me_mapsize / env->me_psize;
2615 p = (MDB_page *)env->me_map;
2616 env->me_metas[0] = METADATA(p);
2617 env->me_metas[1] = (MDB_meta *)((char *)env->me_metas[0] + meta.mm_psize);
2621 int toggle = mdb_env_pick_meta(env);
2622 MDB_db *db = &env->me_metas[toggle]->mm_dbs[MAIN_DBI];
2624 DPRINTF("opened database version %u, pagesize %u",
2625 env->me_metas[0]->mm_version, env->me_psize);
2626 DPRINTF("using meta page %d", toggle);
2627 DPRINTF("depth: %u", db->md_depth);
2628 DPRINTF("entries: %zu", db->md_entries);
2629 DPRINTF("branch pages: %zu", db->md_branch_pages);
2630 DPRINTF("leaf pages: %zu", db->md_leaf_pages);
2631 DPRINTF("overflow pages: %zu", db->md_overflow_pages);
2632 DPRINTF("root: %zu", db->md_root);
2640 /** Release a reader thread's slot in the reader lock table.
2641 * This function is called automatically when a thread exits.
2642 * @param[in] ptr This points to the slot in the reader lock table.
2645 mdb_env_reader_dest(void *ptr)
2647 MDB_reader *reader = ptr;
2649 reader->mr_txnid = 0;
2655 /** Junk for arranging thread-specific callbacks on Windows. This is
2656 * necessarily platform and compiler-specific. Windows supports up
2657 * to 1088 keys. Let's assume nobody opens more than 64 environments
2658 * in a single process, for now. They can override this if needed.
2660 #ifndef MAX_TLS_KEYS
2661 #define MAX_TLS_KEYS 64
2663 static pthread_key_t mdb_tls_keys[MAX_TLS_KEYS];
2664 static int mdb_tls_nkeys;
2666 static void NTAPI mdb_tls_callback(PVOID module, DWORD reason, PVOID ptr)
2670 case DLL_PROCESS_ATTACH: break;
2671 case DLL_THREAD_ATTACH: break;
2672 case DLL_THREAD_DETACH:
2673 for (i=0; i<mdb_tls_nkeys; i++) {
2674 MDB_reader *r = pthread_getspecific(mdb_tls_keys[i]);
2675 mdb_env_reader_dest(r);
2678 case DLL_PROCESS_DETACH: break;
2683 const PIMAGE_TLS_CALLBACK mdb_tls_cbp __attribute__((section (".CRT$XLB"))) = mdb_tls_callback;
2685 PIMAGE_TLS_CALLBACK mdb_tls_cbp __attribute__((section (".CRT$XLB"))) = mdb_tls_callback;
2689 /* Force some symbol references.
2690 * _tls_used forces the linker to create the TLS directory if not already done
2691 * mdb_tls_cbp prevents whole-program-optimizer from dropping the symbol.
2693 #pragma comment(linker, "/INCLUDE:_tls_used")
2694 #pragma comment(linker, "/INCLUDE:mdb_tls_cbp")
2695 #pragma const_seg(".CRT$XLB")
2696 extern const PIMAGE_TLS_CALLBACK mdb_tls_callback;
2697 const PIMAGE_TLS_CALLBACK mdb_tls_cbp = mdb_tls_callback;
2700 #pragma comment(linker, "/INCLUDE:__tls_used")
2701 #pragma comment(linker, "/INCLUDE:_mdb_tls_cbp")
2702 #pragma data_seg(".CRT$XLB")
2703 PIMAGE_TLS_CALLBACK mdb_tls_cbp = mdb_tls_callback;
2705 #endif /* WIN 32/64 */
2706 #endif /* !__GNUC__ */
2709 /** Downgrade the exclusive lock on the region back to shared */
2711 mdb_env_share_locks(MDB_env *env)
2713 int toggle = mdb_env_pick_meta(env);
2715 env->me_txns->mti_txnid = env->me_metas[toggle]->mm_txnid;
2720 /* First acquire a shared lock. The Unlock will
2721 * then release the existing exclusive lock.
2723 memset(&ov, 0, sizeof(ov));
2724 LockFileEx(env->me_lfd, 0, 0, 1, 0, &ov);
2725 UnlockFile(env->me_lfd, 0, 0, 1, 0);
2729 struct flock lock_info;
2730 /* The shared lock replaces the existing lock */
2731 memset((void *)&lock_info, 0, sizeof(lock_info));
2732 lock_info.l_type = F_RDLCK;
2733 lock_info.l_whence = SEEK_SET;
2734 lock_info.l_start = 0;
2735 lock_info.l_len = 1;
2736 fcntl(env->me_lfd, F_SETLK, &lock_info);
2742 mdb_env_excl_lock(MDB_env *env, int *excl)
2745 if (LockFile(env->me_lfd, 0, 0, 1, 0)) {
2749 memset(&ov, 0, sizeof(ov));
2750 if (!LockFileEx(env->me_lfd, 0, 0, 1, 0, &ov)) {
2755 struct flock lock_info;
2756 memset((void *)&lock_info, 0, sizeof(lock_info));
2757 lock_info.l_type = F_WRLCK;
2758 lock_info.l_whence = SEEK_SET;
2759 lock_info.l_start = 0;
2760 lock_info.l_len = 1;
2761 if (!fcntl(env->me_lfd, F_SETLK, &lock_info)) {
2764 lock_info.l_type = F_RDLCK;
2765 if (fcntl(env->me_lfd, F_SETLKW, &lock_info)) {
2773 #if defined(_WIN32) || defined(USE_POSIX_SEM)
2775 * hash_64 - 64 bit Fowler/Noll/Vo-0 FNV-1a hash code
2777 * @(#) $Revision: 5.1 $
2778 * @(#) $Id: hash_64a.c,v 5.1 2009/06/30 09:01:38 chongo Exp $
2779 * @(#) $Source: /usr/local/src/cmd/fnv/RCS/hash_64a.c,v $
2781 * http://www.isthe.com/chongo/tech/comp/fnv/index.html
2785 * Please do not copyright this code. This code is in the public domain.
2787 * LANDON CURT NOLL DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
2788 * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO
2789 * EVENT SHALL LANDON CURT NOLL BE LIABLE FOR ANY SPECIAL, INDIRECT OR
2790 * CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF
2791 * USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
2792 * OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
2793 * PERFORMANCE OF THIS SOFTWARE.
2796 * chongo <Landon Curt Noll> /\oo/\
2797 * http://www.isthe.com/chongo/
2799 * Share and Enjoy! :-)
2802 typedef unsigned long long mdb_hash_t;
2803 #define MDB_HASH_INIT ((mdb_hash_t)0xcbf29ce484222325ULL)
2805 /** perform a 64 bit Fowler/Noll/Vo FNV-1a hash on a buffer
2806 * @param[in] str string to hash
2807 * @param[in] hval initial value for hash
2808 * @return 64 bit hash
2810 * NOTE: To use the recommended 64 bit FNV-1a hash, use MDB_HASH_INIT as the
2811 * hval arg on the first call.
2814 mdb_hash_val(MDB_val *val, mdb_hash_t hval)
2816 unsigned char *s = (unsigned char *)val->mv_data; /* unsigned string */
2817 unsigned char *end = s + val->mv_size;
2819 * FNV-1a hash each octet of the string
2822 /* xor the bottom with the current octet */
2823 hval ^= (mdb_hash_t)*s++;
2825 /* multiply by the 64 bit FNV magic prime mod 2^64 */
2826 hval += (hval << 1) + (hval << 4) + (hval << 5) +
2827 (hval << 7) + (hval << 8) + (hval << 40);
2829 /* return our new hash value */
2833 /** Hash the string and output the hash in hex.
2834 * @param[in] str string to hash
2835 * @param[out] hexbuf an array of 17 chars to hold the hash
2838 mdb_hash_hex(MDB_val *val, char *hexbuf)
2841 mdb_hash_t h = mdb_hash_val(val, MDB_HASH_INIT);
2842 for (i=0; i<8; i++) {
2843 hexbuf += sprintf(hexbuf, "%02x", (unsigned int)h & 0xff);
2849 /** Open and/or initialize the lock region for the environment.
2850 * @param[in] env The MDB environment.
2851 * @param[in] lpath The pathname of the file used for the lock region.
2852 * @param[in] mode The Unix permissions for the file, if we create it.
2853 * @param[out] excl Set to true if we got an exclusive lock on the region.
2854 * @return 0 on success, non-zero on failure.
2857 mdb_env_setup_locks(MDB_env *env, char *lpath, int mode, int *excl)
2865 if ((env->me_lfd = CreateFile(lpath, GENERIC_READ|GENERIC_WRITE,
2866 FILE_SHARE_READ|FILE_SHARE_WRITE, NULL, OPEN_ALWAYS,
2867 FILE_ATTRIBUTE_NORMAL, NULL)) == INVALID_HANDLE_VALUE) {
2871 /* Try to get exclusive lock. If we succeed, then
2872 * nobody is using the lock region and we should initialize it.
2874 if ((rc = mdb_env_excl_lock(env, excl))) goto fail;
2875 size = GetFileSize(env->me_lfd, NULL);
2881 if ((env->me_lfd = open(lpath, O_RDWR|O_CREAT, mode)) == -1)
2883 /* Lose record locks when exec*() */
2884 if ((fdflags = fcntl(env->me_lfd, F_GETFD) | FD_CLOEXEC) >= 0)
2885 fcntl(env->me_lfd, F_SETFD, fdflags);
2887 #else /* O_CLOEXEC on Linux: Open file and set FD_CLOEXEC atomically */
2888 if ((env->me_lfd = open(lpath, O_RDWR|O_CREAT|O_CLOEXEC, mode)) == -1)
2892 /* Try to get exclusive lock. If we succeed, then
2893 * nobody is using the lock region and we should initialize it.
2895 if ((rc = mdb_env_excl_lock(env, excl))) goto fail;
2897 size = lseek(env->me_lfd, 0, SEEK_END);
2899 rsize = (env->me_maxreaders-1) * sizeof(MDB_reader) + sizeof(MDB_txninfo);
2900 if (size < rsize && *excl) {
2902 SetFilePointer(env->me_lfd, rsize, NULL, 0);
2903 if (!SetEndOfFile(env->me_lfd)) {
2908 if (ftruncate(env->me_lfd, rsize) != 0) {
2915 size = rsize - sizeof(MDB_txninfo);
2916 env->me_maxreaders = size/sizeof(MDB_reader) + 1;
2921 mh = CreateFileMapping(env->me_lfd, NULL, PAGE_READWRITE,
2927 env->me_txns = MapViewOfFileEx(mh, FILE_MAP_WRITE, 0, 0, rsize, NULL);
2929 if (!env->me_txns) {
2934 void *m = mmap(NULL, rsize, PROT_READ|PROT_WRITE, MAP_SHARED,
2936 if (m == MAP_FAILED) {
2937 env->me_txns = NULL;
2946 BY_HANDLE_FILE_INFORMATION stbuf;
2955 if (!mdb_sec_inited) {
2956 InitializeSecurityDescriptor(&mdb_null_sd,
2957 SECURITY_DESCRIPTOR_REVISION);
2958 SetSecurityDescriptorDacl(&mdb_null_sd, TRUE, 0, FALSE);
2959 mdb_all_sa.nLength = sizeof(SECURITY_ATTRIBUTES);
2960 mdb_all_sa.bInheritHandle = FALSE;
2961 mdb_all_sa.lpSecurityDescriptor = &mdb_null_sd;
2964 GetFileInformationByHandle(env->me_lfd, &stbuf);
2965 idbuf.volume = stbuf.dwVolumeSerialNumber;
2966 idbuf.nhigh = stbuf.nFileIndexHigh;
2967 idbuf.nlow = stbuf.nFileIndexLow;
2968 val.mv_data = &idbuf;
2969 val.mv_size = sizeof(idbuf);
2970 mdb_hash_hex(&val, hexbuf);
2971 sprintf(env->me_txns->mti_rmname, "Global\\MDBr%s", hexbuf);
2972 env->me_rmutex = CreateMutex(&mdb_all_sa, FALSE, env->me_txns->mti_rmname);
2973 if (!env->me_rmutex) {
2977 sprintf(env->me_txns->mti_wmname, "Global\\MDBw%s", hexbuf);
2978 env->me_wmutex = CreateMutex(&mdb_all_sa, FALSE, env->me_txns->mti_wmname);
2979 if (!env->me_wmutex) {
2984 #ifdef USE_POSIX_SEM
2993 fstat(env->me_lfd, &stbuf);
2994 idbuf.dev = stbuf.st_dev;
2995 idbuf.ino = stbuf.st_ino;
2996 val.mv_data = &idbuf;
2997 val.mv_size = sizeof(idbuf);
2998 mdb_hash_hex(&val, hexbuf);
2999 sprintf(env->me_txns->mti_rmname, "/MDBr%s", hexbuf);
3000 if (sem_unlink(env->me_txns->mti_rmname)) {
3002 if (rc != ENOENT && rc != EINVAL)
3005 env->me_rmutex = sem_open(env->me_txns->mti_rmname, O_CREAT, mode, 1);
3006 if (env->me_rmutex == SEM_FAILED) {
3010 sprintf(env->me_txns->mti_wmname, "/MDBw%s", hexbuf);
3011 if (sem_unlink(env->me_txns->mti_wmname)) {
3013 if (rc != ENOENT && rc != EINVAL)
3016 env->me_wmutex = sem_open(env->me_txns->mti_wmname, O_CREAT, mode, 1);
3017 if (env->me_wmutex == SEM_FAILED) {
3021 #else /* USE_POSIX_SEM */
3022 pthread_mutexattr_t mattr;
3024 pthread_mutexattr_init(&mattr);
3025 rc = pthread_mutexattr_setpshared(&mattr, PTHREAD_PROCESS_SHARED);
3029 pthread_mutex_init(&env->me_txns->mti_mutex, &mattr);
3030 pthread_mutex_init(&env->me_txns->mti_wmutex, &mattr);
3031 #endif /* USE_POSIX_SEM */
3033 env->me_txns->mti_version = MDB_VERSION;
3034 env->me_txns->mti_magic = MDB_MAGIC;
3035 env->me_txns->mti_txnid = 0;
3036 env->me_txns->mti_numreaders = 0;
3039 if (env->me_txns->mti_magic != MDB_MAGIC) {
3040 DPUTS("lock region has invalid magic");
3044 if (env->me_txns->mti_version != MDB_VERSION) {
3045 DPRINTF("lock region is version %u, expected version %u",
3046 env->me_txns->mti_version, MDB_VERSION);
3047 rc = MDB_VERSION_MISMATCH;
3051 if (rc != EACCES && rc != EAGAIN) {
3055 env->me_rmutex = OpenMutex(SYNCHRONIZE, FALSE, env->me_txns->mti_rmname);
3056 if (!env->me_rmutex) {
3060 env->me_wmutex = OpenMutex(SYNCHRONIZE, FALSE, env->me_txns->mti_wmname);
3061 if (!env->me_wmutex) {
3066 #ifdef USE_POSIX_SEM
3067 env->me_rmutex = sem_open(env->me_txns->mti_rmname, 0);
3068 if (env->me_rmutex == SEM_FAILED) {
3072 env->me_wmutex = sem_open(env->me_txns->mti_wmname, 0);
3073 if (env->me_wmutex == SEM_FAILED) {
3083 env->me_lfd = INVALID_HANDLE_VALUE;
3088 /** The name of the lock file in the DB environment */
3089 #define LOCKNAME "/lock.mdb"
3090 /** The name of the data file in the DB environment */
3091 #define DATANAME "/data.mdb"
3092 /** The suffix of the lock file when no subdir is used */
3093 #define LOCKSUFF "-lock"
3096 mdb_env_open(MDB_env *env, const char *path, unsigned int flags, mode_t mode)
3098 int oflags, rc, len, excl;
3099 char *lpath, *dpath;
3102 if (flags & MDB_NOSUBDIR) {
3103 rc = len + sizeof(LOCKSUFF) + len + 1;
3105 rc = len + sizeof(LOCKNAME) + len + sizeof(DATANAME);
3110 if (flags & MDB_NOSUBDIR) {
3111 dpath = lpath + len + sizeof(LOCKSUFF);
3112 sprintf(lpath, "%s" LOCKSUFF, path);
3113 strcpy(dpath, path);
3115 dpath = lpath + len + sizeof(LOCKNAME);
3116 sprintf(lpath, "%s" LOCKNAME, path);
3117 sprintf(dpath, "%s" DATANAME, path);
3120 rc = mdb_env_setup_locks(env, lpath, mode, &excl);
3125 if (F_ISSET(flags, MDB_RDONLY)) {
3126 oflags = GENERIC_READ;
3127 len = OPEN_EXISTING;
3129 oflags = GENERIC_READ|GENERIC_WRITE;
3132 mode = FILE_ATTRIBUTE_NORMAL;
3133 env->me_fd = CreateFile(dpath, oflags, FILE_SHARE_READ|FILE_SHARE_WRITE,
3134 NULL, len, mode, NULL);
3136 if (F_ISSET(flags, MDB_RDONLY))
3139 oflags = O_RDWR | O_CREAT;
3141 env->me_fd = open(dpath, oflags, mode);
3143 if (env->me_fd == INVALID_HANDLE_VALUE) {
3148 if ((rc = mdb_env_open2(env, flags)) == MDB_SUCCESS) {
3149 if (flags & (MDB_RDONLY|MDB_NOSYNC|MDB_NOMETASYNC)) {
3150 env->me_mfd = env->me_fd;
3152 /* synchronous fd for meta writes */
3154 env->me_mfd = CreateFile(dpath, oflags,
3155 FILE_SHARE_READ|FILE_SHARE_WRITE, NULL, len,
3156 mode | FILE_FLAG_WRITE_THROUGH, NULL);
3158 env->me_mfd = open(dpath, oflags | MDB_DSYNC, mode);
3160 if (env->me_mfd == INVALID_HANDLE_VALUE) {
3165 env->me_path = strdup(path);
3166 DPRINTF("opened dbenv %p", (void *) env);
3167 pthread_key_create(&env->me_txkey, mdb_env_reader_dest);
3169 /* Windows TLS callbacks need help finding their TLS info. */
3170 if (mdb_tls_nkeys < MAX_TLS_KEYS)
3171 mdb_tls_keys[mdb_tls_nkeys++] = env->me_txkey;
3178 mdb_env_share_locks(env);
3180 env->me_dbxs = calloc(env->me_maxdbs, sizeof(MDB_dbx));
3181 env->me_dbflags = calloc(env->me_maxdbs, sizeof(uint16_t));
3182 if (!env->me_dbxs || !env->me_dbflags)
3188 if (env->me_fd != INVALID_HANDLE_VALUE) {
3190 env->me_fd = INVALID_HANDLE_VALUE;
3192 if (env->me_lfd != INVALID_HANDLE_VALUE) {
3194 env->me_lfd = INVALID_HANDLE_VALUE;
3202 mdb_env_close(MDB_env *env)
3209 VGMEMP_DESTROY(env);
3210 while (env->me_dpages) {
3211 dp = env->me_dpages;
3212 VGMEMP_DEFINED(&dp->mp_next, sizeof(dp->mp_next));
3213 env->me_dpages = dp->mp_next;
3217 free(env->me_dbflags);
3221 pthread_key_delete(env->me_txkey);
3223 /* Delete our key from the global list */
3225 for (i=0; i<mdb_tls_nkeys; i++)
3226 if (mdb_tls_keys[i] == env->me_txkey) {
3227 mdb_tls_keys[i] = mdb_tls_keys[mdb_tls_nkeys-1];
3235 munmap(env->me_map, env->me_mapsize);
3237 if (env->me_mfd != env->me_fd)
3241 pid_t pid = getpid();
3243 for (i=0; i<env->me_txns->mti_numreaders; i++)
3244 if (env->me_txns->mti_readers[i].mr_pid == pid)
3245 env->me_txns->mti_readers[i].mr_pid = 0;
3247 CloseHandle(env->me_rmutex);
3248 CloseHandle(env->me_wmutex);
3249 /* Windows automatically destroys the mutexes when
3250 * the last handle closes.
3253 #ifdef USE_POSIX_SEM
3254 sem_close(env->me_rmutex);
3255 sem_close(env->me_wmutex);
3257 if (!mdb_env_excl_lock(env, &excl) && excl) {
3258 /* we are the only remaining user of the environment.
3259 clean up semaphores. */
3260 sem_unlink(env->me_txns->mti_rmname);
3261 sem_unlink(env->me_txns->mti_wmname);
3266 munmap((void *)env->me_txns, (env->me_maxreaders-1)*sizeof(MDB_reader)+sizeof(MDB_txninfo));
3269 mdb_midl_free(env->me_free_pgs);
3273 /** Compare two items pointing at aligned size_t's */
3275 mdb_cmp_long(const MDB_val *a, const MDB_val *b)
3277 return (*(size_t *)a->mv_data < *(size_t *)b->mv_data) ? -1 :
3278 *(size_t *)a->mv_data > *(size_t *)b->mv_data;
3281 /** Compare two items pointing at aligned int's */
3283 mdb_cmp_int(const MDB_val *a, const MDB_val *b)
3285 return (*(unsigned int *)a->mv_data < *(unsigned int *)b->mv_data) ? -1 :
3286 *(unsigned int *)a->mv_data > *(unsigned int *)b->mv_data;
3289 /** Compare two items pointing at ints of unknown alignment.
3290 * Nodes and keys are guaranteed to be 2-byte aligned.
3293 mdb_cmp_cint(const MDB_val *a, const MDB_val *b)
3295 #if BYTE_ORDER == LITTLE_ENDIAN
3296 unsigned short *u, *c;
3299 u = (unsigned short *) ((char *) a->mv_data + a->mv_size);
3300 c = (unsigned short *) ((char *) b->mv_data + a->mv_size);
3303 } while(!x && u > (unsigned short *)a->mv_data);
3306 return memcmp(a->mv_data, b->mv_data, a->mv_size);
3310 /** Compare two items lexically */
3312 mdb_cmp_memn(const MDB_val *a, const MDB_val *b)
3319 len_diff = (ssize_t) a->mv_size - (ssize_t) b->mv_size;
3325 diff = memcmp(a->mv_data, b->mv_data, len);
3326 return diff ? diff : len_diff<0 ? -1 : len_diff;
3329 /** Compare two items in reverse byte order */
3331 mdb_cmp_memnr(const MDB_val *a, const MDB_val *b)
3333 const unsigned char *p1, *p2, *p1_lim;
3337 p1_lim = (const unsigned char *)a->mv_data;
3338 p1 = (const unsigned char *)a->mv_data + a->mv_size;
3339 p2 = (const unsigned char *)b->mv_data + b->mv_size;
3341 len_diff = (ssize_t) a->mv_size - (ssize_t) b->mv_size;
3347 while (p1 > p1_lim) {
3348 diff = *--p1 - *--p2;
3352 return len_diff<0 ? -1 : len_diff;
3355 /** Search for key within a page, using binary search.
3356 * Returns the smallest entry larger or equal to the key.
3357 * If exactp is non-null, stores whether the found entry was an exact match
3358 * in *exactp (1 or 0).
3359 * Updates the cursor index with the index of the found entry.
3360 * If no entry larger or equal to the key is found, returns NULL.
3363 mdb_node_search(MDB_cursor *mc, MDB_val *key, int *exactp)
3365 unsigned int i = 0, nkeys;
3368 MDB_page *mp = mc->mc_pg[mc->mc_top];
3369 MDB_node *node = NULL;
3374 nkeys = NUMKEYS(mp);
3379 COPY_PGNO(pgno, mp->mp_pgno);
3380 DPRINTF("searching %u keys in %s %spage %zu",
3381 nkeys, IS_LEAF(mp) ? "leaf" : "branch", IS_SUBP(mp) ? "sub-" : "",
3388 low = IS_LEAF(mp) ? 0 : 1;
3390 cmp = mc->mc_dbx->md_cmp;
3392 /* Branch pages have no data, so if using integer keys,
3393 * alignment is guaranteed. Use faster mdb_cmp_int.
3395 if (cmp == mdb_cmp_cint && IS_BRANCH(mp)) {
3396 if (NODEPTR(mp, 1)->mn_ksize == sizeof(size_t))
3403 nodekey.mv_size = mc->mc_db->md_pad;
3404 node = NODEPTR(mp, 0); /* fake */
3405 while (low <= high) {
3406 i = (low + high) >> 1;
3407 nodekey.mv_data = LEAF2KEY(mp, i, nodekey.mv_size);
3408 rc = cmp(key, &nodekey);
3409 DPRINTF("found leaf index %u [%s], rc = %i",
3410 i, DKEY(&nodekey), rc);
3419 while (low <= high) {
3420 i = (low + high) >> 1;
3422 node = NODEPTR(mp, i);
3423 nodekey.mv_size = NODEKSZ(node);
3424 nodekey.mv_data = NODEKEY(node);
3426 rc = cmp(key, &nodekey);
3429 DPRINTF("found leaf index %u [%s], rc = %i",
3430 i, DKEY(&nodekey), rc);
3432 DPRINTF("found branch index %u [%s -> %zu], rc = %i",
3433 i, DKEY(&nodekey), NODEPGNO(node), rc);
3444 if (rc > 0) { /* Found entry is less than the key. */
3445 i++; /* Skip to get the smallest entry larger than key. */
3447 node = NODEPTR(mp, i);
3450 *exactp = (rc == 0);
3451 /* store the key index */
3452 mc->mc_ki[mc->mc_top] = i;
3454 /* There is no entry larger or equal to the key. */
3457 /* nodeptr is fake for LEAF2 */
3463 mdb_cursor_adjust(MDB_cursor *mc, func)
3467 for (m2 = mc->mc_txn->mt_cursors[mc->mc_dbi]; m2; m2=m2->mc_next) {
3468 if (m2->mc_pg[m2->mc_top] == mc->mc_pg[mc->mc_top]) {
3475 /** Pop a page off the top of the cursor's stack. */
3477 mdb_cursor_pop(MDB_cursor *mc)
3481 MDB_page *top = mc->mc_pg[mc->mc_top];
3487 DPRINTF("popped page %zu off db %u cursor %p", top->mp_pgno,
3488 mc->mc_dbi, (void *) mc);
3492 /** Push a page onto the top of the cursor's stack. */
3494 mdb_cursor_push(MDB_cursor *mc, MDB_page *mp)
3496 DPRINTF("pushing page %zu on db %u cursor %p", mp->mp_pgno,
3497 mc->mc_dbi, (void *) mc);
3499 if (mc->mc_snum >= CURSOR_STACK) {
3500 assert(mc->mc_snum < CURSOR_STACK);
3504 mc->mc_top = mc->mc_snum++;
3505 mc->mc_pg[mc->mc_top] = mp;
3506 mc->mc_ki[mc->mc_top] = 0;
3511 /** Find the address of the page corresponding to a given page number.
3512 * @param[in] txn the transaction for this access.
3513 * @param[in] pgno the page number for the page to retrieve.
3514 * @param[out] ret address of a pointer where the page's address will be stored.
3515 * @return 0 on success, non-zero on failure.
3518 mdb_page_get(MDB_txn *txn, pgno_t pgno, MDB_page **ret)
3522 if (txn->mt_env->me_flags & MDB_WRITEMAP) {
3523 if (pgno < txn->mt_next_pgno)
3524 p = (MDB_page *)(txn->mt_env->me_map + txn->mt_env->me_psize * pgno);
3527 if (!F_ISSET(txn->mt_flags, MDB_TXN_RDONLY) && txn->mt_u.dirty_list[0].mid) {
3529 x = mdb_mid2l_search(txn->mt_u.dirty_list, pgno);
3530 if (x <= txn->mt_u.dirty_list[0].mid && txn->mt_u.dirty_list[x].mid == pgno) {
3531 p = txn->mt_u.dirty_list[x].mptr;
3535 if (pgno < txn->mt_next_pgno)
3536 p = (MDB_page *)(txn->mt_env->me_map + txn->mt_env->me_psize * pgno);
3541 DPRINTF("page %zu not found", pgno);
3544 return (p != NULL) ? MDB_SUCCESS : MDB_PAGE_NOTFOUND;
3547 /** Search for the page a given key should be in.
3548 * Pushes parent pages on the cursor stack. This function continues a
3549 * search on a cursor that has already been initialized. (Usually by
3550 * #mdb_page_search() but also by #mdb_node_move().)
3551 * @param[in,out] mc the cursor for this operation.
3552 * @param[in] key the key to search for. If NULL, search for the lowest
3553 * page. (This is used by #mdb_cursor_first().)
3554 * @param[in] flags If MDB_PS_MODIFY set, visited pages are updated with new page numbers.
3555 * If MDB_PS_ROOTONLY set, just fetch root node, no further lookups.
3556 * @return 0 on success, non-zero on failure.
3559 mdb_page_search_root(MDB_cursor *mc, MDB_val *key, int modify)
3561 MDB_page *mp = mc->mc_pg[mc->mc_top];
3566 while (IS_BRANCH(mp)) {
3570 DPRINTF("branch page %zu has %u keys", mp->mp_pgno, NUMKEYS(mp));
3571 assert(NUMKEYS(mp) > 1);
3572 DPRINTF("found index 0 to page %zu", NODEPGNO(NODEPTR(mp, 0)));
3574 if (key == NULL) /* Initialize cursor to first page. */
3576 else if (key->mv_size > MAXKEYSIZE && key->mv_data == NULL) {
3577 /* cursor to last page */
3581 node = mdb_node_search(mc, key, &exact);
3583 i = NUMKEYS(mp) - 1;
3585 i = mc->mc_ki[mc->mc_top];
3594 DPRINTF("following index %u for key [%s]",
3596 assert(i < NUMKEYS(mp));
3597 node = NODEPTR(mp, i);
3599 if ((rc = mdb_page_get(mc->mc_txn, NODEPGNO(node), &mp)))
3602 mc->mc_ki[mc->mc_top] = i;
3603 if ((rc = mdb_cursor_push(mc, mp)))
3607 if ((rc = mdb_page_touch(mc)) != 0)
3609 mp = mc->mc_pg[mc->mc_top];
3614 DPRINTF("internal error, index points to a %02X page!?",
3616 return MDB_CORRUPTED;
3619 DPRINTF("found leaf page %zu for key [%s]", mp->mp_pgno,
3620 key ? DKEY(key) : NULL);
3625 /** Search for the page a given key should be in.
3626 * Pushes parent pages on the cursor stack. This function just sets up
3627 * the search; it finds the root page for \b mc's database and sets this
3628 * as the root of the cursor's stack. Then #mdb_page_search_root() is
3629 * called to complete the search.
3630 * @param[in,out] mc the cursor for this operation.
3631 * @param[in] key the key to search for. If NULL, search for the lowest
3632 * page. (This is used by #mdb_cursor_first().)
3633 * @param[in] modify If true, visited pages are updated with new page numbers.
3634 * @return 0 on success, non-zero on failure.
3637 mdb_page_search(MDB_cursor *mc, MDB_val *key, int flags)
3642 /* Make sure the txn is still viable, then find the root from
3643 * the txn's db table.
3645 if (F_ISSET(mc->mc_txn->mt_flags, MDB_TXN_ERROR)) {
3646 DPUTS("transaction has failed, must abort");
3649 /* Make sure we're using an up-to-date root */
3650 if (mc->mc_dbi > MAIN_DBI) {
3651 if ((*mc->mc_dbflag & DB_STALE) ||
3652 ((flags & MDB_PS_MODIFY) && !(*mc->mc_dbflag & DB_DIRTY))) {
3654 unsigned char dbflag = 0;
3655 mdb_cursor_init(&mc2, mc->mc_txn, MAIN_DBI, NULL);
3656 rc = mdb_page_search(&mc2, &mc->mc_dbx->md_name, flags & MDB_PS_MODIFY);
3659 if (*mc->mc_dbflag & DB_STALE) {
3662 MDB_node *leaf = mdb_node_search(&mc2,
3663 &mc->mc_dbx->md_name, &exact);
3665 return MDB_NOTFOUND;
3666 mdb_node_read(mc->mc_txn, leaf, &data);
3667 memcpy(mc->mc_db, data.mv_data, sizeof(MDB_db));
3669 if (flags & MDB_PS_MODIFY)
3671 *mc->mc_dbflag = dbflag;
3674 root = mc->mc_db->md_root;
3676 if (root == P_INVALID) { /* Tree is empty. */
3677 DPUTS("tree is empty");
3678 return MDB_NOTFOUND;
3683 if (!mc->mc_pg[0] || mc->mc_pg[0]->mp_pgno != root)
3684 if ((rc = mdb_page_get(mc->mc_txn, root, &mc->mc_pg[0])))
3690 DPRINTF("db %u root page %zu has flags 0x%X",
3691 mc->mc_dbi, root, mc->mc_pg[0]->mp_flags);
3693 if (flags & MDB_PS_MODIFY) {
3694 if ((rc = mdb_page_touch(mc)))
3698 if (flags & MDB_PS_ROOTONLY)
3701 return mdb_page_search_root(mc, key, flags);
3704 /** Return the data associated with a given node.
3705 * @param[in] txn The transaction for this operation.
3706 * @param[in] leaf The node being read.
3707 * @param[out] data Updated to point to the node's data.
3708 * @return 0 on success, non-zero on failure.
3711 mdb_node_read(MDB_txn *txn, MDB_node *leaf, MDB_val *data)
3713 MDB_page *omp; /* overflow page */
3717 if (!F_ISSET(leaf->mn_flags, F_BIGDATA)) {
3718 data->mv_size = NODEDSZ(leaf);
3719 data->mv_data = NODEDATA(leaf);
3723 /* Read overflow data.
3725 data->mv_size = NODEDSZ(leaf);
3726 memcpy(&pgno, NODEDATA(leaf), sizeof(pgno));
3727 if ((rc = mdb_page_get(txn, pgno, &omp))) {
3728 DPRINTF("read overflow page %zu failed", pgno);
3731 data->mv_data = METADATA(omp);
3737 mdb_get(MDB_txn *txn, MDB_dbi dbi,
3738 MDB_val *key, MDB_val *data)
3747 DPRINTF("===> get db %u key [%s]", dbi, DKEY(key));
3749 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs)
3752 if (key->mv_size == 0 || key->mv_size > MAXKEYSIZE) {
3756 mdb_cursor_init(&mc, txn, dbi, &mx);
3757 return mdb_cursor_set(&mc, key, data, MDB_SET, &exact);
3760 /** Find a sibling for a page.
3761 * Replaces the page at the top of the cursor's stack with the
3762 * specified sibling, if one exists.
3763 * @param[in] mc The cursor for this operation.
3764 * @param[in] move_right Non-zero if the right sibling is requested,
3765 * otherwise the left sibling.
3766 * @return 0 on success, non-zero on failure.
3769 mdb_cursor_sibling(MDB_cursor *mc, int move_right)
3775 if (mc->mc_snum < 2) {
3776 return MDB_NOTFOUND; /* root has no siblings */
3780 DPRINTF("parent page is page %zu, index %u",
3781 mc->mc_pg[mc->mc_top]->mp_pgno, mc->mc_ki[mc->mc_top]);
3783 if (move_right ? (mc->mc_ki[mc->mc_top] + 1u >= NUMKEYS(mc->mc_pg[mc->mc_top]))
3784 : (mc->mc_ki[mc->mc_top] == 0)) {
3785 DPRINTF("no more keys left, moving to %s sibling",
3786 move_right ? "right" : "left");
3787 if ((rc = mdb_cursor_sibling(mc, move_right)) != MDB_SUCCESS)
3791 mc->mc_ki[mc->mc_top]++;
3793 mc->mc_ki[mc->mc_top]--;
3794 DPRINTF("just moving to %s index key %u",
3795 move_right ? "right" : "left", mc->mc_ki[mc->mc_top]);
3797 assert(IS_BRANCH(mc->mc_pg[mc->mc_top]));
3799 indx = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
3800 if ((rc = mdb_page_get(mc->mc_txn, NODEPGNO(indx), &mp)))
3803 mdb_cursor_push(mc, mp);
3808 /** Move the cursor to the next data item. */
3810 mdb_cursor_next(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op)
3816 if (mc->mc_flags & C_EOF) {
3817 return MDB_NOTFOUND;
3820 assert(mc->mc_flags & C_INITIALIZED);
3822 mp = mc->mc_pg[mc->mc_top];
3824 if (mc->mc_db->md_flags & MDB_DUPSORT) {
3825 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
3826 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
3827 if (op == MDB_NEXT || op == MDB_NEXT_DUP) {
3828 rc = mdb_cursor_next(&mc->mc_xcursor->mx_cursor, data, NULL, MDB_NEXT);
3829 if (op != MDB_NEXT || rc == MDB_SUCCESS)
3833 mc->mc_xcursor->mx_cursor.mc_flags &= ~C_INITIALIZED;
3834 if (op == MDB_NEXT_DUP)
3835 return MDB_NOTFOUND;
3839 DPRINTF("cursor_next: top page is %zu in cursor %p", mp->mp_pgno, (void *) mc);
3841 if (mc->mc_ki[mc->mc_top] + 1u >= NUMKEYS(mp)) {
3842 DPUTS("=====> move to next sibling page");
3843 if (mdb_cursor_sibling(mc, 1) != MDB_SUCCESS) {
3844 mc->mc_flags |= C_EOF;
3845 mc->mc_flags &= ~C_INITIALIZED;
3846 return MDB_NOTFOUND;
3848 mp = mc->mc_pg[mc->mc_top];
3849 DPRINTF("next page is %zu, key index %u", mp->mp_pgno, mc->mc_ki[mc->mc_top]);
3851 mc->mc_ki[mc->mc_top]++;
3853 DPRINTF("==> cursor points to page %zu with %u keys, key index %u",
3854 mp->mp_pgno, NUMKEYS(mp), mc->mc_ki[mc->mc_top]);
3857 key->mv_size = mc->mc_db->md_pad;
3858 key->mv_data = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], key->mv_size);
3862 assert(IS_LEAF(mp));
3863 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
3865 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
3866 mdb_xcursor_init1(mc, leaf);
3869 if ((rc = mdb_node_read(mc->mc_txn, leaf, data) != MDB_SUCCESS))
3872 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
3873 rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
3874 if (rc != MDB_SUCCESS)
3879 MDB_SET_KEY(leaf, key);
3883 /** Move the cursor to the previous data item. */
3885 mdb_cursor_prev(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op)
3891 assert(mc->mc_flags & C_INITIALIZED);
3893 mp = mc->mc_pg[mc->mc_top];
3895 if (mc->mc_db->md_flags & MDB_DUPSORT) {
3896 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
3897 if (op == MDB_PREV || op == MDB_PREV_DUP) {
3898 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
3899 rc = mdb_cursor_prev(&mc->mc_xcursor->mx_cursor, data, NULL, MDB_PREV);
3900 if (op != MDB_PREV || rc == MDB_SUCCESS)
3903 mc->mc_xcursor->mx_cursor.mc_flags &= ~C_INITIALIZED;
3904 if (op == MDB_PREV_DUP)
3905 return MDB_NOTFOUND;
3910 DPRINTF("cursor_prev: top page is %zu in cursor %p", mp->mp_pgno, (void *) mc);
3912 if (mc->mc_ki[mc->mc_top] == 0) {
3913 DPUTS("=====> move to prev sibling page");
3914 if (mdb_cursor_sibling(mc, 0) != MDB_SUCCESS) {
3915 mc->mc_flags &= ~C_INITIALIZED;
3916 return MDB_NOTFOUND;
3918 mp = mc->mc_pg[mc->mc_top];
3919 mc->mc_ki[mc->mc_top] = NUMKEYS(mp) - 1;
3920 DPRINTF("prev page is %zu, key index %u", mp->mp_pgno, mc->mc_ki[mc->mc_top]);
3922 mc->mc_ki[mc->mc_top]--;
3924 mc->mc_flags &= ~C_EOF;
3926 DPRINTF("==> cursor points to page %zu with %u keys, key index %u",
3927 mp->mp_pgno, NUMKEYS(mp), mc->mc_ki[mc->mc_top]);
3930 key->mv_size = mc->mc_db->md_pad;
3931 key->mv_data = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], key->mv_size);
3935 assert(IS_LEAF(mp));
3936 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
3938 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
3939 mdb_xcursor_init1(mc, leaf);
3942 if ((rc = mdb_node_read(mc->mc_txn, leaf, data) != MDB_SUCCESS))
3945 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
3946 rc = mdb_cursor_last(&mc->mc_xcursor->mx_cursor, data, NULL);
3947 if (rc != MDB_SUCCESS)
3952 MDB_SET_KEY(leaf, key);
3956 /** Set the cursor on a specific data item. */
3958 mdb_cursor_set(MDB_cursor *mc, MDB_val *key, MDB_val *data,
3959 MDB_cursor_op op, int *exactp)
3963 MDB_node *leaf = NULL;
3968 assert(key->mv_size > 0);
3970 /* See if we're already on the right page */
3971 if (mc->mc_flags & C_INITIALIZED) {
3974 mp = mc->mc_pg[mc->mc_top];
3976 mc->mc_ki[mc->mc_top] = 0;
3977 return MDB_NOTFOUND;
3979 if (mp->mp_flags & P_LEAF2) {
3980 nodekey.mv_size = mc->mc_db->md_pad;
3981 nodekey.mv_data = LEAF2KEY(mp, 0, nodekey.mv_size);
3983 leaf = NODEPTR(mp, 0);
3984 MDB_SET_KEY(leaf, &nodekey);
3986 rc = mc->mc_dbx->md_cmp(key, &nodekey);
3988 /* Probably happens rarely, but first node on the page
3989 * was the one we wanted.
3991 mc->mc_ki[mc->mc_top] = 0;
3998 unsigned int nkeys = NUMKEYS(mp);
4000 if (mp->mp_flags & P_LEAF2) {
4001 nodekey.mv_data = LEAF2KEY(mp,
4002 nkeys-1, nodekey.mv_size);
4004 leaf = NODEPTR(mp, nkeys-1);
4005 MDB_SET_KEY(leaf, &nodekey);
4007 rc = mc->mc_dbx->md_cmp(key, &nodekey);
4009 /* last node was the one we wanted */
4010 mc->mc_ki[mc->mc_top] = nkeys-1;
4016 if (mc->mc_ki[mc->mc_top] < NUMKEYS(mp)) {
4017 /* This is definitely the right page, skip search_page */
4018 if (mp->mp_flags & P_LEAF2) {
4019 nodekey.mv_data = LEAF2KEY(mp,
4020 mc->mc_ki[mc->mc_top], nodekey.mv_size);
4022 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
4023 MDB_SET_KEY(leaf, &nodekey);
4025 rc = mc->mc_dbx->md_cmp(key, &nodekey);
4027 /* current node was the one we wanted */
4037 /* If any parents have right-sibs, search.
4038 * Otherwise, there's nothing further.
4040 for (i=0; i<mc->mc_top; i++)
4042 NUMKEYS(mc->mc_pg[i])-1)
4044 if (i == mc->mc_top) {
4045 /* There are no other pages */
4046 mc->mc_ki[mc->mc_top] = nkeys;
4047 return MDB_NOTFOUND;
4051 /* There are no other pages */
4052 mc->mc_ki[mc->mc_top] = 0;
4053 return MDB_NOTFOUND;
4057 rc = mdb_page_search(mc, key, 0);
4058 if (rc != MDB_SUCCESS)
4061 mp = mc->mc_pg[mc->mc_top];
4062 assert(IS_LEAF(mp));
4065 leaf = mdb_node_search(mc, key, exactp);
4066 if (exactp != NULL && !*exactp) {
4067 /* MDB_SET specified and not an exact match. */
4068 return MDB_NOTFOUND;
4072 DPUTS("===> inexact leaf not found, goto sibling");
4073 if ((rc = mdb_cursor_sibling(mc, 1)) != MDB_SUCCESS)
4074 return rc; /* no entries matched */
4075 mp = mc->mc_pg[mc->mc_top];
4076 assert(IS_LEAF(mp));
4077 leaf = NODEPTR(mp, 0);
4081 mc->mc_flags |= C_INITIALIZED;
4082 mc->mc_flags &= ~C_EOF;
4085 key->mv_size = mc->mc_db->md_pad;
4086 key->mv_data = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], key->mv_size);
4090 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4091 mdb_xcursor_init1(mc, leaf);
4094 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4095 if (op == MDB_SET || op == MDB_SET_RANGE) {
4096 rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
4099 if (op == MDB_GET_BOTH) {
4105 rc = mdb_cursor_set(&mc->mc_xcursor->mx_cursor, data, NULL, MDB_SET_RANGE, ex2p);
4106 if (rc != MDB_SUCCESS)
4109 } else if (op == MDB_GET_BOTH || op == MDB_GET_BOTH_RANGE) {
4111 if ((rc = mdb_node_read(mc->mc_txn, leaf, &d2)) != MDB_SUCCESS)
4113 rc = mc->mc_dbx->md_dcmp(data, &d2);
4115 if (op == MDB_GET_BOTH || rc > 0)
4116 return MDB_NOTFOUND;
4121 mc->mc_xcursor->mx_cursor.mc_flags &= ~C_INITIALIZED;
4122 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
4127 /* The key already matches in all other cases */
4128 if (op == MDB_SET_RANGE)
4129 MDB_SET_KEY(leaf, key);
4130 DPRINTF("==> cursor placed on key [%s]", DKEY(key));
4135 /** Move the cursor to the first item in the database. */
4137 mdb_cursor_first(MDB_cursor *mc, MDB_val *key, MDB_val *data)
4142 if (!(mc->mc_flags & C_INITIALIZED) || mc->mc_top) {
4143 rc = mdb_page_search(mc, NULL, 0);
4144 if (rc != MDB_SUCCESS)
4147 assert(IS_LEAF(mc->mc_pg[mc->mc_top]));
4149 leaf = NODEPTR(mc->mc_pg[mc->mc_top], 0);
4150 mc->mc_flags |= C_INITIALIZED;
4151 mc->mc_flags &= ~C_EOF;
4153 mc->mc_ki[mc->mc_top] = 0;
4155 if (IS_LEAF2(mc->mc_pg[mc->mc_top])) {
4156 key->mv_size = mc->mc_db->md_pad;
4157 key->mv_data = LEAF2KEY(mc->mc_pg[mc->mc_top], 0, key->mv_size);
4162 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4163 mdb_xcursor_init1(mc, leaf);
4164 rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
4169 mc->mc_xcursor->mx_cursor.mc_flags &= ~C_INITIALIZED;
4170 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
4174 MDB_SET_KEY(leaf, key);
4178 /** Move the cursor to the last item in the database. */
4180 mdb_cursor_last(MDB_cursor *mc, MDB_val *key, MDB_val *data)
4185 if (!(mc->mc_flags & C_EOF)) {
4187 if (!(mc->mc_flags & C_INITIALIZED) || mc->mc_top) {
4190 lkey.mv_size = MAXKEYSIZE+1;
4191 lkey.mv_data = NULL;
4192 rc = mdb_page_search(mc, &lkey, 0);
4193 if (rc != MDB_SUCCESS)
4196 assert(IS_LEAF(mc->mc_pg[mc->mc_top]));
4198 mc->mc_ki[mc->mc_top] = NUMKEYS(mc->mc_pg[mc->mc_top]) - 1;
4199 mc->mc_flags |= C_INITIALIZED|C_EOF;
4201 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
4203 if (IS_LEAF2(mc->mc_pg[mc->mc_top])) {
4204 key->mv_size = mc->mc_db->md_pad;
4205 key->mv_data = LEAF2KEY(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], key->mv_size);
4210 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4211 mdb_xcursor_init1(mc, leaf);
4212 rc = mdb_cursor_last(&mc->mc_xcursor->mx_cursor, data, NULL);
4217 mc->mc_xcursor->mx_cursor.mc_flags &= ~C_INITIALIZED;
4218 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
4223 MDB_SET_KEY(leaf, key);
4228 mdb_cursor_get(MDB_cursor *mc, MDB_val *key, MDB_val *data,
4238 case MDB_GET_BOTH_RANGE:
4239 if (data == NULL || mc->mc_xcursor == NULL) {
4246 if (key == NULL || key->mv_size == 0 || key->mv_size > MAXKEYSIZE) {
4248 } else if (op == MDB_SET_RANGE)
4249 rc = mdb_cursor_set(mc, key, data, op, NULL);
4251 rc = mdb_cursor_set(mc, key, data, op, &exact);
4253 case MDB_GET_MULTIPLE:
4255 !(mc->mc_db->md_flags & MDB_DUPFIXED) ||
4256 !(mc->mc_flags & C_INITIALIZED)) {
4261 if (!(mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED) ||
4262 (mc->mc_xcursor->mx_cursor.mc_flags & C_EOF))
4265 case MDB_NEXT_MULTIPLE:
4267 !(mc->mc_db->md_flags & MDB_DUPFIXED)) {
4271 if (!(mc->mc_flags & C_INITIALIZED))
4272 rc = mdb_cursor_first(mc, key, data);
4274 rc = mdb_cursor_next(mc, key, data, MDB_NEXT_DUP);
4275 if (rc == MDB_SUCCESS) {
4276 if (mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED) {
4279 mx = &mc->mc_xcursor->mx_cursor;
4280 data->mv_size = NUMKEYS(mx->mc_pg[mx->mc_top]) *
4282 data->mv_data = METADATA(mx->mc_pg[mx->mc_top]);
4283 mx->mc_ki[mx->mc_top] = NUMKEYS(mx->mc_pg[mx->mc_top])-1;
4291 case MDB_NEXT_NODUP:
4292 if (!(mc->mc_flags & C_INITIALIZED))
4293 rc = mdb_cursor_first(mc, key, data);
4295 rc = mdb_cursor_next(mc, key, data, op);
4299 case MDB_PREV_NODUP:
4300 if (!(mc->mc_flags & C_INITIALIZED) || (mc->mc_flags & C_EOF)) {
4301 rc = mdb_cursor_last(mc, key, data);
4302 mc->mc_flags &= ~C_EOF;
4304 rc = mdb_cursor_prev(mc, key, data, op);
4307 rc = mdb_cursor_first(mc, key, data);
4311 !(mc->mc_db->md_flags & MDB_DUPSORT) ||
4312 !(mc->mc_flags & C_INITIALIZED) ||
4313 !(mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED)) {
4317 rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
4320 rc = mdb_cursor_last(mc, key, data);
4324 !(mc->mc_db->md_flags & MDB_DUPSORT) ||
4325 !(mc->mc_flags & C_INITIALIZED) ||
4326 !(mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED)) {
4330 rc = mdb_cursor_last(&mc->mc_xcursor->mx_cursor, data, NULL);
4333 DPRINTF("unhandled/unimplemented cursor operation %u", op);
4341 /** Touch all the pages in the cursor stack.
4342 * Makes sure all the pages are writable, before attempting a write operation.
4343 * @param[in] mc The cursor to operate on.
4346 mdb_cursor_touch(MDB_cursor *mc)
4350 if (mc->mc_dbi > MAIN_DBI && !(*mc->mc_dbflag & DB_DIRTY)) {
4352 mdb_cursor_init(&mc2, mc->mc_txn, MAIN_DBI, NULL);
4353 rc = mdb_page_search(&mc2, &mc->mc_dbx->md_name, MDB_PS_MODIFY);
4356 *mc->mc_dbflag = DB_DIRTY;
4358 for (mc->mc_top = 0; mc->mc_top < mc->mc_snum; mc->mc_top++) {
4359 rc = mdb_page_touch(mc);
4363 mc->mc_top = mc->mc_snum-1;
4368 mdb_cursor_put(MDB_cursor *mc, MDB_val *key, MDB_val *data,
4371 MDB_node *leaf = NULL;
4372 MDB_val xdata, *rdata, dkey;
4375 int do_sub = 0, insert = 0;
4376 unsigned int mcount = 0;
4380 char dbuf[MAXKEYSIZE+1];
4381 unsigned int nflags;
4384 if (F_ISSET(mc->mc_txn->mt_flags, MDB_TXN_RDONLY))
4387 DPRINTF("==> put db %u key [%s], size %zu, data size %zu",
4388 mc->mc_dbi, DKEY(key), key ? key->mv_size:0, data->mv_size);
4392 if (flags == MDB_CURRENT) {
4393 if (!(mc->mc_flags & C_INITIALIZED))
4396 } else if (mc->mc_db->md_root == P_INVALID) {
4398 /* new database, write a root leaf page */
4399 DPUTS("allocating new root leaf page");
4400 if ((np = mdb_page_new(mc, P_LEAF, 1)) == NULL) {
4404 mdb_cursor_push(mc, np);
4405 mc->mc_db->md_root = np->mp_pgno;
4406 mc->mc_db->md_depth++;
4407 *mc->mc_dbflag = DB_DIRTY;
4408 if ((mc->mc_db->md_flags & (MDB_DUPSORT|MDB_DUPFIXED))
4410 np->mp_flags |= P_LEAF2;
4411 mc->mc_flags |= C_INITIALIZED;
4417 if (flags & MDB_APPEND) {
4419 rc = mdb_cursor_last(mc, &k2, &d2);
4421 rc = mc->mc_dbx->md_cmp(key, &k2);
4424 mc->mc_ki[mc->mc_top]++;
4430 rc = mdb_cursor_set(mc, key, &d2, MDB_SET, &exact);
4432 if ((flags & MDB_NOOVERWRITE) && rc == 0) {
4433 DPRINTF("duplicate key [%s]", DKEY(key));
4435 return MDB_KEYEXIST;
4437 if (rc && rc != MDB_NOTFOUND)
4441 /* Cursor is positioned, now make sure all pages are writable */
4442 rc2 = mdb_cursor_touch(mc);
4447 /* The key already exists */
4448 if (rc == MDB_SUCCESS) {
4449 /* there's only a key anyway, so this is a no-op */
4450 if (IS_LEAF2(mc->mc_pg[mc->mc_top])) {
4451 unsigned int ksize = mc->mc_db->md_pad;
4452 if (key->mv_size != ksize)
4454 if (flags == MDB_CURRENT) {
4455 char *ptr = LEAF2KEY(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], ksize);
4456 memcpy(ptr, key->mv_data, ksize);
4461 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
4464 if (F_ISSET(mc->mc_db->md_flags, MDB_DUPSORT)) {
4465 /* Was a single item before, must convert now */
4467 if (!F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4468 /* Just overwrite the current item */
4469 if (flags == MDB_CURRENT)
4472 dkey.mv_size = NODEDSZ(leaf);
4473 dkey.mv_data = NODEDATA(leaf);
4474 #if UINT_MAX < SIZE_MAX
4475 if (mc->mc_dbx->md_dcmp == mdb_cmp_int && dkey.mv_size == sizeof(size_t))
4476 #ifdef MISALIGNED_OK
4477 mc->mc_dbx->md_dcmp = mdb_cmp_long;
4479 mc->mc_dbx->md_dcmp = mdb_cmp_cint;
4482 /* if data matches, ignore it */
4483 if (!mc->mc_dbx->md_dcmp(data, &dkey))
4484 return (flags == MDB_NODUPDATA) ? MDB_KEYEXIST : MDB_SUCCESS;
4486 /* create a fake page for the dup items */
4487 memcpy(dbuf, dkey.mv_data, dkey.mv_size);
4488 dkey.mv_data = dbuf;
4489 fp = (MDB_page *)&pbuf;
4490 fp->mp_pgno = mc->mc_pg[mc->mc_top]->mp_pgno;
4491 fp->mp_flags = P_LEAF|P_DIRTY|P_SUBP;
4492 fp->mp_lower = PAGEHDRSZ;
4493 fp->mp_upper = PAGEHDRSZ + dkey.mv_size + data->mv_size;
4494 if (mc->mc_db->md_flags & MDB_DUPFIXED) {
4495 fp->mp_flags |= P_LEAF2;
4496 fp->mp_pad = data->mv_size;
4497 fp->mp_upper += 2 * data->mv_size; /* leave space for 2 more */
4499 fp->mp_upper += 2 * sizeof(indx_t) + 2 * NODESIZE +
4500 (dkey.mv_size & 1) + (data->mv_size & 1);
4502 mdb_node_del(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], 0);
4505 xdata.mv_size = fp->mp_upper;
4510 if (!F_ISSET(leaf->mn_flags, F_SUBDATA)) {
4511 /* See if we need to convert from fake page to subDB */
4513 unsigned int offset;
4516 fp = NODEDATA(leaf);
4517 if (flags == MDB_CURRENT) {
4519 fp->mp_flags |= P_DIRTY;
4520 COPY_PGNO(fp->mp_pgno, mc->mc_pg[mc->mc_top]->mp_pgno);
4521 mc->mc_xcursor->mx_cursor.mc_pg[0] = fp;
4525 if (mc->mc_db->md_flags & MDB_DUPFIXED) {
4526 offset = fp->mp_pad;
4527 if (SIZELEFT(fp) >= offset)
4529 offset *= 4; /* space for 4 more */
4531 offset = NODESIZE + sizeof(indx_t) + data->mv_size;
4533 offset += offset & 1;
4534 if (NODESIZE + sizeof(indx_t) + NODEKSZ(leaf) + NODEDSZ(leaf) +
4535 offset >= (mc->mc_txn->mt_env->me_psize - PAGEHDRSZ) /
4537 /* yes, convert it */
4539 if (mc->mc_db->md_flags & MDB_DUPFIXED) {
4540 dummy.md_pad = fp->mp_pad;
4541 dummy.md_flags = MDB_DUPFIXED;
4542 if (mc->mc_db->md_flags & MDB_INTEGERDUP)
4543 dummy.md_flags |= MDB_INTEGERKEY;
4546 dummy.md_branch_pages = 0;
4547 dummy.md_leaf_pages = 1;
4548 dummy.md_overflow_pages = 0;
4549 dummy.md_entries = NUMKEYS(fp);
4551 xdata.mv_size = sizeof(MDB_db);
4552 xdata.mv_data = &dummy;
4553 mp = mdb_page_alloc(mc, 1);
4556 offset = mc->mc_txn->mt_env->me_psize - NODEDSZ(leaf);
4557 flags |= F_DUPDATA|F_SUBDATA;
4558 dummy.md_root = mp->mp_pgno;
4560 /* no, just grow it */
4562 xdata.mv_size = NODEDSZ(leaf) + offset;
4563 xdata.mv_data = &pbuf;
4564 mp = (MDB_page *)&pbuf;
4565 mp->mp_pgno = mc->mc_pg[mc->mc_top]->mp_pgno;
4568 mp->mp_flags = fp->mp_flags | P_DIRTY;
4569 mp->mp_pad = fp->mp_pad;
4570 mp->mp_lower = fp->mp_lower;
4571 mp->mp_upper = fp->mp_upper + offset;
4573 memcpy(METADATA(mp), METADATA(fp), NUMKEYS(fp) * fp->mp_pad);
4575 nsize = NODEDSZ(leaf) - fp->mp_upper;
4576 memcpy((char *)mp + mp->mp_upper, (char *)fp + fp->mp_upper, nsize);
4577 for (i=0; i<NUMKEYS(fp); i++)
4578 mp->mp_ptrs[i] = fp->mp_ptrs[i] + offset;
4580 mdb_node_del(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], 0);
4584 /* data is on sub-DB, just store it */
4585 flags |= F_DUPDATA|F_SUBDATA;
4589 /* overflow page overwrites need special handling */
4590 if (F_ISSET(leaf->mn_flags, F_BIGDATA)) {
4593 int ovpages, dpages;
4595 ovpages = OVPAGES(NODEDSZ(leaf), mc->mc_txn->mt_env->me_psize);
4596 dpages = OVPAGES(data->mv_size, mc->mc_txn->mt_env->me_psize);
4597 memcpy(&pg, NODEDATA(leaf), sizeof(pg));
4598 mdb_page_get(mc->mc_txn, pg, &omp);
4599 /* Is the ov page writable and large enough? */
4600 if ((omp->mp_flags & P_DIRTY) && ovpages >= dpages) {
4601 /* yes, overwrite it. Note in this case we don't
4602 * bother to try shrinking the node if the new data
4603 * is smaller than the overflow threshold.
4605 if (F_ISSET(flags, MDB_RESERVE))
4606 data->mv_data = METADATA(omp);
4608 memcpy(METADATA(omp), data->mv_data, data->mv_size);
4611 /* no, free ovpages */
4613 mc->mc_db->md_overflow_pages -= ovpages;
4614 for (i=0; i<ovpages; i++) {
4615 DPRINTF("freed ov page %zu", pg);
4616 mdb_midl_append(&mc->mc_txn->mt_free_pgs, pg);
4620 } else if (NODEDSZ(leaf) == data->mv_size) {
4621 /* same size, just replace it. Note that we could
4622 * also reuse this node if the new data is smaller,
4623 * but instead we opt to shrink the node in that case.
4625 if (F_ISSET(flags, MDB_RESERVE))
4626 data->mv_data = NODEDATA(leaf);
4628 memcpy(NODEDATA(leaf), data->mv_data, data->mv_size);
4631 mdb_node_del(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], 0);
4632 mc->mc_db->md_entries--;
4634 DPRINTF("inserting key at index %i", mc->mc_ki[mc->mc_top]);
4641 nflags = flags & NODE_ADD_FLAGS;
4642 nsize = IS_LEAF2(mc->mc_pg[mc->mc_top]) ? key->mv_size : mdb_leaf_size(mc->mc_txn->mt_env, key, rdata);
4643 if (SIZELEFT(mc->mc_pg[mc->mc_top]) < nsize) {
4644 if (( flags & (F_DUPDATA|F_SUBDATA)) == F_DUPDATA )
4645 nflags &= ~MDB_APPEND;
4647 nflags |= MDB_SPLIT_REPLACE;
4648 rc = mdb_page_split(mc, key, rdata, P_INVALID, nflags);
4650 /* There is room already in this leaf page. */
4651 rc = mdb_node_add(mc, mc->mc_ki[mc->mc_top], key, rdata, 0, nflags);
4652 if (rc == 0 && !do_sub && insert) {
4653 /* Adjust other cursors pointing to mp */
4654 MDB_cursor *m2, *m3;
4655 MDB_dbi dbi = mc->mc_dbi;
4656 unsigned i = mc->mc_top;
4657 MDB_page *mp = mc->mc_pg[i];
4659 if (mc->mc_flags & C_SUB)
4662 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
4663 if (mc->mc_flags & C_SUB)
4664 m3 = &m2->mc_xcursor->mx_cursor;
4667 if (m3 == mc || m3->mc_snum < mc->mc_snum) continue;
4668 if (m3->mc_pg[i] == mp && m3->mc_ki[i] >= mc->mc_ki[i]) {
4675 if (rc != MDB_SUCCESS)
4676 mc->mc_txn->mt_flags |= MDB_TXN_ERROR;
4678 /* Now store the actual data in the child DB. Note that we're
4679 * storing the user data in the keys field, so there are strict
4680 * size limits on dupdata. The actual data fields of the child
4681 * DB are all zero size.
4688 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
4689 if (flags & MDB_CURRENT) {
4690 xflags = MDB_CURRENT;
4692 mdb_xcursor_init1(mc, leaf);
4693 xflags = (flags & MDB_NODUPDATA) ? MDB_NOOVERWRITE : 0;
4695 /* converted, write the original data first */
4697 rc = mdb_cursor_put(&mc->mc_xcursor->mx_cursor, &dkey, &xdata, xflags);
4701 /* Adjust other cursors pointing to mp */
4703 unsigned i = mc->mc_top;
4704 MDB_page *mp = mc->mc_pg[i];
4706 for (m2 = mc->mc_txn->mt_cursors[mc->mc_dbi]; m2; m2=m2->mc_next) {
4707 if (m2 == mc || m2->mc_snum < mc->mc_snum) continue;
4708 if (m2->mc_pg[i] == mp && m2->mc_ki[i] == mc->mc_ki[i]) {
4709 mdb_xcursor_init1(m2, leaf);
4714 if (flags & MDB_APPENDDUP)
4715 xflags |= MDB_APPEND;
4716 rc = mdb_cursor_put(&mc->mc_xcursor->mx_cursor, data, &xdata, xflags);
4717 if (flags & F_SUBDATA) {
4718 void *db = NODEDATA(leaf);
4719 memcpy(db, &mc->mc_xcursor->mx_db, sizeof(MDB_db));
4722 /* sub-writes might have failed so check rc again.
4723 * Don't increment count if we just replaced an existing item.
4725 if (!rc && !(flags & MDB_CURRENT))
4726 mc->mc_db->md_entries++;
4727 if (flags & MDB_MULTIPLE) {
4729 if (mcount < data[1].mv_size) {
4730 data[0].mv_data = (char *)data[0].mv_data + data[0].mv_size;
4731 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
4741 mdb_cursor_del(MDB_cursor *mc, unsigned int flags)
4746 if (F_ISSET(mc->mc_txn->mt_flags, MDB_TXN_RDONLY))
4749 if (!mc->mc_flags & C_INITIALIZED)
4752 rc = mdb_cursor_touch(mc);
4756 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
4758 if (!IS_LEAF2(mc->mc_pg[mc->mc_top]) && F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4759 if (flags != MDB_NODUPDATA) {
4760 if (!F_ISSET(leaf->mn_flags, F_SUBDATA)) {
4761 mc->mc_xcursor->mx_cursor.mc_pg[0] = NODEDATA(leaf);
4763 rc = mdb_cursor_del(&mc->mc_xcursor->mx_cursor, 0);
4764 /* If sub-DB still has entries, we're done */
4765 if (mc->mc_xcursor->mx_db.md_entries) {
4766 if (leaf->mn_flags & F_SUBDATA) {
4767 /* update subDB info */
4768 void *db = NODEDATA(leaf);
4769 memcpy(db, &mc->mc_xcursor->mx_db, sizeof(MDB_db));
4771 /* shrink fake page */
4772 mdb_node_shrink(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
4774 mc->mc_db->md_entries--;
4777 /* otherwise fall thru and delete the sub-DB */
4780 if (leaf->mn_flags & F_SUBDATA) {
4781 /* add all the child DB's pages to the free list */
4782 rc = mdb_drop0(&mc->mc_xcursor->mx_cursor, 0);
4783 if (rc == MDB_SUCCESS) {
4784 mc->mc_db->md_entries -=
4785 mc->mc_xcursor->mx_db.md_entries;
4790 return mdb_cursor_del0(mc, leaf);
4793 /** Allocate and initialize new pages for a database.
4794 * @param[in] mc a cursor on the database being added to.
4795 * @param[in] flags flags defining what type of page is being allocated.
4796 * @param[in] num the number of pages to allocate. This is usually 1,
4797 * unless allocating overflow pages for a large record.
4798 * @return Address of a page, or NULL on failure.
4801 mdb_page_new(MDB_cursor *mc, uint32_t flags, int num)
4805 if ((np = mdb_page_alloc(mc, num)) == NULL)
4807 DPRINTF("allocated new mpage %zu, page size %u",
4808 np->mp_pgno, mc->mc_txn->mt_env->me_psize);
4809 np->mp_flags = flags | P_DIRTY;
4810 np->mp_lower = PAGEHDRSZ;
4811 np->mp_upper = mc->mc_txn->mt_env->me_psize;
4814 mc->mc_db->md_branch_pages++;
4815 else if (IS_LEAF(np))
4816 mc->mc_db->md_leaf_pages++;
4817 else if (IS_OVERFLOW(np)) {
4818 mc->mc_db->md_overflow_pages += num;
4825 /** Calculate the size of a leaf node.
4826 * The size depends on the environment's page size; if a data item
4827 * is too large it will be put onto an overflow page and the node
4828 * size will only include the key and not the data. Sizes are always
4829 * rounded up to an even number of bytes, to guarantee 2-byte alignment
4830 * of the #MDB_node headers.
4831 * @param[in] env The environment handle.
4832 * @param[in] key The key for the node.
4833 * @param[in] data The data for the node.
4834 * @return The number of bytes needed to store the node.
4837 mdb_leaf_size(MDB_env *env, MDB_val *key, MDB_val *data)
4841 sz = LEAFSIZE(key, data);
4842 if (sz >= env->me_psize / MDB_MINKEYS) {
4843 /* put on overflow page */
4844 sz -= data->mv_size - sizeof(pgno_t);
4848 return sz + sizeof(indx_t);
4851 /** Calculate the size of a branch node.
4852 * The size should depend on the environment's page size but since
4853 * we currently don't support spilling large keys onto overflow
4854 * pages, it's simply the size of the #MDB_node header plus the
4855 * size of the key. Sizes are always rounded up to an even number
4856 * of bytes, to guarantee 2-byte alignment of the #MDB_node headers.
4857 * @param[in] env The environment handle.
4858 * @param[in] key The key for the node.
4859 * @return The number of bytes needed to store the node.
4862 mdb_branch_size(MDB_env *env, MDB_val *key)
4867 if (sz >= env->me_psize / MDB_MINKEYS) {
4868 /* put on overflow page */
4869 /* not implemented */
4870 /* sz -= key->size - sizeof(pgno_t); */
4873 return sz + sizeof(indx_t);
4876 /** Add a node to the page pointed to by the cursor.
4877 * @param[in] mc The cursor for this operation.
4878 * @param[in] indx The index on the page where the new node should be added.
4879 * @param[in] key The key for the new node.
4880 * @param[in] data The data for the new node, if any.
4881 * @param[in] pgno The page number, if adding a branch node.
4882 * @param[in] flags Flags for the node.
4883 * @return 0 on success, non-zero on failure. Possible errors are:
4885 * <li>ENOMEM - failed to allocate overflow pages for the node.
4886 * <li>ENOSPC - there is insufficient room in the page. This error
4887 * should never happen since all callers already calculate the
4888 * page's free space before calling this function.
4892 mdb_node_add(MDB_cursor *mc, indx_t indx,
4893 MDB_val *key, MDB_val *data, pgno_t pgno, unsigned int flags)
4896 size_t node_size = NODESIZE;
4899 MDB_page *mp = mc->mc_pg[mc->mc_top];
4900 MDB_page *ofp = NULL; /* overflow page */
4903 assert(mp->mp_upper >= mp->mp_lower);
4905 DPRINTF("add to %s %spage %zu index %i, data size %zu key size %zu [%s]",
4906 IS_LEAF(mp) ? "leaf" : "branch",
4907 IS_SUBP(mp) ? "sub-" : "",
4908 mp->mp_pgno, indx, data ? data->mv_size : 0,
4909 key ? key->mv_size : 0, key ? DKEY(key) : NULL);
4912 /* Move higher keys up one slot. */
4913 int ksize = mc->mc_db->md_pad, dif;
4914 char *ptr = LEAF2KEY(mp, indx, ksize);
4915 dif = NUMKEYS(mp) - indx;
4917 memmove(ptr+ksize, ptr, dif*ksize);
4918 /* insert new key */
4919 memcpy(ptr, key->mv_data, ksize);
4921 /* Just using these for counting */
4922 mp->mp_lower += sizeof(indx_t);
4923 mp->mp_upper -= ksize - sizeof(indx_t);
4928 node_size += key->mv_size;
4932 if (F_ISSET(flags, F_BIGDATA)) {
4933 /* Data already on overflow page. */
4934 node_size += sizeof(pgno_t);
4935 } else if (node_size + data->mv_size >= mc->mc_txn->mt_env->me_psize / MDB_MINKEYS) {
4936 int ovpages = OVPAGES(data->mv_size, mc->mc_txn->mt_env->me_psize);
4937 /* Put data on overflow page. */
4938 DPRINTF("data size is %zu, node would be %zu, put data on overflow page",
4939 data->mv_size, node_size+data->mv_size);
4940 node_size += sizeof(pgno_t);
4941 if ((ofp = mdb_page_new(mc, P_OVERFLOW, ovpages)) == NULL)
4943 DPRINTF("allocated overflow page %zu", ofp->mp_pgno);
4946 node_size += data->mv_size;
4949 node_size += node_size & 1;
4951 if (node_size + sizeof(indx_t) > SIZELEFT(mp)) {
4952 DPRINTF("not enough room in page %zu, got %u ptrs",
4953 mp->mp_pgno, NUMKEYS(mp));
4954 DPRINTF("upper - lower = %u - %u = %u", mp->mp_upper, mp->mp_lower,
4955 mp->mp_upper - mp->mp_lower);
4956 DPRINTF("node size = %zu", node_size);
4960 /* Move higher pointers up one slot. */
4961 for (i = NUMKEYS(mp); i > indx; i--)
4962 mp->mp_ptrs[i] = mp->mp_ptrs[i - 1];
4964 /* Adjust free space offsets. */
4965 ofs = mp->mp_upper - node_size;
4966 assert(ofs >= mp->mp_lower + sizeof(indx_t));
4967 mp->mp_ptrs[indx] = ofs;
4969 mp->mp_lower += sizeof(indx_t);
4971 /* Write the node data. */
4972 node = NODEPTR(mp, indx);
4973 node->mn_ksize = (key == NULL) ? 0 : key->mv_size;
4974 node->mn_flags = flags;
4976 SETDSZ(node,data->mv_size);
4981 memcpy(NODEKEY(node), key->mv_data, key->mv_size);
4986 if (F_ISSET(flags, F_BIGDATA))
4987 memcpy(node->mn_data + key->mv_size, data->mv_data,
4989 else if (F_ISSET(flags, MDB_RESERVE))
4990 data->mv_data = node->mn_data + key->mv_size;
4992 memcpy(node->mn_data + key->mv_size, data->mv_data,
4995 memcpy(node->mn_data + key->mv_size, &ofp->mp_pgno,
4997 if (F_ISSET(flags, MDB_RESERVE))
4998 data->mv_data = METADATA(ofp);
5000 memcpy(METADATA(ofp), data->mv_data, data->mv_size);
5007 /** Delete the specified node from a page.
5008 * @param[in] mp The page to operate on.
5009 * @param[in] indx The index of the node to delete.
5010 * @param[in] ksize The size of a node. Only used if the page is
5011 * part of a #MDB_DUPFIXED database.
5014 mdb_node_del(MDB_page *mp, indx_t indx, int ksize)
5017 indx_t i, j, numkeys, ptr;
5024 COPY_PGNO(pgno, mp->mp_pgno);
5025 DPRINTF("delete node %u on %s page %zu", indx,
5026 IS_LEAF(mp) ? "leaf" : "branch", pgno);
5029 assert(indx < NUMKEYS(mp));
5032 int x = NUMKEYS(mp) - 1 - indx;
5033 base = LEAF2KEY(mp, indx, ksize);
5035 memmove(base, base + ksize, x * ksize);
5036 mp->mp_lower -= sizeof(indx_t);
5037 mp->mp_upper += ksize - sizeof(indx_t);
5041 node = NODEPTR(mp, indx);
5042 sz = NODESIZE + node->mn_ksize;
5044 if (F_ISSET(node->mn_flags, F_BIGDATA))
5045 sz += sizeof(pgno_t);
5047 sz += NODEDSZ(node);
5051 ptr = mp->mp_ptrs[indx];
5052 numkeys = NUMKEYS(mp);
5053 for (i = j = 0; i < numkeys; i++) {
5055 mp->mp_ptrs[j] = mp->mp_ptrs[i];
5056 if (mp->mp_ptrs[i] < ptr)
5057 mp->mp_ptrs[j] += sz;
5062 base = (char *)mp + mp->mp_upper;
5063 memmove(base + sz, base, ptr - mp->mp_upper);
5065 mp->mp_lower -= sizeof(indx_t);
5069 /** Compact the main page after deleting a node on a subpage.
5070 * @param[in] mp The main page to operate on.
5071 * @param[in] indx The index of the subpage on the main page.
5074 mdb_node_shrink(MDB_page *mp, indx_t indx)
5081 indx_t i, numkeys, ptr;
5083 node = NODEPTR(mp, indx);
5084 sp = (MDB_page *)NODEDATA(node);
5085 osize = NODEDSZ(node);
5087 delta = sp->mp_upper - sp->mp_lower;
5088 SETDSZ(node, osize - delta);
5089 xp = (MDB_page *)((char *)sp + delta);
5091 /* shift subpage upward */
5093 nsize = NUMKEYS(sp) * sp->mp_pad;
5094 memmove(METADATA(xp), METADATA(sp), nsize);
5097 nsize = osize - sp->mp_upper;
5098 numkeys = NUMKEYS(sp);
5099 for (i=numkeys-1; i>=0; i--)
5100 xp->mp_ptrs[i] = sp->mp_ptrs[i] - delta;
5102 xp->mp_upper = sp->mp_lower;
5103 xp->mp_lower = sp->mp_lower;
5104 xp->mp_flags = sp->mp_flags;
5105 xp->mp_pad = sp->mp_pad;
5106 COPY_PGNO(xp->mp_pgno, mp->mp_pgno);
5108 /* shift lower nodes upward */
5109 ptr = mp->mp_ptrs[indx];
5110 numkeys = NUMKEYS(mp);
5111 for (i = 0; i < numkeys; i++) {
5112 if (mp->mp_ptrs[i] <= ptr)
5113 mp->mp_ptrs[i] += delta;
5116 base = (char *)mp + mp->mp_upper;
5117 memmove(base + delta, base, ptr - mp->mp_upper + NODESIZE + NODEKSZ(node));
5118 mp->mp_upper += delta;
5121 /** Initial setup of a sorted-dups cursor.
5122 * Sorted duplicates are implemented as a sub-database for the given key.
5123 * The duplicate data items are actually keys of the sub-database.
5124 * Operations on the duplicate data items are performed using a sub-cursor
5125 * initialized when the sub-database is first accessed. This function does
5126 * the preliminary setup of the sub-cursor, filling in the fields that
5127 * depend only on the parent DB.
5128 * @param[in] mc The main cursor whose sorted-dups cursor is to be initialized.
5131 mdb_xcursor_init0(MDB_cursor *mc)
5133 MDB_xcursor *mx = mc->mc_xcursor;
5135 mx->mx_cursor.mc_xcursor = NULL;
5136 mx->mx_cursor.mc_txn = mc->mc_txn;
5137 mx->mx_cursor.mc_db = &mx->mx_db;
5138 mx->mx_cursor.mc_dbx = &mx->mx_dbx;
5139 mx->mx_cursor.mc_dbi = mc->mc_dbi+1;
5140 mx->mx_cursor.mc_dbflag = &mx->mx_dbflag;
5141 mx->mx_cursor.mc_snum = 0;
5142 mx->mx_cursor.mc_top = 0;
5143 mx->mx_cursor.mc_flags = C_SUB;
5144 mx->mx_dbx.md_cmp = mc->mc_dbx->md_dcmp;
5145 mx->mx_dbx.md_dcmp = NULL;
5146 mx->mx_dbx.md_rel = mc->mc_dbx->md_rel;
5149 /** Final setup of a sorted-dups cursor.
5150 * Sets up the fields that depend on the data from the main cursor.
5151 * @param[in] mc The main cursor whose sorted-dups cursor is to be initialized.
5152 * @param[in] node The data containing the #MDB_db record for the
5153 * sorted-dup database.
5156 mdb_xcursor_init1(MDB_cursor *mc, MDB_node *node)
5158 MDB_xcursor *mx = mc->mc_xcursor;
5160 if (node->mn_flags & F_SUBDATA) {
5161 memcpy(&mx->mx_db, NODEDATA(node), sizeof(MDB_db));
5162 mx->mx_cursor.mc_pg[0] = 0;
5163 mx->mx_cursor.mc_snum = 0;
5164 mx->mx_cursor.mc_flags = C_SUB;
5166 MDB_page *fp = NODEDATA(node);
5167 mx->mx_db.md_pad = mc->mc_pg[mc->mc_top]->mp_pad;
5168 mx->mx_db.md_flags = 0;
5169 mx->mx_db.md_depth = 1;
5170 mx->mx_db.md_branch_pages = 0;
5171 mx->mx_db.md_leaf_pages = 1;
5172 mx->mx_db.md_overflow_pages = 0;
5173 mx->mx_db.md_entries = NUMKEYS(fp);
5174 COPY_PGNO(mx->mx_db.md_root, fp->mp_pgno);
5175 mx->mx_cursor.mc_snum = 1;
5176 mx->mx_cursor.mc_flags = C_INITIALIZED|C_SUB;
5177 mx->mx_cursor.mc_top = 0;
5178 mx->mx_cursor.mc_pg[0] = fp;
5179 mx->mx_cursor.mc_ki[0] = 0;
5180 if (mc->mc_db->md_flags & MDB_DUPFIXED) {
5181 mx->mx_db.md_flags = MDB_DUPFIXED;
5182 mx->mx_db.md_pad = fp->mp_pad;
5183 if (mc->mc_db->md_flags & MDB_INTEGERDUP)
5184 mx->mx_db.md_flags |= MDB_INTEGERKEY;
5187 DPRINTF("Sub-db %u for db %u root page %zu", mx->mx_cursor.mc_dbi, mc->mc_dbi,
5189 mx->mx_dbflag = (F_ISSET(mc->mc_pg[mc->mc_top]->mp_flags, P_DIRTY)) ?
5191 mx->mx_dbx.md_name.mv_data = NODEKEY(node);
5192 mx->mx_dbx.md_name.mv_size = node->mn_ksize;
5193 #if UINT_MAX < SIZE_MAX
5194 if (mx->mx_dbx.md_cmp == mdb_cmp_int && mx->mx_db.md_pad == sizeof(size_t))
5195 #ifdef MISALIGNED_OK
5196 mx->mx_dbx.md_cmp = mdb_cmp_long;
5198 mx->mx_dbx.md_cmp = mdb_cmp_cint;
5203 /** Initialize a cursor for a given transaction and database. */
5205 mdb_cursor_init(MDB_cursor *mc, MDB_txn *txn, MDB_dbi dbi, MDB_xcursor *mx)
5210 mc->mc_db = &txn->mt_dbs[dbi];
5211 mc->mc_dbx = &txn->mt_dbxs[dbi];
5212 mc->mc_dbflag = &txn->mt_dbflags[dbi];
5217 if (txn->mt_dbs[dbi].md_flags & MDB_DUPSORT) {
5219 mc->mc_xcursor = mx;
5220 mdb_xcursor_init0(mc);
5222 mc->mc_xcursor = NULL;
5224 if (*mc->mc_dbflag & DB_STALE) {
5225 mdb_page_search(mc, NULL, MDB_PS_ROOTONLY);
5230 mdb_cursor_open(MDB_txn *txn, MDB_dbi dbi, MDB_cursor **ret)
5233 MDB_xcursor *mx = NULL;
5234 size_t size = sizeof(MDB_cursor);
5236 if (txn == NULL || ret == NULL || dbi >= txn->mt_numdbs)
5239 /* Allow read access to the freelist */
5240 if (!dbi && !F_ISSET(txn->mt_flags, MDB_TXN_RDONLY))
5243 if (txn->mt_dbs[dbi].md_flags & MDB_DUPSORT)
5244 size += sizeof(MDB_xcursor);
5246 if ((mc = malloc(size)) != NULL) {
5247 if (txn->mt_dbs[dbi].md_flags & MDB_DUPSORT) {
5248 mx = (MDB_xcursor *)(mc + 1);
5250 mdb_cursor_init(mc, txn, dbi, mx);
5251 if (txn->mt_cursors) {
5252 mc->mc_next = txn->mt_cursors[dbi];
5253 txn->mt_cursors[dbi] = mc;
5255 mc->mc_flags |= C_ALLOCD;
5265 /* Return the count of duplicate data items for the current key */
5267 mdb_cursor_count(MDB_cursor *mc, size_t *countp)
5271 if (mc == NULL || countp == NULL)
5274 if (!(mc->mc_db->md_flags & MDB_DUPSORT))
5277 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
5278 if (!F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5281 if (!(mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED))
5284 *countp = mc->mc_xcursor->mx_db.md_entries;
5290 mdb_cursor_close(MDB_cursor *mc)
5293 /* remove from txn, if tracked */
5294 if (mc->mc_txn->mt_cursors) {
5295 MDB_cursor **prev = &mc->mc_txn->mt_cursors[mc->mc_dbi];
5296 while (*prev && *prev != mc) prev = &(*prev)->mc_next;
5298 *prev = mc->mc_next;
5300 if (mc->mc_flags & C_ALLOCD)
5306 mdb_cursor_txn(MDB_cursor *mc)
5308 if (!mc) return NULL;
5313 mdb_cursor_dbi(MDB_cursor *mc)
5319 /** Replace the key for a node with a new key.
5320 * @param[in] mp The page containing the node to operate on.
5321 * @param[in] indx The index of the node to operate on.
5322 * @param[in] key The new key to use.
5323 * @return 0 on success, non-zero on failure.
5326 mdb_update_key(MDB_page *mp, indx_t indx, MDB_val *key)
5332 indx_t ptr, i, numkeys;
5335 node = NODEPTR(mp, indx);
5336 ptr = mp->mp_ptrs[indx];
5340 char kbuf2[(MAXKEYSIZE*2+1)];
5341 k2.mv_data = NODEKEY(node);
5342 k2.mv_size = node->mn_ksize;
5343 DPRINTF("update key %u (ofs %u) [%s] to [%s] on page %zu",
5345 mdb_dkey(&k2, kbuf2),
5351 delta0 = delta = key->mv_size - node->mn_ksize;
5353 /* Must be 2-byte aligned. If new key is
5354 * shorter by 1, the shift will be skipped.
5356 delta += (delta & 1);
5358 if (delta > 0 && SIZELEFT(mp) < delta) {
5359 DPRINTF("OUCH! Not enough room, delta = %d", delta);
5363 numkeys = NUMKEYS(mp);
5364 for (i = 0; i < numkeys; i++) {
5365 if (mp->mp_ptrs[i] <= ptr)
5366 mp->mp_ptrs[i] -= delta;
5369 base = (char *)mp + mp->mp_upper;
5370 len = ptr - mp->mp_upper + NODESIZE;
5371 memmove(base - delta, base, len);
5372 mp->mp_upper -= delta;
5374 node = NODEPTR(mp, indx);
5377 /* But even if no shift was needed, update ksize */
5379 node->mn_ksize = key->mv_size;
5382 memcpy(NODEKEY(node), key->mv_data, key->mv_size);
5387 /** Move a node from csrc to cdst.
5390 mdb_node_move(MDB_cursor *csrc, MDB_cursor *cdst)
5396 unsigned short flags;
5400 /* Mark src and dst as dirty. */
5401 if ((rc = mdb_page_touch(csrc)) ||
5402 (rc = mdb_page_touch(cdst)))
5405 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
5406 srcnode = NODEPTR(csrc->mc_pg[csrc->mc_top], 0); /* fake */
5407 key.mv_size = csrc->mc_db->md_pad;
5408 key.mv_data = LEAF2KEY(csrc->mc_pg[csrc->mc_top], csrc->mc_ki[csrc->mc_top], key.mv_size);
5410 data.mv_data = NULL;
5414 srcnode = NODEPTR(csrc->mc_pg[csrc->mc_top], csrc->mc_ki[csrc->mc_top]);
5415 assert(!((long)srcnode&1));
5416 srcpg = NODEPGNO(srcnode);
5417 flags = srcnode->mn_flags;
5418 if (csrc->mc_ki[csrc->mc_top] == 0 && IS_BRANCH(csrc->mc_pg[csrc->mc_top])) {
5419 unsigned int snum = csrc->mc_snum;
5421 /* must find the lowest key below src */
5422 mdb_page_search_root(csrc, NULL, 0);
5423 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
5424 key.mv_size = csrc->mc_db->md_pad;
5425 key.mv_data = LEAF2KEY(csrc->mc_pg[csrc->mc_top], 0, key.mv_size);
5427 s2 = NODEPTR(csrc->mc_pg[csrc->mc_top], 0);
5428 key.mv_size = NODEKSZ(s2);
5429 key.mv_data = NODEKEY(s2);
5431 csrc->mc_snum = snum--;
5432 csrc->mc_top = snum;
5434 key.mv_size = NODEKSZ(srcnode);
5435 key.mv_data = NODEKEY(srcnode);
5437 data.mv_size = NODEDSZ(srcnode);
5438 data.mv_data = NODEDATA(srcnode);
5440 if (IS_BRANCH(cdst->mc_pg[cdst->mc_top]) && cdst->mc_ki[cdst->mc_top] == 0) {
5441 unsigned int snum = cdst->mc_snum;
5444 /* must find the lowest key below dst */
5445 mdb_page_search_root(cdst, NULL, 0);
5446 if (IS_LEAF2(cdst->mc_pg[cdst->mc_top])) {
5447 bkey.mv_size = cdst->mc_db->md_pad;
5448 bkey.mv_data = LEAF2KEY(cdst->mc_pg[cdst->mc_top], 0, bkey.mv_size);
5450 s2 = NODEPTR(cdst->mc_pg[cdst->mc_top], 0);
5451 bkey.mv_size = NODEKSZ(s2);
5452 bkey.mv_data = NODEKEY(s2);
5454 cdst->mc_snum = snum--;
5455 cdst->mc_top = snum;
5456 rc = mdb_update_key(cdst->mc_pg[cdst->mc_top], 0, &bkey);
5459 DPRINTF("moving %s node %u [%s] on page %zu to node %u on page %zu",
5460 IS_LEAF(csrc->mc_pg[csrc->mc_top]) ? "leaf" : "branch",
5461 csrc->mc_ki[csrc->mc_top],
5463 csrc->mc_pg[csrc->mc_top]->mp_pgno,
5464 cdst->mc_ki[cdst->mc_top], cdst->mc_pg[cdst->mc_top]->mp_pgno);
5466 /* Add the node to the destination page.
5468 rc = mdb_node_add(cdst, cdst->mc_ki[cdst->mc_top], &key, &data, srcpg, flags);
5469 if (rc != MDB_SUCCESS)
5472 /* Delete the node from the source page.
5474 mdb_node_del(csrc->mc_pg[csrc->mc_top], csrc->mc_ki[csrc->mc_top], key.mv_size);
5477 /* Adjust other cursors pointing to mp */
5478 MDB_cursor *m2, *m3;
5479 MDB_dbi dbi = csrc->mc_dbi;
5480 MDB_page *mp = csrc->mc_pg[csrc->mc_top];
5482 if (csrc->mc_flags & C_SUB)
5485 for (m2 = csrc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
5486 if (m2 == csrc) continue;
5487 if (csrc->mc_flags & C_SUB)
5488 m3 = &m2->mc_xcursor->mx_cursor;
5491 if (m3->mc_pg[csrc->mc_top] == mp && m3->mc_ki[csrc->mc_top] ==
5492 csrc->mc_ki[csrc->mc_top]) {
5493 m3->mc_pg[csrc->mc_top] = cdst->mc_pg[cdst->mc_top];
5494 m3->mc_ki[csrc->mc_top] = cdst->mc_ki[cdst->mc_top];
5499 /* Update the parent separators.
5501 if (csrc->mc_ki[csrc->mc_top] == 0) {
5502 if (csrc->mc_ki[csrc->mc_top-1] != 0) {
5503 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
5504 key.mv_data = LEAF2KEY(csrc->mc_pg[csrc->mc_top], 0, key.mv_size);
5506 srcnode = NODEPTR(csrc->mc_pg[csrc->mc_top], 0);
5507 key.mv_size = NODEKSZ(srcnode);
5508 key.mv_data = NODEKEY(srcnode);
5510 DPRINTF("update separator for source page %zu to [%s]",
5511 csrc->mc_pg[csrc->mc_top]->mp_pgno, DKEY(&key));
5512 if ((rc = mdb_update_key(csrc->mc_pg[csrc->mc_top-1], csrc->mc_ki[csrc->mc_top-1],
5513 &key)) != MDB_SUCCESS)
5516 if (IS_BRANCH(csrc->mc_pg[csrc->mc_top])) {
5518 nullkey.mv_size = 0;
5519 rc = mdb_update_key(csrc->mc_pg[csrc->mc_top], 0, &nullkey);
5520 assert(rc == MDB_SUCCESS);
5524 if (cdst->mc_ki[cdst->mc_top] == 0) {
5525 if (cdst->mc_ki[cdst->mc_top-1] != 0) {
5526 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
5527 key.mv_data = LEAF2KEY(cdst->mc_pg[cdst->mc_top], 0, key.mv_size);
5529 srcnode = NODEPTR(cdst->mc_pg[cdst->mc_top], 0);
5530 key.mv_size = NODEKSZ(srcnode);
5531 key.mv_data = NODEKEY(srcnode);
5533 DPRINTF("update separator for destination page %zu to [%s]",
5534 cdst->mc_pg[cdst->mc_top]->mp_pgno, DKEY(&key));
5535 if ((rc = mdb_update_key(cdst->mc_pg[cdst->mc_top-1], cdst->mc_ki[cdst->mc_top-1],
5536 &key)) != MDB_SUCCESS)
5539 if (IS_BRANCH(cdst->mc_pg[cdst->mc_top])) {
5541 nullkey.mv_size = 0;
5542 rc = mdb_update_key(cdst->mc_pg[cdst->mc_top], 0, &nullkey);
5543 assert(rc == MDB_SUCCESS);
5550 /** Merge one page into another.
5551 * The nodes from the page pointed to by \b csrc will
5552 * be copied to the page pointed to by \b cdst and then
5553 * the \b csrc page will be freed.
5554 * @param[in] csrc Cursor pointing to the source page.
5555 * @param[in] cdst Cursor pointing to the destination page.
5558 mdb_page_merge(MDB_cursor *csrc, MDB_cursor *cdst)
5566 DPRINTF("merging page %zu into %zu", csrc->mc_pg[csrc->mc_top]->mp_pgno,
5567 cdst->mc_pg[cdst->mc_top]->mp_pgno);
5569 assert(csrc->mc_snum > 1); /* can't merge root page */
5570 assert(cdst->mc_snum > 1);
5572 /* Mark dst as dirty. */
5573 if ((rc = mdb_page_touch(cdst)))
5576 /* Move all nodes from src to dst.
5578 j = nkeys = NUMKEYS(cdst->mc_pg[cdst->mc_top]);
5579 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
5580 key.mv_size = csrc->mc_db->md_pad;
5581 key.mv_data = METADATA(csrc->mc_pg[csrc->mc_top]);
5582 for (i = 0; i < NUMKEYS(csrc->mc_pg[csrc->mc_top]); i++, j++) {
5583 rc = mdb_node_add(cdst, j, &key, NULL, 0, 0);
5584 if (rc != MDB_SUCCESS)
5586 key.mv_data = (char *)key.mv_data + key.mv_size;
5589 for (i = 0; i < NUMKEYS(csrc->mc_pg[csrc->mc_top]); i++, j++) {
5590 srcnode = NODEPTR(csrc->mc_pg[csrc->mc_top], i);
5591 if (i == 0 && IS_BRANCH(csrc->mc_pg[csrc->mc_top])) {
5592 unsigned int snum = csrc->mc_snum;
5594 /* must find the lowest key below src */
5595 mdb_page_search_root(csrc, NULL, 0);
5596 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
5597 key.mv_size = csrc->mc_db->md_pad;
5598 key.mv_data = LEAF2KEY(csrc->mc_pg[csrc->mc_top], 0, key.mv_size);
5600 s2 = NODEPTR(csrc->mc_pg[csrc->mc_top], 0);
5601 key.mv_size = NODEKSZ(s2);
5602 key.mv_data = NODEKEY(s2);
5604 csrc->mc_snum = snum--;
5605 csrc->mc_top = snum;
5607 key.mv_size = srcnode->mn_ksize;
5608 key.mv_data = NODEKEY(srcnode);
5611 data.mv_size = NODEDSZ(srcnode);
5612 data.mv_data = NODEDATA(srcnode);
5613 rc = mdb_node_add(cdst, j, &key, &data, NODEPGNO(srcnode), srcnode->mn_flags);
5614 if (rc != MDB_SUCCESS)
5619 DPRINTF("dst page %zu now has %u keys (%.1f%% filled)",
5620 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);
5622 /* Unlink the src page from parent and add to free list.
5624 mdb_node_del(csrc->mc_pg[csrc->mc_top-1], csrc->mc_ki[csrc->mc_top-1], 0);
5625 if (csrc->mc_ki[csrc->mc_top-1] == 0) {
5627 if ((rc = mdb_update_key(csrc->mc_pg[csrc->mc_top-1], 0, &key)) != MDB_SUCCESS)
5631 mdb_midl_append(&csrc->mc_txn->mt_free_pgs, csrc->mc_pg[csrc->mc_top]->mp_pgno);
5632 if (IS_LEAF(csrc->mc_pg[csrc->mc_top]))
5633 csrc->mc_db->md_leaf_pages--;
5635 csrc->mc_db->md_branch_pages--;
5637 /* Adjust other cursors pointing to mp */
5638 MDB_cursor *m2, *m3;
5639 MDB_dbi dbi = csrc->mc_dbi;
5640 MDB_page *mp = cdst->mc_pg[cdst->mc_top];
5642 if (csrc->mc_flags & C_SUB)
5645 for (m2 = csrc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
5646 if (csrc->mc_flags & C_SUB)
5647 m3 = &m2->mc_xcursor->mx_cursor;
5650 if (m3 == csrc) continue;
5651 if (m3->mc_snum < csrc->mc_snum) continue;
5652 if (m3->mc_pg[csrc->mc_top] == csrc->mc_pg[csrc->mc_top]) {
5653 m3->mc_pg[csrc->mc_top] = mp;
5654 m3->mc_ki[csrc->mc_top] += nkeys;
5658 mdb_cursor_pop(csrc);
5660 return mdb_rebalance(csrc);
5663 /** Copy the contents of a cursor.
5664 * @param[in] csrc The cursor to copy from.
5665 * @param[out] cdst The cursor to copy to.
5668 mdb_cursor_copy(const MDB_cursor *csrc, MDB_cursor *cdst)
5672 cdst->mc_txn = csrc->mc_txn;
5673 cdst->mc_dbi = csrc->mc_dbi;
5674 cdst->mc_db = csrc->mc_db;
5675 cdst->mc_dbx = csrc->mc_dbx;
5676 cdst->mc_snum = csrc->mc_snum;
5677 cdst->mc_top = csrc->mc_top;
5678 cdst->mc_flags = csrc->mc_flags;
5680 for (i=0; i<csrc->mc_snum; i++) {
5681 cdst->mc_pg[i] = csrc->mc_pg[i];
5682 cdst->mc_ki[i] = csrc->mc_ki[i];
5686 /** Rebalance the tree after a delete operation.
5687 * @param[in] mc Cursor pointing to the page where rebalancing
5689 * @return 0 on success, non-zero on failure.
5692 mdb_rebalance(MDB_cursor *mc)
5702 COPY_PGNO(pgno, mc->mc_pg[mc->mc_top]->mp_pgno);
5703 DPRINTF("rebalancing %s page %zu (has %u keys, %.1f%% full)",
5704 IS_LEAF(mc->mc_pg[mc->mc_top]) ? "leaf" : "branch",
5705 pgno, NUMKEYS(mc->mc_pg[mc->mc_top]), (float)PAGEFILL(mc->mc_txn->mt_env, mc->mc_pg[mc->mc_top]) / 10);
5709 if (PAGEFILL(mc->mc_txn->mt_env, mc->mc_pg[mc->mc_top]) >= FILL_THRESHOLD) {
5712 COPY_PGNO(pgno, mc->mc_pg[mc->mc_top]->mp_pgno);
5713 DPRINTF("no need to rebalance page %zu, above fill threshold",
5719 if (mc->mc_snum < 2) {
5720 MDB_page *mp = mc->mc_pg[0];
5721 if (NUMKEYS(mp) == 0) {
5722 DPUTS("tree is completely empty");
5723 mc->mc_db->md_root = P_INVALID;
5724 mc->mc_db->md_depth = 0;
5725 mc->mc_db->md_leaf_pages = 0;
5726 mdb_midl_append(&mc->mc_txn->mt_free_pgs, mp->mp_pgno);
5730 /* Adjust other cursors pointing to mp */
5731 MDB_cursor *m2, *m3;
5732 MDB_dbi dbi = mc->mc_dbi;
5734 if (mc->mc_flags & C_SUB)
5737 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
5738 if (m2 == mc) continue;
5739 if (mc->mc_flags & C_SUB)
5740 m3 = &m2->mc_xcursor->mx_cursor;
5743 if (m3->mc_snum < mc->mc_snum) continue;
5744 if (m3->mc_pg[0] == mp) {
5750 } else if (IS_BRANCH(mp) && NUMKEYS(mp) == 1) {
5751 DPUTS("collapsing root page!");
5752 mdb_midl_append(&mc->mc_txn->mt_free_pgs, mp->mp_pgno);
5753 mc->mc_db->md_root = NODEPGNO(NODEPTR(mp, 0));
5754 if ((rc = mdb_page_get(mc->mc_txn, mc->mc_db->md_root,
5757 mc->mc_db->md_depth--;
5758 mc->mc_db->md_branch_pages--;
5760 /* Adjust other cursors pointing to mp */
5761 MDB_cursor *m2, *m3;
5762 MDB_dbi dbi = mc->mc_dbi;
5764 if (mc->mc_flags & C_SUB)
5767 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
5768 if (m2 == mc) continue;
5769 if (mc->mc_flags & C_SUB)
5770 m3 = &m2->mc_xcursor->mx_cursor;
5773 if (m3->mc_snum < mc->mc_snum) continue;
5774 if (m3->mc_pg[0] == mp) {
5775 m3->mc_pg[0] = mc->mc_pg[0];
5780 DPUTS("root page doesn't need rebalancing");
5784 /* The parent (branch page) must have at least 2 pointers,
5785 * otherwise the tree is invalid.
5787 ptop = mc->mc_top-1;
5788 assert(NUMKEYS(mc->mc_pg[ptop]) > 1);
5790 /* Leaf page fill factor is below the threshold.
5791 * Try to move keys from left or right neighbor, or
5792 * merge with a neighbor page.
5797 mdb_cursor_copy(mc, &mn);
5798 mn.mc_xcursor = NULL;
5800 if (mc->mc_ki[ptop] == 0) {
5801 /* We're the leftmost leaf in our parent.
5803 DPUTS("reading right neighbor");
5805 node = NODEPTR(mc->mc_pg[ptop], mn.mc_ki[ptop]);
5806 if ((rc = mdb_page_get(mc->mc_txn, NODEPGNO(node), &mn.mc_pg[mn.mc_top])))
5808 mn.mc_ki[mn.mc_top] = 0;
5809 mc->mc_ki[mc->mc_top] = NUMKEYS(mc->mc_pg[mc->mc_top]);
5811 /* There is at least one neighbor to the left.
5813 DPUTS("reading left neighbor");
5815 node = NODEPTR(mc->mc_pg[ptop], mn.mc_ki[ptop]);
5816 if ((rc = mdb_page_get(mc->mc_txn, NODEPGNO(node), &mn.mc_pg[mn.mc_top])))
5818 mn.mc_ki[mn.mc_top] = NUMKEYS(mn.mc_pg[mn.mc_top]) - 1;
5819 mc->mc_ki[mc->mc_top] = 0;
5822 DPRINTF("found neighbor page %zu (%u keys, %.1f%% full)",
5823 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);
5825 /* If the neighbor page is above threshold and has at least two
5826 * keys, move one key from it.
5828 * Otherwise we should try to merge them.
5830 if (PAGEFILL(mc->mc_txn->mt_env, mn.mc_pg[mn.mc_top]) >= FILL_THRESHOLD && NUMKEYS(mn.mc_pg[mn.mc_top]) >= 2)
5831 return mdb_node_move(&mn, mc);
5832 else { /* FIXME: if (has_enough_room()) */
5833 mc->mc_flags &= ~C_INITIALIZED;
5834 if (mc->mc_ki[ptop] == 0)
5835 return mdb_page_merge(&mn, mc);
5837 return mdb_page_merge(mc, &mn);
5841 /** Complete a delete operation started by #mdb_cursor_del(). */
5843 mdb_cursor_del0(MDB_cursor *mc, MDB_node *leaf)
5847 /* add overflow pages to free list */
5848 if (!IS_LEAF2(mc->mc_pg[mc->mc_top]) && F_ISSET(leaf->mn_flags, F_BIGDATA)) {
5852 memcpy(&pg, NODEDATA(leaf), sizeof(pg));
5853 ovpages = OVPAGES(NODEDSZ(leaf), mc->mc_txn->mt_env->me_psize);
5854 mc->mc_db->md_overflow_pages -= ovpages;
5855 for (i=0; i<ovpages; i++) {
5856 DPRINTF("freed ov page %zu", pg);
5857 mdb_midl_append(&mc->mc_txn->mt_free_pgs, pg);
5861 mdb_node_del(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], mc->mc_db->md_pad);
5862 mc->mc_db->md_entries--;
5863 rc = mdb_rebalance(mc);
5864 if (rc != MDB_SUCCESS)
5865 mc->mc_txn->mt_flags |= MDB_TXN_ERROR;
5871 mdb_del(MDB_txn *txn, MDB_dbi dbi,
5872 MDB_val *key, MDB_val *data)
5877 MDB_val rdata, *xdata;
5881 assert(key != NULL);
5883 DPRINTF("====> delete db %u key [%s]", dbi, DKEY(key));
5885 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs)
5888 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY)) {
5892 if (key->mv_size == 0 || key->mv_size > MAXKEYSIZE) {
5896 mdb_cursor_init(&mc, txn, dbi, &mx);
5907 rc = mdb_cursor_set(&mc, key, xdata, op, &exact);
5909 rc = mdb_cursor_del(&mc, data ? 0 : MDB_NODUPDATA);
5913 /** Split a page and insert a new node.
5914 * @param[in,out] mc Cursor pointing to the page and desired insertion index.
5915 * The cursor will be updated to point to the actual page and index where
5916 * the node got inserted after the split.
5917 * @param[in] newkey The key for the newly inserted node.
5918 * @param[in] newdata The data for the newly inserted node.
5919 * @param[in] newpgno The page number, if the new node is a branch node.
5920 * @param[in] nflags The #NODE_ADD_FLAGS for the new node.
5921 * @return 0 on success, non-zero on failure.
5924 mdb_page_split(MDB_cursor *mc, MDB_val *newkey, MDB_val *newdata, pgno_t newpgno,
5925 unsigned int nflags)
5928 int rc = MDB_SUCCESS, ins_new = 0, new_root = 0, newpos = 1, did_split = 0;
5931 unsigned int i, j, split_indx, nkeys, pmax;
5933 MDB_val sepkey, rkey, xdata, *rdata = &xdata;
5935 MDB_page *mp, *rp, *pp;
5940 mp = mc->mc_pg[mc->mc_top];
5941 newindx = mc->mc_ki[mc->mc_top];
5943 DPRINTF("-----> splitting %s page %zu and adding [%s] at index %i",
5944 IS_LEAF(mp) ? "leaf" : "branch", mp->mp_pgno,
5945 DKEY(newkey), mc->mc_ki[mc->mc_top]);
5947 /* Create a right sibling. */
5948 if ((rp = mdb_page_new(mc, mp->mp_flags, 1)) == NULL)
5950 DPRINTF("new right sibling: page %zu", rp->mp_pgno);
5952 if (mc->mc_snum < 2) {
5953 if ((pp = mdb_page_new(mc, P_BRANCH, 1)) == NULL)
5955 /* shift current top to make room for new parent */
5956 mc->mc_pg[1] = mc->mc_pg[0];
5957 mc->mc_ki[1] = mc->mc_ki[0];
5960 mc->mc_db->md_root = pp->mp_pgno;
5961 DPRINTF("root split! new root = %zu", pp->mp_pgno);
5962 mc->mc_db->md_depth++;
5965 /* Add left (implicit) pointer. */
5966 if ((rc = mdb_node_add(mc, 0, NULL, NULL, mp->mp_pgno, 0)) != MDB_SUCCESS) {
5967 /* undo the pre-push */
5968 mc->mc_pg[0] = mc->mc_pg[1];
5969 mc->mc_ki[0] = mc->mc_ki[1];
5970 mc->mc_db->md_root = mp->mp_pgno;
5971 mc->mc_db->md_depth--;
5978 ptop = mc->mc_top-1;
5979 DPRINTF("parent branch page is %zu", mc->mc_pg[ptop]->mp_pgno);
5982 mc->mc_flags |= C_SPLITTING;
5983 mdb_cursor_copy(mc, &mn);
5984 mn.mc_pg[mn.mc_top] = rp;
5985 mn.mc_ki[ptop] = mc->mc_ki[ptop]+1;
5987 if (nflags & MDB_APPEND) {
5988 mn.mc_ki[mn.mc_top] = 0;
5990 split_indx = newindx;
5995 nkeys = NUMKEYS(mp);
5996 split_indx = nkeys / 2;
5997 if (newindx < split_indx)
6003 unsigned int lsize, rsize, ksize;
6004 /* Move half of the keys to the right sibling */
6006 x = mc->mc_ki[mc->mc_top] - split_indx;
6007 ksize = mc->mc_db->md_pad;
6008 split = LEAF2KEY(mp, split_indx, ksize);
6009 rsize = (nkeys - split_indx) * ksize;
6010 lsize = (nkeys - split_indx) * sizeof(indx_t);
6011 mp->mp_lower -= lsize;
6012 rp->mp_lower += lsize;
6013 mp->mp_upper += rsize - lsize;
6014 rp->mp_upper -= rsize - lsize;
6015 sepkey.mv_size = ksize;
6016 if (newindx == split_indx) {
6017 sepkey.mv_data = newkey->mv_data;
6019 sepkey.mv_data = split;
6022 ins = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], ksize);
6023 memcpy(rp->mp_ptrs, split, rsize);
6024 sepkey.mv_data = rp->mp_ptrs;
6025 memmove(ins+ksize, ins, (split_indx - mc->mc_ki[mc->mc_top]) * ksize);
6026 memcpy(ins, newkey->mv_data, ksize);
6027 mp->mp_lower += sizeof(indx_t);
6028 mp->mp_upper -= ksize - sizeof(indx_t);
6031 memcpy(rp->mp_ptrs, split, x * ksize);
6032 ins = LEAF2KEY(rp, x, ksize);
6033 memcpy(ins, newkey->mv_data, ksize);
6034 memcpy(ins+ksize, split + x * ksize, rsize - x * ksize);
6035 rp->mp_lower += sizeof(indx_t);
6036 rp->mp_upper -= ksize - sizeof(indx_t);
6037 mc->mc_ki[mc->mc_top] = x;
6038 mc->mc_pg[mc->mc_top] = rp;
6043 /* For leaf pages, check the split point based on what
6044 * fits where, since otherwise mdb_node_add can fail.
6046 * This check is only needed when the data items are
6047 * relatively large, such that being off by one will
6048 * make the difference between success or failure.
6049 * When the size of the data items is much smaller than
6050 * one-half of a page, this check is irrelevant.
6053 unsigned int psize, nsize;
6054 /* Maximum free space in an empty page */
6055 pmax = mc->mc_txn->mt_env->me_psize - PAGEHDRSZ;
6056 nsize = mdb_leaf_size(mc->mc_txn->mt_env, newkey, newdata);
6057 if ((nkeys < 20) || (nsize > pmax/4)) {
6058 if (newindx <= split_indx) {
6061 for (i=0; i<split_indx; i++) {
6062 node = NODEPTR(mp, i);
6063 psize += NODESIZE + NODEKSZ(node) + sizeof(indx_t);
6064 if (F_ISSET(node->mn_flags, F_BIGDATA))
6065 psize += sizeof(pgno_t);
6067 psize += NODEDSZ(node);
6071 split_indx = newindx;
6082 for (i=nkeys-1; i>=split_indx; i--) {
6083 node = NODEPTR(mp, i);
6084 psize += NODESIZE + NODEKSZ(node) + sizeof(indx_t);
6085 if (F_ISSET(node->mn_flags, F_BIGDATA))
6086 psize += sizeof(pgno_t);
6088 psize += NODEDSZ(node);
6092 split_indx = newindx;
6102 /* First find the separating key between the split pages.
6103 * The case where newindx == split_indx is ambiguous; the
6104 * new item could go to the new page or stay on the original
6105 * page. If newpos == 1 it goes to the new page.
6107 if (newindx == split_indx && newpos) {
6108 sepkey.mv_size = newkey->mv_size;
6109 sepkey.mv_data = newkey->mv_data;
6111 node = NODEPTR(mp, split_indx);
6112 sepkey.mv_size = node->mn_ksize;
6113 sepkey.mv_data = NODEKEY(node);
6117 DPRINTF("separator is [%s]", DKEY(&sepkey));
6119 /* Copy separator key to the parent.
6121 if (SIZELEFT(mn.mc_pg[ptop]) < mdb_branch_size(mc->mc_txn->mt_env, &sepkey)) {
6125 rc = mdb_page_split(&mn, &sepkey, NULL, rp->mp_pgno, 0);
6128 if (mn.mc_snum == mc->mc_snum) {
6129 mc->mc_pg[mc->mc_snum] = mc->mc_pg[mc->mc_top];
6130 mc->mc_ki[mc->mc_snum] = mc->mc_ki[mc->mc_top];
6131 mc->mc_pg[mc->mc_top] = mc->mc_pg[ptop];
6132 mc->mc_ki[mc->mc_top] = mc->mc_ki[ptop];
6137 /* Right page might now have changed parent.
6138 * Check if left page also changed parent.
6140 if (mn.mc_pg[ptop] != mc->mc_pg[ptop] &&
6141 mc->mc_ki[ptop] >= NUMKEYS(mc->mc_pg[ptop])) {
6142 for (i=0; i<ptop; i++) {
6143 mc->mc_pg[i] = mn.mc_pg[i];
6144 mc->mc_ki[i] = mn.mc_ki[i];
6146 mc->mc_pg[ptop] = mn.mc_pg[ptop];
6147 mc->mc_ki[ptop] = mn.mc_ki[ptop] - 1;
6151 rc = mdb_node_add(&mn, mn.mc_ki[ptop], &sepkey, NULL, rp->mp_pgno, 0);
6154 mc->mc_flags ^= C_SPLITTING;
6155 if (rc != MDB_SUCCESS) {
6158 if (nflags & MDB_APPEND) {
6159 mc->mc_pg[mc->mc_top] = rp;
6160 mc->mc_ki[mc->mc_top] = 0;
6161 rc = mdb_node_add(mc, 0, newkey, newdata, newpgno, nflags);
6164 for (i=0; i<mc->mc_top; i++)
6165 mc->mc_ki[i] = mn.mc_ki[i];
6172 /* Move half of the keys to the right sibling. */
6174 /* grab a page to hold a temporary copy */
6175 copy = mdb_page_malloc(mc);
6179 copy->mp_pgno = mp->mp_pgno;
6180 copy->mp_flags = mp->mp_flags;
6181 copy->mp_lower = PAGEHDRSZ;
6182 copy->mp_upper = mc->mc_txn->mt_env->me_psize;
6183 mc->mc_pg[mc->mc_top] = copy;
6184 for (i = j = 0; i <= nkeys; j++) {
6185 if (i == split_indx) {
6186 /* Insert in right sibling. */
6187 /* Reset insert index for right sibling. */
6188 if (i != newindx || (newpos ^ ins_new)) {
6190 mc->mc_pg[mc->mc_top] = rp;
6194 if (i == newindx && !ins_new) {
6195 /* Insert the original entry that caused the split. */
6196 rkey.mv_data = newkey->mv_data;
6197 rkey.mv_size = newkey->mv_size;
6206 /* Update index for the new key. */
6207 mc->mc_ki[mc->mc_top] = j;
6208 } else if (i == nkeys) {
6211 node = NODEPTR(mp, i);
6212 rkey.mv_data = NODEKEY(node);
6213 rkey.mv_size = node->mn_ksize;
6215 xdata.mv_data = NODEDATA(node);
6216 xdata.mv_size = NODEDSZ(node);
6219 pgno = NODEPGNO(node);
6220 flags = node->mn_flags;
6225 if (!IS_LEAF(mp) && j == 0) {
6226 /* First branch index doesn't need key data. */
6230 rc = mdb_node_add(mc, j, &rkey, rdata, pgno, flags);
6234 nkeys = NUMKEYS(copy);
6235 for (i=0; i<nkeys; i++)
6236 mp->mp_ptrs[i] = copy->mp_ptrs[i];
6237 mp->mp_lower = copy->mp_lower;
6238 mp->mp_upper = copy->mp_upper;
6239 memcpy(NODEPTR(mp, nkeys-1), NODEPTR(copy, nkeys-1),
6240 mc->mc_txn->mt_env->me_psize - copy->mp_upper);
6242 /* reset back to original page */
6243 if (newindx < split_indx || (!newpos && newindx == split_indx)) {
6244 mc->mc_pg[mc->mc_top] = mp;
6245 if (nflags & MDB_RESERVE) {
6246 node = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
6247 if (!(node->mn_flags & F_BIGDATA))
6248 newdata->mv_data = NODEDATA(node);
6254 /* return tmp page to freelist */
6255 copy->mp_next = mc->mc_txn->mt_env->me_dpages;
6256 VGMEMP_FREE(mc->mc_txn->mt_env, copy);
6257 mc->mc_txn->mt_env->me_dpages = copy;
6260 /* Adjust other cursors pointing to mp */
6261 MDB_cursor *m2, *m3;
6262 MDB_dbi dbi = mc->mc_dbi;
6263 int fixup = NUMKEYS(mp);
6265 if (mc->mc_flags & C_SUB)
6268 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
6269 if (m2 == mc) continue;
6270 if (mc->mc_flags & C_SUB)
6271 m3 = &m2->mc_xcursor->mx_cursor;
6274 if (!(m3->mc_flags & C_INITIALIZED))
6276 if (m3->mc_flags & C_SPLITTING)
6281 for (k=m3->mc_top; k>=0; k--) {
6282 m3->mc_ki[k+1] = m3->mc_ki[k];
6283 m3->mc_pg[k+1] = m3->mc_pg[k];
6285 if (m3->mc_ki[0] >= split_indx) {
6290 m3->mc_pg[0] = mc->mc_pg[0];
6294 if (m3->mc_pg[mc->mc_top] == mp) {
6295 if (m3->mc_ki[mc->mc_top] >= newindx && !(nflags & MDB_SPLIT_REPLACE))
6296 m3->mc_ki[mc->mc_top]++;
6297 if (m3->mc_ki[mc->mc_top] >= fixup) {
6298 m3->mc_pg[mc->mc_top] = rp;
6299 m3->mc_ki[mc->mc_top] -= fixup;
6300 m3->mc_ki[ptop] = mn.mc_ki[ptop];
6302 } else if (!did_split && m3->mc_pg[ptop] == mc->mc_pg[ptop] &&
6303 m3->mc_ki[ptop] >= mc->mc_ki[ptop]) {
6312 mdb_put(MDB_txn *txn, MDB_dbi dbi,
6313 MDB_val *key, MDB_val *data, unsigned int flags)
6318 assert(key != NULL);
6319 assert(data != NULL);
6321 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs)
6324 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY)) {
6328 if (key->mv_size == 0 || key->mv_size > MAXKEYSIZE) {
6332 if ((flags & (MDB_NOOVERWRITE|MDB_NODUPDATA|MDB_RESERVE|MDB_APPEND)) != flags)
6335 mdb_cursor_init(&mc, txn, dbi, &mx);
6336 return mdb_cursor_put(&mc, key, data, flags);
6339 /** Only a subset of the @ref mdb_env flags can be changed
6340 * at runtime. Changing other flags requires closing the environment
6341 * and re-opening it with the new flags.
6343 #define CHANGEABLE (MDB_NOSYNC|MDB_NOMETASYNC)
6345 mdb_env_set_flags(MDB_env *env, unsigned int flag, int onoff)
6347 if ((flag & CHANGEABLE) != flag)
6350 env->me_flags |= flag;
6352 env->me_flags &= ~flag;
6357 mdb_env_get_flags(MDB_env *env, unsigned int *arg)
6362 *arg = env->me_flags;
6367 mdb_env_get_path(MDB_env *env, const char **arg)
6372 *arg = env->me_path;
6376 /** Common code for #mdb_stat() and #mdb_env_stat().
6377 * @param[in] env the environment to operate in.
6378 * @param[in] db the #MDB_db record containing the stats to return.
6379 * @param[out] arg the address of an #MDB_stat structure to receive the stats.
6380 * @return 0, this function always succeeds.
6383 mdb_stat0(MDB_env *env, MDB_db *db, MDB_stat *arg)
6385 arg->ms_psize = env->me_psize;
6386 arg->ms_depth = db->md_depth;
6387 arg->ms_branch_pages = db->md_branch_pages;
6388 arg->ms_leaf_pages = db->md_leaf_pages;
6389 arg->ms_overflow_pages = db->md_overflow_pages;
6390 arg->ms_entries = db->md_entries;
6395 mdb_env_stat(MDB_env *env, MDB_stat *arg)
6399 if (env == NULL || arg == NULL)
6402 toggle = mdb_env_pick_meta(env);
6404 return mdb_stat0(env, &env->me_metas[toggle]->mm_dbs[MAIN_DBI], arg);
6407 /** Set the default comparison functions for a database.
6408 * Called immediately after a database is opened to set the defaults.
6409 * The user can then override them with #mdb_set_compare() or
6410 * #mdb_set_dupsort().
6411 * @param[in] txn A transaction handle returned by #mdb_txn_begin()
6412 * @param[in] dbi A database handle returned by #mdb_open()
6415 mdb_default_cmp(MDB_txn *txn, MDB_dbi dbi)
6417 uint16_t f = txn->mt_dbs[dbi].md_flags;
6419 txn->mt_dbxs[dbi].md_cmp =
6420 (f & MDB_REVERSEKEY) ? mdb_cmp_memnr :
6421 (f & MDB_INTEGERKEY) ? mdb_cmp_cint : mdb_cmp_memn;
6423 txn->mt_dbxs[dbi].md_dcmp =
6424 !(f & MDB_DUPSORT) ? 0 :
6425 ((f & MDB_INTEGERDUP)
6426 ? ((f & MDB_DUPFIXED) ? mdb_cmp_int : mdb_cmp_cint)
6427 : ((f & MDB_REVERSEDUP) ? mdb_cmp_memnr : mdb_cmp_memn));
6430 int mdb_open(MDB_txn *txn, const char *name, unsigned int flags, MDB_dbi *dbi)
6435 int rc, dbflag, exact;
6436 unsigned int unused = 0;
6439 if (txn->mt_dbxs[FREE_DBI].md_cmp == NULL) {
6440 mdb_default_cmp(txn, FREE_DBI);
6446 if (flags & (MDB_DUPSORT|MDB_REVERSEKEY|MDB_INTEGERKEY))
6447 txn->mt_dbs[MAIN_DBI].md_flags |= (flags & (MDB_DUPSORT|MDB_REVERSEKEY|MDB_INTEGERKEY));
6448 mdb_default_cmp(txn, MAIN_DBI);
6452 if (txn->mt_dbxs[MAIN_DBI].md_cmp == NULL) {
6453 mdb_default_cmp(txn, MAIN_DBI);
6456 /* Is the DB already open? */
6458 for (i=2; i<txn->mt_numdbs; i++) {
6459 if (!txn->mt_dbxs[i].md_name.mv_size) {
6460 /* Remember this free slot */
6461 if (!unused) unused = i;
6464 if (len == txn->mt_dbxs[i].md_name.mv_size &&
6465 !strncmp(name, txn->mt_dbxs[i].md_name.mv_data, len)) {
6471 /* If no free slot and max hit, fail */
6472 if (!unused && txn->mt_numdbs >= txn->mt_env->me_maxdbs - 1)
6475 /* Find the DB info */
6479 key.mv_data = (void *)name;
6480 mdb_cursor_init(&mc, txn, MAIN_DBI, NULL);
6481 rc = mdb_cursor_set(&mc, &key, &data, MDB_SET, &exact);
6482 if (rc == MDB_SUCCESS) {
6483 /* make sure this is actually a DB */
6484 MDB_node *node = NODEPTR(mc.mc_pg[mc.mc_top], mc.mc_ki[mc.mc_top]);
6485 if (!(node->mn_flags & F_SUBDATA))
6487 } else if (rc == MDB_NOTFOUND && (flags & MDB_CREATE)) {
6488 /* Create if requested */
6490 data.mv_size = sizeof(MDB_db);
6491 data.mv_data = &dummy;
6492 memset(&dummy, 0, sizeof(dummy));
6493 dummy.md_root = P_INVALID;
6494 dummy.md_flags = flags & 0xffff;
6495 rc = mdb_cursor_put(&mc, &key, &data, F_SUBDATA);
6499 /* OK, got info, add to table */
6500 if (rc == MDB_SUCCESS) {
6501 unsigned int slot = unused ? unused : txn->mt_numdbs;
6502 txn->mt_dbxs[slot].md_name.mv_data = strdup(name);
6503 txn->mt_dbxs[slot].md_name.mv_size = len;
6504 txn->mt_dbxs[slot].md_rel = NULL;
6505 txn->mt_dbflags[slot] = dbflag;
6506 memcpy(&txn->mt_dbs[slot], data.mv_data, sizeof(MDB_db));
6508 txn->mt_env->me_dbflags[slot] = txn->mt_dbs[slot].md_flags;
6509 mdb_default_cmp(txn, slot);
6512 txn->mt_env->me_numdbs++;
6519 int mdb_stat(MDB_txn *txn, MDB_dbi dbi, MDB_stat *arg)
6521 if (txn == NULL || arg == NULL || dbi >= txn->mt_numdbs)
6524 return mdb_stat0(txn->mt_env, &txn->mt_dbs[dbi], arg);
6527 void mdb_close(MDB_env *env, MDB_dbi dbi)
6530 if (dbi <= MAIN_DBI || dbi >= env->me_numdbs)
6532 ptr = env->me_dbxs[dbi].md_name.mv_data;
6533 env->me_dbxs[dbi].md_name.mv_data = NULL;
6534 env->me_dbxs[dbi].md_name.mv_size = 0;
6538 /** Add all the DB's pages to the free list.
6539 * @param[in] mc Cursor on the DB to free.
6540 * @param[in] subs non-Zero to check for sub-DBs in this DB.
6541 * @return 0 on success, non-zero on failure.
6544 mdb_drop0(MDB_cursor *mc, int subs)
6548 rc = mdb_page_search(mc, NULL, 0);
6549 if (rc == MDB_SUCCESS) {
6554 /* LEAF2 pages have no nodes, cannot have sub-DBs */
6555 if (!subs || IS_LEAF2(mc->mc_pg[mc->mc_top]))
6558 mdb_cursor_copy(mc, &mx);
6559 while (mc->mc_snum > 0) {
6560 if (IS_LEAF(mc->mc_pg[mc->mc_top])) {
6561 for (i=0; i<NUMKEYS(mc->mc_pg[mc->mc_top]); i++) {
6562 ni = NODEPTR(mc->mc_pg[mc->mc_top], i);
6563 if (ni->mn_flags & F_SUBDATA) {
6564 mdb_xcursor_init1(mc, ni);
6565 rc = mdb_drop0(&mc->mc_xcursor->mx_cursor, 0);
6571 for (i=0; i<NUMKEYS(mc->mc_pg[mc->mc_top]); i++) {
6573 ni = NODEPTR(mc->mc_pg[mc->mc_top], i);
6576 mdb_midl_append(&mc->mc_txn->mt_free_pgs, pg);
6581 rc = mdb_cursor_sibling(mc, 1);
6583 /* no more siblings, go back to beginning
6584 * of previous level. (stack was already popped
6585 * by mdb_cursor_sibling)
6587 for (i=1; i<mc->mc_top; i++)
6588 mc->mc_pg[i] = mx.mc_pg[i];
6592 mdb_midl_append(&mc->mc_txn->mt_free_pgs,
6593 mc->mc_db->md_root);
6598 int mdb_drop(MDB_txn *txn, MDB_dbi dbi, int del)
6603 if (!txn || !dbi || dbi >= txn->mt_numdbs)
6606 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY))
6609 rc = mdb_cursor_open(txn, dbi, &mc);
6613 rc = mdb_drop0(mc, mc->mc_db->md_flags & MDB_DUPSORT);
6617 /* Can't delete the main DB */
6618 if (del && dbi > MAIN_DBI) {
6619 rc = mdb_del(txn, MAIN_DBI, &mc->mc_dbx->md_name, NULL);
6621 mdb_close(txn->mt_env, dbi);
6623 txn->mt_dbflags[dbi] |= DB_DIRTY;
6624 txn->mt_dbs[dbi].md_depth = 0;
6625 txn->mt_dbs[dbi].md_branch_pages = 0;
6626 txn->mt_dbs[dbi].md_leaf_pages = 0;
6627 txn->mt_dbs[dbi].md_overflow_pages = 0;
6628 txn->mt_dbs[dbi].md_entries = 0;
6629 txn->mt_dbs[dbi].md_root = P_INVALID;
6632 mdb_cursor_close(mc);
6636 int mdb_set_compare(MDB_txn *txn, MDB_dbi dbi, MDB_cmp_func *cmp)
6638 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs)
6641 txn->mt_dbxs[dbi].md_cmp = cmp;
6645 int mdb_set_dupsort(MDB_txn *txn, MDB_dbi dbi, MDB_cmp_func *cmp)
6647 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs)
6650 txn->mt_dbxs[dbi].md_dcmp = cmp;
6654 int mdb_set_relfunc(MDB_txn *txn, MDB_dbi dbi, MDB_rel_func *rel)
6656 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs)
6659 txn->mt_dbxs[dbi].md_rel = rel;
6663 int mdb_set_relctx(MDB_txn *txn, MDB_dbi dbi, void *ctx)
6665 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs)
6668 txn->mt_dbxs[dbi].md_relctx = ctx;
projects / openldap / blob