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 int mdb_page_alloc(MDB_cursor *mc, int num, MDB_page **mp);
947 static int mdb_page_new(MDB_cursor *mc, uint32_t flags, int num, MDB_page **mp);
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",
1027 "MDB_INVALID: File is not an MDB file"
1028 "MDB_MAP_FULL: Environment mapsize limit reached",
1029 "MDB_DBS_FULL: Environment maxdbs limit reached",
1030 "MDB_READERS_FULL: Environment maxreaders limit reached",
1031 "MDB_TLS_FULL: Thread-local storage keys full - too many environments open",
1032 "MDB_TXN_FULL: Nested transaction has too many dirty pages - transaction too big",
1033 "MDB_CURSOR_FULL: Internal error - cursor stack limit reached",
1034 "MDB_PAGE_FULL: Internal error - page has no more space",
1038 mdb_strerror(int err)
1041 return ("Successful return: 0");
1043 if (err >= MDB_KEYEXIST && err <= MDB_VERSION_MISMATCH)
1044 return mdb_errstr[err - MDB_KEYEXIST];
1046 return strerror(err);
1050 /** Display a key in hexadecimal and return the address of the result.
1051 * @param[in] key the key to display
1052 * @param[in] buf the buffer to write into. Should always be #DKBUF.
1053 * @return The key in hexadecimal form.
1056 mdb_dkey(MDB_val *key, char *buf)
1059 unsigned char *c = key->mv_data;
1061 if (key->mv_size > MAXKEYSIZE)
1062 return "MAXKEYSIZE";
1063 /* may want to make this a dynamic check: if the key is mostly
1064 * printable characters, print it as-is instead of converting to hex.
1068 for (i=0; i<key->mv_size; i++)
1069 ptr += sprintf(ptr, "%02x", *c++);
1071 sprintf(buf, "%.*s", key->mv_size, key->mv_data);
1076 /** Display all the keys in the page. */
1078 mdb_page_list(MDB_page *mp)
1081 unsigned int i, nkeys, nsize;
1085 nkeys = NUMKEYS(mp);
1086 fprintf(stderr, "numkeys %d\n", nkeys);
1087 for (i=0; i<nkeys; i++) {
1088 node = NODEPTR(mp, i);
1089 key.mv_size = node->mn_ksize;
1090 key.mv_data = node->mn_data;
1091 nsize = NODESIZE + NODEKSZ(node) + sizeof(indx_t);
1092 if (F_ISSET(node->mn_flags, F_BIGDATA))
1093 nsize += sizeof(pgno_t);
1095 nsize += NODEDSZ(node);
1096 fprintf(stderr, "key %d: nsize %d, %s\n", i, nsize, DKEY(&key));
1101 mdb_cursor_chk(MDB_cursor *mc)
1107 if (!mc->mc_snum && !(mc->mc_flags & C_INITIALIZED)) return;
1108 for (i=0; i<mc->mc_top; i++) {
1110 node = NODEPTR(mp, mc->mc_ki[i]);
1111 if (NODEPGNO(node) != mc->mc_pg[i+1]->mp_pgno)
1114 if (mc->mc_ki[i] >= NUMKEYS(mc->mc_pg[i]))
1120 /** Count all the pages in each DB and in the freelist
1121 * and make sure it matches the actual number of pages
1124 static void mdb_audit(MDB_txn *txn)
1128 MDB_ID freecount, count;
1133 mdb_cursor_init(&mc, txn, FREE_DBI, NULL);
1134 while ((rc = mdb_cursor_get(&mc, &key, &data, MDB_NEXT)) == 0)
1135 freecount += *(MDB_ID *)data.mv_data;
1138 for (i = 0; i<txn->mt_numdbs; i++) {
1139 MDB_xcursor mx, *mxp;
1140 mxp = (txn->mt_dbs[i].md_flags & MDB_DUPSORT) ? &mx : NULL;
1141 mdb_cursor_init(&mc, txn, i, mxp);
1142 if (txn->mt_dbs[i].md_root == P_INVALID)
1144 count += txn->mt_dbs[i].md_branch_pages +
1145 txn->mt_dbs[i].md_leaf_pages +
1146 txn->mt_dbs[i].md_overflow_pages;
1147 if (txn->mt_dbs[i].md_flags & MDB_DUPSORT) {
1148 mdb_page_search(&mc, NULL, 0);
1152 mp = mc.mc_pg[mc.mc_top];
1153 for (j=0; j<NUMKEYS(mp); j++) {
1154 MDB_node *leaf = NODEPTR(mp, j);
1155 if (leaf->mn_flags & F_SUBDATA) {
1157 memcpy(&db, NODEDATA(leaf), sizeof(db));
1158 count += db.md_branch_pages + db.md_leaf_pages +
1159 db.md_overflow_pages;
1163 while (mdb_cursor_sibling(&mc, 1) == 0);
1166 if (freecount + count + 2 /* metapages */ != txn->mt_next_pgno) {
1167 fprintf(stderr, "audit: %lu freecount: %lu count: %lu total: %lu next_pgno: %lu\n",
1168 txn->mt_txnid, freecount, count+2, freecount+count+2, txn->mt_next_pgno);
1174 mdb_cmp(MDB_txn *txn, MDB_dbi dbi, const MDB_val *a, const MDB_val *b)
1176 return txn->mt_dbxs[dbi].md_cmp(a, b);
1180 mdb_dcmp(MDB_txn *txn, MDB_dbi dbi, const MDB_val *a, const MDB_val *b)
1182 if (txn->mt_dbxs[dbi].md_dcmp)
1183 return txn->mt_dbxs[dbi].md_dcmp(a, b);
1185 return EINVAL; /* too bad you can't distinguish this from a valid result */
1188 /** Allocate a single page.
1189 * Re-use old malloc'd pages first, otherwise just malloc.
1192 mdb_page_malloc(MDB_cursor *mc) {
1194 size_t sz = mc->mc_txn->mt_env->me_psize;
1195 if ((ret = mc->mc_txn->mt_env->me_dpages) != NULL) {
1196 VGMEMP_ALLOC(mc->mc_txn->mt_env, ret, sz);
1197 VGMEMP_DEFINED(ret, sizeof(ret->mp_next));
1198 mc->mc_txn->mt_env->me_dpages = ret->mp_next;
1199 } else if ((ret = malloc(sz)) != NULL) {
1200 VGMEMP_ALLOC(mc->mc_txn->mt_env, ret, sz);
1205 /** Allocate pages for writing.
1206 * If there are free pages available from older transactions, they
1207 * will be re-used first. Otherwise a new page will be allocated.
1208 * @param[in] mc cursor A cursor handle identifying the transaction and
1209 * database for which we are allocating.
1210 * @param[in] num the number of pages to allocate.
1211 * @param[out] mp Address of the allocated page(s). Requests for multiple pages
1212 * will always be satisfied by a single contiguous chunk of memory.
1213 * @return 0 on success, non-zero on failure.
1216 mdb_page_alloc(MDB_cursor *mc, int num, MDB_page **mp)
1218 MDB_txn *txn = mc->mc_txn;
1220 pgno_t pgno = P_INVALID;
1225 /* The free list won't have any content at all until txn 2 has
1226 * committed. The pages freed by txn 2 will be unreferenced
1227 * after txn 3 commits, and so will be safe to re-use in txn 4.
1229 if (txn->mt_txnid > 3) {
1231 if (!txn->mt_env->me_pghead &&
1232 txn->mt_dbs[FREE_DBI].md_root != P_INVALID) {
1233 /* See if there's anything in the free DB */
1237 txnid_t *kptr, oldest, last;
1239 mdb_cursor_init(&m2, txn, FREE_DBI, NULL);
1240 if (!txn->mt_env->me_pgfirst) {
1241 mdb_page_search(&m2, NULL, 0);
1242 leaf = NODEPTR(m2.mc_pg[m2.mc_top], 0);
1243 kptr = (txnid_t *)NODEKEY(leaf);
1250 last = txn->mt_env->me_pglast + 1;
1252 key.mv_data = &last;
1253 key.mv_size = sizeof(last);
1254 rc = mdb_cursor_set(&m2, &key, &data, MDB_SET, &exact);
1257 last = *(txnid_t *)key.mv_data;
1262 oldest = txn->mt_txnid - 1;
1263 for (i=0; i<txn->mt_env->me_txns->mti_numreaders; i++) {
1264 txnid_t mr = txn->mt_env->me_txns->mti_readers[i].mr_txnid;
1265 if (mr && mr < oldest)
1270 if (oldest > last) {
1271 /* It's usable, grab it.
1276 if (!txn->mt_env->me_pgfirst) {
1277 mdb_node_read(txn, leaf, &data);
1279 txn->mt_env->me_pglast = last;
1280 if (!txn->mt_env->me_pgfirst)
1281 txn->mt_env->me_pgfirst = last;
1282 idl = (MDB_ID *) data.mv_data;
1283 /* We might have a zero-length IDL due to freelist growth
1284 * during a prior commit
1286 if (!idl[0]) goto again;
1287 mop = malloc(sizeof(MDB_oldpages) + MDB_IDL_SIZEOF(idl) - sizeof(pgno_t));
1290 mop->mo_next = txn->mt_env->me_pghead;
1291 mop->mo_txnid = last;
1292 txn->mt_env->me_pghead = mop;
1293 memcpy(mop->mo_pages, idl, MDB_IDL_SIZEOF(idl));
1298 DPRINTF("IDL read txn %zu root %zu num %zu",
1299 mop->mo_txnid, txn->mt_dbs[FREE_DBI].md_root, idl[0]);
1300 for (i=0; i<idl[0]; i++) {
1301 DPRINTF("IDL %zu", idl[i+1]);
1308 if (txn->mt_env->me_pghead) {
1309 MDB_oldpages *mop = txn->mt_env->me_pghead;
1311 /* FIXME: For now, always use fresh pages. We
1312 * really ought to search the free list for a
1317 /* peel pages off tail, so we only have to truncate the list */
1318 pgno = MDB_IDL_LAST(mop->mo_pages);
1319 if (MDB_IDL_IS_RANGE(mop->mo_pages)) {
1321 if (mop->mo_pages[2] > mop->mo_pages[1])
1322 mop->mo_pages[0] = 0;
1326 if (MDB_IDL_IS_ZERO(mop->mo_pages)) {
1327 txn->mt_env->me_pghead = mop->mo_next;
1328 if (mc->mc_dbi == FREE_DBI) {
1329 mop->mo_next = txn->mt_env->me_pgfree;
1330 txn->mt_env->me_pgfree = mop;
1339 if (pgno == P_INVALID) {
1340 /* DB size is maxed out */
1341 if (txn->mt_next_pgno + num >= txn->mt_env->me_maxpg) {
1342 DPUTS("DB size maxed out");
1343 return MDB_MAP_FULL;
1346 if (txn->mt_env->me_flags & MDB_WRITEMAP) {
1347 if (pgno == P_INVALID) {
1348 pgno = txn->mt_next_pgno;
1349 txn->mt_next_pgno += num;
1351 np = (MDB_page *)(txn->mt_env->me_map + txn->mt_env->me_psize * pgno);
1354 if (txn->mt_env->me_dpages && num == 1) {
1355 np = txn->mt_env->me_dpages;
1356 VGMEMP_ALLOC(txn->mt_env, np, txn->mt_env->me_psize);
1357 VGMEMP_DEFINED(np, sizeof(np->mp_next));
1358 txn->mt_env->me_dpages = np->mp_next;
1360 size_t sz = txn->mt_env->me_psize * num;
1361 if ((np = malloc(sz)) == NULL)
1363 VGMEMP_ALLOC(txn->mt_env, np, sz);
1365 if (pgno == P_INVALID) {
1366 np->mp_pgno = txn->mt_next_pgno;
1367 txn->mt_next_pgno += num;
1372 mid.mid = np->mp_pgno;
1374 if (txn->mt_env->me_flags & MDB_WRITEMAP) {
1375 mdb_mid2l_append(txn->mt_u.dirty_list, &mid);
1377 mdb_mid2l_insert(txn->mt_u.dirty_list, &mid);
1384 /** Copy a page: avoid copying unused portions of the page.
1385 * @param[in] dst page to copy into
1386 * @param[in] src page to copy from
1389 mdb_page_copy(MDB_page *dst, MDB_page *src, unsigned int psize)
1391 dst->mp_flags = src->mp_flags | P_DIRTY;
1392 dst->mp_pages = src->mp_pages;
1394 if (IS_LEAF2(src)) {
1395 memcpy(dst->mp_ptrs, src->mp_ptrs, psize - PAGEHDRSZ - SIZELEFT(src));
1397 unsigned int i, nkeys = NUMKEYS(src);
1398 for (i=0; i<nkeys; i++)
1399 dst->mp_ptrs[i] = src->mp_ptrs[i];
1400 memcpy((char *)dst+src->mp_upper, (char *)src+src->mp_upper,
1401 psize - src->mp_upper);
1405 /** Touch a page: make it dirty and re-insert into tree with updated pgno.
1406 * @param[in] mc cursor pointing to the page to be touched
1407 * @return 0 on success, non-zero on failure.
1410 mdb_page_touch(MDB_cursor *mc)
1412 MDB_page *mp = mc->mc_pg[mc->mc_top];
1416 if (!F_ISSET(mp->mp_flags, P_DIRTY)) {
1418 if ((rc = mdb_page_alloc(mc, 1, &np)))
1420 DPRINTF("touched db %u page %zu -> %zu", mc->mc_dbi, mp->mp_pgno, np->mp_pgno);
1421 assert(mp->mp_pgno != np->mp_pgno);
1422 mdb_midl_append(&mc->mc_txn->mt_free_pgs, mp->mp_pgno);
1424 /* If page isn't full, just copy the used portion */
1425 mdb_page_copy(np, mp, mc->mc_txn->mt_env->me_psize);
1428 memcpy(np, mp, mc->mc_txn->mt_env->me_psize);
1430 np->mp_flags |= P_DIRTY;
1435 /* Adjust other cursors pointing to mp */
1436 if (mc->mc_flags & C_SUB) {
1437 MDB_cursor *m2, *m3;
1438 MDB_dbi dbi = mc->mc_dbi-1;
1440 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
1441 if (m2 == mc) continue;
1442 m3 = &m2->mc_xcursor->mx_cursor;
1443 if (m3->mc_snum < mc->mc_snum) continue;
1444 if (m3->mc_pg[mc->mc_top] == mc->mc_pg[mc->mc_top]) {
1445 m3->mc_pg[mc->mc_top] = mp;
1451 for (m2 = mc->mc_txn->mt_cursors[mc->mc_dbi]; m2; m2=m2->mc_next) {
1452 if (m2 == mc || m2->mc_snum < mc->mc_snum) continue;
1453 if (m2->mc_pg[mc->mc_top] == mc->mc_pg[mc->mc_top]) {
1454 m2->mc_pg[mc->mc_top] = mp;
1458 mc->mc_pg[mc->mc_top] = mp;
1459 /** If this page has a parent, update the parent to point to
1463 SETPGNO(NODEPTR(mc->mc_pg[mc->mc_top-1], mc->mc_ki[mc->mc_top-1]), mp->mp_pgno);
1465 mc->mc_db->md_root = mp->mp_pgno;
1466 } else if (mc->mc_txn->mt_parent) {
1469 /* If txn has a parent, make sure the page is in our
1472 if (mc->mc_txn->mt_u.dirty_list[0].mid) {
1473 unsigned x = mdb_mid2l_search(mc->mc_txn->mt_u.dirty_list, mp->mp_pgno);
1474 if (x <= mc->mc_txn->mt_u.dirty_list[0].mid &&
1475 mc->mc_txn->mt_u.dirty_list[x].mid == mp->mp_pgno) {
1476 if (mc->mc_txn->mt_u.dirty_list[x].mptr != mp) {
1477 mp = mc->mc_txn->mt_u.dirty_list[x].mptr;
1478 mc->mc_pg[mc->mc_top] = mp;
1484 np = mdb_page_malloc(mc);
1487 memcpy(np, mp, mc->mc_txn->mt_env->me_psize);
1488 mid.mid = np->mp_pgno;
1490 mdb_mid2l_insert(mc->mc_txn->mt_u.dirty_list, &mid);
1498 mdb_env_sync(MDB_env *env, int force)
1501 if (force || !F_ISSET(env->me_flags, MDB_NOSYNC)) {
1502 if (env->me_flags & MDB_WRITEMAP) {
1503 int flags = (env->me_flags & MDB_MAPASYNC) ? MS_ASYNC : MS_SYNC;
1504 if (MDB_MSYNC(env->me_map, env->me_mapsize, flags))
1507 else if (flags == MS_SYNC && MDB_FDATASYNC(env->me_fd))
1511 if (MDB_FDATASYNC(env->me_fd))
1518 /** Make shadow copies of all of parent txn's cursors */
1520 mdb_cursor_shadow(MDB_txn *src, MDB_txn *dst)
1522 MDB_cursor *mc, *m2;
1523 unsigned int i, j, size;
1525 for (i=0;i<src->mt_numdbs; i++) {
1526 if (src->mt_cursors[i]) {
1527 size = sizeof(MDB_cursor);
1528 if (src->mt_cursors[i]->mc_xcursor)
1529 size += sizeof(MDB_xcursor);
1530 for (m2 = src->mt_cursors[i]; m2; m2=m2->mc_next) {
1537 mc->mc_db = &dst->mt_dbs[i];
1538 mc->mc_dbx = m2->mc_dbx;
1539 mc->mc_dbflag = &dst->mt_dbflags[i];
1540 mc->mc_snum = m2->mc_snum;
1541 mc->mc_top = m2->mc_top;
1542 mc->mc_flags = m2->mc_flags | C_SHADOW;
1543 for (j=0; j<mc->mc_snum; j++) {
1544 mc->mc_pg[j] = m2->mc_pg[j];
1545 mc->mc_ki[j] = m2->mc_ki[j];
1547 if (m2->mc_xcursor) {
1548 MDB_xcursor *mx, *mx2;
1549 mx = (MDB_xcursor *)(mc+1);
1550 mc->mc_xcursor = mx;
1551 mx2 = m2->mc_xcursor;
1552 mx->mx_db = mx2->mx_db;
1553 mx->mx_dbx = mx2->mx_dbx;
1554 mx->mx_dbflag = mx2->mx_dbflag;
1555 mx->mx_cursor.mc_txn = dst;
1556 mx->mx_cursor.mc_dbi = mx2->mx_cursor.mc_dbi;
1557 mx->mx_cursor.mc_db = &mx->mx_db;
1558 mx->mx_cursor.mc_dbx = &mx->mx_dbx;
1559 mx->mx_cursor.mc_dbflag = &mx->mx_dbflag;
1560 mx->mx_cursor.mc_snum = mx2->mx_cursor.mc_snum;
1561 mx->mx_cursor.mc_top = mx2->mx_cursor.mc_top;
1562 mx->mx_cursor.mc_flags = mx2->mx_cursor.mc_flags | C_SHADOW;
1563 for (j=0; j<mx2->mx_cursor.mc_snum; j++) {
1564 mx->mx_cursor.mc_pg[j] = mx2->mx_cursor.mc_pg[j];
1565 mx->mx_cursor.mc_ki[j] = mx2->mx_cursor.mc_ki[j];
1568 mc->mc_xcursor = NULL;
1570 mc->mc_next = dst->mt_cursors[i];
1571 dst->mt_cursors[i] = mc;
1578 /** Merge shadow cursors back into parent's */
1580 mdb_cursor_merge(MDB_txn *txn)
1583 for (i=0; i<txn->mt_numdbs; i++) {
1584 if (txn->mt_cursors[i]) {
1586 while ((mc = txn->mt_cursors[i])) {
1587 txn->mt_cursors[i] = mc->mc_next;
1588 if (mc->mc_flags & C_SHADOW) {
1589 MDB_cursor *m2 = mc->mc_orig;
1591 m2->mc_snum = mc->mc_snum;
1592 m2->mc_top = mc->mc_top;
1593 for (j=0; j<mc->mc_snum; j++) {
1594 m2->mc_pg[j] = mc->mc_pg[j];
1595 m2->mc_ki[j] = mc->mc_ki[j];
1598 if (mc->mc_flags & C_ALLOCD)
1606 mdb_txn_reset0(MDB_txn *txn);
1608 /** Common code for #mdb_txn_begin() and #mdb_txn_renew().
1609 * @param[in] txn the transaction handle to initialize
1610 * @return 0 on success, non-zero on failure. This can only
1611 * fail for read-only transactions, and then only if the
1612 * reader table is full.
1615 mdb_txn_renew0(MDB_txn *txn)
1617 MDB_env *env = txn->mt_env;
1621 txn->mt_numdbs = env->me_numdbs;
1622 txn->mt_dbxs = env->me_dbxs; /* mostly static anyway */
1624 if (txn->mt_flags & MDB_TXN_RDONLY) {
1625 MDB_reader *r = pthread_getspecific(env->me_txkey);
1627 pid_t pid = getpid();
1628 pthread_t tid = pthread_self();
1631 for (i=0; i<env->me_txns->mti_numreaders; i++)
1632 if (env->me_txns->mti_readers[i].mr_pid == 0)
1634 if (i == env->me_maxreaders) {
1635 UNLOCK_MUTEX_R(env);
1636 return MDB_READERS_FULL;
1638 env->me_txns->mti_readers[i].mr_pid = pid;
1639 env->me_txns->mti_readers[i].mr_tid = tid;
1640 if (i >= env->me_txns->mti_numreaders)
1641 env->me_txns->mti_numreaders = i+1;
1642 UNLOCK_MUTEX_R(env);
1643 r = &env->me_txns->mti_readers[i];
1644 pthread_setspecific(env->me_txkey, r);
1646 txn->mt_txnid = r->mr_txnid = env->me_txns->mti_txnid;
1647 txn->mt_toggle = txn->mt_txnid & 1;
1648 txn->mt_next_pgno = env->me_metas[txn->mt_toggle]->mm_last_pg+1;
1649 txn->mt_u.reader = r;
1653 txn->mt_txnid = env->me_txns->mti_txnid;
1654 txn->mt_toggle = txn->mt_txnid & 1;
1655 txn->mt_next_pgno = env->me_metas[txn->mt_toggle]->mm_last_pg+1;
1658 if (txn->mt_txnid == mdb_debug_start)
1661 txn->mt_u.dirty_list = env->me_dirty_list;
1662 txn->mt_u.dirty_list[0].mid = 0;
1663 txn->mt_free_pgs = env->me_free_pgs;
1664 txn->mt_free_pgs[0] = 0;
1668 /* Copy the DB info and flags */
1669 memcpy(txn->mt_dbs, env->me_metas[txn->mt_toggle]->mm_dbs, 2 * sizeof(MDB_db));
1670 for (i=2; i<txn->mt_numdbs; i++)
1671 txn->mt_dbs[i].md_flags = env->me_dbflags[i];
1672 txn->mt_dbflags[0] = txn->mt_dbflags[1] = 0;
1673 if (txn->mt_numdbs > 2)
1674 memset(txn->mt_dbflags+2, DB_STALE, txn->mt_numdbs-2);
1680 mdb_txn_renew(MDB_txn *txn)
1687 if (txn->mt_env->me_flags & MDB_FATAL_ERROR) {
1688 DPUTS("environment had fatal error, must shutdown!");
1692 rc = mdb_txn_renew0(txn);
1693 if (rc == MDB_SUCCESS) {
1694 DPRINTF("renew txn %zu%c %p on mdbenv %p, root page %zu",
1695 txn->mt_txnid, (txn->mt_flags & MDB_TXN_RDONLY) ? 'r' : 'w',
1696 (void *)txn, (void *)txn->mt_env, txn->mt_dbs[MAIN_DBI].md_root);
1702 mdb_txn_begin(MDB_env *env, MDB_txn *parent, unsigned int flags, MDB_txn **ret)
1707 if (env->me_flags & MDB_FATAL_ERROR) {
1708 DPUTS("environment had fatal error, must shutdown!");
1711 if ((env->me_flags & MDB_RDONLY) && !(flags & MDB_RDONLY))
1714 /* parent already has an active child txn */
1715 if (parent->mt_child) {
1718 /* nested TXNs not supported here */
1719 if (env->me_flags & MDB_WRITEMAP)
1722 size = sizeof(MDB_txn) + env->me_maxdbs * (sizeof(MDB_db)+1);
1723 if (!(flags & MDB_RDONLY))
1724 size += env->me_maxdbs * sizeof(MDB_cursor *);
1726 if ((txn = calloc(1, size)) == NULL) {
1727 DPRINTF("calloc: %s", strerror(ErrCode()));
1730 txn->mt_dbs = (MDB_db *)(txn+1);
1731 if (flags & MDB_RDONLY) {
1732 txn->mt_flags |= MDB_TXN_RDONLY;
1733 txn->mt_dbflags = (unsigned char *)(txn->mt_dbs + env->me_maxdbs);
1735 txn->mt_cursors = (MDB_cursor **)(txn->mt_dbs + env->me_maxdbs);
1736 txn->mt_dbflags = (unsigned char *)(txn->mt_cursors + env->me_maxdbs);
1741 txn->mt_free_pgs = mdb_midl_alloc();
1742 if (!txn->mt_free_pgs) {
1746 txn->mt_u.dirty_list = malloc(sizeof(MDB_ID2)*MDB_IDL_UM_SIZE);
1747 if (!txn->mt_u.dirty_list) {
1748 free(txn->mt_free_pgs);
1752 txn->mt_txnid = parent->mt_txnid;
1753 txn->mt_toggle = parent->mt_toggle;
1754 txn->mt_u.dirty_list[0].mid = 0;
1755 txn->mt_free_pgs[0] = 0;
1756 txn->mt_next_pgno = parent->mt_next_pgno;
1757 parent->mt_child = txn;
1758 txn->mt_parent = parent;
1759 txn->mt_numdbs = parent->mt_numdbs;
1760 txn->mt_dbxs = parent->mt_dbxs;
1761 memcpy(txn->mt_dbs, parent->mt_dbs, txn->mt_numdbs * sizeof(MDB_db));
1762 memcpy(txn->mt_dbflags, parent->mt_dbflags, txn->mt_numdbs);
1763 mdb_cursor_shadow(parent, txn);
1766 rc = mdb_txn_renew0(txn);
1772 DPRINTF("begin txn %zu%c %p on mdbenv %p, root page %zu",
1773 txn->mt_txnid, (txn->mt_flags & MDB_TXN_RDONLY) ? 'r' : 'w',
1774 (void *) txn, (void *) env, txn->mt_dbs[MAIN_DBI].md_root);
1780 /** Common code for #mdb_txn_reset() and #mdb_txn_abort().
1781 * @param[in] txn the transaction handle to reset
1784 mdb_txn_reset0(MDB_txn *txn)
1786 MDB_env *env = txn->mt_env;
1788 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY)) {
1789 txn->mt_u.reader->mr_txnid = 0;
1795 /* close(free) all cursors */
1796 for (i=0; i<txn->mt_numdbs; i++) {
1797 if (txn->mt_cursors[i]) {
1799 while ((mc = txn->mt_cursors[i])) {
1800 txn->mt_cursors[i] = mc->mc_next;
1801 if (mc->mc_flags & C_ALLOCD)
1807 if (!(env->me_flags & MDB_WRITEMAP)) {
1808 /* return all dirty pages to dpage list */
1809 for (i=1; i<=txn->mt_u.dirty_list[0].mid; i++) {
1810 dp = txn->mt_u.dirty_list[i].mptr;
1811 if (!IS_OVERFLOW(dp) || dp->mp_pages == 1) {
1812 dp->mp_next = txn->mt_env->me_dpages;
1813 VGMEMP_FREE(txn->mt_env, dp);
1814 txn->mt_env->me_dpages = dp;
1816 /* large pages just get freed directly */
1817 VGMEMP_FREE(txn->mt_env, dp);
1823 if (txn->mt_parent) {
1824 txn->mt_parent->mt_child = NULL;
1825 mdb_midl_free(txn->mt_free_pgs);
1826 free(txn->mt_u.dirty_list);
1829 if (mdb_midl_shrink(&txn->mt_free_pgs))
1830 env->me_free_pgs = txn->mt_free_pgs;
1833 while ((mop = txn->mt_env->me_pghead)) {
1834 txn->mt_env->me_pghead = mop->mo_next;
1837 txn->mt_env->me_pgfirst = 0;
1838 txn->mt_env->me_pglast = 0;
1841 /* The writer mutex was locked in mdb_txn_begin. */
1842 UNLOCK_MUTEX_W(env);
1847 mdb_txn_reset(MDB_txn *txn)
1852 DPRINTF("reset txn %zu%c %p on mdbenv %p, root page %zu",
1853 txn->mt_txnid, (txn->mt_flags & MDB_TXN_RDONLY) ? 'r' : 'w',
1854 (void *) txn, (void *)txn->mt_env, txn->mt_dbs[MAIN_DBI].md_root);
1856 mdb_txn_reset0(txn);
1860 mdb_txn_abort(MDB_txn *txn)
1865 DPRINTF("abort txn %zu%c %p on mdbenv %p, root page %zu",
1866 txn->mt_txnid, (txn->mt_flags & MDB_TXN_RDONLY) ? 'r' : 'w',
1867 (void *)txn, (void *)txn->mt_env, txn->mt_dbs[MAIN_DBI].md_root);
1870 mdb_txn_abort(txn->mt_child);
1872 mdb_txn_reset0(txn);
1877 mdb_txn_commit(MDB_txn *txn)
1885 pgno_t next, freecnt;
1888 assert(txn != NULL);
1889 assert(txn->mt_env != NULL);
1891 if (txn->mt_child) {
1892 mdb_txn_commit(txn->mt_child);
1893 txn->mt_child = NULL;
1898 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY)) {
1899 if (txn->mt_numdbs > env->me_numdbs) {
1900 /* update the DB flags */
1902 for (i = env->me_numdbs; i<txn->mt_numdbs; i++)
1903 env->me_dbflags[i] = txn->mt_dbs[i].md_flags;
1910 if (F_ISSET(txn->mt_flags, MDB_TXN_ERROR)) {
1911 DPUTS("error flag is set, can't commit");
1913 txn->mt_parent->mt_flags |= MDB_TXN_ERROR;
1918 /* Merge (and close) our cursors with parent's */
1919 mdb_cursor_merge(txn);
1921 if (txn->mt_parent) {
1927 /* Update parent's DB table */
1928 ip = &txn->mt_parent->mt_dbs[2];
1929 jp = &txn->mt_dbs[2];
1930 for (i = 2; i < txn->mt_numdbs; i++) {
1931 if (ip->md_root != jp->md_root)
1935 txn->mt_parent->mt_numdbs = txn->mt_numdbs;
1937 /* Append our free list to parent's */
1938 mdb_midl_append_list(&txn->mt_parent->mt_free_pgs,
1940 mdb_midl_free(txn->mt_free_pgs);
1942 /* Merge our dirty list with parent's */
1943 dst = txn->mt_parent->mt_u.dirty_list;
1944 src = txn->mt_u.dirty_list;
1945 x = mdb_mid2l_search(dst, src[1].mid);
1946 for (y=1; y<=src[0].mid; y++) {
1947 while (x <= dst[0].mid && dst[x].mid != src[y].mid) x++;
1951 dst[x].mptr = src[y].mptr;
1954 for (; y<=src[0].mid; y++) {
1955 if (++x >= MDB_IDL_UM_MAX) {
1957 return MDB_TXN_FULL;
1962 free(txn->mt_u.dirty_list);
1963 txn->mt_parent->mt_child = NULL;
1968 if (txn != env->me_txn) {
1969 DPUTS("attempt to commit unknown transaction");
1974 if (!txn->mt_u.dirty_list[0].mid)
1977 DPRINTF("committing txn %zu %p on mdbenv %p, root page %zu",
1978 txn->mt_txnid, (void *)txn, (void *)env, txn->mt_dbs[MAIN_DBI].md_root);
1980 /* Update DB root pointers. Their pages have already been
1981 * touched so this is all in-place and cannot fail.
1983 if (txn->mt_numdbs > 2) {
1986 data.mv_size = sizeof(MDB_db);
1988 mdb_cursor_init(&mc, txn, MAIN_DBI, NULL);
1989 for (i = 2; i < txn->mt_numdbs; i++) {
1990 if (txn->mt_dbflags[i] & DB_DIRTY) {
1991 data.mv_data = &txn->mt_dbs[i];
1992 mdb_cursor_put(&mc, &txn->mt_dbxs[i].md_name, &data, 0);
1997 mdb_cursor_init(&mc, txn, FREE_DBI, NULL);
1999 /* should only be one record now */
2000 if (env->me_pghead) {
2001 /* make sure first page of freeDB is touched and on freelist */
2002 mdb_page_search(&mc, NULL, MDB_PS_MODIFY);
2005 /* Delete IDLs we used from the free list */
2006 if (env->me_pgfirst) {
2011 key.mv_size = sizeof(cur);
2012 for (cur = env->me_pgfirst; cur <= env->me_pglast; cur++) {
2015 mdb_cursor_set(&mc, &key, NULL, MDB_SET, &exact);
2016 rc = mdb_cursor_del(&mc, 0);
2022 env->me_pgfirst = 0;
2026 /* save to free list */
2028 freecnt = txn->mt_free_pgs[0];
2029 if (!MDB_IDL_IS_ZERO(txn->mt_free_pgs)) {
2032 /* make sure last page of freeDB is touched and on freelist */
2033 key.mv_size = MAXKEYSIZE+1;
2035 mdb_page_search(&mc, &key, MDB_PS_MODIFY);
2037 mdb_midl_sort(txn->mt_free_pgs);
2041 MDB_IDL idl = txn->mt_free_pgs;
2042 DPRINTF("IDL write txn %zu root %zu num %zu",
2043 txn->mt_txnid, txn->mt_dbs[FREE_DBI].md_root, idl[0]);
2044 for (i=0; i<idl[0]; i++) {
2045 DPRINTF("IDL %zu", idl[i+1]);
2049 /* write to last page of freeDB */
2050 key.mv_size = sizeof(pgno_t);
2051 key.mv_data = &txn->mt_txnid;
2052 data.mv_data = txn->mt_free_pgs;
2053 /* The free list can still grow during this call,
2054 * despite the pre-emptive touches above. So check
2055 * and make sure the entire thing got written.
2058 freecnt = txn->mt_free_pgs[0];
2059 data.mv_size = MDB_IDL_SIZEOF(txn->mt_free_pgs);
2060 rc = mdb_cursor_put(&mc, &key, &data, 0);
2065 } while (freecnt != txn->mt_free_pgs[0]);
2067 /* should only be one record now */
2069 if (env->me_pghead) {
2075 mop = env->me_pghead;
2077 key.mv_size = sizeof(id);
2079 data.mv_size = MDB_IDL_SIZEOF(mop->mo_pages);
2080 data.mv_data = mop->mo_pages;
2081 orig = mop->mo_pages[0];
2082 /* These steps may grow the freelist again
2083 * due to freed overflow pages...
2085 mdb_cursor_put(&mc, &key, &data, 0);
2086 if (mop == env->me_pghead && env->me_pghead->mo_txnid == id) {
2087 /* could have been used again here */
2088 if (mop->mo_pages[0] != orig) {
2089 data.mv_size = MDB_IDL_SIZEOF(mop->mo_pages);
2090 data.mv_data = mop->mo_pages;
2092 mdb_cursor_put(&mc, &key, &data, 0);
2094 env->me_pghead = NULL;
2097 /* was completely used up */
2098 mdb_cursor_del(&mc, 0);
2102 env->me_pgfirst = 0;
2106 while (env->me_pgfree) {
2107 MDB_oldpages *mop = env->me_pgfree;
2108 env->me_pgfree = mop->mo_next;
2112 /* Check for growth of freelist again */
2113 if (freecnt != txn->mt_free_pgs[0])
2116 if (!MDB_IDL_IS_ZERO(txn->mt_free_pgs)) {
2117 if (mdb_midl_shrink(&txn->mt_free_pgs))
2118 env->me_free_pgs = txn->mt_free_pgs;
2125 if (env->me_flags & MDB_WRITEMAP) {
2126 for (i=1; i<=txn->mt_u.dirty_list[0].mid; i++) {
2127 dp = txn->mt_u.dirty_list[i].mptr;
2128 /* clear dirty flag */
2129 dp->mp_flags &= ~P_DIRTY;
2130 txn->mt_u.dirty_list[i].mid = 0;
2132 txn->mt_u.dirty_list[0].mid = 0;
2136 /* Commit up to MDB_COMMIT_PAGES dirty pages to disk until done.
2142 /* Windows actually supports scatter/gather I/O, but only on
2143 * unbuffered file handles. Since we're relying on the OS page
2144 * cache for all our data, that's self-defeating. So we just
2145 * write pages one at a time. We use the ov structure to set
2146 * the write offset, to at least save the overhead of a Seek
2150 memset(&ov, 0, sizeof(ov));
2151 for (; i<=txn->mt_u.dirty_list[0].mid; i++) {
2153 dp = txn->mt_u.dirty_list[i].mptr;
2154 DPRINTF("committing page %zu", dp->mp_pgno);
2155 size = dp->mp_pgno * env->me_psize;
2156 ov.Offset = size & 0xffffffff;
2157 ov.OffsetHigh = size >> 16;
2158 ov.OffsetHigh >>= 16;
2159 /* clear dirty flag */
2160 dp->mp_flags &= ~P_DIRTY;
2161 wsize = env->me_psize;
2162 if (IS_OVERFLOW(dp)) wsize *= dp->mp_pages;
2163 rc = WriteFile(env->me_fd, dp, wsize, NULL, &ov);
2166 DPRINTF("WriteFile: %d", n);
2173 struct iovec iov[MDB_COMMIT_PAGES];
2177 for (; i<=txn->mt_u.dirty_list[0].mid; i++) {
2178 dp = txn->mt_u.dirty_list[i].mptr;
2179 if (dp->mp_pgno != next) {
2181 rc = writev(env->me_fd, iov, n);
2185 DPUTS("short write, filesystem full?");
2187 DPRINTF("writev: %s", strerror(n));
2194 lseek(env->me_fd, dp->mp_pgno * env->me_psize, SEEK_SET);
2197 DPRINTF("committing page %zu", dp->mp_pgno);
2198 iov[n].iov_len = env->me_psize;
2199 if (IS_OVERFLOW(dp)) iov[n].iov_len *= dp->mp_pages;
2200 iov[n].iov_base = (char *)dp;
2201 size += iov[n].iov_len;
2202 next = dp->mp_pgno + (IS_OVERFLOW(dp) ? dp->mp_pages : 1);
2203 /* clear dirty flag */
2204 dp->mp_flags &= ~P_DIRTY;
2205 if (++n >= MDB_COMMIT_PAGES) {
2215 rc = writev(env->me_fd, iov, n);
2219 DPUTS("short write, filesystem full?");
2221 DPRINTF("writev: %s", strerror(n));
2228 /* Drop the dirty pages.
2230 for (i=1; i<=txn->mt_u.dirty_list[0].mid; i++) {
2231 dp = txn->mt_u.dirty_list[i].mptr;
2232 if (!IS_OVERFLOW(dp) || dp->mp_pages == 1) {
2233 dp->mp_next = txn->mt_env->me_dpages;
2234 VGMEMP_FREE(txn->mt_env, dp);
2235 txn->mt_env->me_dpages = dp;
2237 VGMEMP_FREE(txn->mt_env, dp);
2240 txn->mt_u.dirty_list[i].mid = 0;
2242 txn->mt_u.dirty_list[0].mid = 0;
2245 if ((n = mdb_env_sync(env, 0)) != 0 ||
2246 (n = mdb_env_write_meta(txn)) != MDB_SUCCESS) {
2253 if (txn->mt_numdbs > env->me_numdbs) {
2254 /* update the DB flags */
2256 for (i = env->me_numdbs; i<txn->mt_numdbs; i++)
2257 env->me_dbflags[i] = txn->mt_dbs[i].md_flags;
2261 UNLOCK_MUTEX_W(env);
2267 /** Read the environment parameters of a DB environment before
2268 * mapping it into memory.
2269 * @param[in] env the environment handle
2270 * @param[out] meta address of where to store the meta information
2271 * @return 0 on success, non-zero on failure.
2274 mdb_env_read_header(MDB_env *env, MDB_meta *meta)
2281 /* We don't know the page size yet, so use a minimum value.
2285 if (!ReadFile(env->me_fd, &pbuf, MDB_PAGESIZE, (DWORD *)&rc, NULL) || rc == 0)
2287 if ((rc = read(env->me_fd, &pbuf, MDB_PAGESIZE)) == 0)
2292 else if (rc != MDB_PAGESIZE) {
2296 DPRINTF("read: %s", strerror(err));
2300 p = (MDB_page *)&pbuf;
2302 if (!F_ISSET(p->mp_flags, P_META)) {
2303 DPRINTF("page %zu not a meta page", p->mp_pgno);
2308 if (m->mm_magic != MDB_MAGIC) {
2309 DPUTS("meta has invalid magic");
2313 if (m->mm_version != MDB_VERSION) {
2314 DPRINTF("database is version %u, expected version %u",
2315 m->mm_version, MDB_VERSION);
2316 return MDB_VERSION_MISMATCH;
2319 memcpy(meta, m, sizeof(*m));
2323 /** Write the environment parameters of a freshly created DB environment.
2324 * @param[in] env the environment handle
2325 * @param[out] meta address of where to store the meta information
2326 * @return 0 on success, non-zero on failure.
2329 mdb_env_init_meta(MDB_env *env, MDB_meta *meta)
2336 DPUTS("writing new meta page");
2338 GET_PAGESIZE(psize);
2340 meta->mm_magic = MDB_MAGIC;
2341 meta->mm_version = MDB_VERSION;
2342 meta->mm_psize = psize;
2343 meta->mm_last_pg = 1;
2344 meta->mm_flags = env->me_flags & 0xffff;
2345 meta->mm_flags |= MDB_INTEGERKEY;
2346 meta->mm_dbs[0].md_root = P_INVALID;
2347 meta->mm_dbs[1].md_root = P_INVALID;
2349 p = calloc(2, psize);
2351 p->mp_flags = P_META;
2354 memcpy(m, meta, sizeof(*meta));
2356 q = (MDB_page *)((char *)p + psize);
2359 q->mp_flags = P_META;
2362 memcpy(m, meta, sizeof(*meta));
2367 rc = WriteFile(env->me_fd, p, psize * 2, &len, NULL);
2368 rc = (len == psize * 2) ? MDB_SUCCESS : ErrCode();
2371 rc = write(env->me_fd, p, psize * 2);
2372 rc = (rc == (int)psize * 2) ? MDB_SUCCESS : ErrCode();
2378 /** Update the environment info to commit a transaction.
2379 * @param[in] txn the transaction that's being committed
2380 * @return 0 on success, non-zero on failure.
2383 mdb_env_write_meta(MDB_txn *txn)
2386 MDB_meta meta, metab;
2388 int rc, len, toggle;
2394 assert(txn != NULL);
2395 assert(txn->mt_env != NULL);
2397 toggle = !txn->mt_toggle;
2398 DPRINTF("writing meta page %d for root page %zu",
2399 toggle, txn->mt_dbs[MAIN_DBI].md_root);
2403 if (env->me_flags & MDB_WRITEMAP) {
2404 MDB_meta *mp = env->me_metas[toggle];
2405 mp->mm_dbs[0] = txn->mt_dbs[0];
2406 mp->mm_dbs[1] = txn->mt_dbs[1];
2407 mp->mm_last_pg = txn->mt_next_pgno - 1;
2408 mp->mm_txnid = txn->mt_txnid;
2409 if (!(env->me_flags & (MDB_NOMETASYNC|MDB_NOSYNC))) {
2410 rc = (env->me_flags & MDB_MAPASYNC) ? MS_ASYNC : MS_SYNC;
2413 ptr += env->me_psize;
2414 if (MDB_MSYNC(ptr, env->me_psize, rc)) {
2421 metab.mm_txnid = env->me_metas[toggle]->mm_txnid;
2422 metab.mm_last_pg = env->me_metas[toggle]->mm_last_pg;
2424 ptr = (char *)&meta;
2425 off = offsetof(MDB_meta, mm_dbs[0].md_depth);
2426 len = sizeof(MDB_meta) - off;
2429 meta.mm_dbs[0] = txn->mt_dbs[0];
2430 meta.mm_dbs[1] = txn->mt_dbs[1];
2431 meta.mm_last_pg = txn->mt_next_pgno - 1;
2432 meta.mm_txnid = txn->mt_txnid;
2435 off += env->me_psize;
2438 /* Write to the SYNC fd */
2441 memset(&ov, 0, sizeof(ov));
2443 WriteFile(env->me_mfd, ptr, len, (DWORD *)&rc, &ov);
2446 rc = pwrite(env->me_mfd, ptr, len, off);
2451 DPUTS("write failed, disk error?");
2452 /* On a failure, the pagecache still contains the new data.
2453 * Write some old data back, to prevent it from being used.
2454 * Use the non-SYNC fd; we know it will fail anyway.
2456 meta.mm_last_pg = metab.mm_last_pg;
2457 meta.mm_txnid = metab.mm_txnid;
2459 WriteFile(env->me_fd, ptr, len, NULL, &ov);
2461 r2 = pwrite(env->me_fd, ptr, len, off);
2464 env->me_flags |= MDB_FATAL_ERROR;
2468 /* Memory ordering issues are irrelevant; since the entire writer
2469 * is wrapped by wmutex, all of these changes will become visible
2470 * after the wmutex is unlocked. Since the DB is multi-version,
2471 * readers will get consistent data regardless of how fresh or
2472 * how stale their view of these values is.
2474 txn->mt_env->me_txns->mti_txnid = txn->mt_txnid;
2479 /** Check both meta pages to see which one is newer.
2480 * @param[in] env the environment handle
2481 * @return meta toggle (0 or 1).
2484 mdb_env_pick_meta(const MDB_env *env)
2486 return (env->me_metas[0]->mm_txnid < env->me_metas[1]->mm_txnid);
2490 mdb_env_create(MDB_env **env)
2494 e = calloc(1, sizeof(MDB_env));
2498 e->me_free_pgs = mdb_midl_alloc();
2499 if (!e->me_free_pgs) {
2503 e->me_maxreaders = DEFAULT_READERS;
2505 e->me_fd = INVALID_HANDLE_VALUE;
2506 e->me_lfd = INVALID_HANDLE_VALUE;
2507 e->me_mfd = INVALID_HANDLE_VALUE;
2508 VGMEMP_CREATE(e,0,0);
2514 mdb_env_set_mapsize(MDB_env *env, size_t size)
2518 env->me_mapsize = size;
2520 env->me_maxpg = env->me_mapsize / env->me_psize;
2525 mdb_env_set_maxdbs(MDB_env *env, MDB_dbi dbs)
2529 env->me_maxdbs = dbs;
2534 mdb_env_set_maxreaders(MDB_env *env, unsigned int readers)
2536 if (env->me_map || readers < 1)
2538 env->me_maxreaders = readers;
2543 mdb_env_get_maxreaders(MDB_env *env, unsigned int *readers)
2545 if (!env || !readers)
2547 *readers = env->me_maxreaders;
2551 /** Further setup required for opening an MDB environment
2554 mdb_env_open2(MDB_env *env, unsigned int flags)
2556 int i, newenv = 0, prot;
2560 env->me_flags = flags;
2562 memset(&meta, 0, sizeof(meta));
2564 if ((i = mdb_env_read_header(env, &meta)) != 0) {
2567 DPUTS("new mdbenv");
2571 if (!env->me_mapsize) {
2572 env->me_mapsize = newenv ? DEFAULT_MAPSIZE : meta.mm_mapsize;
2578 LONG sizelo, sizehi;
2579 sizelo = env->me_mapsize & 0xffffffff;
2580 sizehi = env->me_mapsize >> 16; /* pointless on WIN32, only needed on W64 */
2582 /* Windows won't create mappings for zero length files.
2583 * Just allocate the maxsize right now.
2586 SetFilePointer(env->me_fd, sizelo, sizehi ? &sizehi : NULL, 0);
2587 if (!SetEndOfFile(env->me_fd))
2589 SetFilePointer(env->me_fd, 0, NULL, 0);
2591 mh = CreateFileMapping(env->me_fd, NULL, flags & MDB_WRITEMAP ?
2592 PAGE_READWRITE : PAGE_READONLY,
2593 sizehi, sizelo, NULL);
2596 env->me_map = MapViewOfFileEx(mh, flags & MDB_WRITEMAP ?
2597 FILE_MAP_WRITE : FILE_MAP_READ,
2598 0, 0, env->me_mapsize, meta.mm_address);
2605 if (meta.mm_address && (flags & MDB_FIXEDMAP))
2608 if (flags & MDB_WRITEMAP) {
2610 ftruncate(env->me_fd, env->me_mapsize);
2612 env->me_map = mmap(meta.mm_address, env->me_mapsize, prot, i,
2614 if (env->me_map == MAP_FAILED) {
2621 meta.mm_mapsize = env->me_mapsize;
2622 if (flags & MDB_FIXEDMAP)
2623 meta.mm_address = env->me_map;
2624 i = mdb_env_init_meta(env, &meta);
2625 if (i != MDB_SUCCESS) {
2626 munmap(env->me_map, env->me_mapsize);
2630 env->me_psize = meta.mm_psize;
2632 env->me_maxpg = env->me_mapsize / env->me_psize;
2634 p = (MDB_page *)env->me_map;
2635 env->me_metas[0] = METADATA(p);
2636 env->me_metas[1] = (MDB_meta *)((char *)env->me_metas[0] + meta.mm_psize);
2640 int toggle = mdb_env_pick_meta(env);
2641 MDB_db *db = &env->me_metas[toggle]->mm_dbs[MAIN_DBI];
2643 DPRINTF("opened database version %u, pagesize %u",
2644 env->me_metas[0]->mm_version, env->me_psize);
2645 DPRINTF("using meta page %d", toggle);
2646 DPRINTF("depth: %u", db->md_depth);
2647 DPRINTF("entries: %zu", db->md_entries);
2648 DPRINTF("branch pages: %zu", db->md_branch_pages);
2649 DPRINTF("leaf pages: %zu", db->md_leaf_pages);
2650 DPRINTF("overflow pages: %zu", db->md_overflow_pages);
2651 DPRINTF("root: %zu", db->md_root);
2659 /** Release a reader thread's slot in the reader lock table.
2660 * This function is called automatically when a thread exits.
2661 * @param[in] ptr This points to the slot in the reader lock table.
2664 mdb_env_reader_dest(void *ptr)
2666 MDB_reader *reader = ptr;
2668 reader->mr_txnid = 0;
2674 /** Junk for arranging thread-specific callbacks on Windows. This is
2675 * necessarily platform and compiler-specific. Windows supports up
2676 * to 1088 keys. Let's assume nobody opens more than 64 environments
2677 * in a single process, for now. They can override this if needed.
2679 #ifndef MAX_TLS_KEYS
2680 #define MAX_TLS_KEYS 64
2682 static pthread_key_t mdb_tls_keys[MAX_TLS_KEYS];
2683 static int mdb_tls_nkeys;
2685 static void NTAPI mdb_tls_callback(PVOID module, DWORD reason, PVOID ptr)
2689 case DLL_PROCESS_ATTACH: break;
2690 case DLL_THREAD_ATTACH: break;
2691 case DLL_THREAD_DETACH:
2692 for (i=0; i<mdb_tls_nkeys; i++) {
2693 MDB_reader *r = pthread_getspecific(mdb_tls_keys[i]);
2694 mdb_env_reader_dest(r);
2697 case DLL_PROCESS_DETACH: break;
2702 const PIMAGE_TLS_CALLBACK mdb_tls_cbp __attribute__((section (".CRT$XLB"))) = mdb_tls_callback;
2704 PIMAGE_TLS_CALLBACK mdb_tls_cbp __attribute__((section (".CRT$XLB"))) = mdb_tls_callback;
2708 /* Force some symbol references.
2709 * _tls_used forces the linker to create the TLS directory if not already done
2710 * mdb_tls_cbp prevents whole-program-optimizer from dropping the symbol.
2712 #pragma comment(linker, "/INCLUDE:_tls_used")
2713 #pragma comment(linker, "/INCLUDE:mdb_tls_cbp")
2714 #pragma const_seg(".CRT$XLB")
2715 extern const PIMAGE_TLS_CALLBACK mdb_tls_callback;
2716 const PIMAGE_TLS_CALLBACK mdb_tls_cbp = mdb_tls_callback;
2719 #pragma comment(linker, "/INCLUDE:__tls_used")
2720 #pragma comment(linker, "/INCLUDE:_mdb_tls_cbp")
2721 #pragma data_seg(".CRT$XLB")
2722 PIMAGE_TLS_CALLBACK mdb_tls_cbp = mdb_tls_callback;
2724 #endif /* WIN 32/64 */
2725 #endif /* !__GNUC__ */
2728 /** Downgrade the exclusive lock on the region back to shared */
2730 mdb_env_share_locks(MDB_env *env)
2732 int toggle = mdb_env_pick_meta(env);
2734 env->me_txns->mti_txnid = env->me_metas[toggle]->mm_txnid;
2739 /* First acquire a shared lock. The Unlock will
2740 * then release the existing exclusive lock.
2742 memset(&ov, 0, sizeof(ov));
2743 LockFileEx(env->me_lfd, 0, 0, 1, 0, &ov);
2744 UnlockFile(env->me_lfd, 0, 0, 1, 0);
2748 struct flock lock_info;
2749 /* The shared lock replaces the existing lock */
2750 memset((void *)&lock_info, 0, sizeof(lock_info));
2751 lock_info.l_type = F_RDLCK;
2752 lock_info.l_whence = SEEK_SET;
2753 lock_info.l_start = 0;
2754 lock_info.l_len = 1;
2755 fcntl(env->me_lfd, F_SETLK, &lock_info);
2761 mdb_env_excl_lock(MDB_env *env, int *excl)
2764 if (LockFile(env->me_lfd, 0, 0, 1, 0)) {
2768 memset(&ov, 0, sizeof(ov));
2769 if (!LockFileEx(env->me_lfd, 0, 0, 1, 0, &ov)) {
2774 struct flock lock_info;
2775 memset((void *)&lock_info, 0, sizeof(lock_info));
2776 lock_info.l_type = F_WRLCK;
2777 lock_info.l_whence = SEEK_SET;
2778 lock_info.l_start = 0;
2779 lock_info.l_len = 1;
2780 if (!fcntl(env->me_lfd, F_SETLK, &lock_info)) {
2783 lock_info.l_type = F_RDLCK;
2784 if (fcntl(env->me_lfd, F_SETLKW, &lock_info)) {
2792 #if defined(_WIN32) || defined(USE_POSIX_SEM)
2794 * hash_64 - 64 bit Fowler/Noll/Vo-0 FNV-1a hash code
2796 * @(#) $Revision: 5.1 $
2797 * @(#) $Id: hash_64a.c,v 5.1 2009/06/30 09:01:38 chongo Exp $
2798 * @(#) $Source: /usr/local/src/cmd/fnv/RCS/hash_64a.c,v $
2800 * http://www.isthe.com/chongo/tech/comp/fnv/index.html
2804 * Please do not copyright this code. This code is in the public domain.
2806 * LANDON CURT NOLL DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
2807 * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO
2808 * EVENT SHALL LANDON CURT NOLL BE LIABLE FOR ANY SPECIAL, INDIRECT OR
2809 * CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF
2810 * USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
2811 * OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
2812 * PERFORMANCE OF THIS SOFTWARE.
2815 * chongo <Landon Curt Noll> /\oo/\
2816 * http://www.isthe.com/chongo/
2818 * Share and Enjoy! :-)
2821 typedef unsigned long long mdb_hash_t;
2822 #define MDB_HASH_INIT ((mdb_hash_t)0xcbf29ce484222325ULL)
2824 /** perform a 64 bit Fowler/Noll/Vo FNV-1a hash on a buffer
2825 * @param[in] str string to hash
2826 * @param[in] hval initial value for hash
2827 * @return 64 bit hash
2829 * NOTE: To use the recommended 64 bit FNV-1a hash, use MDB_HASH_INIT as the
2830 * hval arg on the first call.
2833 mdb_hash_val(MDB_val *val, mdb_hash_t hval)
2835 unsigned char *s = (unsigned char *)val->mv_data; /* unsigned string */
2836 unsigned char *end = s + val->mv_size;
2838 * FNV-1a hash each octet of the string
2841 /* xor the bottom with the current octet */
2842 hval ^= (mdb_hash_t)*s++;
2844 /* multiply by the 64 bit FNV magic prime mod 2^64 */
2845 hval += (hval << 1) + (hval << 4) + (hval << 5) +
2846 (hval << 7) + (hval << 8) + (hval << 40);
2848 /* return our new hash value */
2852 /** Hash the string and output the hash in hex.
2853 * @param[in] str string to hash
2854 * @param[out] hexbuf an array of 17 chars to hold the hash
2857 mdb_hash_hex(MDB_val *val, char *hexbuf)
2860 mdb_hash_t h = mdb_hash_val(val, MDB_HASH_INIT);
2861 for (i=0; i<8; i++) {
2862 hexbuf += sprintf(hexbuf, "%02x", (unsigned int)h & 0xff);
2868 /** Open and/or initialize the lock region for the environment.
2869 * @param[in] env The MDB environment.
2870 * @param[in] lpath The pathname of the file used for the lock region.
2871 * @param[in] mode The Unix permissions for the file, if we create it.
2872 * @param[out] excl Set to true if we got an exclusive lock on the region.
2873 * @return 0 on success, non-zero on failure.
2876 mdb_env_setup_locks(MDB_env *env, char *lpath, int mode, int *excl)
2884 if ((env->me_lfd = CreateFile(lpath, GENERIC_READ|GENERIC_WRITE,
2885 FILE_SHARE_READ|FILE_SHARE_WRITE, NULL, OPEN_ALWAYS,
2886 FILE_ATTRIBUTE_NORMAL, NULL)) == INVALID_HANDLE_VALUE) {
2890 /* Try to get exclusive lock. If we succeed, then
2891 * nobody is using the lock region and we should initialize it.
2893 if ((rc = mdb_env_excl_lock(env, excl))) goto fail;
2894 size = GetFileSize(env->me_lfd, NULL);
2900 if ((env->me_lfd = open(lpath, O_RDWR|O_CREAT, mode)) == -1)
2902 /* Lose record locks when exec*() */
2903 if ((fdflags = fcntl(env->me_lfd, F_GETFD) | FD_CLOEXEC) >= 0)
2904 fcntl(env->me_lfd, F_SETFD, fdflags);
2906 #else /* O_CLOEXEC on Linux: Open file and set FD_CLOEXEC atomically */
2907 if ((env->me_lfd = open(lpath, O_RDWR|O_CREAT|O_CLOEXEC, mode)) == -1)
2911 /* Try to get exclusive lock. If we succeed, then
2912 * nobody is using the lock region and we should initialize it.
2914 if ((rc = mdb_env_excl_lock(env, excl))) goto fail;
2916 size = lseek(env->me_lfd, 0, SEEK_END);
2918 rsize = (env->me_maxreaders-1) * sizeof(MDB_reader) + sizeof(MDB_txninfo);
2919 if (size < rsize && *excl) {
2921 SetFilePointer(env->me_lfd, rsize, NULL, 0);
2922 if (!SetEndOfFile(env->me_lfd)) {
2927 if (ftruncate(env->me_lfd, rsize) != 0) {
2934 size = rsize - sizeof(MDB_txninfo);
2935 env->me_maxreaders = size/sizeof(MDB_reader) + 1;
2940 mh = CreateFileMapping(env->me_lfd, NULL, PAGE_READWRITE,
2946 env->me_txns = MapViewOfFileEx(mh, FILE_MAP_WRITE, 0, 0, rsize, NULL);
2948 if (!env->me_txns) {
2953 void *m = mmap(NULL, rsize, PROT_READ|PROT_WRITE, MAP_SHARED,
2955 if (m == MAP_FAILED) {
2956 env->me_txns = NULL;
2965 BY_HANDLE_FILE_INFORMATION stbuf;
2974 if (!mdb_sec_inited) {
2975 InitializeSecurityDescriptor(&mdb_null_sd,
2976 SECURITY_DESCRIPTOR_REVISION);
2977 SetSecurityDescriptorDacl(&mdb_null_sd, TRUE, 0, FALSE);
2978 mdb_all_sa.nLength = sizeof(SECURITY_ATTRIBUTES);
2979 mdb_all_sa.bInheritHandle = FALSE;
2980 mdb_all_sa.lpSecurityDescriptor = &mdb_null_sd;
2983 GetFileInformationByHandle(env->me_lfd, &stbuf);
2984 idbuf.volume = stbuf.dwVolumeSerialNumber;
2985 idbuf.nhigh = stbuf.nFileIndexHigh;
2986 idbuf.nlow = stbuf.nFileIndexLow;
2987 val.mv_data = &idbuf;
2988 val.mv_size = sizeof(idbuf);
2989 mdb_hash_hex(&val, hexbuf);
2990 sprintf(env->me_txns->mti_rmname, "Global\\MDBr%s", hexbuf);
2991 env->me_rmutex = CreateMutex(&mdb_all_sa, FALSE, env->me_txns->mti_rmname);
2992 if (!env->me_rmutex) {
2996 sprintf(env->me_txns->mti_wmname, "Global\\MDBw%s", hexbuf);
2997 env->me_wmutex = CreateMutex(&mdb_all_sa, FALSE, env->me_txns->mti_wmname);
2998 if (!env->me_wmutex) {
3003 #ifdef USE_POSIX_SEM
3012 fstat(env->me_lfd, &stbuf);
3013 idbuf.dev = stbuf.st_dev;
3014 idbuf.ino = stbuf.st_ino;
3015 val.mv_data = &idbuf;
3016 val.mv_size = sizeof(idbuf);
3017 mdb_hash_hex(&val, hexbuf);
3018 sprintf(env->me_txns->mti_rmname, "/MDBr%s", hexbuf);
3019 if (sem_unlink(env->me_txns->mti_rmname)) {
3021 if (rc != ENOENT && rc != EINVAL)
3024 env->me_rmutex = sem_open(env->me_txns->mti_rmname, O_CREAT, mode, 1);
3025 if (env->me_rmutex == SEM_FAILED) {
3029 sprintf(env->me_txns->mti_wmname, "/MDBw%s", hexbuf);
3030 if (sem_unlink(env->me_txns->mti_wmname)) {
3032 if (rc != ENOENT && rc != EINVAL)
3035 env->me_wmutex = sem_open(env->me_txns->mti_wmname, O_CREAT, mode, 1);
3036 if (env->me_wmutex == SEM_FAILED) {
3040 #else /* USE_POSIX_SEM */
3041 pthread_mutexattr_t mattr;
3043 pthread_mutexattr_init(&mattr);
3044 rc = pthread_mutexattr_setpshared(&mattr, PTHREAD_PROCESS_SHARED);
3048 pthread_mutex_init(&env->me_txns->mti_mutex, &mattr);
3049 pthread_mutex_init(&env->me_txns->mti_wmutex, &mattr);
3050 #endif /* USE_POSIX_SEM */
3052 env->me_txns->mti_version = MDB_VERSION;
3053 env->me_txns->mti_magic = MDB_MAGIC;
3054 env->me_txns->mti_txnid = 0;
3055 env->me_txns->mti_numreaders = 0;
3058 if (env->me_txns->mti_magic != MDB_MAGIC) {
3059 DPUTS("lock region has invalid magic");
3063 if (env->me_txns->mti_version != MDB_VERSION) {
3064 DPRINTF("lock region is version %u, expected version %u",
3065 env->me_txns->mti_version, MDB_VERSION);
3066 rc = MDB_VERSION_MISMATCH;
3070 if (rc != EACCES && rc != EAGAIN) {
3074 env->me_rmutex = OpenMutex(SYNCHRONIZE, FALSE, env->me_txns->mti_rmname);
3075 if (!env->me_rmutex) {
3079 env->me_wmutex = OpenMutex(SYNCHRONIZE, FALSE, env->me_txns->mti_wmname);
3080 if (!env->me_wmutex) {
3085 #ifdef USE_POSIX_SEM
3086 env->me_rmutex = sem_open(env->me_txns->mti_rmname, 0);
3087 if (env->me_rmutex == SEM_FAILED) {
3091 env->me_wmutex = sem_open(env->me_txns->mti_wmname, 0);
3092 if (env->me_wmutex == SEM_FAILED) {
3102 env->me_lfd = INVALID_HANDLE_VALUE;
3107 /** The name of the lock file in the DB environment */
3108 #define LOCKNAME "/lock.mdb"
3109 /** The name of the data file in the DB environment */
3110 #define DATANAME "/data.mdb"
3111 /** The suffix of the lock file when no subdir is used */
3112 #define LOCKSUFF "-lock"
3115 mdb_env_open(MDB_env *env, const char *path, unsigned int flags, mode_t mode)
3117 int oflags, rc, len, excl;
3118 char *lpath, *dpath;
3121 if (flags & MDB_NOSUBDIR) {
3122 rc = len + sizeof(LOCKSUFF) + len + 1;
3124 rc = len + sizeof(LOCKNAME) + len + sizeof(DATANAME);
3129 if (flags & MDB_NOSUBDIR) {
3130 dpath = lpath + len + sizeof(LOCKSUFF);
3131 sprintf(lpath, "%s" LOCKSUFF, path);
3132 strcpy(dpath, path);
3134 dpath = lpath + len + sizeof(LOCKNAME);
3135 sprintf(lpath, "%s" LOCKNAME, path);
3136 sprintf(dpath, "%s" DATANAME, path);
3139 rc = mdb_env_setup_locks(env, lpath, mode, &excl);
3144 if (F_ISSET(flags, MDB_RDONLY)) {
3145 oflags = GENERIC_READ;
3146 len = OPEN_EXISTING;
3148 oflags = GENERIC_READ|GENERIC_WRITE;
3151 mode = FILE_ATTRIBUTE_NORMAL;
3152 env->me_fd = CreateFile(dpath, oflags, FILE_SHARE_READ|FILE_SHARE_WRITE,
3153 NULL, len, mode, NULL);
3155 if (F_ISSET(flags, MDB_RDONLY))
3158 oflags = O_RDWR | O_CREAT;
3160 env->me_fd = open(dpath, oflags, mode);
3162 if (env->me_fd == INVALID_HANDLE_VALUE) {
3167 if ((rc = mdb_env_open2(env, flags)) == MDB_SUCCESS) {
3168 if (flags & (MDB_RDONLY|MDB_NOSYNC|MDB_NOMETASYNC)) {
3169 env->me_mfd = env->me_fd;
3171 /* synchronous fd for meta writes */
3173 env->me_mfd = CreateFile(dpath, oflags,
3174 FILE_SHARE_READ|FILE_SHARE_WRITE, NULL, len,
3175 mode | FILE_FLAG_WRITE_THROUGH, NULL);
3177 env->me_mfd = open(dpath, oflags | MDB_DSYNC, mode);
3179 if (env->me_mfd == INVALID_HANDLE_VALUE) {
3184 env->me_path = strdup(path);
3185 DPRINTF("opened dbenv %p", (void *) env);
3186 pthread_key_create(&env->me_txkey, mdb_env_reader_dest);
3188 /* Windows TLS callbacks need help finding their TLS info. */
3189 if (mdb_tls_nkeys < MAX_TLS_KEYS)
3190 mdb_tls_keys[mdb_tls_nkeys++] = env->me_txkey;
3197 mdb_env_share_locks(env);
3199 env->me_dbxs = calloc(env->me_maxdbs, sizeof(MDB_dbx));
3200 env->me_dbflags = calloc(env->me_maxdbs, sizeof(uint16_t));
3201 if (!env->me_dbxs || !env->me_dbflags)
3207 if (env->me_fd != INVALID_HANDLE_VALUE) {
3209 env->me_fd = INVALID_HANDLE_VALUE;
3211 if (env->me_lfd != INVALID_HANDLE_VALUE) {
3213 env->me_lfd = INVALID_HANDLE_VALUE;
3221 mdb_env_close(MDB_env *env)
3228 VGMEMP_DESTROY(env);
3229 while (env->me_dpages) {
3230 dp = env->me_dpages;
3231 VGMEMP_DEFINED(&dp->mp_next, sizeof(dp->mp_next));
3232 env->me_dpages = dp->mp_next;
3236 free(env->me_dbflags);
3240 pthread_key_delete(env->me_txkey);
3242 /* Delete our key from the global list */
3244 for (i=0; i<mdb_tls_nkeys; i++)
3245 if (mdb_tls_keys[i] == env->me_txkey) {
3246 mdb_tls_keys[i] = mdb_tls_keys[mdb_tls_nkeys-1];
3254 munmap(env->me_map, env->me_mapsize);
3256 if (env->me_mfd != env->me_fd)
3260 pid_t pid = getpid();
3262 for (i=0; i<env->me_txns->mti_numreaders; i++)
3263 if (env->me_txns->mti_readers[i].mr_pid == pid)
3264 env->me_txns->mti_readers[i].mr_pid = 0;
3266 CloseHandle(env->me_rmutex);
3267 CloseHandle(env->me_wmutex);
3268 /* Windows automatically destroys the mutexes when
3269 * the last handle closes.
3272 #ifdef USE_POSIX_SEM
3273 sem_close(env->me_rmutex);
3274 sem_close(env->me_wmutex);
3276 if (!mdb_env_excl_lock(env, &excl) && excl) {
3277 /* we are the only remaining user of the environment.
3278 clean up semaphores. */
3279 sem_unlink(env->me_txns->mti_rmname);
3280 sem_unlink(env->me_txns->mti_wmname);
3285 munmap((void *)env->me_txns, (env->me_maxreaders-1)*sizeof(MDB_reader)+sizeof(MDB_txninfo));
3288 mdb_midl_free(env->me_free_pgs);
3292 /** Compare two items pointing at aligned size_t's */
3294 mdb_cmp_long(const MDB_val *a, const MDB_val *b)
3296 return (*(size_t *)a->mv_data < *(size_t *)b->mv_data) ? -1 :
3297 *(size_t *)a->mv_data > *(size_t *)b->mv_data;
3300 /** Compare two items pointing at aligned int's */
3302 mdb_cmp_int(const MDB_val *a, const MDB_val *b)
3304 return (*(unsigned int *)a->mv_data < *(unsigned int *)b->mv_data) ? -1 :
3305 *(unsigned int *)a->mv_data > *(unsigned int *)b->mv_data;
3308 /** Compare two items pointing at ints of unknown alignment.
3309 * Nodes and keys are guaranteed to be 2-byte aligned.
3312 mdb_cmp_cint(const MDB_val *a, const MDB_val *b)
3314 #if BYTE_ORDER == LITTLE_ENDIAN
3315 unsigned short *u, *c;
3318 u = (unsigned short *) ((char *) a->mv_data + a->mv_size);
3319 c = (unsigned short *) ((char *) b->mv_data + a->mv_size);
3322 } while(!x && u > (unsigned short *)a->mv_data);
3325 return memcmp(a->mv_data, b->mv_data, a->mv_size);
3329 /** Compare two items lexically */
3331 mdb_cmp_memn(const MDB_val *a, const MDB_val *b)
3338 len_diff = (ssize_t) a->mv_size - (ssize_t) b->mv_size;
3344 diff = memcmp(a->mv_data, b->mv_data, len);
3345 return diff ? diff : len_diff<0 ? -1 : len_diff;
3348 /** Compare two items in reverse byte order */
3350 mdb_cmp_memnr(const MDB_val *a, const MDB_val *b)
3352 const unsigned char *p1, *p2, *p1_lim;
3356 p1_lim = (const unsigned char *)a->mv_data;
3357 p1 = (const unsigned char *)a->mv_data + a->mv_size;
3358 p2 = (const unsigned char *)b->mv_data + b->mv_size;
3360 len_diff = (ssize_t) a->mv_size - (ssize_t) b->mv_size;
3366 while (p1 > p1_lim) {
3367 diff = *--p1 - *--p2;
3371 return len_diff<0 ? -1 : len_diff;
3374 /** Search for key within a page, using binary search.
3375 * Returns the smallest entry larger or equal to the key.
3376 * If exactp is non-null, stores whether the found entry was an exact match
3377 * in *exactp (1 or 0).
3378 * Updates the cursor index with the index of the found entry.
3379 * If no entry larger or equal to the key is found, returns NULL.
3382 mdb_node_search(MDB_cursor *mc, MDB_val *key, int *exactp)
3384 unsigned int i = 0, nkeys;
3387 MDB_page *mp = mc->mc_pg[mc->mc_top];
3388 MDB_node *node = NULL;
3393 nkeys = NUMKEYS(mp);
3398 COPY_PGNO(pgno, mp->mp_pgno);
3399 DPRINTF("searching %u keys in %s %spage %zu",
3400 nkeys, IS_LEAF(mp) ? "leaf" : "branch", IS_SUBP(mp) ? "sub-" : "",
3407 low = IS_LEAF(mp) ? 0 : 1;
3409 cmp = mc->mc_dbx->md_cmp;
3411 /* Branch pages have no data, so if using integer keys,
3412 * alignment is guaranteed. Use faster mdb_cmp_int.
3414 if (cmp == mdb_cmp_cint && IS_BRANCH(mp)) {
3415 if (NODEPTR(mp, 1)->mn_ksize == sizeof(size_t))
3422 nodekey.mv_size = mc->mc_db->md_pad;
3423 node = NODEPTR(mp, 0); /* fake */
3424 while (low <= high) {
3425 i = (low + high) >> 1;
3426 nodekey.mv_data = LEAF2KEY(mp, i, nodekey.mv_size);
3427 rc = cmp(key, &nodekey);
3428 DPRINTF("found leaf index %u [%s], rc = %i",
3429 i, DKEY(&nodekey), rc);
3438 while (low <= high) {
3439 i = (low + high) >> 1;
3441 node = NODEPTR(mp, i);
3442 nodekey.mv_size = NODEKSZ(node);
3443 nodekey.mv_data = NODEKEY(node);
3445 rc = cmp(key, &nodekey);
3448 DPRINTF("found leaf index %u [%s], rc = %i",
3449 i, DKEY(&nodekey), rc);
3451 DPRINTF("found branch index %u [%s -> %zu], rc = %i",
3452 i, DKEY(&nodekey), NODEPGNO(node), rc);
3463 if (rc > 0) { /* Found entry is less than the key. */
3464 i++; /* Skip to get the smallest entry larger than key. */
3466 node = NODEPTR(mp, i);
3469 *exactp = (rc == 0);
3470 /* store the key index */
3471 mc->mc_ki[mc->mc_top] = i;
3473 /* There is no entry larger or equal to the key. */
3476 /* nodeptr is fake for LEAF2 */
3482 mdb_cursor_adjust(MDB_cursor *mc, func)
3486 for (m2 = mc->mc_txn->mt_cursors[mc->mc_dbi]; m2; m2=m2->mc_next) {
3487 if (m2->mc_pg[m2->mc_top] == mc->mc_pg[mc->mc_top]) {
3494 /** Pop a page off the top of the cursor's stack. */
3496 mdb_cursor_pop(MDB_cursor *mc)
3500 MDB_page *top = mc->mc_pg[mc->mc_top];
3506 DPRINTF("popped page %zu off db %u cursor %p", top->mp_pgno,
3507 mc->mc_dbi, (void *) mc);
3511 /** Push a page onto the top of the cursor's stack. */
3513 mdb_cursor_push(MDB_cursor *mc, MDB_page *mp)
3515 DPRINTF("pushing page %zu on db %u cursor %p", mp->mp_pgno,
3516 mc->mc_dbi, (void *) mc);
3518 if (mc->mc_snum >= CURSOR_STACK) {
3519 assert(mc->mc_snum < CURSOR_STACK);
3520 return MDB_CURSOR_FULL;
3523 mc->mc_top = mc->mc_snum++;
3524 mc->mc_pg[mc->mc_top] = mp;
3525 mc->mc_ki[mc->mc_top] = 0;
3530 /** Find the address of the page corresponding to a given page number.
3531 * @param[in] txn the transaction for this access.
3532 * @param[in] pgno the page number for the page to retrieve.
3533 * @param[out] ret address of a pointer where the page's address will be stored.
3534 * @return 0 on success, non-zero on failure.
3537 mdb_page_get(MDB_txn *txn, pgno_t pgno, MDB_page **ret)
3541 if (txn->mt_env->me_flags & MDB_WRITEMAP) {
3542 if (pgno < txn->mt_next_pgno)
3543 p = (MDB_page *)(txn->mt_env->me_map + txn->mt_env->me_psize * pgno);
3546 if (!F_ISSET(txn->mt_flags, MDB_TXN_RDONLY) && txn->mt_u.dirty_list[0].mid) {
3548 x = mdb_mid2l_search(txn->mt_u.dirty_list, pgno);
3549 if (x <= txn->mt_u.dirty_list[0].mid && txn->mt_u.dirty_list[x].mid == pgno) {
3550 p = txn->mt_u.dirty_list[x].mptr;
3554 if (pgno < txn->mt_next_pgno)
3555 p = (MDB_page *)(txn->mt_env->me_map + txn->mt_env->me_psize * pgno);
3560 DPRINTF("page %zu not found", pgno);
3563 return (p != NULL) ? MDB_SUCCESS : MDB_PAGE_NOTFOUND;
3566 /** Search for the page a given key should be in.
3567 * Pushes parent pages on the cursor stack. This function continues a
3568 * search on a cursor that has already been initialized. (Usually by
3569 * #mdb_page_search() but also by #mdb_node_move().)
3570 * @param[in,out] mc the cursor for this operation.
3571 * @param[in] key the key to search for. If NULL, search for the lowest
3572 * page. (This is used by #mdb_cursor_first().)
3573 * @param[in] flags If MDB_PS_MODIFY set, visited pages are updated with new page numbers.
3574 * If MDB_PS_ROOTONLY set, just fetch root node, no further lookups.
3575 * @return 0 on success, non-zero on failure.
3578 mdb_page_search_root(MDB_cursor *mc, MDB_val *key, int modify)
3580 MDB_page *mp = mc->mc_pg[mc->mc_top];
3585 while (IS_BRANCH(mp)) {
3589 DPRINTF("branch page %zu has %u keys", mp->mp_pgno, NUMKEYS(mp));
3590 assert(NUMKEYS(mp) > 1);
3591 DPRINTF("found index 0 to page %zu", NODEPGNO(NODEPTR(mp, 0)));
3593 if (key == NULL) /* Initialize cursor to first page. */
3595 else if (key->mv_size > MAXKEYSIZE && key->mv_data == NULL) {
3596 /* cursor to last page */
3600 node = mdb_node_search(mc, key, &exact);
3602 i = NUMKEYS(mp) - 1;
3604 i = mc->mc_ki[mc->mc_top];
3613 DPRINTF("following index %u for key [%s]",
3615 assert(i < NUMKEYS(mp));
3616 node = NODEPTR(mp, i);
3618 if ((rc = mdb_page_get(mc->mc_txn, NODEPGNO(node), &mp)))
3621 mc->mc_ki[mc->mc_top] = i;
3622 if ((rc = mdb_cursor_push(mc, mp)))
3626 if ((rc = mdb_page_touch(mc)) != 0)
3628 mp = mc->mc_pg[mc->mc_top];
3633 DPRINTF("internal error, index points to a %02X page!?",
3635 return MDB_CORRUPTED;
3638 DPRINTF("found leaf page %zu for key [%s]", mp->mp_pgno,
3639 key ? DKEY(key) : NULL);
3644 /** Search for the page a given key should be in.
3645 * Pushes parent pages on the cursor stack. This function just sets up
3646 * the search; it finds the root page for \b mc's database and sets this
3647 * as the root of the cursor's stack. Then #mdb_page_search_root() is
3648 * called to complete the search.
3649 * @param[in,out] mc the cursor for this operation.
3650 * @param[in] key the key to search for. If NULL, search for the lowest
3651 * page. (This is used by #mdb_cursor_first().)
3652 * @param[in] modify If true, visited pages are updated with new page numbers.
3653 * @return 0 on success, non-zero on failure.
3656 mdb_page_search(MDB_cursor *mc, MDB_val *key, int flags)
3661 /* Make sure the txn is still viable, then find the root from
3662 * the txn's db table.
3664 if (F_ISSET(mc->mc_txn->mt_flags, MDB_TXN_ERROR)) {
3665 DPUTS("transaction has failed, must abort");
3668 /* Make sure we're using an up-to-date root */
3669 if (mc->mc_dbi > MAIN_DBI) {
3670 if ((*mc->mc_dbflag & DB_STALE) ||
3671 ((flags & MDB_PS_MODIFY) && !(*mc->mc_dbflag & DB_DIRTY))) {
3673 unsigned char dbflag = 0;
3674 mdb_cursor_init(&mc2, mc->mc_txn, MAIN_DBI, NULL);
3675 rc = mdb_page_search(&mc2, &mc->mc_dbx->md_name, flags & MDB_PS_MODIFY);
3678 if (*mc->mc_dbflag & DB_STALE) {
3681 MDB_node *leaf = mdb_node_search(&mc2,
3682 &mc->mc_dbx->md_name, &exact);
3684 return MDB_NOTFOUND;
3685 mdb_node_read(mc->mc_txn, leaf, &data);
3686 memcpy(mc->mc_db, data.mv_data, sizeof(MDB_db));
3688 if (flags & MDB_PS_MODIFY)
3690 *mc->mc_dbflag = dbflag;
3693 root = mc->mc_db->md_root;
3695 if (root == P_INVALID) { /* Tree is empty. */
3696 DPUTS("tree is empty");
3697 return MDB_NOTFOUND;
3702 if (!mc->mc_pg[0] || mc->mc_pg[0]->mp_pgno != root)
3703 if ((rc = mdb_page_get(mc->mc_txn, root, &mc->mc_pg[0])))
3709 DPRINTF("db %u root page %zu has flags 0x%X",
3710 mc->mc_dbi, root, mc->mc_pg[0]->mp_flags);
3712 if (flags & MDB_PS_MODIFY) {
3713 if ((rc = mdb_page_touch(mc)))
3717 if (flags & MDB_PS_ROOTONLY)
3720 return mdb_page_search_root(mc, key, flags);
3723 /** Return the data associated with a given node.
3724 * @param[in] txn The transaction for this operation.
3725 * @param[in] leaf The node being read.
3726 * @param[out] data Updated to point to the node's data.
3727 * @return 0 on success, non-zero on failure.
3730 mdb_node_read(MDB_txn *txn, MDB_node *leaf, MDB_val *data)
3732 MDB_page *omp; /* overflow page */
3736 if (!F_ISSET(leaf->mn_flags, F_BIGDATA)) {
3737 data->mv_size = NODEDSZ(leaf);
3738 data->mv_data = NODEDATA(leaf);
3742 /* Read overflow data.
3744 data->mv_size = NODEDSZ(leaf);
3745 memcpy(&pgno, NODEDATA(leaf), sizeof(pgno));
3746 if ((rc = mdb_page_get(txn, pgno, &omp))) {
3747 DPRINTF("read overflow page %zu failed", pgno);
3750 data->mv_data = METADATA(omp);
3756 mdb_get(MDB_txn *txn, MDB_dbi dbi,
3757 MDB_val *key, MDB_val *data)
3766 DPRINTF("===> get db %u key [%s]", dbi, DKEY(key));
3768 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs)
3771 if (key->mv_size == 0 || key->mv_size > MAXKEYSIZE) {
3775 mdb_cursor_init(&mc, txn, dbi, &mx);
3776 return mdb_cursor_set(&mc, key, data, MDB_SET, &exact);
3779 /** Find a sibling for a page.
3780 * Replaces the page at the top of the cursor's stack with the
3781 * specified sibling, if one exists.
3782 * @param[in] mc The cursor for this operation.
3783 * @param[in] move_right Non-zero if the right sibling is requested,
3784 * otherwise the left sibling.
3785 * @return 0 on success, non-zero on failure.
3788 mdb_cursor_sibling(MDB_cursor *mc, int move_right)
3794 if (mc->mc_snum < 2) {
3795 return MDB_NOTFOUND; /* root has no siblings */
3799 DPRINTF("parent page is page %zu, index %u",
3800 mc->mc_pg[mc->mc_top]->mp_pgno, mc->mc_ki[mc->mc_top]);
3802 if (move_right ? (mc->mc_ki[mc->mc_top] + 1u >= NUMKEYS(mc->mc_pg[mc->mc_top]))
3803 : (mc->mc_ki[mc->mc_top] == 0)) {
3804 DPRINTF("no more keys left, moving to %s sibling",
3805 move_right ? "right" : "left");
3806 if ((rc = mdb_cursor_sibling(mc, move_right)) != MDB_SUCCESS)
3810 mc->mc_ki[mc->mc_top]++;
3812 mc->mc_ki[mc->mc_top]--;
3813 DPRINTF("just moving to %s index key %u",
3814 move_right ? "right" : "left", mc->mc_ki[mc->mc_top]);
3816 assert(IS_BRANCH(mc->mc_pg[mc->mc_top]));
3818 indx = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
3819 if ((rc = mdb_page_get(mc->mc_txn, NODEPGNO(indx), &mp)))
3822 mdb_cursor_push(mc, mp);
3827 /** Move the cursor to the next data item. */
3829 mdb_cursor_next(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op)
3835 if (mc->mc_flags & C_EOF) {
3836 return MDB_NOTFOUND;
3839 assert(mc->mc_flags & C_INITIALIZED);
3841 mp = mc->mc_pg[mc->mc_top];
3843 if (mc->mc_db->md_flags & MDB_DUPSORT) {
3844 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
3845 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
3846 if (op == MDB_NEXT || op == MDB_NEXT_DUP) {
3847 rc = mdb_cursor_next(&mc->mc_xcursor->mx_cursor, data, NULL, MDB_NEXT);
3848 if (op != MDB_NEXT || rc == MDB_SUCCESS)
3852 mc->mc_xcursor->mx_cursor.mc_flags &= ~C_INITIALIZED;
3853 if (op == MDB_NEXT_DUP)
3854 return MDB_NOTFOUND;
3858 DPRINTF("cursor_next: top page is %zu in cursor %p", mp->mp_pgno, (void *) mc);
3860 if (mc->mc_ki[mc->mc_top] + 1u >= NUMKEYS(mp)) {
3861 DPUTS("=====> move to next sibling page");
3862 if (mdb_cursor_sibling(mc, 1) != MDB_SUCCESS) {
3863 mc->mc_flags |= C_EOF;
3864 mc->mc_flags &= ~C_INITIALIZED;
3865 return MDB_NOTFOUND;
3867 mp = mc->mc_pg[mc->mc_top];
3868 DPRINTF("next page is %zu, key index %u", mp->mp_pgno, mc->mc_ki[mc->mc_top]);
3870 mc->mc_ki[mc->mc_top]++;
3872 DPRINTF("==> cursor points to page %zu with %u keys, key index %u",
3873 mp->mp_pgno, NUMKEYS(mp), mc->mc_ki[mc->mc_top]);
3876 key->mv_size = mc->mc_db->md_pad;
3877 key->mv_data = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], key->mv_size);
3881 assert(IS_LEAF(mp));
3882 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
3884 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
3885 mdb_xcursor_init1(mc, leaf);
3888 if ((rc = mdb_node_read(mc->mc_txn, leaf, data) != MDB_SUCCESS))
3891 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
3892 rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
3893 if (rc != MDB_SUCCESS)
3898 MDB_SET_KEY(leaf, key);
3902 /** Move the cursor to the previous data item. */
3904 mdb_cursor_prev(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op)
3910 assert(mc->mc_flags & C_INITIALIZED);
3912 mp = mc->mc_pg[mc->mc_top];
3914 if (mc->mc_db->md_flags & MDB_DUPSORT) {
3915 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
3916 if (op == MDB_PREV || op == MDB_PREV_DUP) {
3917 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
3918 rc = mdb_cursor_prev(&mc->mc_xcursor->mx_cursor, data, NULL, MDB_PREV);
3919 if (op != MDB_PREV || rc == MDB_SUCCESS)
3922 mc->mc_xcursor->mx_cursor.mc_flags &= ~C_INITIALIZED;
3923 if (op == MDB_PREV_DUP)
3924 return MDB_NOTFOUND;
3929 DPRINTF("cursor_prev: top page is %zu in cursor %p", mp->mp_pgno, (void *) mc);
3931 if (mc->mc_ki[mc->mc_top] == 0) {
3932 DPUTS("=====> move to prev sibling page");
3933 if (mdb_cursor_sibling(mc, 0) != MDB_SUCCESS) {
3934 mc->mc_flags &= ~C_INITIALIZED;
3935 return MDB_NOTFOUND;
3937 mp = mc->mc_pg[mc->mc_top];
3938 mc->mc_ki[mc->mc_top] = NUMKEYS(mp) - 1;
3939 DPRINTF("prev page is %zu, key index %u", mp->mp_pgno, mc->mc_ki[mc->mc_top]);
3941 mc->mc_ki[mc->mc_top]--;
3943 mc->mc_flags &= ~C_EOF;
3945 DPRINTF("==> cursor points to page %zu with %u keys, key index %u",
3946 mp->mp_pgno, NUMKEYS(mp), mc->mc_ki[mc->mc_top]);
3949 key->mv_size = mc->mc_db->md_pad;
3950 key->mv_data = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], key->mv_size);
3954 assert(IS_LEAF(mp));
3955 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
3957 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
3958 mdb_xcursor_init1(mc, leaf);
3961 if ((rc = mdb_node_read(mc->mc_txn, leaf, data) != MDB_SUCCESS))
3964 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
3965 rc = mdb_cursor_last(&mc->mc_xcursor->mx_cursor, data, NULL);
3966 if (rc != MDB_SUCCESS)
3971 MDB_SET_KEY(leaf, key);
3975 /** Set the cursor on a specific data item. */
3977 mdb_cursor_set(MDB_cursor *mc, MDB_val *key, MDB_val *data,
3978 MDB_cursor_op op, int *exactp)
3982 MDB_node *leaf = NULL;
3987 assert(key->mv_size > 0);
3989 /* See if we're already on the right page */
3990 if (mc->mc_flags & C_INITIALIZED) {
3993 mp = mc->mc_pg[mc->mc_top];
3995 mc->mc_ki[mc->mc_top] = 0;
3996 return MDB_NOTFOUND;
3998 if (mp->mp_flags & P_LEAF2) {
3999 nodekey.mv_size = mc->mc_db->md_pad;
4000 nodekey.mv_data = LEAF2KEY(mp, 0, nodekey.mv_size);
4002 leaf = NODEPTR(mp, 0);
4003 MDB_SET_KEY(leaf, &nodekey);
4005 rc = mc->mc_dbx->md_cmp(key, &nodekey);
4007 /* Probably happens rarely, but first node on the page
4008 * was the one we wanted.
4010 mc->mc_ki[mc->mc_top] = 0;
4017 unsigned int nkeys = NUMKEYS(mp);
4019 if (mp->mp_flags & P_LEAF2) {
4020 nodekey.mv_data = LEAF2KEY(mp,
4021 nkeys-1, nodekey.mv_size);
4023 leaf = NODEPTR(mp, nkeys-1);
4024 MDB_SET_KEY(leaf, &nodekey);
4026 rc = mc->mc_dbx->md_cmp(key, &nodekey);
4028 /* last node was the one we wanted */
4029 mc->mc_ki[mc->mc_top] = nkeys-1;
4035 if (mc->mc_ki[mc->mc_top] < NUMKEYS(mp)) {
4036 /* This is definitely the right page, skip search_page */
4037 if (mp->mp_flags & P_LEAF2) {
4038 nodekey.mv_data = LEAF2KEY(mp,
4039 mc->mc_ki[mc->mc_top], nodekey.mv_size);
4041 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
4042 MDB_SET_KEY(leaf, &nodekey);
4044 rc = mc->mc_dbx->md_cmp(key, &nodekey);
4046 /* current node was the one we wanted */
4056 /* If any parents have right-sibs, search.
4057 * Otherwise, there's nothing further.
4059 for (i=0; i<mc->mc_top; i++)
4061 NUMKEYS(mc->mc_pg[i])-1)
4063 if (i == mc->mc_top) {
4064 /* There are no other pages */
4065 mc->mc_ki[mc->mc_top] = nkeys;
4066 return MDB_NOTFOUND;
4070 /* There are no other pages */
4071 mc->mc_ki[mc->mc_top] = 0;
4072 return MDB_NOTFOUND;
4076 rc = mdb_page_search(mc, key, 0);
4077 if (rc != MDB_SUCCESS)
4080 mp = mc->mc_pg[mc->mc_top];
4081 assert(IS_LEAF(mp));
4084 leaf = mdb_node_search(mc, key, exactp);
4085 if (exactp != NULL && !*exactp) {
4086 /* MDB_SET specified and not an exact match. */
4087 return MDB_NOTFOUND;
4091 DPUTS("===> inexact leaf not found, goto sibling");
4092 if ((rc = mdb_cursor_sibling(mc, 1)) != MDB_SUCCESS)
4093 return rc; /* no entries matched */
4094 mp = mc->mc_pg[mc->mc_top];
4095 assert(IS_LEAF(mp));
4096 leaf = NODEPTR(mp, 0);
4100 mc->mc_flags |= C_INITIALIZED;
4101 mc->mc_flags &= ~C_EOF;
4104 key->mv_size = mc->mc_db->md_pad;
4105 key->mv_data = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], key->mv_size);
4109 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4110 mdb_xcursor_init1(mc, leaf);
4113 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4114 if (op == MDB_SET || op == MDB_SET_RANGE) {
4115 rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
4118 if (op == MDB_GET_BOTH) {
4124 rc = mdb_cursor_set(&mc->mc_xcursor->mx_cursor, data, NULL, MDB_SET_RANGE, ex2p);
4125 if (rc != MDB_SUCCESS)
4128 } else if (op == MDB_GET_BOTH || op == MDB_GET_BOTH_RANGE) {
4130 if ((rc = mdb_node_read(mc->mc_txn, leaf, &d2)) != MDB_SUCCESS)
4132 rc = mc->mc_dbx->md_dcmp(data, &d2);
4134 if (op == MDB_GET_BOTH || rc > 0)
4135 return MDB_NOTFOUND;
4140 mc->mc_xcursor->mx_cursor.mc_flags &= ~C_INITIALIZED;
4141 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
4146 /* The key already matches in all other cases */
4147 if (op == MDB_SET_RANGE)
4148 MDB_SET_KEY(leaf, key);
4149 DPRINTF("==> cursor placed on key [%s]", DKEY(key));
4154 /** Move the cursor to the first item in the database. */
4156 mdb_cursor_first(MDB_cursor *mc, MDB_val *key, MDB_val *data)
4161 if (!(mc->mc_flags & C_INITIALIZED) || mc->mc_top) {
4162 rc = mdb_page_search(mc, NULL, 0);
4163 if (rc != MDB_SUCCESS)
4166 assert(IS_LEAF(mc->mc_pg[mc->mc_top]));
4168 leaf = NODEPTR(mc->mc_pg[mc->mc_top], 0);
4169 mc->mc_flags |= C_INITIALIZED;
4170 mc->mc_flags &= ~C_EOF;
4172 mc->mc_ki[mc->mc_top] = 0;
4174 if (IS_LEAF2(mc->mc_pg[mc->mc_top])) {
4175 key->mv_size = mc->mc_db->md_pad;
4176 key->mv_data = LEAF2KEY(mc->mc_pg[mc->mc_top], 0, key->mv_size);
4181 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4182 mdb_xcursor_init1(mc, leaf);
4183 rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
4188 mc->mc_xcursor->mx_cursor.mc_flags &= ~C_INITIALIZED;
4189 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
4193 MDB_SET_KEY(leaf, key);
4197 /** Move the cursor to the last item in the database. */
4199 mdb_cursor_last(MDB_cursor *mc, MDB_val *key, MDB_val *data)
4204 if (!(mc->mc_flags & C_EOF)) {
4206 if (!(mc->mc_flags & C_INITIALIZED) || mc->mc_top) {
4209 lkey.mv_size = MAXKEYSIZE+1;
4210 lkey.mv_data = NULL;
4211 rc = mdb_page_search(mc, &lkey, 0);
4212 if (rc != MDB_SUCCESS)
4215 assert(IS_LEAF(mc->mc_pg[mc->mc_top]));
4217 mc->mc_ki[mc->mc_top] = NUMKEYS(mc->mc_pg[mc->mc_top]) - 1;
4218 mc->mc_flags |= C_INITIALIZED|C_EOF;
4220 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
4222 if (IS_LEAF2(mc->mc_pg[mc->mc_top])) {
4223 key->mv_size = mc->mc_db->md_pad;
4224 key->mv_data = LEAF2KEY(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], key->mv_size);
4229 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4230 mdb_xcursor_init1(mc, leaf);
4231 rc = mdb_cursor_last(&mc->mc_xcursor->mx_cursor, data, NULL);
4236 mc->mc_xcursor->mx_cursor.mc_flags &= ~C_INITIALIZED;
4237 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
4242 MDB_SET_KEY(leaf, key);
4247 mdb_cursor_get(MDB_cursor *mc, MDB_val *key, MDB_val *data,
4257 case MDB_GET_BOTH_RANGE:
4258 if (data == NULL || mc->mc_xcursor == NULL) {
4265 if (key == NULL || key->mv_size == 0 || key->mv_size > MAXKEYSIZE) {
4267 } else if (op == MDB_SET_RANGE)
4268 rc = mdb_cursor_set(mc, key, data, op, NULL);
4270 rc = mdb_cursor_set(mc, key, data, op, &exact);
4272 case MDB_GET_MULTIPLE:
4274 !(mc->mc_db->md_flags & MDB_DUPFIXED) ||
4275 !(mc->mc_flags & C_INITIALIZED)) {
4280 if (!(mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED) ||
4281 (mc->mc_xcursor->mx_cursor.mc_flags & C_EOF))
4284 case MDB_NEXT_MULTIPLE:
4286 !(mc->mc_db->md_flags & MDB_DUPFIXED)) {
4290 if (!(mc->mc_flags & C_INITIALIZED))
4291 rc = mdb_cursor_first(mc, key, data);
4293 rc = mdb_cursor_next(mc, key, data, MDB_NEXT_DUP);
4294 if (rc == MDB_SUCCESS) {
4295 if (mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED) {
4298 mx = &mc->mc_xcursor->mx_cursor;
4299 data->mv_size = NUMKEYS(mx->mc_pg[mx->mc_top]) *
4301 data->mv_data = METADATA(mx->mc_pg[mx->mc_top]);
4302 mx->mc_ki[mx->mc_top] = NUMKEYS(mx->mc_pg[mx->mc_top])-1;
4310 case MDB_NEXT_NODUP:
4311 if (!(mc->mc_flags & C_INITIALIZED))
4312 rc = mdb_cursor_first(mc, key, data);
4314 rc = mdb_cursor_next(mc, key, data, op);
4318 case MDB_PREV_NODUP:
4319 if (!(mc->mc_flags & C_INITIALIZED) || (mc->mc_flags & C_EOF)) {
4320 rc = mdb_cursor_last(mc, key, data);
4321 mc->mc_flags &= ~C_EOF;
4323 rc = mdb_cursor_prev(mc, key, data, op);
4326 rc = mdb_cursor_first(mc, key, data);
4330 !(mc->mc_db->md_flags & MDB_DUPSORT) ||
4331 !(mc->mc_flags & C_INITIALIZED) ||
4332 !(mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED)) {
4336 rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
4339 rc = mdb_cursor_last(mc, key, data);
4343 !(mc->mc_db->md_flags & MDB_DUPSORT) ||
4344 !(mc->mc_flags & C_INITIALIZED) ||
4345 !(mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED)) {
4349 rc = mdb_cursor_last(&mc->mc_xcursor->mx_cursor, data, NULL);
4352 DPRINTF("unhandled/unimplemented cursor operation %u", op);
4360 /** Touch all the pages in the cursor stack.
4361 * Makes sure all the pages are writable, before attempting a write operation.
4362 * @param[in] mc The cursor to operate on.
4365 mdb_cursor_touch(MDB_cursor *mc)
4369 if (mc->mc_dbi > MAIN_DBI && !(*mc->mc_dbflag & DB_DIRTY)) {
4371 mdb_cursor_init(&mc2, mc->mc_txn, MAIN_DBI, NULL);
4372 rc = mdb_page_search(&mc2, &mc->mc_dbx->md_name, MDB_PS_MODIFY);
4375 *mc->mc_dbflag = DB_DIRTY;
4377 for (mc->mc_top = 0; mc->mc_top < mc->mc_snum; mc->mc_top++) {
4378 rc = mdb_page_touch(mc);
4382 mc->mc_top = mc->mc_snum-1;
4387 mdb_cursor_put(MDB_cursor *mc, MDB_val *key, MDB_val *data,
4390 MDB_node *leaf = NULL;
4391 MDB_val xdata, *rdata, dkey;
4394 int do_sub = 0, insert = 0;
4395 unsigned int mcount = 0;
4399 char dbuf[MAXKEYSIZE+1];
4400 unsigned int nflags;
4403 if (F_ISSET(mc->mc_txn->mt_flags, MDB_TXN_RDONLY))
4406 DPRINTF("==> put db %u key [%s], size %zu, data size %zu",
4407 mc->mc_dbi, DKEY(key), key ? key->mv_size:0, data->mv_size);
4411 if (flags == MDB_CURRENT) {
4412 if (!(mc->mc_flags & C_INITIALIZED))
4415 } else if (mc->mc_db->md_root == P_INVALID) {
4417 /* new database, write a root leaf page */
4418 DPUTS("allocating new root leaf page");
4419 if ((rc = mdb_page_new(mc, P_LEAF, 1, &np))) {
4423 mdb_cursor_push(mc, np);
4424 mc->mc_db->md_root = np->mp_pgno;
4425 mc->mc_db->md_depth++;
4426 *mc->mc_dbflag = DB_DIRTY;
4427 if ((mc->mc_db->md_flags & (MDB_DUPSORT|MDB_DUPFIXED))
4429 np->mp_flags |= P_LEAF2;
4430 mc->mc_flags |= C_INITIALIZED;
4436 if (flags & MDB_APPEND) {
4438 rc = mdb_cursor_last(mc, &k2, &d2);
4440 rc = mc->mc_dbx->md_cmp(key, &k2);
4443 mc->mc_ki[mc->mc_top]++;
4449 rc = mdb_cursor_set(mc, key, &d2, MDB_SET, &exact);
4451 if ((flags & MDB_NOOVERWRITE) && rc == 0) {
4452 DPRINTF("duplicate key [%s]", DKEY(key));
4454 return MDB_KEYEXIST;
4456 if (rc && rc != MDB_NOTFOUND)
4460 /* Cursor is positioned, now make sure all pages are writable */
4461 rc2 = mdb_cursor_touch(mc);
4466 /* The key already exists */
4467 if (rc == MDB_SUCCESS) {
4468 /* there's only a key anyway, so this is a no-op */
4469 if (IS_LEAF2(mc->mc_pg[mc->mc_top])) {
4470 unsigned int ksize = mc->mc_db->md_pad;
4471 if (key->mv_size != ksize)
4473 if (flags == MDB_CURRENT) {
4474 char *ptr = LEAF2KEY(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], ksize);
4475 memcpy(ptr, key->mv_data, ksize);
4480 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
4483 if (F_ISSET(mc->mc_db->md_flags, MDB_DUPSORT)) {
4484 /* Was a single item before, must convert now */
4486 if (!F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4487 /* Just overwrite the current item */
4488 if (flags == MDB_CURRENT)
4491 dkey.mv_size = NODEDSZ(leaf);
4492 dkey.mv_data = NODEDATA(leaf);
4493 #if UINT_MAX < SIZE_MAX
4494 if (mc->mc_dbx->md_dcmp == mdb_cmp_int && dkey.mv_size == sizeof(size_t))
4495 #ifdef MISALIGNED_OK
4496 mc->mc_dbx->md_dcmp = mdb_cmp_long;
4498 mc->mc_dbx->md_dcmp = mdb_cmp_cint;
4501 /* if data matches, ignore it */
4502 if (!mc->mc_dbx->md_dcmp(data, &dkey))
4503 return (flags == MDB_NODUPDATA) ? MDB_KEYEXIST : MDB_SUCCESS;
4505 /* create a fake page for the dup items */
4506 memcpy(dbuf, dkey.mv_data, dkey.mv_size);
4507 dkey.mv_data = dbuf;
4508 fp = (MDB_page *)&pbuf;
4509 fp->mp_pgno = mc->mc_pg[mc->mc_top]->mp_pgno;
4510 fp->mp_flags = P_LEAF|P_DIRTY|P_SUBP;
4511 fp->mp_lower = PAGEHDRSZ;
4512 fp->mp_upper = PAGEHDRSZ + dkey.mv_size + data->mv_size;
4513 if (mc->mc_db->md_flags & MDB_DUPFIXED) {
4514 fp->mp_flags |= P_LEAF2;
4515 fp->mp_pad = data->mv_size;
4516 fp->mp_upper += 2 * data->mv_size; /* leave space for 2 more */
4518 fp->mp_upper += 2 * sizeof(indx_t) + 2 * NODESIZE +
4519 (dkey.mv_size & 1) + (data->mv_size & 1);
4521 mdb_node_del(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], 0);
4524 xdata.mv_size = fp->mp_upper;
4529 if (!F_ISSET(leaf->mn_flags, F_SUBDATA)) {
4530 /* See if we need to convert from fake page to subDB */
4532 unsigned int offset;
4535 fp = NODEDATA(leaf);
4536 if (flags == MDB_CURRENT) {
4538 fp->mp_flags |= P_DIRTY;
4539 COPY_PGNO(fp->mp_pgno, mc->mc_pg[mc->mc_top]->mp_pgno);
4540 mc->mc_xcursor->mx_cursor.mc_pg[0] = fp;
4544 if (mc->mc_db->md_flags & MDB_DUPFIXED) {
4545 offset = fp->mp_pad;
4546 if (SIZELEFT(fp) >= offset)
4548 offset *= 4; /* space for 4 more */
4550 offset = NODESIZE + sizeof(indx_t) + data->mv_size;
4552 offset += offset & 1;
4553 if (NODESIZE + sizeof(indx_t) + NODEKSZ(leaf) + NODEDSZ(leaf) +
4554 offset >= (mc->mc_txn->mt_env->me_psize - PAGEHDRSZ) /
4556 /* yes, convert it */
4558 if (mc->mc_db->md_flags & MDB_DUPFIXED) {
4559 dummy.md_pad = fp->mp_pad;
4560 dummy.md_flags = MDB_DUPFIXED;
4561 if (mc->mc_db->md_flags & MDB_INTEGERDUP)
4562 dummy.md_flags |= MDB_INTEGERKEY;
4565 dummy.md_branch_pages = 0;
4566 dummy.md_leaf_pages = 1;
4567 dummy.md_overflow_pages = 0;
4568 dummy.md_entries = NUMKEYS(fp);
4570 xdata.mv_size = sizeof(MDB_db);
4571 xdata.mv_data = &dummy;
4572 if ((rc = mdb_page_alloc(mc, 1, &mp)))
4574 offset = mc->mc_txn->mt_env->me_psize - NODEDSZ(leaf);
4575 flags |= F_DUPDATA|F_SUBDATA;
4576 dummy.md_root = mp->mp_pgno;
4578 /* no, just grow it */
4580 xdata.mv_size = NODEDSZ(leaf) + offset;
4581 xdata.mv_data = &pbuf;
4582 mp = (MDB_page *)&pbuf;
4583 mp->mp_pgno = mc->mc_pg[mc->mc_top]->mp_pgno;
4586 mp->mp_flags = fp->mp_flags | P_DIRTY;
4587 mp->mp_pad = fp->mp_pad;
4588 mp->mp_lower = fp->mp_lower;
4589 mp->mp_upper = fp->mp_upper + offset;
4591 memcpy(METADATA(mp), METADATA(fp), NUMKEYS(fp) * fp->mp_pad);
4593 nsize = NODEDSZ(leaf) - fp->mp_upper;
4594 memcpy((char *)mp + mp->mp_upper, (char *)fp + fp->mp_upper, nsize);
4595 for (i=0; i<NUMKEYS(fp); i++)
4596 mp->mp_ptrs[i] = fp->mp_ptrs[i] + offset;
4598 mdb_node_del(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], 0);
4602 /* data is on sub-DB, just store it */
4603 flags |= F_DUPDATA|F_SUBDATA;
4607 /* overflow page overwrites need special handling */
4608 if (F_ISSET(leaf->mn_flags, F_BIGDATA)) {
4611 int ovpages, dpages;
4613 ovpages = OVPAGES(NODEDSZ(leaf), mc->mc_txn->mt_env->me_psize);
4614 dpages = OVPAGES(data->mv_size, mc->mc_txn->mt_env->me_psize);
4615 memcpy(&pg, NODEDATA(leaf), sizeof(pg));
4616 mdb_page_get(mc->mc_txn, pg, &omp);
4617 /* Is the ov page writable and large enough? */
4618 if ((omp->mp_flags & P_DIRTY) && ovpages >= dpages) {
4619 /* yes, overwrite it. Note in this case we don't
4620 * bother to try shrinking the node if the new data
4621 * is smaller than the overflow threshold.
4623 if (F_ISSET(flags, MDB_RESERVE))
4624 data->mv_data = METADATA(omp);
4626 memcpy(METADATA(omp), data->mv_data, data->mv_size);
4629 /* no, free ovpages */
4631 mc->mc_db->md_overflow_pages -= ovpages;
4632 for (i=0; i<ovpages; i++) {
4633 DPRINTF("freed ov page %zu", pg);
4634 mdb_midl_append(&mc->mc_txn->mt_free_pgs, pg);
4638 } else if (NODEDSZ(leaf) == data->mv_size) {
4639 /* same size, just replace it. Note that we could
4640 * also reuse this node if the new data is smaller,
4641 * but instead we opt to shrink the node in that case.
4643 if (F_ISSET(flags, MDB_RESERVE))
4644 data->mv_data = NODEDATA(leaf);
4646 memcpy(NODEDATA(leaf), data->mv_data, data->mv_size);
4649 mdb_node_del(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], 0);
4650 mc->mc_db->md_entries--;
4652 DPRINTF("inserting key at index %i", mc->mc_ki[mc->mc_top]);
4659 nflags = flags & NODE_ADD_FLAGS;
4660 nsize = IS_LEAF2(mc->mc_pg[mc->mc_top]) ? key->mv_size : mdb_leaf_size(mc->mc_txn->mt_env, key, rdata);
4661 if (SIZELEFT(mc->mc_pg[mc->mc_top]) < nsize) {
4662 if (( flags & (F_DUPDATA|F_SUBDATA)) == F_DUPDATA )
4663 nflags &= ~MDB_APPEND;
4665 nflags |= MDB_SPLIT_REPLACE;
4666 rc = mdb_page_split(mc, key, rdata, P_INVALID, nflags);
4668 /* There is room already in this leaf page. */
4669 rc = mdb_node_add(mc, mc->mc_ki[mc->mc_top], key, rdata, 0, nflags);
4670 if (rc == 0 && !do_sub && insert) {
4671 /* Adjust other cursors pointing to mp */
4672 MDB_cursor *m2, *m3;
4673 MDB_dbi dbi = mc->mc_dbi;
4674 unsigned i = mc->mc_top;
4675 MDB_page *mp = mc->mc_pg[i];
4677 if (mc->mc_flags & C_SUB)
4680 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
4681 if (mc->mc_flags & C_SUB)
4682 m3 = &m2->mc_xcursor->mx_cursor;
4685 if (m3 == mc || m3->mc_snum < mc->mc_snum) continue;
4686 if (m3->mc_pg[i] == mp && m3->mc_ki[i] >= mc->mc_ki[i]) {
4693 if (rc != MDB_SUCCESS)
4694 mc->mc_txn->mt_flags |= MDB_TXN_ERROR;
4696 /* Now store the actual data in the child DB. Note that we're
4697 * storing the user data in the keys field, so there are strict
4698 * size limits on dupdata. The actual data fields of the child
4699 * DB are all zero size.
4706 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
4707 if (flags & MDB_CURRENT) {
4708 xflags = MDB_CURRENT;
4710 mdb_xcursor_init1(mc, leaf);
4711 xflags = (flags & MDB_NODUPDATA) ? MDB_NOOVERWRITE : 0;
4713 /* converted, write the original data first */
4715 rc = mdb_cursor_put(&mc->mc_xcursor->mx_cursor, &dkey, &xdata, xflags);
4719 /* Adjust other cursors pointing to mp */
4721 unsigned i = mc->mc_top;
4722 MDB_page *mp = mc->mc_pg[i];
4724 for (m2 = mc->mc_txn->mt_cursors[mc->mc_dbi]; m2; m2=m2->mc_next) {
4725 if (m2 == mc || m2->mc_snum < mc->mc_snum) continue;
4726 if (m2->mc_pg[i] == mp && m2->mc_ki[i] == mc->mc_ki[i]) {
4727 mdb_xcursor_init1(m2, leaf);
4732 if (flags & MDB_APPENDDUP)
4733 xflags |= MDB_APPEND;
4734 rc = mdb_cursor_put(&mc->mc_xcursor->mx_cursor, data, &xdata, xflags);
4735 if (flags & F_SUBDATA) {
4736 void *db = NODEDATA(leaf);
4737 memcpy(db, &mc->mc_xcursor->mx_db, sizeof(MDB_db));
4740 /* sub-writes might have failed so check rc again.
4741 * Don't increment count if we just replaced an existing item.
4743 if (!rc && !(flags & MDB_CURRENT))
4744 mc->mc_db->md_entries++;
4745 if (flags & MDB_MULTIPLE) {
4747 if (mcount < data[1].mv_size) {
4748 data[0].mv_data = (char *)data[0].mv_data + data[0].mv_size;
4749 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
4759 mdb_cursor_del(MDB_cursor *mc, unsigned int flags)
4764 if (F_ISSET(mc->mc_txn->mt_flags, MDB_TXN_RDONLY))
4767 if (!mc->mc_flags & C_INITIALIZED)
4770 rc = mdb_cursor_touch(mc);
4774 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
4776 if (!IS_LEAF2(mc->mc_pg[mc->mc_top]) && F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4777 if (flags != MDB_NODUPDATA) {
4778 if (!F_ISSET(leaf->mn_flags, F_SUBDATA)) {
4779 mc->mc_xcursor->mx_cursor.mc_pg[0] = NODEDATA(leaf);
4781 rc = mdb_cursor_del(&mc->mc_xcursor->mx_cursor, 0);
4782 /* If sub-DB still has entries, we're done */
4783 if (mc->mc_xcursor->mx_db.md_entries) {
4784 if (leaf->mn_flags & F_SUBDATA) {
4785 /* update subDB info */
4786 void *db = NODEDATA(leaf);
4787 memcpy(db, &mc->mc_xcursor->mx_db, sizeof(MDB_db));
4789 /* shrink fake page */
4790 mdb_node_shrink(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
4792 mc->mc_db->md_entries--;
4795 /* otherwise fall thru and delete the sub-DB */
4798 if (leaf->mn_flags & F_SUBDATA) {
4799 /* add all the child DB's pages to the free list */
4800 rc = mdb_drop0(&mc->mc_xcursor->mx_cursor, 0);
4801 if (rc == MDB_SUCCESS) {
4802 mc->mc_db->md_entries -=
4803 mc->mc_xcursor->mx_db.md_entries;
4808 return mdb_cursor_del0(mc, leaf);
4811 /** Allocate and initialize new pages for a database.
4812 * @param[in] mc a cursor on the database being added to.
4813 * @param[in] flags flags defining what type of page is being allocated.
4814 * @param[in] num the number of pages to allocate. This is usually 1,
4815 * unless allocating overflow pages for a large record.
4816 * @param[out] mp Address of a page, or NULL on failure.
4817 * @return 0 on success, non-zero on failure.
4820 mdb_page_new(MDB_cursor *mc, uint32_t flags, int num, MDB_page **mp)
4825 if ((rc = mdb_page_alloc(mc, num, &np)))
4827 DPRINTF("allocated new mpage %zu, page size %u",
4828 np->mp_pgno, mc->mc_txn->mt_env->me_psize);
4829 np->mp_flags = flags | P_DIRTY;
4830 np->mp_lower = PAGEHDRSZ;
4831 np->mp_upper = mc->mc_txn->mt_env->me_psize;
4834 mc->mc_db->md_branch_pages++;
4835 else if (IS_LEAF(np))
4836 mc->mc_db->md_leaf_pages++;
4837 else if (IS_OVERFLOW(np)) {
4838 mc->mc_db->md_overflow_pages += num;
4846 /** Calculate the size of a leaf node.
4847 * The size depends on the environment's page size; if a data item
4848 * is too large it will be put onto an overflow page and the node
4849 * size will only include the key and not the data. Sizes are always
4850 * rounded up to an even number of bytes, to guarantee 2-byte alignment
4851 * of the #MDB_node headers.
4852 * @param[in] env The environment handle.
4853 * @param[in] key The key for the node.
4854 * @param[in] data The data for the node.
4855 * @return The number of bytes needed to store the node.
4858 mdb_leaf_size(MDB_env *env, MDB_val *key, MDB_val *data)
4862 sz = LEAFSIZE(key, data);
4863 if (sz >= env->me_psize / MDB_MINKEYS) {
4864 /* put on overflow page */
4865 sz -= data->mv_size - sizeof(pgno_t);
4869 return sz + sizeof(indx_t);
4872 /** Calculate the size of a branch node.
4873 * The size should depend on the environment's page size but since
4874 * we currently don't support spilling large keys onto overflow
4875 * pages, it's simply the size of the #MDB_node header plus the
4876 * size of the key. Sizes are always rounded up to an even number
4877 * of bytes, to guarantee 2-byte alignment of the #MDB_node headers.
4878 * @param[in] env The environment handle.
4879 * @param[in] key The key for the node.
4880 * @return The number of bytes needed to store the node.
4883 mdb_branch_size(MDB_env *env, MDB_val *key)
4888 if (sz >= env->me_psize / MDB_MINKEYS) {
4889 /* put on overflow page */
4890 /* not implemented */
4891 /* sz -= key->size - sizeof(pgno_t); */
4894 return sz + sizeof(indx_t);
4897 /** Add a node to the page pointed to by the cursor.
4898 * @param[in] mc The cursor for this operation.
4899 * @param[in] indx The index on the page where the new node should be added.
4900 * @param[in] key The key for the new node.
4901 * @param[in] data The data for the new node, if any.
4902 * @param[in] pgno The page number, if adding a branch node.
4903 * @param[in] flags Flags for the node.
4904 * @return 0 on success, non-zero on failure. Possible errors are:
4906 * <li>ENOMEM - failed to allocate overflow pages for the node.
4907 * <li>MDB_PAGE_FULL - there is insufficient room in the page. This error
4908 * should never happen since all callers already calculate the
4909 * page's free space before calling this function.
4913 mdb_node_add(MDB_cursor *mc, indx_t indx,
4914 MDB_val *key, MDB_val *data, pgno_t pgno, unsigned int flags)
4917 size_t node_size = NODESIZE;
4920 MDB_page *mp = mc->mc_pg[mc->mc_top];
4921 MDB_page *ofp = NULL; /* overflow page */
4924 assert(mp->mp_upper >= mp->mp_lower);
4926 DPRINTF("add to %s %spage %zu index %i, data size %zu key size %zu [%s]",
4927 IS_LEAF(mp) ? "leaf" : "branch",
4928 IS_SUBP(mp) ? "sub-" : "",
4929 mp->mp_pgno, indx, data ? data->mv_size : 0,
4930 key ? key->mv_size : 0, key ? DKEY(key) : NULL);
4933 /* Move higher keys up one slot. */
4934 int ksize = mc->mc_db->md_pad, dif;
4935 char *ptr = LEAF2KEY(mp, indx, ksize);
4936 dif = NUMKEYS(mp) - indx;
4938 memmove(ptr+ksize, ptr, dif*ksize);
4939 /* insert new key */
4940 memcpy(ptr, key->mv_data, ksize);
4942 /* Just using these for counting */
4943 mp->mp_lower += sizeof(indx_t);
4944 mp->mp_upper -= ksize - sizeof(indx_t);
4949 node_size += key->mv_size;
4953 if (F_ISSET(flags, F_BIGDATA)) {
4954 /* Data already on overflow page. */
4955 node_size += sizeof(pgno_t);
4956 } else if (node_size + data->mv_size >= mc->mc_txn->mt_env->me_psize / MDB_MINKEYS) {
4957 int ovpages = OVPAGES(data->mv_size, mc->mc_txn->mt_env->me_psize);
4959 /* Put data on overflow page. */
4960 DPRINTF("data size is %zu, node would be %zu, put data on overflow page",
4961 data->mv_size, node_size+data->mv_size);
4962 node_size += sizeof(pgno_t);
4963 if ((rc = mdb_page_new(mc, P_OVERFLOW, ovpages, &ofp)))
4965 DPRINTF("allocated overflow page %zu", ofp->mp_pgno);
4968 node_size += data->mv_size;
4971 node_size += node_size & 1;
4973 if (node_size + sizeof(indx_t) > SIZELEFT(mp)) {
4974 DPRINTF("not enough room in page %zu, got %u ptrs",
4975 mp->mp_pgno, NUMKEYS(mp));
4976 DPRINTF("upper - lower = %u - %u = %u", mp->mp_upper, mp->mp_lower,
4977 mp->mp_upper - mp->mp_lower);
4978 DPRINTF("node size = %zu", node_size);
4979 return MDB_PAGE_FULL;
4982 /* Move higher pointers up one slot. */
4983 for (i = NUMKEYS(mp); i > indx; i--)
4984 mp->mp_ptrs[i] = mp->mp_ptrs[i - 1];
4986 /* Adjust free space offsets. */
4987 ofs = mp->mp_upper - node_size;
4988 assert(ofs >= mp->mp_lower + sizeof(indx_t));
4989 mp->mp_ptrs[indx] = ofs;
4991 mp->mp_lower += sizeof(indx_t);
4993 /* Write the node data. */
4994 node = NODEPTR(mp, indx);
4995 node->mn_ksize = (key == NULL) ? 0 : key->mv_size;
4996 node->mn_flags = flags;
4998 SETDSZ(node,data->mv_size);
5003 memcpy(NODEKEY(node), key->mv_data, key->mv_size);
5008 if (F_ISSET(flags, F_BIGDATA))
5009 memcpy(node->mn_data + key->mv_size, data->mv_data,
5011 else if (F_ISSET(flags, MDB_RESERVE))
5012 data->mv_data = node->mn_data + key->mv_size;
5014 memcpy(node->mn_data + key->mv_size, data->mv_data,
5017 memcpy(node->mn_data + key->mv_size, &ofp->mp_pgno,
5019 if (F_ISSET(flags, MDB_RESERVE))
5020 data->mv_data = METADATA(ofp);
5022 memcpy(METADATA(ofp), data->mv_data, data->mv_size);
5029 /** Delete the specified node from a page.
5030 * @param[in] mp The page to operate on.
5031 * @param[in] indx The index of the node to delete.
5032 * @param[in] ksize The size of a node. Only used if the page is
5033 * part of a #MDB_DUPFIXED database.
5036 mdb_node_del(MDB_page *mp, indx_t indx, int ksize)
5039 indx_t i, j, numkeys, ptr;
5046 COPY_PGNO(pgno, mp->mp_pgno);
5047 DPRINTF("delete node %u on %s page %zu", indx,
5048 IS_LEAF(mp) ? "leaf" : "branch", pgno);
5051 assert(indx < NUMKEYS(mp));
5054 int x = NUMKEYS(mp) - 1 - indx;
5055 base = LEAF2KEY(mp, indx, ksize);
5057 memmove(base, base + ksize, x * ksize);
5058 mp->mp_lower -= sizeof(indx_t);
5059 mp->mp_upper += ksize - sizeof(indx_t);
5063 node = NODEPTR(mp, indx);
5064 sz = NODESIZE + node->mn_ksize;
5066 if (F_ISSET(node->mn_flags, F_BIGDATA))
5067 sz += sizeof(pgno_t);
5069 sz += NODEDSZ(node);
5073 ptr = mp->mp_ptrs[indx];
5074 numkeys = NUMKEYS(mp);
5075 for (i = j = 0; i < numkeys; i++) {
5077 mp->mp_ptrs[j] = mp->mp_ptrs[i];
5078 if (mp->mp_ptrs[i] < ptr)
5079 mp->mp_ptrs[j] += sz;
5084 base = (char *)mp + mp->mp_upper;
5085 memmove(base + sz, base, ptr - mp->mp_upper);
5087 mp->mp_lower -= sizeof(indx_t);
5091 /** Compact the main page after deleting a node on a subpage.
5092 * @param[in] mp The main page to operate on.
5093 * @param[in] indx The index of the subpage on the main page.
5096 mdb_node_shrink(MDB_page *mp, indx_t indx)
5103 indx_t i, numkeys, ptr;
5105 node = NODEPTR(mp, indx);
5106 sp = (MDB_page *)NODEDATA(node);
5107 osize = NODEDSZ(node);
5109 delta = sp->mp_upper - sp->mp_lower;
5110 SETDSZ(node, osize - delta);
5111 xp = (MDB_page *)((char *)sp + delta);
5113 /* shift subpage upward */
5115 nsize = NUMKEYS(sp) * sp->mp_pad;
5116 memmove(METADATA(xp), METADATA(sp), nsize);
5119 nsize = osize - sp->mp_upper;
5120 numkeys = NUMKEYS(sp);
5121 for (i=numkeys-1; i>=0; i--)
5122 xp->mp_ptrs[i] = sp->mp_ptrs[i] - delta;
5124 xp->mp_upper = sp->mp_lower;
5125 xp->mp_lower = sp->mp_lower;
5126 xp->mp_flags = sp->mp_flags;
5127 xp->mp_pad = sp->mp_pad;
5128 COPY_PGNO(xp->mp_pgno, mp->mp_pgno);
5130 /* shift lower nodes upward */
5131 ptr = mp->mp_ptrs[indx];
5132 numkeys = NUMKEYS(mp);
5133 for (i = 0; i < numkeys; i++) {
5134 if (mp->mp_ptrs[i] <= ptr)
5135 mp->mp_ptrs[i] += delta;
5138 base = (char *)mp + mp->mp_upper;
5139 memmove(base + delta, base, ptr - mp->mp_upper + NODESIZE + NODEKSZ(node));
5140 mp->mp_upper += delta;
5143 /** Initial setup of a sorted-dups cursor.
5144 * Sorted duplicates are implemented as a sub-database for the given key.
5145 * The duplicate data items are actually keys of the sub-database.
5146 * Operations on the duplicate data items are performed using a sub-cursor
5147 * initialized when the sub-database is first accessed. This function does
5148 * the preliminary setup of the sub-cursor, filling in the fields that
5149 * depend only on the parent DB.
5150 * @param[in] mc The main cursor whose sorted-dups cursor is to be initialized.
5153 mdb_xcursor_init0(MDB_cursor *mc)
5155 MDB_xcursor *mx = mc->mc_xcursor;
5157 mx->mx_cursor.mc_xcursor = NULL;
5158 mx->mx_cursor.mc_txn = mc->mc_txn;
5159 mx->mx_cursor.mc_db = &mx->mx_db;
5160 mx->mx_cursor.mc_dbx = &mx->mx_dbx;
5161 mx->mx_cursor.mc_dbi = mc->mc_dbi+1;
5162 mx->mx_cursor.mc_dbflag = &mx->mx_dbflag;
5163 mx->mx_cursor.mc_snum = 0;
5164 mx->mx_cursor.mc_top = 0;
5165 mx->mx_cursor.mc_flags = C_SUB;
5166 mx->mx_dbx.md_cmp = mc->mc_dbx->md_dcmp;
5167 mx->mx_dbx.md_dcmp = NULL;
5168 mx->mx_dbx.md_rel = mc->mc_dbx->md_rel;
5171 /** Final setup of a sorted-dups cursor.
5172 * Sets up the fields that depend on the data from the main cursor.
5173 * @param[in] mc The main cursor whose sorted-dups cursor is to be initialized.
5174 * @param[in] node The data containing the #MDB_db record for the
5175 * sorted-dup database.
5178 mdb_xcursor_init1(MDB_cursor *mc, MDB_node *node)
5180 MDB_xcursor *mx = mc->mc_xcursor;
5182 if (node->mn_flags & F_SUBDATA) {
5183 memcpy(&mx->mx_db, NODEDATA(node), sizeof(MDB_db));
5184 mx->mx_cursor.mc_pg[0] = 0;
5185 mx->mx_cursor.mc_snum = 0;
5186 mx->mx_cursor.mc_flags = C_SUB;
5188 MDB_page *fp = NODEDATA(node);
5189 mx->mx_db.md_pad = mc->mc_pg[mc->mc_top]->mp_pad;
5190 mx->mx_db.md_flags = 0;
5191 mx->mx_db.md_depth = 1;
5192 mx->mx_db.md_branch_pages = 0;
5193 mx->mx_db.md_leaf_pages = 1;
5194 mx->mx_db.md_overflow_pages = 0;
5195 mx->mx_db.md_entries = NUMKEYS(fp);
5196 COPY_PGNO(mx->mx_db.md_root, fp->mp_pgno);
5197 mx->mx_cursor.mc_snum = 1;
5198 mx->mx_cursor.mc_flags = C_INITIALIZED|C_SUB;
5199 mx->mx_cursor.mc_top = 0;
5200 mx->mx_cursor.mc_pg[0] = fp;
5201 mx->mx_cursor.mc_ki[0] = 0;
5202 if (mc->mc_db->md_flags & MDB_DUPFIXED) {
5203 mx->mx_db.md_flags = MDB_DUPFIXED;
5204 mx->mx_db.md_pad = fp->mp_pad;
5205 if (mc->mc_db->md_flags & MDB_INTEGERDUP)
5206 mx->mx_db.md_flags |= MDB_INTEGERKEY;
5209 DPRINTF("Sub-db %u for db %u root page %zu", mx->mx_cursor.mc_dbi, mc->mc_dbi,
5211 mx->mx_dbflag = (F_ISSET(mc->mc_pg[mc->mc_top]->mp_flags, P_DIRTY)) ?
5213 mx->mx_dbx.md_name.mv_data = NODEKEY(node);
5214 mx->mx_dbx.md_name.mv_size = node->mn_ksize;
5215 #if UINT_MAX < SIZE_MAX
5216 if (mx->mx_dbx.md_cmp == mdb_cmp_int && mx->mx_db.md_pad == sizeof(size_t))
5217 #ifdef MISALIGNED_OK
5218 mx->mx_dbx.md_cmp = mdb_cmp_long;
5220 mx->mx_dbx.md_cmp = mdb_cmp_cint;
5225 /** Initialize a cursor for a given transaction and database. */
5227 mdb_cursor_init(MDB_cursor *mc, MDB_txn *txn, MDB_dbi dbi, MDB_xcursor *mx)
5232 mc->mc_db = &txn->mt_dbs[dbi];
5233 mc->mc_dbx = &txn->mt_dbxs[dbi];
5234 mc->mc_dbflag = &txn->mt_dbflags[dbi];
5239 if (txn->mt_dbs[dbi].md_flags & MDB_DUPSORT) {
5241 mc->mc_xcursor = mx;
5242 mdb_xcursor_init0(mc);
5244 mc->mc_xcursor = NULL;
5246 if (*mc->mc_dbflag & DB_STALE) {
5247 mdb_page_search(mc, NULL, MDB_PS_ROOTONLY);
5252 mdb_cursor_open(MDB_txn *txn, MDB_dbi dbi, MDB_cursor **ret)
5255 MDB_xcursor *mx = NULL;
5256 size_t size = sizeof(MDB_cursor);
5258 if (txn == NULL || ret == NULL || dbi >= txn->mt_numdbs)
5261 /* Allow read access to the freelist */
5262 if (!dbi && !F_ISSET(txn->mt_flags, MDB_TXN_RDONLY))
5265 if (txn->mt_dbs[dbi].md_flags & MDB_DUPSORT)
5266 size += sizeof(MDB_xcursor);
5268 if ((mc = malloc(size)) != NULL) {
5269 if (txn->mt_dbs[dbi].md_flags & MDB_DUPSORT) {
5270 mx = (MDB_xcursor *)(mc + 1);
5272 mdb_cursor_init(mc, txn, dbi, mx);
5273 if (txn->mt_cursors) {
5274 mc->mc_next = txn->mt_cursors[dbi];
5275 txn->mt_cursors[dbi] = mc;
5277 mc->mc_flags |= C_ALLOCD;
5287 /* Return the count of duplicate data items for the current key */
5289 mdb_cursor_count(MDB_cursor *mc, size_t *countp)
5293 if (mc == NULL || countp == NULL)
5296 if (!(mc->mc_db->md_flags & MDB_DUPSORT))
5299 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
5300 if (!F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5303 if (!(mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED))
5306 *countp = mc->mc_xcursor->mx_db.md_entries;
5312 mdb_cursor_close(MDB_cursor *mc)
5315 /* remove from txn, if tracked */
5316 if (mc->mc_txn->mt_cursors) {
5317 MDB_cursor **prev = &mc->mc_txn->mt_cursors[mc->mc_dbi];
5318 while (*prev && *prev != mc) prev = &(*prev)->mc_next;
5320 *prev = mc->mc_next;
5322 if (mc->mc_flags & C_ALLOCD)
5328 mdb_cursor_txn(MDB_cursor *mc)
5330 if (!mc) return NULL;
5335 mdb_cursor_dbi(MDB_cursor *mc)
5341 /** Replace the key for a node with a new key.
5342 * @param[in] mp The page containing the node to operate on.
5343 * @param[in] indx The index of the node to operate on.
5344 * @param[in] key The new key to use.
5345 * @return 0 on success, non-zero on failure.
5348 mdb_update_key(MDB_page *mp, indx_t indx, MDB_val *key)
5354 indx_t ptr, i, numkeys;
5357 node = NODEPTR(mp, indx);
5358 ptr = mp->mp_ptrs[indx];
5362 char kbuf2[(MAXKEYSIZE*2+1)];
5363 k2.mv_data = NODEKEY(node);
5364 k2.mv_size = node->mn_ksize;
5365 DPRINTF("update key %u (ofs %u) [%s] to [%s] on page %zu",
5367 mdb_dkey(&k2, kbuf2),
5373 delta0 = delta = key->mv_size - node->mn_ksize;
5375 /* Must be 2-byte aligned. If new key is
5376 * shorter by 1, the shift will be skipped.
5378 delta += (delta & 1);
5380 if (delta > 0 && SIZELEFT(mp) < delta) {
5381 DPRINTF("OUCH! Not enough room, delta = %d", delta);
5382 return MDB_PAGE_FULL;
5385 numkeys = NUMKEYS(mp);
5386 for (i = 0; i < numkeys; i++) {
5387 if (mp->mp_ptrs[i] <= ptr)
5388 mp->mp_ptrs[i] -= delta;
5391 base = (char *)mp + mp->mp_upper;
5392 len = ptr - mp->mp_upper + NODESIZE;
5393 memmove(base - delta, base, len);
5394 mp->mp_upper -= delta;
5396 node = NODEPTR(mp, indx);
5399 /* But even if no shift was needed, update ksize */
5401 node->mn_ksize = key->mv_size;
5404 memcpy(NODEKEY(node), key->mv_data, key->mv_size);
5409 /** Move a node from csrc to cdst.
5412 mdb_node_move(MDB_cursor *csrc, MDB_cursor *cdst)
5418 unsigned short flags;
5422 /* Mark src and dst as dirty. */
5423 if ((rc = mdb_page_touch(csrc)) ||
5424 (rc = mdb_page_touch(cdst)))
5427 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
5428 srcnode = NODEPTR(csrc->mc_pg[csrc->mc_top], 0); /* fake */
5429 key.mv_size = csrc->mc_db->md_pad;
5430 key.mv_data = LEAF2KEY(csrc->mc_pg[csrc->mc_top], csrc->mc_ki[csrc->mc_top], key.mv_size);
5432 data.mv_data = NULL;
5436 srcnode = NODEPTR(csrc->mc_pg[csrc->mc_top], csrc->mc_ki[csrc->mc_top]);
5437 assert(!((long)srcnode&1));
5438 srcpg = NODEPGNO(srcnode);
5439 flags = srcnode->mn_flags;
5440 if (csrc->mc_ki[csrc->mc_top] == 0 && IS_BRANCH(csrc->mc_pg[csrc->mc_top])) {
5441 unsigned int snum = csrc->mc_snum;
5443 /* must find the lowest key below src */
5444 mdb_page_search_root(csrc, NULL, 0);
5445 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
5446 key.mv_size = csrc->mc_db->md_pad;
5447 key.mv_data = LEAF2KEY(csrc->mc_pg[csrc->mc_top], 0, key.mv_size);
5449 s2 = NODEPTR(csrc->mc_pg[csrc->mc_top], 0);
5450 key.mv_size = NODEKSZ(s2);
5451 key.mv_data = NODEKEY(s2);
5453 csrc->mc_snum = snum--;
5454 csrc->mc_top = snum;
5456 key.mv_size = NODEKSZ(srcnode);
5457 key.mv_data = NODEKEY(srcnode);
5459 data.mv_size = NODEDSZ(srcnode);
5460 data.mv_data = NODEDATA(srcnode);
5462 if (IS_BRANCH(cdst->mc_pg[cdst->mc_top]) && cdst->mc_ki[cdst->mc_top] == 0) {
5463 unsigned int snum = cdst->mc_snum;
5466 /* must find the lowest key below dst */
5467 mdb_page_search_root(cdst, NULL, 0);
5468 if (IS_LEAF2(cdst->mc_pg[cdst->mc_top])) {
5469 bkey.mv_size = cdst->mc_db->md_pad;
5470 bkey.mv_data = LEAF2KEY(cdst->mc_pg[cdst->mc_top], 0, bkey.mv_size);
5472 s2 = NODEPTR(cdst->mc_pg[cdst->mc_top], 0);
5473 bkey.mv_size = NODEKSZ(s2);
5474 bkey.mv_data = NODEKEY(s2);
5476 cdst->mc_snum = snum--;
5477 cdst->mc_top = snum;
5478 rc = mdb_update_key(cdst->mc_pg[cdst->mc_top], 0, &bkey);
5481 DPRINTF("moving %s node %u [%s] on page %zu to node %u on page %zu",
5482 IS_LEAF(csrc->mc_pg[csrc->mc_top]) ? "leaf" : "branch",
5483 csrc->mc_ki[csrc->mc_top],
5485 csrc->mc_pg[csrc->mc_top]->mp_pgno,
5486 cdst->mc_ki[cdst->mc_top], cdst->mc_pg[cdst->mc_top]->mp_pgno);
5488 /* Add the node to the destination page.
5490 rc = mdb_node_add(cdst, cdst->mc_ki[cdst->mc_top], &key, &data, srcpg, flags);
5491 if (rc != MDB_SUCCESS)
5494 /* Delete the node from the source page.
5496 mdb_node_del(csrc->mc_pg[csrc->mc_top], csrc->mc_ki[csrc->mc_top], key.mv_size);
5499 /* Adjust other cursors pointing to mp */
5500 MDB_cursor *m2, *m3;
5501 MDB_dbi dbi = csrc->mc_dbi;
5502 MDB_page *mp = csrc->mc_pg[csrc->mc_top];
5504 if (csrc->mc_flags & C_SUB)
5507 for (m2 = csrc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
5508 if (m2 == csrc) continue;
5509 if (csrc->mc_flags & C_SUB)
5510 m3 = &m2->mc_xcursor->mx_cursor;
5513 if (m3->mc_pg[csrc->mc_top] == mp && m3->mc_ki[csrc->mc_top] ==
5514 csrc->mc_ki[csrc->mc_top]) {
5515 m3->mc_pg[csrc->mc_top] = cdst->mc_pg[cdst->mc_top];
5516 m3->mc_ki[csrc->mc_top] = cdst->mc_ki[cdst->mc_top];
5521 /* Update the parent separators.
5523 if (csrc->mc_ki[csrc->mc_top] == 0) {
5524 if (csrc->mc_ki[csrc->mc_top-1] != 0) {
5525 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
5526 key.mv_data = LEAF2KEY(csrc->mc_pg[csrc->mc_top], 0, key.mv_size);
5528 srcnode = NODEPTR(csrc->mc_pg[csrc->mc_top], 0);
5529 key.mv_size = NODEKSZ(srcnode);
5530 key.mv_data = NODEKEY(srcnode);
5532 DPRINTF("update separator for source page %zu to [%s]",
5533 csrc->mc_pg[csrc->mc_top]->mp_pgno, DKEY(&key));
5534 if ((rc = mdb_update_key(csrc->mc_pg[csrc->mc_top-1], csrc->mc_ki[csrc->mc_top-1],
5535 &key)) != MDB_SUCCESS)
5538 if (IS_BRANCH(csrc->mc_pg[csrc->mc_top])) {
5540 nullkey.mv_size = 0;
5541 rc = mdb_update_key(csrc->mc_pg[csrc->mc_top], 0, &nullkey);
5542 assert(rc == MDB_SUCCESS);
5546 if (cdst->mc_ki[cdst->mc_top] == 0) {
5547 if (cdst->mc_ki[cdst->mc_top-1] != 0) {
5548 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
5549 key.mv_data = LEAF2KEY(cdst->mc_pg[cdst->mc_top], 0, key.mv_size);
5551 srcnode = NODEPTR(cdst->mc_pg[cdst->mc_top], 0);
5552 key.mv_size = NODEKSZ(srcnode);
5553 key.mv_data = NODEKEY(srcnode);
5555 DPRINTF("update separator for destination page %zu to [%s]",
5556 cdst->mc_pg[cdst->mc_top]->mp_pgno, DKEY(&key));
5557 if ((rc = mdb_update_key(cdst->mc_pg[cdst->mc_top-1], cdst->mc_ki[cdst->mc_top-1],
5558 &key)) != MDB_SUCCESS)
5561 if (IS_BRANCH(cdst->mc_pg[cdst->mc_top])) {
5563 nullkey.mv_size = 0;
5564 rc = mdb_update_key(cdst->mc_pg[cdst->mc_top], 0, &nullkey);
5565 assert(rc == MDB_SUCCESS);
5572 /** Merge one page into another.
5573 * The nodes from the page pointed to by \b csrc will
5574 * be copied to the page pointed to by \b cdst and then
5575 * the \b csrc page will be freed.
5576 * @param[in] csrc Cursor pointing to the source page.
5577 * @param[in] cdst Cursor pointing to the destination page.
5580 mdb_page_merge(MDB_cursor *csrc, MDB_cursor *cdst)
5588 DPRINTF("merging page %zu into %zu", csrc->mc_pg[csrc->mc_top]->mp_pgno,
5589 cdst->mc_pg[cdst->mc_top]->mp_pgno);
5591 assert(csrc->mc_snum > 1); /* can't merge root page */
5592 assert(cdst->mc_snum > 1);
5594 /* Mark dst as dirty. */
5595 if ((rc = mdb_page_touch(cdst)))
5598 /* Move all nodes from src to dst.
5600 j = nkeys = NUMKEYS(cdst->mc_pg[cdst->mc_top]);
5601 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
5602 key.mv_size = csrc->mc_db->md_pad;
5603 key.mv_data = METADATA(csrc->mc_pg[csrc->mc_top]);
5604 for (i = 0; i < NUMKEYS(csrc->mc_pg[csrc->mc_top]); i++, j++) {
5605 rc = mdb_node_add(cdst, j, &key, NULL, 0, 0);
5606 if (rc != MDB_SUCCESS)
5608 key.mv_data = (char *)key.mv_data + key.mv_size;
5611 for (i = 0; i < NUMKEYS(csrc->mc_pg[csrc->mc_top]); i++, j++) {
5612 srcnode = NODEPTR(csrc->mc_pg[csrc->mc_top], i);
5613 if (i == 0 && IS_BRANCH(csrc->mc_pg[csrc->mc_top])) {
5614 unsigned int snum = csrc->mc_snum;
5616 /* must find the lowest key below src */
5617 mdb_page_search_root(csrc, NULL, 0);
5618 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
5619 key.mv_size = csrc->mc_db->md_pad;
5620 key.mv_data = LEAF2KEY(csrc->mc_pg[csrc->mc_top], 0, key.mv_size);
5622 s2 = NODEPTR(csrc->mc_pg[csrc->mc_top], 0);
5623 key.mv_size = NODEKSZ(s2);
5624 key.mv_data = NODEKEY(s2);
5626 csrc->mc_snum = snum--;
5627 csrc->mc_top = snum;
5629 key.mv_size = srcnode->mn_ksize;
5630 key.mv_data = NODEKEY(srcnode);
5633 data.mv_size = NODEDSZ(srcnode);
5634 data.mv_data = NODEDATA(srcnode);
5635 rc = mdb_node_add(cdst, j, &key, &data, NODEPGNO(srcnode), srcnode->mn_flags);
5636 if (rc != MDB_SUCCESS)
5641 DPRINTF("dst page %zu now has %u keys (%.1f%% filled)",
5642 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);
5644 /* Unlink the src page from parent and add to free list.
5646 mdb_node_del(csrc->mc_pg[csrc->mc_top-1], csrc->mc_ki[csrc->mc_top-1], 0);
5647 if (csrc->mc_ki[csrc->mc_top-1] == 0) {
5649 if ((rc = mdb_update_key(csrc->mc_pg[csrc->mc_top-1], 0, &key)) != MDB_SUCCESS)
5653 mdb_midl_append(&csrc->mc_txn->mt_free_pgs, csrc->mc_pg[csrc->mc_top]->mp_pgno);
5654 if (IS_LEAF(csrc->mc_pg[csrc->mc_top]))
5655 csrc->mc_db->md_leaf_pages--;
5657 csrc->mc_db->md_branch_pages--;
5659 /* Adjust other cursors pointing to mp */
5660 MDB_cursor *m2, *m3;
5661 MDB_dbi dbi = csrc->mc_dbi;
5662 MDB_page *mp = cdst->mc_pg[cdst->mc_top];
5664 if (csrc->mc_flags & C_SUB)
5667 for (m2 = csrc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
5668 if (csrc->mc_flags & C_SUB)
5669 m3 = &m2->mc_xcursor->mx_cursor;
5672 if (m3 == csrc) continue;
5673 if (m3->mc_snum < csrc->mc_snum) continue;
5674 if (m3->mc_pg[csrc->mc_top] == csrc->mc_pg[csrc->mc_top]) {
5675 m3->mc_pg[csrc->mc_top] = mp;
5676 m3->mc_ki[csrc->mc_top] += nkeys;
5680 mdb_cursor_pop(csrc);
5682 return mdb_rebalance(csrc);
5685 /** Copy the contents of a cursor.
5686 * @param[in] csrc The cursor to copy from.
5687 * @param[out] cdst The cursor to copy to.
5690 mdb_cursor_copy(const MDB_cursor *csrc, MDB_cursor *cdst)
5694 cdst->mc_txn = csrc->mc_txn;
5695 cdst->mc_dbi = csrc->mc_dbi;
5696 cdst->mc_db = csrc->mc_db;
5697 cdst->mc_dbx = csrc->mc_dbx;
5698 cdst->mc_snum = csrc->mc_snum;
5699 cdst->mc_top = csrc->mc_top;
5700 cdst->mc_flags = csrc->mc_flags;
5702 for (i=0; i<csrc->mc_snum; i++) {
5703 cdst->mc_pg[i] = csrc->mc_pg[i];
5704 cdst->mc_ki[i] = csrc->mc_ki[i];
5708 /** Rebalance the tree after a delete operation.
5709 * @param[in] mc Cursor pointing to the page where rebalancing
5711 * @return 0 on success, non-zero on failure.
5714 mdb_rebalance(MDB_cursor *mc)
5724 COPY_PGNO(pgno, mc->mc_pg[mc->mc_top]->mp_pgno);
5725 DPRINTF("rebalancing %s page %zu (has %u keys, %.1f%% full)",
5726 IS_LEAF(mc->mc_pg[mc->mc_top]) ? "leaf" : "branch",
5727 pgno, NUMKEYS(mc->mc_pg[mc->mc_top]), (float)PAGEFILL(mc->mc_txn->mt_env, mc->mc_pg[mc->mc_top]) / 10);
5731 if (PAGEFILL(mc->mc_txn->mt_env, mc->mc_pg[mc->mc_top]) >= FILL_THRESHOLD) {
5734 COPY_PGNO(pgno, mc->mc_pg[mc->mc_top]->mp_pgno);
5735 DPRINTF("no need to rebalance page %zu, above fill threshold",
5741 if (mc->mc_snum < 2) {
5742 MDB_page *mp = mc->mc_pg[0];
5743 if (NUMKEYS(mp) == 0) {
5744 DPUTS("tree is completely empty");
5745 mc->mc_db->md_root = P_INVALID;
5746 mc->mc_db->md_depth = 0;
5747 mc->mc_db->md_leaf_pages = 0;
5748 mdb_midl_append(&mc->mc_txn->mt_free_pgs, mp->mp_pgno);
5752 /* Adjust other cursors pointing to mp */
5753 MDB_cursor *m2, *m3;
5754 MDB_dbi dbi = mc->mc_dbi;
5756 if (mc->mc_flags & C_SUB)
5759 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
5760 if (m2 == mc) continue;
5761 if (mc->mc_flags & C_SUB)
5762 m3 = &m2->mc_xcursor->mx_cursor;
5765 if (m3->mc_snum < mc->mc_snum) continue;
5766 if (m3->mc_pg[0] == mp) {
5772 } else if (IS_BRANCH(mp) && NUMKEYS(mp) == 1) {
5773 DPUTS("collapsing root page!");
5774 mdb_midl_append(&mc->mc_txn->mt_free_pgs, mp->mp_pgno);
5775 mc->mc_db->md_root = NODEPGNO(NODEPTR(mp, 0));
5776 if ((rc = mdb_page_get(mc->mc_txn, mc->mc_db->md_root,
5779 mc->mc_db->md_depth--;
5780 mc->mc_db->md_branch_pages--;
5782 /* Adjust other cursors pointing to mp */
5783 MDB_cursor *m2, *m3;
5784 MDB_dbi dbi = mc->mc_dbi;
5786 if (mc->mc_flags & C_SUB)
5789 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
5790 if (m2 == mc) continue;
5791 if (mc->mc_flags & C_SUB)
5792 m3 = &m2->mc_xcursor->mx_cursor;
5795 if (m3->mc_snum < mc->mc_snum) continue;
5796 if (m3->mc_pg[0] == mp) {
5797 m3->mc_pg[0] = mc->mc_pg[0];
5802 DPUTS("root page doesn't need rebalancing");
5806 /* The parent (branch page) must have at least 2 pointers,
5807 * otherwise the tree is invalid.
5809 ptop = mc->mc_top-1;
5810 assert(NUMKEYS(mc->mc_pg[ptop]) > 1);
5812 /* Leaf page fill factor is below the threshold.
5813 * Try to move keys from left or right neighbor, or
5814 * merge with a neighbor page.
5819 mdb_cursor_copy(mc, &mn);
5820 mn.mc_xcursor = NULL;
5822 if (mc->mc_ki[ptop] == 0) {
5823 /* We're the leftmost leaf in our parent.
5825 DPUTS("reading right neighbor");
5827 node = NODEPTR(mc->mc_pg[ptop], mn.mc_ki[ptop]);
5828 if ((rc = mdb_page_get(mc->mc_txn, NODEPGNO(node), &mn.mc_pg[mn.mc_top])))
5830 mn.mc_ki[mn.mc_top] = 0;
5831 mc->mc_ki[mc->mc_top] = NUMKEYS(mc->mc_pg[mc->mc_top]);
5833 /* There is at least one neighbor to the left.
5835 DPUTS("reading left neighbor");
5837 node = NODEPTR(mc->mc_pg[ptop], mn.mc_ki[ptop]);
5838 if ((rc = mdb_page_get(mc->mc_txn, NODEPGNO(node), &mn.mc_pg[mn.mc_top])))
5840 mn.mc_ki[mn.mc_top] = NUMKEYS(mn.mc_pg[mn.mc_top]) - 1;
5841 mc->mc_ki[mc->mc_top] = 0;
5844 DPRINTF("found neighbor page %zu (%u keys, %.1f%% full)",
5845 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);
5847 /* If the neighbor page is above threshold and has at least two
5848 * keys, move one key from it.
5850 * Otherwise we should try to merge them.
5852 if (PAGEFILL(mc->mc_txn->mt_env, mn.mc_pg[mn.mc_top]) >= FILL_THRESHOLD && NUMKEYS(mn.mc_pg[mn.mc_top]) >= 2)
5853 return mdb_node_move(&mn, mc);
5854 else { /* FIXME: if (has_enough_room()) */
5855 mc->mc_flags &= ~C_INITIALIZED;
5856 if (mc->mc_ki[ptop] == 0)
5857 return mdb_page_merge(&mn, mc);
5859 return mdb_page_merge(mc, &mn);
5863 /** Complete a delete operation started by #mdb_cursor_del(). */
5865 mdb_cursor_del0(MDB_cursor *mc, MDB_node *leaf)
5869 /* add overflow pages to free list */
5870 if (!IS_LEAF2(mc->mc_pg[mc->mc_top]) && F_ISSET(leaf->mn_flags, F_BIGDATA)) {
5874 memcpy(&pg, NODEDATA(leaf), sizeof(pg));
5875 ovpages = OVPAGES(NODEDSZ(leaf), mc->mc_txn->mt_env->me_psize);
5876 mc->mc_db->md_overflow_pages -= ovpages;
5877 for (i=0; i<ovpages; i++) {
5878 DPRINTF("freed ov page %zu", pg);
5879 mdb_midl_append(&mc->mc_txn->mt_free_pgs, pg);
5883 mdb_node_del(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], mc->mc_db->md_pad);
5884 mc->mc_db->md_entries--;
5885 rc = mdb_rebalance(mc);
5886 if (rc != MDB_SUCCESS)
5887 mc->mc_txn->mt_flags |= MDB_TXN_ERROR;
5893 mdb_del(MDB_txn *txn, MDB_dbi dbi,
5894 MDB_val *key, MDB_val *data)
5899 MDB_val rdata, *xdata;
5903 assert(key != NULL);
5905 DPRINTF("====> delete db %u key [%s]", dbi, DKEY(key));
5907 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs)
5910 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY)) {
5914 if (key->mv_size == 0 || key->mv_size > MAXKEYSIZE) {
5918 mdb_cursor_init(&mc, txn, dbi, &mx);
5929 rc = mdb_cursor_set(&mc, key, xdata, op, &exact);
5931 rc = mdb_cursor_del(&mc, data ? 0 : MDB_NODUPDATA);
5935 /** Split a page and insert a new node.
5936 * @param[in,out] mc Cursor pointing to the page and desired insertion index.
5937 * The cursor will be updated to point to the actual page and index where
5938 * the node got inserted after the split.
5939 * @param[in] newkey The key for the newly inserted node.
5940 * @param[in] newdata The data for the newly inserted node.
5941 * @param[in] newpgno The page number, if the new node is a branch node.
5942 * @param[in] nflags The #NODE_ADD_FLAGS for the new node.
5943 * @return 0 on success, non-zero on failure.
5946 mdb_page_split(MDB_cursor *mc, MDB_val *newkey, MDB_val *newdata, pgno_t newpgno,
5947 unsigned int nflags)
5950 int rc = MDB_SUCCESS, ins_new = 0, new_root = 0, newpos = 1, did_split = 0;
5953 unsigned int i, j, split_indx, nkeys, pmax;
5955 MDB_val sepkey, rkey, xdata, *rdata = &xdata;
5957 MDB_page *mp, *rp, *pp;
5962 mp = mc->mc_pg[mc->mc_top];
5963 newindx = mc->mc_ki[mc->mc_top];
5965 DPRINTF("-----> splitting %s page %zu and adding [%s] at index %i",
5966 IS_LEAF(mp) ? "leaf" : "branch", mp->mp_pgno,
5967 DKEY(newkey), mc->mc_ki[mc->mc_top]);
5969 /* Create a right sibling. */
5970 if ((rc = mdb_page_new(mc, mp->mp_flags, 1, &rp)))
5972 DPRINTF("new right sibling: page %zu", rp->mp_pgno);
5974 if (mc->mc_snum < 2) {
5975 if ((rc = mdb_page_new(mc, P_BRANCH, 1, &pp)))
5977 /* shift current top to make room for new parent */
5978 mc->mc_pg[1] = mc->mc_pg[0];
5979 mc->mc_ki[1] = mc->mc_ki[0];
5982 mc->mc_db->md_root = pp->mp_pgno;
5983 DPRINTF("root split! new root = %zu", pp->mp_pgno);
5984 mc->mc_db->md_depth++;
5987 /* Add left (implicit) pointer. */
5988 if ((rc = mdb_node_add(mc, 0, NULL, NULL, mp->mp_pgno, 0)) != MDB_SUCCESS) {
5989 /* undo the pre-push */
5990 mc->mc_pg[0] = mc->mc_pg[1];
5991 mc->mc_ki[0] = mc->mc_ki[1];
5992 mc->mc_db->md_root = mp->mp_pgno;
5993 mc->mc_db->md_depth--;
6000 ptop = mc->mc_top-1;
6001 DPRINTF("parent branch page is %zu", mc->mc_pg[ptop]->mp_pgno);
6004 mc->mc_flags |= C_SPLITTING;
6005 mdb_cursor_copy(mc, &mn);
6006 mn.mc_pg[mn.mc_top] = rp;
6007 mn.mc_ki[ptop] = mc->mc_ki[ptop]+1;
6009 if (nflags & MDB_APPEND) {
6010 mn.mc_ki[mn.mc_top] = 0;
6012 split_indx = newindx;
6017 nkeys = NUMKEYS(mp);
6018 split_indx = nkeys / 2;
6019 if (newindx < split_indx)
6025 unsigned int lsize, rsize, ksize;
6026 /* Move half of the keys to the right sibling */
6028 x = mc->mc_ki[mc->mc_top] - split_indx;
6029 ksize = mc->mc_db->md_pad;
6030 split = LEAF2KEY(mp, split_indx, ksize);
6031 rsize = (nkeys - split_indx) * ksize;
6032 lsize = (nkeys - split_indx) * sizeof(indx_t);
6033 mp->mp_lower -= lsize;
6034 rp->mp_lower += lsize;
6035 mp->mp_upper += rsize - lsize;
6036 rp->mp_upper -= rsize - lsize;
6037 sepkey.mv_size = ksize;
6038 if (newindx == split_indx) {
6039 sepkey.mv_data = newkey->mv_data;
6041 sepkey.mv_data = split;
6044 ins = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], ksize);
6045 memcpy(rp->mp_ptrs, split, rsize);
6046 sepkey.mv_data = rp->mp_ptrs;
6047 memmove(ins+ksize, ins, (split_indx - mc->mc_ki[mc->mc_top]) * ksize);
6048 memcpy(ins, newkey->mv_data, ksize);
6049 mp->mp_lower += sizeof(indx_t);
6050 mp->mp_upper -= ksize - sizeof(indx_t);
6053 memcpy(rp->mp_ptrs, split, x * ksize);
6054 ins = LEAF2KEY(rp, x, ksize);
6055 memcpy(ins, newkey->mv_data, ksize);
6056 memcpy(ins+ksize, split + x * ksize, rsize - x * ksize);
6057 rp->mp_lower += sizeof(indx_t);
6058 rp->mp_upper -= ksize - sizeof(indx_t);
6059 mc->mc_ki[mc->mc_top] = x;
6060 mc->mc_pg[mc->mc_top] = rp;
6065 /* For leaf pages, check the split point based on what
6066 * fits where, since otherwise mdb_node_add can fail.
6068 * This check is only needed when the data items are
6069 * relatively large, such that being off by one will
6070 * make the difference between success or failure.
6071 * When the size of the data items is much smaller than
6072 * one-half of a page, this check is irrelevant.
6075 unsigned int psize, nsize;
6076 /* Maximum free space in an empty page */
6077 pmax = mc->mc_txn->mt_env->me_psize - PAGEHDRSZ;
6078 nsize = mdb_leaf_size(mc->mc_txn->mt_env, newkey, newdata);
6079 if ((nkeys < 20) || (nsize > pmax/4)) {
6080 if (newindx <= split_indx) {
6083 for (i=0; i<split_indx; i++) {
6084 node = NODEPTR(mp, i);
6085 psize += NODESIZE + NODEKSZ(node) + sizeof(indx_t);
6086 if (F_ISSET(node->mn_flags, F_BIGDATA))
6087 psize += sizeof(pgno_t);
6089 psize += NODEDSZ(node);
6093 split_indx = newindx;
6104 for (i=nkeys-1; i>=split_indx; i--) {
6105 node = NODEPTR(mp, i);
6106 psize += NODESIZE + NODEKSZ(node) + sizeof(indx_t);
6107 if (F_ISSET(node->mn_flags, F_BIGDATA))
6108 psize += sizeof(pgno_t);
6110 psize += NODEDSZ(node);
6114 split_indx = newindx;
6124 /* First find the separating key between the split pages.
6125 * The case where newindx == split_indx is ambiguous; the
6126 * new item could go to the new page or stay on the original
6127 * page. If newpos == 1 it goes to the new page.
6129 if (newindx == split_indx && newpos) {
6130 sepkey.mv_size = newkey->mv_size;
6131 sepkey.mv_data = newkey->mv_data;
6133 node = NODEPTR(mp, split_indx);
6134 sepkey.mv_size = node->mn_ksize;
6135 sepkey.mv_data = NODEKEY(node);
6139 DPRINTF("separator is [%s]", DKEY(&sepkey));
6141 /* Copy separator key to the parent.
6143 if (SIZELEFT(mn.mc_pg[ptop]) < mdb_branch_size(mc->mc_txn->mt_env, &sepkey)) {
6147 rc = mdb_page_split(&mn, &sepkey, NULL, rp->mp_pgno, 0);
6150 if (mn.mc_snum == mc->mc_snum) {
6151 mc->mc_pg[mc->mc_snum] = mc->mc_pg[mc->mc_top];
6152 mc->mc_ki[mc->mc_snum] = mc->mc_ki[mc->mc_top];
6153 mc->mc_pg[mc->mc_top] = mc->mc_pg[ptop];
6154 mc->mc_ki[mc->mc_top] = mc->mc_ki[ptop];
6159 /* Right page might now have changed parent.
6160 * Check if left page also changed parent.
6162 if (mn.mc_pg[ptop] != mc->mc_pg[ptop] &&
6163 mc->mc_ki[ptop] >= NUMKEYS(mc->mc_pg[ptop])) {
6164 for (i=0; i<ptop; i++) {
6165 mc->mc_pg[i] = mn.mc_pg[i];
6166 mc->mc_ki[i] = mn.mc_ki[i];
6168 mc->mc_pg[ptop] = mn.mc_pg[ptop];
6169 mc->mc_ki[ptop] = mn.mc_ki[ptop] - 1;
6173 rc = mdb_node_add(&mn, mn.mc_ki[ptop], &sepkey, NULL, rp->mp_pgno, 0);
6176 mc->mc_flags ^= C_SPLITTING;
6177 if (rc != MDB_SUCCESS) {
6180 if (nflags & MDB_APPEND) {
6181 mc->mc_pg[mc->mc_top] = rp;
6182 mc->mc_ki[mc->mc_top] = 0;
6183 rc = mdb_node_add(mc, 0, newkey, newdata, newpgno, nflags);
6186 for (i=0; i<mc->mc_top; i++)
6187 mc->mc_ki[i] = mn.mc_ki[i];
6194 /* Move half of the keys to the right sibling. */
6196 /* grab a page to hold a temporary copy */
6197 copy = mdb_page_malloc(mc);
6201 copy->mp_pgno = mp->mp_pgno;
6202 copy->mp_flags = mp->mp_flags;
6203 copy->mp_lower = PAGEHDRSZ;
6204 copy->mp_upper = mc->mc_txn->mt_env->me_psize;
6205 mc->mc_pg[mc->mc_top] = copy;
6206 for (i = j = 0; i <= nkeys; j++) {
6207 if (i == split_indx) {
6208 /* Insert in right sibling. */
6209 /* Reset insert index for right sibling. */
6210 if (i != newindx || (newpos ^ ins_new)) {
6212 mc->mc_pg[mc->mc_top] = rp;
6216 if (i == newindx && !ins_new) {
6217 /* Insert the original entry that caused the split. */
6218 rkey.mv_data = newkey->mv_data;
6219 rkey.mv_size = newkey->mv_size;
6228 /* Update index for the new key. */
6229 mc->mc_ki[mc->mc_top] = j;
6230 } else if (i == nkeys) {
6233 node = NODEPTR(mp, i);
6234 rkey.mv_data = NODEKEY(node);
6235 rkey.mv_size = node->mn_ksize;
6237 xdata.mv_data = NODEDATA(node);
6238 xdata.mv_size = NODEDSZ(node);
6241 pgno = NODEPGNO(node);
6242 flags = node->mn_flags;
6247 if (!IS_LEAF(mp) && j == 0) {
6248 /* First branch index doesn't need key data. */
6252 rc = mdb_node_add(mc, j, &rkey, rdata, pgno, flags);
6256 nkeys = NUMKEYS(copy);
6257 for (i=0; i<nkeys; i++)
6258 mp->mp_ptrs[i] = copy->mp_ptrs[i];
6259 mp->mp_lower = copy->mp_lower;
6260 mp->mp_upper = copy->mp_upper;
6261 memcpy(NODEPTR(mp, nkeys-1), NODEPTR(copy, nkeys-1),
6262 mc->mc_txn->mt_env->me_psize - copy->mp_upper);
6264 /* reset back to original page */
6265 if (newindx < split_indx || (!newpos && newindx == split_indx)) {
6266 mc->mc_pg[mc->mc_top] = mp;
6267 if (nflags & MDB_RESERVE) {
6268 node = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
6269 if (!(node->mn_flags & F_BIGDATA))
6270 newdata->mv_data = NODEDATA(node);
6276 /* return tmp page to freelist */
6277 copy->mp_next = mc->mc_txn->mt_env->me_dpages;
6278 VGMEMP_FREE(mc->mc_txn->mt_env, copy);
6279 mc->mc_txn->mt_env->me_dpages = copy;
6282 /* Adjust other cursors pointing to mp */
6283 MDB_cursor *m2, *m3;
6284 MDB_dbi dbi = mc->mc_dbi;
6285 int fixup = NUMKEYS(mp);
6287 if (mc->mc_flags & C_SUB)
6290 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
6291 if (m2 == mc) continue;
6292 if (mc->mc_flags & C_SUB)
6293 m3 = &m2->mc_xcursor->mx_cursor;
6296 if (!(m3->mc_flags & C_INITIALIZED))
6298 if (m3->mc_flags & C_SPLITTING)
6303 for (k=m3->mc_top; k>=0; k--) {
6304 m3->mc_ki[k+1] = m3->mc_ki[k];
6305 m3->mc_pg[k+1] = m3->mc_pg[k];
6307 if (m3->mc_ki[0] >= split_indx) {
6312 m3->mc_pg[0] = mc->mc_pg[0];
6316 if (m3->mc_pg[mc->mc_top] == mp) {
6317 if (m3->mc_ki[mc->mc_top] >= newindx && !(nflags & MDB_SPLIT_REPLACE))
6318 m3->mc_ki[mc->mc_top]++;
6319 if (m3->mc_ki[mc->mc_top] >= fixup) {
6320 m3->mc_pg[mc->mc_top] = rp;
6321 m3->mc_ki[mc->mc_top] -= fixup;
6322 m3->mc_ki[ptop] = mn.mc_ki[ptop];
6324 } else if (!did_split && m3->mc_pg[ptop] == mc->mc_pg[ptop] &&
6325 m3->mc_ki[ptop] >= mc->mc_ki[ptop]) {
6334 mdb_put(MDB_txn *txn, MDB_dbi dbi,
6335 MDB_val *key, MDB_val *data, unsigned int flags)
6340 assert(key != NULL);
6341 assert(data != NULL);
6343 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs)
6346 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY)) {
6350 if (key->mv_size == 0 || key->mv_size > MAXKEYSIZE) {
6354 if ((flags & (MDB_NOOVERWRITE|MDB_NODUPDATA|MDB_RESERVE|MDB_APPEND)) != flags)
6357 mdb_cursor_init(&mc, txn, dbi, &mx);
6358 return mdb_cursor_put(&mc, key, data, flags);
6361 /** Only a subset of the @ref mdb_env flags can be changed
6362 * at runtime. Changing other flags requires closing the environment
6363 * and re-opening it with the new flags.
6365 #define CHANGEABLE (MDB_NOSYNC|MDB_NOMETASYNC|MDB_MAPASYNC)
6367 mdb_env_set_flags(MDB_env *env, unsigned int flag, int onoff)
6369 if ((flag & CHANGEABLE) != flag)
6372 env->me_flags |= flag;
6374 env->me_flags &= ~flag;
6379 mdb_env_get_flags(MDB_env *env, unsigned int *arg)
6384 *arg = env->me_flags;
6389 mdb_env_get_path(MDB_env *env, const char **arg)
6394 *arg = env->me_path;
6398 /** Common code for #mdb_stat() and #mdb_env_stat().
6399 * @param[in] env the environment to operate in.
6400 * @param[in] db the #MDB_db record containing the stats to return.
6401 * @param[out] arg the address of an #MDB_stat structure to receive the stats.
6402 * @return 0, this function always succeeds.
6405 mdb_stat0(MDB_env *env, MDB_db *db, MDB_stat *arg)
6407 arg->ms_psize = env->me_psize;
6408 arg->ms_depth = db->md_depth;
6409 arg->ms_branch_pages = db->md_branch_pages;
6410 arg->ms_leaf_pages = db->md_leaf_pages;
6411 arg->ms_overflow_pages = db->md_overflow_pages;
6412 arg->ms_entries = db->md_entries;
6417 mdb_env_stat(MDB_env *env, MDB_stat *arg)
6421 if (env == NULL || arg == NULL)
6424 toggle = mdb_env_pick_meta(env);
6426 return mdb_stat0(env, &env->me_metas[toggle]->mm_dbs[MAIN_DBI], arg);
6429 /** Set the default comparison functions for a database.
6430 * Called immediately after a database is opened to set the defaults.
6431 * The user can then override them with #mdb_set_compare() or
6432 * #mdb_set_dupsort().
6433 * @param[in] txn A transaction handle returned by #mdb_txn_begin()
6434 * @param[in] dbi A database handle returned by #mdb_open()
6437 mdb_default_cmp(MDB_txn *txn, MDB_dbi dbi)
6439 uint16_t f = txn->mt_dbs[dbi].md_flags;
6441 txn->mt_dbxs[dbi].md_cmp =
6442 (f & MDB_REVERSEKEY) ? mdb_cmp_memnr :
6443 (f & MDB_INTEGERKEY) ? mdb_cmp_cint : mdb_cmp_memn;
6445 txn->mt_dbxs[dbi].md_dcmp =
6446 !(f & MDB_DUPSORT) ? 0 :
6447 ((f & MDB_INTEGERDUP)
6448 ? ((f & MDB_DUPFIXED) ? mdb_cmp_int : mdb_cmp_cint)
6449 : ((f & MDB_REVERSEDUP) ? mdb_cmp_memnr : mdb_cmp_memn));
6452 int mdb_open(MDB_txn *txn, const char *name, unsigned int flags, MDB_dbi *dbi)
6457 int rc, dbflag, exact;
6458 unsigned int unused = 0;
6461 if (txn->mt_dbxs[FREE_DBI].md_cmp == NULL) {
6462 mdb_default_cmp(txn, FREE_DBI);
6468 if (flags & (MDB_DUPSORT|MDB_REVERSEKEY|MDB_INTEGERKEY))
6469 txn->mt_dbs[MAIN_DBI].md_flags |= (flags & (MDB_DUPSORT|MDB_REVERSEKEY|MDB_INTEGERKEY));
6470 mdb_default_cmp(txn, MAIN_DBI);
6474 if (txn->mt_dbxs[MAIN_DBI].md_cmp == NULL) {
6475 mdb_default_cmp(txn, MAIN_DBI);
6478 /* Is the DB already open? */
6480 for (i=2; i<txn->mt_numdbs; i++) {
6481 if (!txn->mt_dbxs[i].md_name.mv_size) {
6482 /* Remember this free slot */
6483 if (!unused) unused = i;
6486 if (len == txn->mt_dbxs[i].md_name.mv_size &&
6487 !strncmp(name, txn->mt_dbxs[i].md_name.mv_data, len)) {
6493 /* If no free slot and max hit, fail */
6494 if (!unused && txn->mt_numdbs >= txn->mt_env->me_maxdbs - 1)
6495 return MDB_DBS_FULL;
6497 /* Find the DB info */
6501 key.mv_data = (void *)name;
6502 mdb_cursor_init(&mc, txn, MAIN_DBI, NULL);
6503 rc = mdb_cursor_set(&mc, &key, &data, MDB_SET, &exact);
6504 if (rc == MDB_SUCCESS) {
6505 /* make sure this is actually a DB */
6506 MDB_node *node = NODEPTR(mc.mc_pg[mc.mc_top], mc.mc_ki[mc.mc_top]);
6507 if (!(node->mn_flags & F_SUBDATA))
6509 } else if (rc == MDB_NOTFOUND && (flags & MDB_CREATE)) {
6510 /* Create if requested */
6512 data.mv_size = sizeof(MDB_db);
6513 data.mv_data = &dummy;
6514 memset(&dummy, 0, sizeof(dummy));
6515 dummy.md_root = P_INVALID;
6516 dummy.md_flags = flags & 0xffff;
6517 rc = mdb_cursor_put(&mc, &key, &data, F_SUBDATA);
6521 /* OK, got info, add to table */
6522 if (rc == MDB_SUCCESS) {
6523 unsigned int slot = unused ? unused : txn->mt_numdbs;
6524 txn->mt_dbxs[slot].md_name.mv_data = strdup(name);
6525 txn->mt_dbxs[slot].md_name.mv_size = len;
6526 txn->mt_dbxs[slot].md_rel = NULL;
6527 txn->mt_dbflags[slot] = dbflag;
6528 memcpy(&txn->mt_dbs[slot], data.mv_data, sizeof(MDB_db));
6530 txn->mt_env->me_dbflags[slot] = txn->mt_dbs[slot].md_flags;
6531 mdb_default_cmp(txn, slot);
6534 txn->mt_env->me_numdbs++;
6541 int mdb_stat(MDB_txn *txn, MDB_dbi dbi, MDB_stat *arg)
6543 if (txn == NULL || arg == NULL || dbi >= txn->mt_numdbs)
6546 return mdb_stat0(txn->mt_env, &txn->mt_dbs[dbi], arg);
6549 void mdb_close(MDB_env *env, MDB_dbi dbi)
6552 if (dbi <= MAIN_DBI || dbi >= env->me_numdbs)
6554 ptr = env->me_dbxs[dbi].md_name.mv_data;
6555 env->me_dbxs[dbi].md_name.mv_data = NULL;
6556 env->me_dbxs[dbi].md_name.mv_size = 0;
6560 /** Add all the DB's pages to the free list.
6561 * @param[in] mc Cursor on the DB to free.
6562 * @param[in] subs non-Zero to check for sub-DBs in this DB.
6563 * @return 0 on success, non-zero on failure.
6566 mdb_drop0(MDB_cursor *mc, int subs)
6570 rc = mdb_page_search(mc, NULL, 0);
6571 if (rc == MDB_SUCCESS) {
6576 /* LEAF2 pages have no nodes, cannot have sub-DBs */
6577 if (!subs || IS_LEAF2(mc->mc_pg[mc->mc_top]))
6580 mdb_cursor_copy(mc, &mx);
6581 while (mc->mc_snum > 0) {
6582 if (IS_LEAF(mc->mc_pg[mc->mc_top])) {
6583 for (i=0; i<NUMKEYS(mc->mc_pg[mc->mc_top]); i++) {
6584 ni = NODEPTR(mc->mc_pg[mc->mc_top], i);
6585 if (ni->mn_flags & F_SUBDATA) {
6586 mdb_xcursor_init1(mc, ni);
6587 rc = mdb_drop0(&mc->mc_xcursor->mx_cursor, 0);
6593 for (i=0; i<NUMKEYS(mc->mc_pg[mc->mc_top]); i++) {
6595 ni = NODEPTR(mc->mc_pg[mc->mc_top], i);
6598 mdb_midl_append(&mc->mc_txn->mt_free_pgs, pg);
6603 rc = mdb_cursor_sibling(mc, 1);
6605 /* no more siblings, go back to beginning
6606 * of previous level. (stack was already popped
6607 * by mdb_cursor_sibling)
6609 for (i=1; i<mc->mc_top; i++)
6610 mc->mc_pg[i] = mx.mc_pg[i];
6614 mdb_midl_append(&mc->mc_txn->mt_free_pgs,
6615 mc->mc_db->md_root);
6620 int mdb_drop(MDB_txn *txn, MDB_dbi dbi, int del)
6625 if (!txn || !dbi || dbi >= txn->mt_numdbs)
6628 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY))
6631 rc = mdb_cursor_open(txn, dbi, &mc);
6635 rc = mdb_drop0(mc, mc->mc_db->md_flags & MDB_DUPSORT);
6639 /* Can't delete the main DB */
6640 if (del && dbi > MAIN_DBI) {
6641 rc = mdb_del(txn, MAIN_DBI, &mc->mc_dbx->md_name, NULL);
6643 mdb_close(txn->mt_env, dbi);
6645 txn->mt_dbflags[dbi] |= DB_DIRTY;
6646 txn->mt_dbs[dbi].md_depth = 0;
6647 txn->mt_dbs[dbi].md_branch_pages = 0;
6648 txn->mt_dbs[dbi].md_leaf_pages = 0;
6649 txn->mt_dbs[dbi].md_overflow_pages = 0;
6650 txn->mt_dbs[dbi].md_entries = 0;
6651 txn->mt_dbs[dbi].md_root = P_INVALID;
6654 mdb_cursor_close(mc);
6658 int mdb_set_compare(MDB_txn *txn, MDB_dbi dbi, MDB_cmp_func *cmp)
6660 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs)
6663 txn->mt_dbxs[dbi].md_cmp = cmp;
6667 int mdb_set_dupsort(MDB_txn *txn, MDB_dbi dbi, MDB_cmp_func *cmp)
6669 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs)
6672 txn->mt_dbxs[dbi].md_dcmp = cmp;
6676 int mdb_set_relfunc(MDB_txn *txn, MDB_dbi dbi, MDB_rel_func *rel)
6678 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs)
6681 txn->mt_dbxs[dbi].md_rel = rel;
6685 int mdb_set_relctx(MDB_txn *txn, MDB_dbi dbi, void *ctx)
6687 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs)
6690 txn->mt_dbxs[dbi].md_relctx = ctx;
projects / openldap / blob