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 */
67 #include <semaphore.h>
72 #include <valgrind/memcheck.h>
73 #define VGMEMP_CREATE(h,r,z) VALGRIND_CREATE_MEMPOOL(h,r,z)
74 #define VGMEMP_ALLOC(h,a,s) VALGRIND_MEMPOOL_ALLOC(h,a,s)
75 #define VGMEMP_FREE(h,a) VALGRIND_MEMPOOL_FREE(h,a)
76 #define VGMEMP_DESTROY(h) VALGRIND_DESTROY_MEMPOOL(h)
77 #define VGMEMP_DEFINED(a,s) VALGRIND_MAKE_MEM_DEFINED(a,s)
79 #define VGMEMP_CREATE(h,r,z)
80 #define VGMEMP_ALLOC(h,a,s)
81 #define VGMEMP_FREE(h,a)
82 #define VGMEMP_DESTROY(h)
83 #define VGMEMP_DEFINED(a,s)
87 # if (defined(_LITTLE_ENDIAN) || defined(_BIG_ENDIAN)) && !(defined(_LITTLE_ENDIAN) && defined(_BIG_ENDIAN))
88 /* Solaris just defines one or the other */
89 # define LITTLE_ENDIAN 1234
90 # define BIG_ENDIAN 4321
91 # ifdef _LITTLE_ENDIAN
92 # define BYTE_ORDER LITTLE_ENDIAN
94 # define BYTE_ORDER BIG_ENDIAN
97 # define BYTE_ORDER __BYTE_ORDER
101 #ifndef LITTLE_ENDIAN
102 #define LITTLE_ENDIAN __LITTLE_ENDIAN
105 #define BIG_ENDIAN __BIG_ENDIAN
108 #if defined(__i386) || defined(__x86_64)
109 #define MISALIGNED_OK 1
115 #if (BYTE_ORDER == LITTLE_ENDIAN) == (BYTE_ORDER == BIG_ENDIAN)
116 # error "Unknown or unsupported endianness (BYTE_ORDER)"
117 #elif (-6 & 5) || CHAR_BIT != 8 || UINT_MAX < 0xffffffff || ULONG_MAX % 0xFFFF
118 # error "Two's complement, reasonably sized integer types, please"
121 /** @defgroup internal MDB Internals
124 /** @defgroup compat Windows Compatibility Macros
125 * A bunch of macros to minimize the amount of platform-specific ifdefs
126 * needed throughout the rest of the code. When the features this library
127 * needs are similar enough to POSIX to be hidden in a one-or-two line
128 * replacement, this macro approach is used.
132 #define pthread_t DWORD
133 #define pthread_mutex_t HANDLE
134 #define pthread_key_t DWORD
135 #define pthread_self() GetCurrentThreadId()
136 #define pthread_key_create(x,y) (*(x) = TlsAlloc())
137 #define pthread_key_delete(x) TlsFree(x)
138 #define pthread_getspecific(x) TlsGetValue(x)
139 #define pthread_setspecific(x,y) TlsSetValue(x,y)
140 #define pthread_mutex_unlock(x) ReleaseMutex(x)
141 #define pthread_mutex_lock(x) WaitForSingleObject(x, INFINITE)
142 #define LOCK_MUTEX_R(env) pthread_mutex_lock((env)->me_rmutex)
143 #define UNLOCK_MUTEX_R(env) pthread_mutex_unlock((env)->me_rmutex)
144 #define LOCK_MUTEX_W(env) pthread_mutex_lock((env)->me_wmutex)
145 #define UNLOCK_MUTEX_W(env) pthread_mutex_unlock((env)->me_wmutex)
146 #define getpid() GetCurrentProcessId()
147 #define MDB_FDATASYNC(fd) (!FlushFileBuffers(fd))
148 #define ErrCode() GetLastError()
149 #define GET_PAGESIZE(x) {SYSTEM_INFO si; GetSystemInfo(&si); (x) = si.dwPageSize;}
150 #define close(fd) CloseHandle(fd)
151 #define munmap(ptr,len) UnmapViewOfFile(ptr)
154 #define LOCK_MUTEX_R(env) sem_wait((env)->me_rmutex)
155 #define UNLOCK_MUTEX_R(env) sem_post((env)->me_rmutex)
156 #define LOCK_MUTEX_W(env) sem_wait((env)->me_wmutex)
157 #define UNLOCK_MUTEX_W(env) sem_post((env)->me_wmutex)
158 #define MDB_FDATASYNC(fd) fsync(fd)
161 #define MDB_FDATASYNC(fd) fsync(fd)
163 /** Lock the reader mutex.
165 #define LOCK_MUTEX_R(env) pthread_mutex_lock(&(env)->me_txns->mti_mutex)
166 /** Unlock the reader mutex.
168 #define UNLOCK_MUTEX_R(env) pthread_mutex_unlock(&(env)->me_txns->mti_mutex)
170 /** Lock the writer mutex.
171 * Only a single write transaction is allowed at a time. Other writers
172 * will block waiting for this mutex.
174 #define LOCK_MUTEX_W(env) pthread_mutex_lock(&(env)->me_txns->mti_wmutex)
175 /** Unlock the writer mutex.
177 #define UNLOCK_MUTEX_W(env) pthread_mutex_unlock(&(env)->me_txns->mti_wmutex)
178 #endif /* __APPLE__ */
180 /** Get the error code for the last failed system function.
182 #define ErrCode() errno
184 /** An abstraction for a file handle.
185 * On POSIX systems file handles are small integers. On Windows
186 * they're opaque pointers.
190 /** A value for an invalid file handle.
191 * Mainly used to initialize file variables and signify that they are
194 #define INVALID_HANDLE_VALUE (-1)
196 /** Get the size of a memory page for the system.
197 * This is the basic size that the platform's memory manager uses, and is
198 * fundamental to the use of memory-mapped files.
200 #define GET_PAGESIZE(x) ((x) = sysconf(_SC_PAGE_SIZE))
203 #if defined(_WIN32) || defined(__APPLE__)
206 #define MNAME_LEN (sizeof(pthread_mutex_t))
212 /** A flag for opening a file and requesting synchronous data writes.
213 * This is only used when writing a meta page. It's not strictly needed;
214 * we could just do a normal write and then immediately perform a flush.
215 * But if this flag is available it saves us an extra system call.
217 * @note If O_DSYNC is undefined but exists in /usr/include,
218 * preferably set some compiler flag to get the definition.
219 * Otherwise compile with the less efficient -DMDB_DSYNC=O_SYNC.
222 # define MDB_DSYNC O_DSYNC
226 /** Function for flushing the data of a file. Define this to fsync
227 * if fdatasync() is not supported.
229 #ifndef MDB_FDATASYNC
230 # define MDB_FDATASYNC fdatasync
233 /** A page number in the database.
234 * Note that 64 bit page numbers are overkill, since pages themselves
235 * already represent 12-13 bits of addressable memory, and the OS will
236 * always limit applications to a maximum of 63 bits of address space.
238 * @note In the #MDB_node structure, we only store 48 bits of this value,
239 * which thus limits us to only 60 bits of addressable data.
243 /** A transaction ID.
244 * See struct MDB_txn.mt_txnid for details.
248 /** @defgroup debug Debug Macros
252 /** Enable debug output.
253 * Set this to 1 for copious tracing. Set to 2 to add dumps of all IDLs
254 * read from and written to the database (used for free space management).
259 #if !(__STDC_VERSION__ >= 199901L || defined(__GNUC__))
260 # define DPRINTF (void) /* Vararg macros may be unsupported */
262 static int mdb_debug;
263 static txnid_t mdb_debug_start;
265 /** Print a debug message with printf formatting. */
266 # define DPRINTF(fmt, ...) /**< Requires 2 or more args */ \
267 ((void) ((mdb_debug) && \
268 fprintf(stderr, "%s:%d " fmt "\n", __func__, __LINE__, __VA_ARGS__)))
270 # define DPRINTF(fmt, ...) ((void) 0)
272 /** Print a debug string.
273 * The string is printed literally, with no format processing.
275 #define DPUTS(arg) DPRINTF("%s", arg)
278 /** A default memory page size.
279 * The actual size is platform-dependent, but we use this for
280 * boot-strapping. We probably should not be using this any more.
281 * The #GET_PAGESIZE() macro is used to get the actual size.
283 * Note that we don't currently support Huge pages. On Linux,
284 * regular data files cannot use Huge pages, and in general
285 * Huge pages aren't actually pageable. We rely on the OS
286 * demand-pager to read our data and page it out when memory
287 * pressure from other processes is high. So until OSs have
288 * actual paging support for Huge pages, they're not viable.
290 #define MDB_PAGESIZE 4096
292 /** The minimum number of keys required in a database page.
293 * Setting this to a larger value will place a smaller bound on the
294 * maximum size of a data item. Data items larger than this size will
295 * be pushed into overflow pages instead of being stored directly in
296 * the B-tree node. This value used to default to 4. With a page size
297 * of 4096 bytes that meant that any item larger than 1024 bytes would
298 * go into an overflow page. That also meant that on average 2-3KB of
299 * each overflow page was wasted space. The value cannot be lower than
300 * 2 because then there would no longer be a tree structure. With this
301 * value, items larger than 2KB will go into overflow pages, and on
302 * average only 1KB will be wasted.
304 #define MDB_MINKEYS 2
306 /** A stamp that identifies a file as an MDB file.
307 * There's nothing special about this value other than that it is easily
308 * recognizable, and it will reflect any byte order mismatches.
310 #define MDB_MAGIC 0xBEEFC0DE
312 /** The version number for a database's file format. */
313 #define MDB_VERSION 1
315 /** The maximum size of a key in the database.
316 * While data items have essentially unbounded size, we require that
317 * keys all fit onto a regular page. This limit could be raised a bit
318 * further if needed; to something just under #MDB_PAGESIZE / #MDB_MINKEYS.
320 #define MAXKEYSIZE 511
325 * This is used for printing a hex dump of a key's contents.
327 #define DKBUF char kbuf[(MAXKEYSIZE*2+1)]
328 /** Display a key in hex.
330 * Invoke a function to display a key in hex.
332 #define DKEY(x) mdb_dkey(x, kbuf)
334 #define DKBUF typedef int dummy_kbuf /* so we can put ';' after */
338 /** @defgroup lazylock Lazy Locking
339 * Macros for locks that aren't actually needed.
340 * The DB view is always consistent because all writes are wrapped in
341 * the wmutex. Finer-grained locks aren't necessary.
345 /** Use lazy locking. I.e., don't lock these accesses at all. */
349 /** Grab the reader lock */
350 #define LAZY_MUTEX_LOCK(x)
351 /** Release the reader lock */
352 #define LAZY_MUTEX_UNLOCK(x)
353 /** Release the DB table reader/writer lock */
354 #define LAZY_RWLOCK_UNLOCK(x)
355 /** Grab the DB table write lock */
356 #define LAZY_RWLOCK_WRLOCK(x)
357 /** Grab the DB table read lock */
358 #define LAZY_RWLOCK_RDLOCK(x)
359 /** Declare the DB table rwlock. Should not be followed by ';'. */
360 #define LAZY_RWLOCK_DEF(x)
361 /** Initialize the DB table rwlock */
362 #define LAZY_RWLOCK_INIT(x,y)
363 /** Destroy the DB table rwlock */
364 #define LAZY_RWLOCK_DESTROY(x)
366 #define LAZY_MUTEX_LOCK(x) pthread_mutex_lock(x)
367 #define LAZY_MUTEX_UNLOCK(x) pthread_mutex_unlock(x)
368 #define LAZY_RWLOCK_UNLOCK(x) pthread_rwlock_unlock(x)
369 #define LAZY_RWLOCK_WRLOCK(x) pthread_rwlock_wrlock(x)
370 #define LAZY_RWLOCK_RDLOCK(x) pthread_rwlock_rdlock(x)
371 #define LAZY_RWLOCK_DEF(x) pthread_rwlock_t x;
372 #define LAZY_RWLOCK_INIT(x,y) pthread_rwlock_init(x,y)
373 #define LAZY_RWLOCK_DESTROY(x) pthread_rwlock_destroy(x)
377 /** An invalid page number.
378 * Mainly used to denote an empty tree.
380 #define P_INVALID (~0UL)
382 /** Test if a flag \b f is set in a flag word \b w. */
383 #define F_ISSET(w, f) (((w) & (f)) == (f))
385 /** Used for offsets within a single page.
386 * Since memory pages are typically 4 or 8KB in size, 12-13 bits,
389 typedef uint16_t indx_t;
391 /** Default size of memory map.
392 * This is certainly too small for any actual applications. Apps should always set
393 * the size explicitly using #mdb_env_set_mapsize().
395 #define DEFAULT_MAPSIZE 1048576
397 /** @defgroup readers Reader Lock Table
398 * Readers don't acquire any locks for their data access. Instead, they
399 * simply record their transaction ID in the reader table. The reader
400 * mutex is needed just to find an empty slot in the reader table. The
401 * slot's address is saved in thread-specific data so that subsequent read
402 * transactions started by the same thread need no further locking to proceed.
404 * Since the database uses multi-version concurrency control, readers don't
405 * actually need any locking. This table is used to keep track of which
406 * readers are using data from which old transactions, so that we'll know
407 * when a particular old transaction is no longer in use. Old transactions
408 * that have discarded any data pages can then have those pages reclaimed
409 * for use by a later write transaction.
411 * The lock table is constructed such that reader slots are aligned with the
412 * processor's cache line size. Any slot is only ever used by one thread.
413 * This alignment guarantees that there will be no contention or cache
414 * thrashing as threads update their own slot info, and also eliminates
415 * any need for locking when accessing a slot.
417 * A writer thread will scan every slot in the table to determine the oldest
418 * outstanding reader transaction. Any freed pages older than this will be
419 * reclaimed by the writer. The writer doesn't use any locks when scanning
420 * this table. This means that there's no guarantee that the writer will
421 * see the most up-to-date reader info, but that's not required for correct
422 * operation - all we need is to know the upper bound on the oldest reader,
423 * we don't care at all about the newest reader. So the only consequence of
424 * reading stale information here is that old pages might hang around a
425 * while longer before being reclaimed. That's actually good anyway, because
426 * the longer we delay reclaiming old pages, the more likely it is that a
427 * string of contiguous pages can be found after coalescing old pages from
428 * many old transactions together.
430 * @todo We don't actually do such coalescing yet, we grab pages from one
431 * old transaction at a time.
434 /** Number of slots in the reader table.
435 * This value was chosen somewhat arbitrarily. 126 readers plus a
436 * couple mutexes fit exactly into 8KB on my development machine.
437 * Applications should set the table size using #mdb_env_set_maxreaders().
439 #define DEFAULT_READERS 126
441 /** The size of a CPU cache line in bytes. We want our lock structures
442 * aligned to this size to avoid false cache line sharing in the
444 * This value works for most CPUs. For Itanium this should be 128.
450 /** The information we store in a single slot of the reader table.
451 * In addition to a transaction ID, we also record the process and
452 * thread ID that owns a slot, so that we can detect stale information,
453 * e.g. threads or processes that went away without cleaning up.
454 * @note We currently don't check for stale records. We simply re-init
455 * the table when we know that we're the only process opening the
458 typedef struct MDB_rxbody {
459 /** The current Transaction ID when this transaction began.
460 * Multiple readers that start at the same time will probably have the
461 * same ID here. Again, it's not important to exclude them from
462 * anything; all we need to know is which version of the DB they
463 * started from so we can avoid overwriting any data used in that
464 * particular version.
467 /** The process ID of the process owning this reader txn. */
469 /** The thread ID of the thread owning this txn. */
473 /** The actual reader record, with cacheline padding. */
474 typedef struct MDB_reader {
477 /** shorthand for mrb_txnid */
478 #define mr_txnid mru.mrx.mrb_txnid
479 #define mr_pid mru.mrx.mrb_pid
480 #define mr_tid mru.mrx.mrb_tid
481 /** cache line alignment */
482 char pad[(sizeof(MDB_rxbody)+CACHELINE-1) & ~(CACHELINE-1)];
486 /** The header for the reader table.
487 * The table resides in a memory-mapped file. (This is a different file
488 * than is used for the main database.)
490 * For POSIX the actual mutexes reside in the shared memory of this
491 * mapped file. On Windows, mutexes are named objects allocated by the
492 * kernel; we store the mutex names in this mapped file so that other
493 * processes can grab them. This same approach is also used on
494 * MacOSX/Darwin (using named semaphores) since MacOSX doesn't support
495 * process-shared POSIX mutexes. For these cases where a named object
496 * is used, the object name is derived from a 64 bit FNV hash of the
497 * environment pathname. As such, naming collisions are extremely
498 * unlikely. If a collision occurs, the results are unpredictable.
500 typedef struct MDB_txbody {
501 /** Stamp identifying this as an MDB file. It must be set
504 /** Version number of this lock file. Must be set to #MDB_VERSION. */
505 uint32_t mtb_version;
506 #if defined(_WIN32) || defined(__APPLE__)
507 char mtb_rmname[MNAME_LEN];
509 /** Mutex protecting access to this table.
510 * This is the reader lock that #LOCK_MUTEX_R acquires.
512 pthread_mutex_t mtb_mutex;
515 /** The ID of the last transaction committed to the database.
516 * This is recorded here only for convenience; the value can always
517 * be determined by reading the main database meta pages.
519 * Value is unused, but maintained for backwards compatibility.
520 * Drop this or mtb_me_toggle when changing MDB_VERSION.
521 * (Reading both should have been done atomically.)
525 /** The number of slots that have been used in the reader table.
526 * This always records the maximum count, it is not decremented
527 * when readers release their slots.
529 unsigned mtb_numreaders;
530 /** The ID of the most recent meta page in the database.
531 * This is recorded here only for convenience; the value can always
532 * be determined by reading the main database meta pages.
534 uint32_t mtb_me_toggle;
537 /** The actual reader table definition. */
538 typedef struct MDB_txninfo {
541 #define mti_magic mt1.mtb.mtb_magic
542 #define mti_version mt1.mtb.mtb_version
543 #define mti_mutex mt1.mtb.mtb_mutex
544 #define mti_rmname mt1.mtb.mtb_rmname
546 #define mti_txnid mt1.mtb.mtb_txnid
548 #define mti_numreaders mt1.mtb.mtb_numreaders
549 #define mti_me_toggle mt1.mtb.mtb_me_toggle
550 char pad[(sizeof(MDB_txbody)+CACHELINE-1) & ~(CACHELINE-1)];
553 #if defined(_WIN32) || defined(__APPLE__)
554 char mt2_wmname[MNAME_LEN];
555 #define mti_wmname mt2.mt2_wmname
557 pthread_mutex_t mt2_wmutex;
558 #define mti_wmutex mt2.mt2_wmutex
560 char pad[(MNAME_LEN+CACHELINE-1) & ~(CACHELINE-1)];
562 MDB_reader mti_readers[1];
566 /** Common header for all page types.
567 * Overflow records occupy a number of contiguous pages with no
568 * headers on any page after the first.
570 typedef struct MDB_page {
571 #define mp_pgno mp_p.p_pgno
572 #define mp_next mp_p.p_next
574 pgno_t p_pgno; /**< page number */
575 void * p_next; /**< for in-memory list of freed structs */
578 /** @defgroup mdb_page Page Flags
580 * Flags for the page headers.
583 #define P_BRANCH 0x01 /**< branch page */
584 #define P_LEAF 0x02 /**< leaf page */
585 #define P_OVERFLOW 0x04 /**< overflow page */
586 #define P_META 0x08 /**< meta page */
587 #define P_DIRTY 0x10 /**< dirty page */
588 #define P_LEAF2 0x20 /**< for #MDB_DUPFIXED records */
589 #define P_SUBP 0x40 /**< for #MDB_DUPSORT sub-pages */
591 uint16_t mp_flags; /**< @ref mdb_page */
592 #define mp_lower mp_pb.pb.pb_lower
593 #define mp_upper mp_pb.pb.pb_upper
594 #define mp_pages mp_pb.pb_pages
597 indx_t pb_lower; /**< lower bound of free space */
598 indx_t pb_upper; /**< upper bound of free space */
600 uint32_t pb_pages; /**< number of overflow pages */
602 indx_t mp_ptrs[1]; /**< dynamic size */
605 /** Size of the page header, excluding dynamic data at the end */
606 #define PAGEHDRSZ ((unsigned) offsetof(MDB_page, mp_ptrs))
608 /** Address of first usable data byte in a page, after the header */
609 #define METADATA(p) ((void *)((char *)(p) + PAGEHDRSZ))
611 /** Number of nodes on a page */
612 #define NUMKEYS(p) (((p)->mp_lower - PAGEHDRSZ) >> 1)
614 /** The amount of space remaining in the page */
615 #define SIZELEFT(p) (indx_t)((p)->mp_upper - (p)->mp_lower)
617 /** The percentage of space used in the page, in tenths of a percent. */
618 #define PAGEFILL(env, p) (1000L * ((env)->me_psize - PAGEHDRSZ - SIZELEFT(p)) / \
619 ((env)->me_psize - PAGEHDRSZ))
620 /** The minimum page fill factor, in tenths of a percent.
621 * Pages emptier than this are candidates for merging.
623 #define FILL_THRESHOLD 250
625 /** Test if a page is a leaf page */
626 #define IS_LEAF(p) F_ISSET((p)->mp_flags, P_LEAF)
627 /** Test if a page is a LEAF2 page */
628 #define IS_LEAF2(p) F_ISSET((p)->mp_flags, P_LEAF2)
629 /** Test if a page is a branch page */
630 #define IS_BRANCH(p) F_ISSET((p)->mp_flags, P_BRANCH)
631 /** Test if a page is an overflow page */
632 #define IS_OVERFLOW(p) F_ISSET((p)->mp_flags, P_OVERFLOW)
633 /** Test if a page is a sub page */
634 #define IS_SUBP(p) F_ISSET((p)->mp_flags, P_SUBP)
636 /** The number of overflow pages needed to store the given size. */
637 #define OVPAGES(size, psize) ((PAGEHDRSZ-1 + (size)) / (psize) + 1)
639 /** Header for a single key/data pair within a page.
640 * We guarantee 2-byte alignment for nodes.
642 typedef struct MDB_node {
643 /** lo and hi are used for data size on leaf nodes and for
644 * child pgno on branch nodes. On 64 bit platforms, flags
645 * is also used for pgno. (Branch nodes have no flags).
646 * They are in host byte order in case that lets some
647 * accesses be optimized into a 32-bit word access.
649 #define mn_lo mn_offset[BYTE_ORDER!=LITTLE_ENDIAN]
650 #define mn_hi mn_offset[BYTE_ORDER==LITTLE_ENDIAN] /**< part of dsize or pgno */
651 unsigned short mn_offset[2]; /**< storage for #mn_lo and #mn_hi */
652 /** @defgroup mdb_node Node Flags
654 * Flags for node headers.
657 #define F_BIGDATA 0x01 /**< data put on overflow page */
658 #define F_SUBDATA 0x02 /**< data is a sub-database */
659 #define F_DUPDATA 0x04 /**< data has duplicates */
661 /** valid flags for #mdb_node_add() */
662 #define NODE_ADD_FLAGS (F_DUPDATA|F_SUBDATA|MDB_RESERVE|MDB_APPEND)
665 unsigned short mn_flags; /**< @ref mdb_node */
666 unsigned short mn_ksize; /**< key size */
667 char mn_data[1]; /**< key and data are appended here */
670 /** Size of the node header, excluding dynamic data at the end */
671 #define NODESIZE offsetof(MDB_node, mn_data)
673 /** Bit position of top word in page number, for shifting mn_flags */
674 #define PGNO_TOPWORD ((pgno_t)-1 > 0xffffffffu ? 32 : 0)
676 /** Size of a node in a branch page with a given key.
677 * This is just the node header plus the key, there is no data.
679 #define INDXSIZE(k) (NODESIZE + ((k) == NULL ? 0 : (k)->mv_size))
681 /** Size of a node in a leaf page with a given key and data.
682 * This is node header plus key plus data size.
684 #define LEAFSIZE(k, d) (NODESIZE + (k)->mv_size + (d)->mv_size)
686 /** Address of node \b i in page \b p */
687 #define NODEPTR(p, i) ((MDB_node *)((char *)(p) + (p)->mp_ptrs[i]))
689 /** Address of the key for the node */
690 #define NODEKEY(node) (void *)((node)->mn_data)
692 /** Address of the data for a node */
693 #define NODEDATA(node) (void *)((char *)(node)->mn_data + (node)->mn_ksize)
695 /** Get the page number pointed to by a branch node */
696 #define NODEPGNO(node) \
697 ((node)->mn_lo | ((pgno_t) (node)->mn_hi << 16) | \
698 (PGNO_TOPWORD ? ((pgno_t) (node)->mn_flags << PGNO_TOPWORD) : 0))
699 /** Set the page number in a branch node */
700 #define SETPGNO(node,pgno) do { \
701 (node)->mn_lo = (pgno) & 0xffff; (node)->mn_hi = (pgno) >> 16; \
702 if (PGNO_TOPWORD) (node)->mn_flags = (pgno) >> PGNO_TOPWORD; } while(0)
704 /** Get the size of the data in a leaf node */
705 #define NODEDSZ(node) ((node)->mn_lo | ((unsigned)(node)->mn_hi << 16))
706 /** Set the size of the data for a leaf node */
707 #define SETDSZ(node,size) do { \
708 (node)->mn_lo = (size) & 0xffff; (node)->mn_hi = (size) >> 16;} while(0)
709 /** The size of a key in a node */
710 #define NODEKSZ(node) ((node)->mn_ksize)
712 /** Copy a page number from src to dst */
714 #define COPY_PGNO(dst,src) dst = src
716 #if SIZE_MAX > 4294967295UL
717 #define COPY_PGNO(dst,src) do { \
718 unsigned short *s, *d; \
719 s = (unsigned short *)&(src); \
720 d = (unsigned short *)&(dst); \
727 #define COPY_PGNO(dst,src) do { \
728 unsigned short *s, *d; \
729 s = (unsigned short *)&(src); \
730 d = (unsigned short *)&(dst); \
736 /** The address of a key in a LEAF2 page.
737 * LEAF2 pages are used for #MDB_DUPFIXED sorted-duplicate sub-DBs.
738 * There are no node headers, keys are stored contiguously.
740 #define LEAF2KEY(p, i, ks) ((char *)(p) + PAGEHDRSZ + ((i)*(ks)))
742 /** Set the \b node's key into \b key, if requested. */
743 #define MDB_SET_KEY(node, key) { if ((key) != NULL) { \
744 (key)->mv_size = NODEKSZ(node); (key)->mv_data = NODEKEY(node); } }
746 /** Information about a single database in the environment. */
747 typedef struct MDB_db {
748 uint32_t md_pad; /**< also ksize for LEAF2 pages */
749 uint16_t md_flags; /**< @ref mdb_open */
750 uint16_t md_depth; /**< depth of this tree */
751 pgno_t md_branch_pages; /**< number of internal pages */
752 pgno_t md_leaf_pages; /**< number of leaf pages */
753 pgno_t md_overflow_pages; /**< number of overflow pages */
754 size_t md_entries; /**< number of data items */
755 pgno_t md_root; /**< the root page of this tree */
758 /** Handle for the DB used to track free pages. */
760 /** Handle for the default DB. */
763 /** Meta page content. */
764 typedef struct MDB_meta {
765 /** Stamp identifying this as an MDB file. It must be set
768 /** Version number of this lock file. Must be set to #MDB_VERSION. */
770 void *mm_address; /**< address for fixed mapping */
771 size_t mm_mapsize; /**< size of mmap region */
772 MDB_db mm_dbs[2]; /**< first is free space, 2nd is main db */
773 /** The size of pages used in this DB */
774 #define mm_psize mm_dbs[0].md_pad
775 /** Any persistent environment flags. @ref mdb_env */
776 #define mm_flags mm_dbs[0].md_flags
777 pgno_t mm_last_pg; /**< last used page in file */
778 txnid_t mm_txnid; /**< txnid that committed this page */
781 /** Buffer for a stack-allocated dirty page.
782 * The members define size and alignment, and silence type
783 * aliasing warnings. They are not used directly; that could
784 * mean incorrectly using several union members in parallel.
786 typedef union MDB_pagebuf {
787 char mb_raw[MDB_PAGESIZE];
790 char mm_pad[PAGEHDRSZ];
795 /** Auxiliary DB info.
796 * The information here is mostly static/read-only. There is
797 * only a single copy of this record in the environment.
799 typedef struct MDB_dbx {
800 MDB_val md_name; /**< name of the database */
801 MDB_cmp_func *md_cmp; /**< function for comparing keys */
802 MDB_cmp_func *md_dcmp; /**< function for comparing data items */
803 MDB_rel_func *md_rel; /**< user relocate function */
804 void *md_relctx; /**< user-provided context for md_rel */
807 /** A database transaction.
808 * Every operation requires a transaction handle.
811 MDB_txn *mt_parent; /**< parent of a nested txn */
812 MDB_txn *mt_child; /**< nested txn under this txn */
813 pgno_t mt_next_pgno; /**< next unallocated page */
814 /** The ID of this transaction. IDs are integers incrementing from 1.
815 * Only committed write transactions increment the ID. If a transaction
816 * aborts, the ID may be re-used by the next writer.
819 MDB_env *mt_env; /**< the DB environment */
820 /** The list of pages that became unused during this transaction.
824 ID2L dirty_list; /**< modified pages */
825 MDB_reader *reader; /**< this thread's slot in the reader table */
827 /** Array of records for each DB known in the environment. */
829 /** Array of MDB_db records for each known DB */
831 /** @defgroup mt_dbflag Transaction DB Flags
835 #define DB_DIRTY 0x01 /**< DB was written in this txn */
836 #define DB_STALE 0x02 /**< DB record is older than txnID */
838 /** Array of cursors for each DB */
839 MDB_cursor **mt_cursors;
840 /** Array of flags for each DB */
841 unsigned char *mt_dbflags;
842 /** Number of DB records in use. This number only ever increments;
843 * we don't decrement it when individual DB handles are closed.
847 /** @defgroup mdb_txn Transaction Flags
851 #define MDB_TXN_RDONLY 0x01 /**< read-only transaction */
852 #define MDB_TXN_ERROR 0x02 /**< an error has occurred */
854 unsigned int mt_flags; /**< @ref mdb_txn */
855 /** Tracks which of the two meta pages was used at the start
856 * of this transaction.
858 unsigned int mt_toggle;
861 /** Enough space for 2^32 nodes with minimum of 2 keys per node. I.e., plenty.
862 * At 4 keys per node, enough for 2^64 nodes, so there's probably no need to
863 * raise this on a 64 bit machine.
865 #define CURSOR_STACK 32
869 /** Cursors are used for all DB operations */
871 /** Next cursor on this DB in this txn */
873 /** Original cursor if this is a shadow */
875 /** Context used for databases with #MDB_DUPSORT, otherwise NULL */
876 struct MDB_xcursor *mc_xcursor;
877 /** The transaction that owns this cursor */
879 /** The database handle this cursor operates on */
881 /** The database record for this cursor */
883 /** The database auxiliary record for this cursor */
885 /** The @ref mt_dbflag for this database */
886 unsigned char *mc_dbflag;
887 unsigned short mc_snum; /**< number of pushed pages */
888 unsigned short mc_top; /**< index of top page, normally mc_snum-1 */
889 /** @defgroup mdb_cursor Cursor Flags
891 * Cursor state flags.
894 #define C_INITIALIZED 0x01 /**< cursor has been initialized and is valid */
895 #define C_EOF 0x02 /**< No more data */
896 #define C_SUB 0x04 /**< Cursor is a sub-cursor */
897 #define C_SHADOW 0x08 /**< Cursor is a dup from a parent txn */
898 #define C_ALLOCD 0x10 /**< Cursor was malloc'd */
900 unsigned int mc_flags; /**< @ref mdb_cursor */
901 MDB_page *mc_pg[CURSOR_STACK]; /**< stack of pushed pages */
902 indx_t mc_ki[CURSOR_STACK]; /**< stack of page indices */
905 /** Context for sorted-dup records.
906 * We could have gone to a fully recursive design, with arbitrarily
907 * deep nesting of sub-databases. But for now we only handle these
908 * levels - main DB, optional sub-DB, sorted-duplicate DB.
910 typedef struct MDB_xcursor {
911 /** A sub-cursor for traversing the Dup DB */
912 MDB_cursor mx_cursor;
913 /** The database record for this Dup DB */
915 /** The auxiliary DB record for this Dup DB */
917 /** The @ref mt_dbflag for this Dup DB */
918 unsigned char mx_dbflag;
921 /** A set of pages freed by an earlier transaction. */
922 typedef struct MDB_oldpages {
923 /** Usually we only read one record from the FREEDB at a time, but
924 * in case we read more, this will chain them together.
926 struct MDB_oldpages *mo_next;
927 /** The ID of the transaction in which these pages were freed. */
929 /** An #IDL of the pages */
930 pgno_t mo_pages[1]; /* dynamic */
933 /** The database environment. */
935 HANDLE me_fd; /**< The main data file */
936 HANDLE me_lfd; /**< The lock file */
937 HANDLE me_mfd; /**< just for writing the meta pages */
938 /** Failed to update the meta page. Probably an I/O error. */
939 #define MDB_FATAL_ERROR 0x80000000U
940 uint32_t me_flags; /**< @ref mdb_env */
941 uint32_t me_extrapad; /**< unused for now */
942 unsigned int me_maxreaders; /**< size of the reader table */
943 MDB_dbi me_numdbs; /**< number of DBs opened */
944 MDB_dbi me_maxdbs; /**< size of the DB table */
945 char *me_path; /**< path to the DB files */
946 char *me_map; /**< the memory map of the data file */
947 MDB_txninfo *me_txns; /**< the memory map of the lock file */
948 MDB_meta *me_metas[2]; /**< pointers to the two meta pages */
949 MDB_txn *me_txn; /**< current write transaction */
950 size_t me_mapsize; /**< size of the data memory map */
951 off_t me_size; /**< current file size */
952 pgno_t me_maxpg; /**< me_mapsize / me_psize */
953 unsigned int me_psize; /**< size of a page, from #GET_PAGESIZE */
954 unsigned int me_db_toggle; /**< which DB table is current */
955 txnid_t me_wtxnid; /**< ID of last txn we committed */
956 txnid_t me_pgfirst; /**< ID of first old page record we used */
957 txnid_t me_pglast; /**< ID of last old page record we used */
958 MDB_dbx *me_dbxs; /**< array of static DB info */
959 MDB_db *me_dbs[2]; /**< two arrays of MDB_db info */
960 MDB_oldpages *me_pghead; /**< list of old page records */
961 pthread_key_t me_txkey; /**< thread-key for readers */
962 MDB_page *me_dpages; /**< list of malloc'd blocks for re-use */
963 /** IDL of pages that became unused in a write txn */
965 /** ID2L of pages that were written during a write txn */
966 ID2 me_dirty_list[MDB_IDL_UM_SIZE];
967 /** rwlock for the DB tables, if #LAZY_LOCKS is false */
968 LAZY_RWLOCK_DEF(me_dblock)
970 HANDLE me_rmutex; /* Windows mutexes don't reside in shared mem */
974 sem_t *me_rmutex; /* Apple doesn't support shared mutexes */
978 /** max number of pages to commit in one writev() call */
979 #define MDB_COMMIT_PAGES 64
980 #if defined(IOV_MAX) && IOV_MAX < MDB_COMMIT_PAGES
981 #undef MDB_COMMIT_PAGES
982 #define MDB_COMMIT_PAGES IOV_MAX
985 static MDB_page *mdb_page_alloc(MDB_cursor *mc, int num);
986 static MDB_page *mdb_page_new(MDB_cursor *mc, uint32_t flags, int num);
987 static int mdb_page_touch(MDB_cursor *mc);
989 static int mdb_page_get(MDB_txn *txn, pgno_t pgno, MDB_page **mp);
990 static int mdb_page_search_root(MDB_cursor *mc,
991 MDB_val *key, int modify);
992 static int mdb_page_search(MDB_cursor *mc,
993 MDB_val *key, int modify);
994 static int mdb_page_merge(MDB_cursor *csrc, MDB_cursor *cdst);
995 static int mdb_page_split(MDB_cursor *mc, MDB_val *newkey, MDB_val *newdata,
996 pgno_t newpgno, unsigned int nflags);
998 static int mdb_env_read_header(MDB_env *env, MDB_meta *meta);
999 static int mdb_env_read_meta(MDB_env *env, int *which);
1000 static int mdb_env_write_meta(MDB_txn *txn);
1002 static MDB_node *mdb_node_search(MDB_cursor *mc, MDB_val *key, int *exactp);
1003 static int mdb_node_add(MDB_cursor *mc, indx_t indx,
1004 MDB_val *key, MDB_val *data, pgno_t pgno, unsigned int flags);
1005 static void mdb_node_del(MDB_page *mp, indx_t indx, int ksize);
1006 static void mdb_node_shrink(MDB_page *mp, indx_t indx);
1007 static int mdb_node_move(MDB_cursor *csrc, MDB_cursor *cdst);
1008 static int mdb_node_read(MDB_txn *txn, MDB_node *leaf, MDB_val *data);
1009 static size_t mdb_leaf_size(MDB_env *env, MDB_val *key, MDB_val *data);
1010 static size_t mdb_branch_size(MDB_env *env, MDB_val *key);
1012 static int mdb_rebalance(MDB_cursor *mc);
1013 static int mdb_update_key(MDB_page *mp, indx_t indx, MDB_val *key);
1015 static void mdb_cursor_pop(MDB_cursor *mc);
1016 static int mdb_cursor_push(MDB_cursor *mc, MDB_page *mp);
1018 static int mdb_cursor_del0(MDB_cursor *mc, MDB_node *leaf);
1019 static int mdb_cursor_sibling(MDB_cursor *mc, int move_right);
1020 static int mdb_cursor_next(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op);
1021 static int mdb_cursor_prev(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op);
1022 static int mdb_cursor_set(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op,
1024 static int mdb_cursor_first(MDB_cursor *mc, MDB_val *key, MDB_val *data);
1025 static int mdb_cursor_last(MDB_cursor *mc, MDB_val *key, MDB_val *data);
1027 static void mdb_cursor_init(MDB_cursor *mc, MDB_txn *txn, MDB_dbi dbi, MDB_xcursor *mx);
1028 static void mdb_xcursor_init0(MDB_cursor *mc);
1029 static void mdb_xcursor_init1(MDB_cursor *mc, MDB_node *node);
1031 static int mdb_drop0(MDB_cursor *mc, int subs);
1032 static void mdb_default_cmp(MDB_txn *txn, MDB_dbi dbi);
1035 static MDB_cmp_func mdb_cmp_memn, mdb_cmp_memnr, mdb_cmp_int, mdb_cmp_cint, mdb_cmp_long;
1039 static SECURITY_DESCRIPTOR mdb_null_sd;
1040 static SECURITY_ATTRIBUTES mdb_all_sa;
1041 static int mdb_sec_inited;
1044 /** Return the library version info. */
1046 mdb_version(int *major, int *minor, int *patch)
1048 if (major) *major = MDB_VERSION_MAJOR;
1049 if (minor) *minor = MDB_VERSION_MINOR;
1050 if (patch) *patch = MDB_VERSION_PATCH;
1051 return MDB_VERSION_STRING;
1054 /** Table of descriptions for MDB @ref errors */
1055 static char *const mdb_errstr[] = {
1056 "MDB_KEYEXIST: Key/data pair already exists",
1057 "MDB_NOTFOUND: No matching key/data pair found",
1058 "MDB_PAGE_NOTFOUND: Requested page not found",
1059 "MDB_CORRUPTED: Located page was wrong type",
1060 "MDB_PANIC: Update of meta page failed",
1061 "MDB_VERSION_MISMATCH: Database environment version mismatch"
1065 mdb_strerror(int err)
1068 return ("Successful return: 0");
1070 if (err >= MDB_KEYEXIST && err <= MDB_VERSION_MISMATCH)
1071 return mdb_errstr[err - MDB_KEYEXIST];
1073 return strerror(err);
1077 /** Display a key in hexadecimal and return the address of the result.
1078 * @param[in] key the key to display
1079 * @param[in] buf the buffer to write into. Should always be #DKBUF.
1080 * @return The key in hexadecimal form.
1083 mdb_dkey(MDB_val *key, char *buf)
1086 unsigned char *c = key->mv_data;
1088 if (key->mv_size > MAXKEYSIZE)
1089 return "MAXKEYSIZE";
1090 /* may want to make this a dynamic check: if the key is mostly
1091 * printable characters, print it as-is instead of converting to hex.
1095 for (i=0; i<key->mv_size; i++)
1096 ptr += sprintf(ptr, "%02x", *c++);
1098 sprintf(buf, "%.*s", key->mv_size, key->mv_data);
1103 /** Display all the keys in the page. */
1105 mdb_page_keys(MDB_page *mp)
1108 unsigned int i, nkeys;
1112 nkeys = NUMKEYS(mp);
1113 DPRINTF("numkeys %d", nkeys);
1114 for (i=0; i<nkeys; i++) {
1115 node = NODEPTR(mp, i);
1116 key.mv_size = node->mn_ksize;
1117 key.mv_data = node->mn_data;
1118 DPRINTF("key %d: %s", i, DKEY(&key));
1124 /** Count all the pages in each DB and in the freelist
1125 * and make sure it matches the actual number of pages
1128 static void mdb_audit(MDB_txn *txn)
1134 ID freecount, count;
1137 mdb_cursor_init(&mc, txn, FREE_DBI, NULL);
1138 while ((rc = mdb_cursor_get(&mc, &key, &data, MDB_NEXT)) == 0)
1139 freecount += *(ID *)data.mv_data;
1140 freecount += txn->mt_dbs[0].md_branch_pages + txn->mt_dbs[0].md_leaf_pages +
1141 txn->mt_dbs[0].md_overflow_pages;
1144 for (i = 0; i<txn->mt_numdbs; i++) {
1145 count += txn->mt_dbs[i].md_branch_pages +
1146 txn->mt_dbs[i].md_leaf_pages +
1147 txn->mt_dbs[i].md_overflow_pages;
1148 if (txn->mt_dbs[i].md_flags & MDB_DUPSORT) {
1150 mdb_cursor_init(&mc, txn, i, &mx);
1151 mdb_page_search(&mc, NULL, 0);
1155 mp = mc.mc_pg[mc.mc_top];
1156 for (j=0; j<NUMKEYS(mp); j++) {
1157 MDB_node *leaf = NODEPTR(mp, j);
1158 if (leaf->mn_flags & F_SUBDATA) {
1160 memcpy(&db, NODEDATA(leaf), sizeof(db));
1161 count += db.md_branch_pages + db.md_leaf_pages +
1162 db.md_overflow_pages;
1166 while (mdb_cursor_sibling(&mc, 1) == 0);
1169 assert(freecount + count + 2 >= txn->mt_next_pgno - 1);
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 * @return Address of the allocated page(s). Requests for multiple pages
1212 * will always be satisfied by a single contiguous chunk of memory.
1215 mdb_page_alloc(MDB_cursor *mc, int num)
1217 MDB_txn *txn = mc->mc_txn;
1219 pgno_t pgno = P_INVALID;
1222 if (txn->mt_txnid > 2) {
1224 if (!txn->mt_env->me_pghead &&
1225 txn->mt_dbs[FREE_DBI].md_root != P_INVALID) {
1226 /* See if there's anything in the free DB */
1230 txnid_t *kptr, oldest, last;
1232 mdb_cursor_init(&m2, txn, FREE_DBI, NULL);
1233 if (!txn->mt_env->me_pgfirst) {
1234 mdb_page_search(&m2, NULL, 0);
1235 leaf = NODEPTR(m2.mc_pg[m2.mc_top], 0);
1236 kptr = (txnid_t *)NODEKEY(leaf);
1243 last = txn->mt_env->me_pglast + 1;
1245 key.mv_data = &last;
1246 key.mv_size = sizeof(last);
1247 rc = mdb_cursor_set(&m2, &key, &data, MDB_SET, &exact);
1250 last = *(txnid_t *)key.mv_data;
1255 oldest = txn->mt_txnid - 1;
1256 for (i=0; i<txn->mt_env->me_txns->mti_numreaders; i++) {
1257 txnid_t mr = txn->mt_env->me_txns->mti_readers[i].mr_txnid;
1258 if (mr && mr < oldest)
1263 if (oldest > last) {
1264 /* It's usable, grab it.
1269 if (!txn->mt_env->me_pgfirst) {
1270 mdb_node_read(txn, leaf, &data);
1272 txn->mt_env->me_pglast = last;
1273 if (!txn->mt_env->me_pgfirst)
1274 txn->mt_env->me_pgfirst = last;
1275 idl = (ID *) data.mv_data;
1276 /* We might have a zero-length IDL due to freelist growth
1277 * during a prior commit
1279 if (!idl[0]) goto again;
1280 mop = malloc(sizeof(MDB_oldpages) + MDB_IDL_SIZEOF(idl) - sizeof(pgno_t));
1281 mop->mo_next = txn->mt_env->me_pghead;
1282 mop->mo_txnid = last;
1283 txn->mt_env->me_pghead = mop;
1284 memcpy(mop->mo_pages, idl, MDB_IDL_SIZEOF(idl));
1289 DPRINTF("IDL read txn %zu root %zu num %zu",
1290 mop->mo_txnid, txn->mt_dbs[FREE_DBI].md_root, idl[0]);
1291 for (i=0; i<idl[0]; i++) {
1292 DPRINTF("IDL %zu", idl[i+1]);
1299 if (txn->mt_env->me_pghead) {
1300 MDB_oldpages *mop = txn->mt_env->me_pghead;
1302 /* FIXME: For now, always use fresh pages. We
1303 * really ought to search the free list for a
1308 /* peel pages off tail, so we only have to truncate the list */
1309 pgno = MDB_IDL_LAST(mop->mo_pages);
1310 if (MDB_IDL_IS_RANGE(mop->mo_pages)) {
1312 if (mop->mo_pages[2] > mop->mo_pages[1])
1313 mop->mo_pages[0] = 0;
1317 if (MDB_IDL_IS_ZERO(mop->mo_pages)) {
1318 txn->mt_env->me_pghead = mop->mo_next;
1325 if (pgno == P_INVALID) {
1326 /* DB size is maxed out */
1327 if (txn->mt_next_pgno + num >= txn->mt_env->me_maxpg) {
1328 DPUTS("DB size maxed out");
1332 if (txn->mt_env->me_dpages && num == 1) {
1333 np = txn->mt_env->me_dpages;
1334 VGMEMP_ALLOC(txn->mt_env, np, txn->mt_env->me_psize);
1335 VGMEMP_DEFINED(np, sizeof(np->mp_next));
1336 txn->mt_env->me_dpages = np->mp_next;
1338 size_t sz = txn->mt_env->me_psize * num;
1339 if ((np = malloc(sz)) == NULL)
1341 VGMEMP_ALLOC(txn->mt_env, np, sz);
1343 if (pgno == P_INVALID) {
1344 np->mp_pgno = txn->mt_next_pgno;
1345 txn->mt_next_pgno += num;
1349 mid.mid = np->mp_pgno;
1351 mdb_mid2l_insert(txn->mt_u.dirty_list, &mid);
1356 /** Touch a page: make it dirty and re-insert into tree with updated pgno.
1357 * @param[in] mc cursor pointing to the page to be touched
1358 * @return 0 on success, non-zero on failure.
1361 mdb_page_touch(MDB_cursor *mc)
1363 MDB_page *mp = mc->mc_pg[mc->mc_top];
1366 if (!F_ISSET(mp->mp_flags, P_DIRTY)) {
1368 if ((np = mdb_page_alloc(mc, 1)) == NULL)
1370 DPRINTF("touched db %u page %zu -> %zu", mc->mc_dbi, mp->mp_pgno, np->mp_pgno);
1371 assert(mp->mp_pgno != np->mp_pgno);
1372 mdb_midl_append(&mc->mc_txn->mt_free_pgs, mp->mp_pgno);
1374 memcpy(np, mp, mc->mc_txn->mt_env->me_psize);
1377 mp->mp_flags |= P_DIRTY;
1380 /* Adjust other cursors pointing to mp */
1381 if (mc->mc_flags & C_SUB) {
1382 MDB_cursor *m2, *m3;
1383 MDB_dbi dbi = mc->mc_dbi-1;
1385 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
1386 if (m2 == mc) continue;
1387 m3 = &m2->mc_xcursor->mx_cursor;
1388 if (m3->mc_snum < mc->mc_snum) continue;
1389 if (m3->mc_pg[mc->mc_top] == mc->mc_pg[mc->mc_top]) {
1390 m3->mc_pg[mc->mc_top] = mp;
1396 for (m2 = mc->mc_txn->mt_cursors[mc->mc_dbi]; m2; m2=m2->mc_next) {
1397 if (m2 == mc || m2->mc_snum < mc->mc_snum) continue;
1398 if (m2->mc_pg[mc->mc_top] == mc->mc_pg[mc->mc_top]) {
1399 m2->mc_pg[mc->mc_top] = mp;
1403 mc->mc_pg[mc->mc_top] = mp;
1404 /** If this page has a parent, update the parent to point to
1408 SETPGNO(NODEPTR(mc->mc_pg[mc->mc_top-1], mc->mc_ki[mc->mc_top-1]), mp->mp_pgno);
1410 mc->mc_db->md_root = mp->mp_pgno;
1411 } else if (mc->mc_txn->mt_parent) {
1414 /* If txn has a parent, make sure the page is in our
1417 if (mc->mc_txn->mt_u.dirty_list[0].mid) {
1418 unsigned x = mdb_mid2l_search(mc->mc_txn->mt_u.dirty_list, mp->mp_pgno);
1419 if (x <= mc->mc_txn->mt_u.dirty_list[0].mid &&
1420 mc->mc_txn->mt_u.dirty_list[x].mid == mp->mp_pgno) {
1421 if (mc->mc_txn->mt_u.dirty_list[x].mptr != mp) {
1422 mp = mc->mc_txn->mt_u.dirty_list[x].mptr;
1423 mc->mc_pg[mc->mc_top] = mp;
1429 np = mdb_page_malloc(mc);
1430 memcpy(np, mp, mc->mc_txn->mt_env->me_psize);
1431 mid.mid = np->mp_pgno;
1433 mdb_mid2l_insert(mc->mc_txn->mt_u.dirty_list, &mid);
1441 mdb_env_sync(MDB_env *env, int force)
1444 if (force || !F_ISSET(env->me_flags, MDB_NOSYNC)) {
1445 if (MDB_FDATASYNC(env->me_fd))
1451 /** Make shadow copies of all of parent txn's cursors */
1453 mdb_cursor_shadow(MDB_txn *src, MDB_txn *dst)
1455 MDB_cursor *mc, *m2;
1456 unsigned int i, j, size;
1458 for (i=0;i<src->mt_numdbs; i++) {
1459 if (src->mt_cursors[i]) {
1460 size = sizeof(MDB_cursor);
1461 if (src->mt_cursors[i]->mc_xcursor)
1462 size += sizeof(MDB_xcursor);
1463 for (m2 = src->mt_cursors[i]; m2; m2=m2->mc_next) {
1470 mc->mc_db = &dst->mt_dbs[i];
1471 mc->mc_dbx = m2->mc_dbx;
1472 mc->mc_dbflag = &dst->mt_dbflags[i];
1473 mc->mc_snum = m2->mc_snum;
1474 mc->mc_top = m2->mc_top;
1475 mc->mc_flags = m2->mc_flags | C_SHADOW;
1476 for (j=0; j<mc->mc_snum; j++) {
1477 mc->mc_pg[j] = m2->mc_pg[j];
1478 mc->mc_ki[j] = m2->mc_ki[j];
1480 if (m2->mc_xcursor) {
1481 MDB_xcursor *mx, *mx2;
1482 mx = (MDB_xcursor *)(mc+1);
1483 mc->mc_xcursor = mx;
1484 mx2 = m2->mc_xcursor;
1485 mx->mx_db = mx2->mx_db;
1486 mx->mx_dbx = mx2->mx_dbx;
1487 mx->mx_dbflag = mx2->mx_dbflag;
1488 mx->mx_cursor.mc_txn = dst;
1489 mx->mx_cursor.mc_dbi = mx2->mx_cursor.mc_dbi;
1490 mx->mx_cursor.mc_db = &mx->mx_db;
1491 mx->mx_cursor.mc_dbx = &mx->mx_dbx;
1492 mx->mx_cursor.mc_dbflag = &mx->mx_dbflag;
1493 mx->mx_cursor.mc_snum = mx2->mx_cursor.mc_snum;
1494 mx->mx_cursor.mc_top = mx2->mx_cursor.mc_top;
1495 mx->mx_cursor.mc_flags = mx2->mx_cursor.mc_flags | C_SHADOW;
1496 for (j=0; j<mx2->mx_cursor.mc_snum; j++) {
1497 mx->mx_cursor.mc_pg[j] = mx2->mx_cursor.mc_pg[j];
1498 mx->mx_cursor.mc_ki[j] = mx2->mx_cursor.mc_ki[j];
1501 mc->mc_xcursor = NULL;
1503 mc->mc_next = dst->mt_cursors[i];
1504 dst->mt_cursors[i] = mc;
1511 /** Merge shadow cursors back into parent's */
1513 mdb_cursor_merge(MDB_txn *txn)
1516 for (i=0; i<txn->mt_numdbs; i++) {
1517 if (txn->mt_cursors[i]) {
1519 while ((mc = txn->mt_cursors[i])) {
1520 txn->mt_cursors[i] = mc->mc_next;
1521 if (mc->mc_flags & C_SHADOW) {
1522 MDB_cursor *m2 = mc->mc_orig;
1524 m2->mc_snum = mc->mc_snum;
1525 m2->mc_top = mc->mc_top;
1526 for (j=0; j<mc->mc_snum; j++) {
1527 m2->mc_pg[j] = mc->mc_pg[j];
1528 m2->mc_ki[j] = mc->mc_ki[j];
1531 if (mc->mc_flags & C_ALLOCD)
1539 mdb_txn_reset0(MDB_txn *txn);
1541 /** Common code for #mdb_txn_begin() and #mdb_txn_renew().
1542 * @param[in] txn the transaction handle to initialize
1543 * @return 0 on success, non-zero on failure. This can only
1544 * fail for read-only transactions, and then only if the
1545 * reader table is full.
1548 mdb_txn_renew0(MDB_txn *txn)
1550 MDB_env *env = txn->mt_env;
1553 if (txn->mt_flags & MDB_TXN_RDONLY) {
1554 MDB_reader *r = pthread_getspecific(env->me_txkey);
1557 pid_t pid = getpid();
1558 pthread_t tid = pthread_self();
1561 for (i=0; i<env->me_txns->mti_numreaders; i++)
1562 if (env->me_txns->mti_readers[i].mr_pid == 0)
1564 if (i == env->me_maxreaders) {
1565 UNLOCK_MUTEX_R(env);
1568 env->me_txns->mti_readers[i].mr_pid = pid;
1569 env->me_txns->mti_readers[i].mr_tid = tid;
1570 if (i >= env->me_txns->mti_numreaders)
1571 env->me_txns->mti_numreaders = i+1;
1572 UNLOCK_MUTEX_R(env);
1573 r = &env->me_txns->mti_readers[i];
1574 pthread_setspecific(env->me_txkey, r);
1576 txn->mt_toggle = env->me_txns->mti_me_toggle;
1577 txn->mt_txnid = r->mr_txnid = env->me_metas[txn->mt_toggle]->mm_txnid;
1579 /* This happens if a different process was the
1580 * last writer to the DB.
1582 if (env->me_wtxnid < txn->mt_txnid)
1583 mt_dbflag = DB_STALE;
1584 txn->mt_u.reader = r;
1588 txn->mt_toggle = env->me_txns->mti_me_toggle;
1589 txn->mt_txnid = env->me_metas[txn->mt_toggle]->mm_txnid;
1590 if (env->me_wtxnid < txn->mt_txnid)
1591 mt_dbflag = DB_STALE;
1594 if (txn->mt_txnid == mdb_debug_start)
1597 txn->mt_u.dirty_list = env->me_dirty_list;
1598 txn->mt_u.dirty_list[0].mid = 0;
1599 txn->mt_free_pgs = env->me_free_pgs;
1600 txn->mt_free_pgs[0] = 0;
1601 txn->mt_next_pgno = env->me_metas[txn->mt_toggle]->mm_last_pg+1;
1605 /* Copy the DB arrays */
1606 LAZY_RWLOCK_RDLOCK(&env->me_dblock);
1607 txn->mt_numdbs = env->me_numdbs;
1608 txn->mt_dbxs = env->me_dbxs; /* mostly static anyway */
1609 memcpy(txn->mt_dbs, env->me_metas[txn->mt_toggle]->mm_dbs, 2 * sizeof(MDB_db));
1610 if (txn->mt_numdbs > 2)
1611 memcpy(txn->mt_dbs+2, env->me_dbs[env->me_db_toggle]+2,
1612 (txn->mt_numdbs - 2) * sizeof(MDB_db));
1613 LAZY_RWLOCK_UNLOCK(&env->me_dblock);
1615 memset(txn->mt_dbflags, mt_dbflag, env->me_numdbs);
1621 mdb_txn_renew(MDB_txn *txn)
1628 if (txn->mt_env->me_flags & MDB_FATAL_ERROR) {
1629 DPUTS("environment had fatal error, must shutdown!");
1633 rc = mdb_txn_renew0(txn);
1634 if (rc == MDB_SUCCESS) {
1635 DPRINTF("renew txn %zu%c %p on mdbenv %p, root page %zu",
1636 txn->mt_txnid, (txn->mt_flags & MDB_TXN_RDONLY) ? 'r' : 'w',
1637 (void *)txn, (void *)txn->mt_env, txn->mt_dbs[MAIN_DBI].md_root);
1643 mdb_txn_begin(MDB_env *env, MDB_txn *parent, unsigned int flags, MDB_txn **ret)
1648 if (env->me_flags & MDB_FATAL_ERROR) {
1649 DPUTS("environment had fatal error, must shutdown!");
1653 /* parent already has an active child txn */
1654 if (parent->mt_child) {
1658 size = sizeof(MDB_txn) + env->me_maxdbs * (sizeof(MDB_db)+1);
1659 if (!(flags & MDB_RDONLY))
1660 size += env->me_maxdbs * sizeof(MDB_cursor *);
1662 if ((txn = calloc(1, size)) == NULL) {
1663 DPRINTF("calloc: %s", strerror(ErrCode()));
1666 txn->mt_dbs = (MDB_db *)(txn+1);
1667 if (flags & MDB_RDONLY) {
1668 txn->mt_flags |= MDB_TXN_RDONLY;
1669 txn->mt_dbflags = (unsigned char *)(txn->mt_dbs + env->me_maxdbs);
1671 txn->mt_cursors = (MDB_cursor **)(txn->mt_dbs + env->me_maxdbs);
1672 txn->mt_dbflags = (unsigned char *)(txn->mt_cursors + env->me_maxdbs);
1677 txn->mt_free_pgs = mdb_midl_alloc();
1678 if (!txn->mt_free_pgs) {
1682 txn->mt_u.dirty_list = malloc(sizeof(ID2)*MDB_IDL_UM_SIZE);
1683 if (!txn->mt_u.dirty_list) {
1684 free(txn->mt_free_pgs);
1688 txn->mt_txnid = parent->mt_txnid;
1689 txn->mt_toggle = parent->mt_toggle;
1690 txn->mt_u.dirty_list[0].mid = 0;
1691 txn->mt_free_pgs[0] = 0;
1692 txn->mt_next_pgno = parent->mt_next_pgno;
1693 parent->mt_child = txn;
1694 txn->mt_parent = parent;
1695 txn->mt_numdbs = parent->mt_numdbs;
1696 txn->mt_dbxs = parent->mt_dbxs;
1697 memcpy(txn->mt_dbs, parent->mt_dbs, txn->mt_numdbs * sizeof(MDB_db));
1698 memcpy(txn->mt_dbflags, parent->mt_dbflags, txn->mt_numdbs);
1699 mdb_cursor_shadow(parent, txn);
1702 rc = mdb_txn_renew0(txn);
1708 DPRINTF("begin txn %zu%c %p on mdbenv %p, root page %zu",
1709 txn->mt_txnid, (txn->mt_flags & MDB_TXN_RDONLY) ? 'r' : 'w',
1710 (void *) txn, (void *) env, txn->mt_dbs[MAIN_DBI].md_root);
1716 /** Common code for #mdb_txn_reset() and #mdb_txn_abort().
1717 * @param[in] txn the transaction handle to reset
1720 mdb_txn_reset0(MDB_txn *txn)
1722 MDB_env *env = txn->mt_env;
1724 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY)) {
1725 txn->mt_u.reader->mr_txnid = 0;
1731 /* close(free) all cursors */
1732 for (i=0; i<txn->mt_numdbs; i++) {
1733 if (txn->mt_cursors[i]) {
1735 while ((mc = txn->mt_cursors[i])) {
1736 txn->mt_cursors[i] = mc->mc_next;
1737 if (mc->mc_flags & C_ALLOCD)
1743 /* return all dirty pages to dpage list */
1744 for (i=1; i<=txn->mt_u.dirty_list[0].mid; i++) {
1745 dp = txn->mt_u.dirty_list[i].mptr;
1746 if (!IS_OVERFLOW(dp) || dp->mp_pages == 1) {
1747 dp->mp_next = txn->mt_env->me_dpages;
1748 VGMEMP_FREE(txn->mt_env, dp);
1749 txn->mt_env->me_dpages = dp;
1751 /* large pages just get freed directly */
1752 VGMEMP_FREE(txn->mt_env, dp);
1757 if (txn->mt_parent) {
1758 txn->mt_parent->mt_child = NULL;
1759 free(txn->mt_free_pgs);
1760 free(txn->mt_u.dirty_list);
1763 if (mdb_midl_shrink(&txn->mt_free_pgs))
1764 env->me_free_pgs = txn->mt_free_pgs;
1767 while ((mop = txn->mt_env->me_pghead)) {
1768 txn->mt_env->me_pghead = mop->mo_next;
1771 txn->mt_env->me_pgfirst = 0;
1772 txn->mt_env->me_pglast = 0;
1775 /* The writer mutex was locked in mdb_txn_begin. */
1776 UNLOCK_MUTEX_W(env);
1781 mdb_txn_reset(MDB_txn *txn)
1786 DPRINTF("reset txn %zu%c %p on mdbenv %p, root page %zu",
1787 txn->mt_txnid, (txn->mt_flags & MDB_TXN_RDONLY) ? 'r' : 'w',
1788 (void *) txn, (void *)txn->mt_env, txn->mt_dbs[MAIN_DBI].md_root);
1790 mdb_txn_reset0(txn);
1794 mdb_txn_abort(MDB_txn *txn)
1799 DPRINTF("abort txn %zu%c %p on mdbenv %p, root page %zu",
1800 txn->mt_txnid, (txn->mt_flags & MDB_TXN_RDONLY) ? 'r' : 'w',
1801 (void *)txn, (void *)txn->mt_env, txn->mt_dbs[MAIN_DBI].md_root);
1804 mdb_txn_abort(txn->mt_child);
1806 mdb_txn_reset0(txn);
1811 mdb_txn_commit(MDB_txn *txn)
1819 pgno_t next, freecnt;
1822 assert(txn != NULL);
1823 assert(txn->mt_env != NULL);
1825 if (txn->mt_child) {
1826 mdb_txn_commit(txn->mt_child);
1827 txn->mt_child = NULL;
1832 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY)) {
1833 if (txn->mt_numdbs > env->me_numdbs) {
1834 /* update the DB tables */
1835 int toggle = !env->me_db_toggle;
1839 ip = &env->me_dbs[toggle][env->me_numdbs];
1840 jp = &txn->mt_dbs[env->me_numdbs];
1841 LAZY_RWLOCK_WRLOCK(&env->me_dblock);
1842 for (i = env->me_numdbs; i < txn->mt_numdbs; i++) {
1846 env->me_db_toggle = toggle;
1847 env->me_numdbs = txn->mt_numdbs;
1848 LAZY_RWLOCK_UNLOCK(&env->me_dblock);
1854 if (F_ISSET(txn->mt_flags, MDB_TXN_ERROR)) {
1855 DPUTS("error flag is set, can't commit");
1857 txn->mt_parent->mt_flags |= MDB_TXN_ERROR;
1862 /* Merge (and close) our cursors with parent's */
1863 mdb_cursor_merge(txn);
1865 if (txn->mt_parent) {
1871 /* Update parent's DB table */
1872 ip = &txn->mt_parent->mt_dbs[2];
1873 jp = &txn->mt_dbs[2];
1874 for (i = 2; i < txn->mt_numdbs; i++) {
1875 if (ip->md_root != jp->md_root)
1879 txn->mt_parent->mt_numdbs = txn->mt_numdbs;
1881 /* Append our free list to parent's */
1882 mdb_midl_append_list(&txn->mt_parent->mt_free_pgs,
1884 mdb_midl_free(txn->mt_free_pgs);
1886 /* Merge our dirty list with parent's */
1887 dst = txn->mt_parent->mt_u.dirty_list;
1888 src = txn->mt_u.dirty_list;
1889 x = mdb_mid2l_search(dst, src[1].mid);
1890 for (y=1; y<=src[0].mid; y++) {
1891 while (x <= dst[0].mid && dst[x].mid != src[y].mid) x++;
1895 dst[x].mptr = src[y].mptr;
1898 for (; y<=src[0].mid; y++) {
1899 if (++x >= MDB_IDL_UM_MAX) {
1906 free(txn->mt_u.dirty_list);
1907 txn->mt_parent->mt_child = NULL;
1912 if (txn != env->me_txn) {
1913 DPUTS("attempt to commit unknown transaction");
1918 if (!txn->mt_u.dirty_list[0].mid)
1921 DPRINTF("committing txn %zu %p on mdbenv %p, root page %zu",
1922 txn->mt_txnid, (void *)txn, (void *)env, txn->mt_dbs[MAIN_DBI].md_root);
1924 mdb_cursor_init(&mc, txn, FREE_DBI, NULL);
1926 /* should only be one record now */
1927 if (env->me_pghead) {
1928 /* make sure first page of freeDB is touched and on freelist */
1929 mdb_page_search(&mc, NULL, 1);
1932 /* Delete IDLs we used from the free list */
1933 if (env->me_pgfirst) {
1938 key.mv_size = sizeof(cur);
1939 for (cur = env->me_pgfirst; cur <= env->me_pglast; cur++) {
1942 mdb_cursor_set(&mc, &key, NULL, MDB_SET, &exact);
1943 mdb_cursor_del(&mc, 0);
1945 env->me_pgfirst = 0;
1949 /* save to free list */
1951 freecnt = txn->mt_free_pgs[0];
1952 if (!MDB_IDL_IS_ZERO(txn->mt_free_pgs)) {
1955 /* make sure last page of freeDB is touched and on freelist */
1956 key.mv_size = MAXKEYSIZE+1;
1958 mdb_page_search(&mc, &key, 1);
1960 mdb_midl_sort(txn->mt_free_pgs);
1964 ID *idl = txn->mt_free_pgs;
1965 DPRINTF("IDL write txn %zu root %zu num %zu",
1966 txn->mt_txnid, txn->mt_dbs[FREE_DBI].md_root, idl[0]);
1967 for (i=0; i<idl[0]; i++) {
1968 DPRINTF("IDL %zu", idl[i+1]);
1972 /* write to last page of freeDB */
1973 key.mv_size = sizeof(pgno_t);
1974 key.mv_data = &txn->mt_txnid;
1975 data.mv_data = txn->mt_free_pgs;
1976 /* The free list can still grow during this call,
1977 * despite the pre-emptive touches above. So check
1978 * and make sure the entire thing got written.
1981 freecnt = txn->mt_free_pgs[0];
1982 data.mv_size = MDB_IDL_SIZEOF(txn->mt_free_pgs);
1983 rc = mdb_cursor_put(&mc, &key, &data, 0);
1988 } while (freecnt != txn->mt_free_pgs[0]);
1990 /* should only be one record now */
1992 if (env->me_pghead) {
1998 mop = env->me_pghead;
2000 key.mv_size = sizeof(id);
2002 data.mv_size = MDB_IDL_SIZEOF(mop->mo_pages);
2003 data.mv_data = mop->mo_pages;
2004 orig = mop->mo_pages[0];
2005 /* These steps may grow the freelist again
2006 * due to freed overflow pages...
2008 mdb_cursor_put(&mc, &key, &data, 0);
2009 if (mop == env->me_pghead && env->me_pghead->mo_txnid == id) {
2010 /* could have been used again here */
2011 if (mop->mo_pages[0] != orig) {
2012 data.mv_size = MDB_IDL_SIZEOF(mop->mo_pages);
2013 data.mv_data = mop->mo_pages;
2015 mdb_cursor_put(&mc, &key, &data, 0);
2017 env->me_pghead = NULL;
2020 /* was completely used up */
2021 mdb_cursor_del(&mc, 0);
2025 env->me_pgfirst = 0;
2028 /* Check for growth of freelist again */
2029 if (freecnt != txn->mt_free_pgs[0])
2032 if (!MDB_IDL_IS_ZERO(txn->mt_free_pgs)) {
2033 if (mdb_midl_shrink(&txn->mt_free_pgs))
2034 env->me_free_pgs = txn->mt_free_pgs;
2037 /* Update DB root pointers. Their pages have already been
2038 * touched so this is all in-place and cannot fail.
2043 data.mv_size = sizeof(MDB_db);
2045 mdb_cursor_init(&mc, txn, MAIN_DBI, NULL);
2046 for (i = 2; i < txn->mt_numdbs; i++) {
2047 if (txn->mt_dbflags[i] & DB_DIRTY) {
2048 data.mv_data = &txn->mt_dbs[i];
2049 mdb_cursor_put(&mc, &txn->mt_dbxs[i].md_name, &data, 0);
2057 /* Commit up to MDB_COMMIT_PAGES dirty pages to disk until done.
2063 /* Windows actually supports scatter/gather I/O, but only on
2064 * unbuffered file handles. Since we're relying on the OS page
2065 * cache for all our data, that's self-defeating. So we just
2066 * write pages one at a time. We use the ov structure to set
2067 * the write offset, to at least save the overhead of a Seek
2071 memset(&ov, 0, sizeof(ov));
2072 for (; i<=txn->mt_u.dirty_list[0].mid; i++) {
2074 dp = txn->mt_u.dirty_list[i].mptr;
2075 DPRINTF("committing page %zu", dp->mp_pgno);
2076 size = dp->mp_pgno * env->me_psize;
2077 ov.Offset = size & 0xffffffff;
2078 ov.OffsetHigh = size >> 16;
2079 ov.OffsetHigh >>= 16;
2080 /* clear dirty flag */
2081 dp->mp_flags &= ~P_DIRTY;
2082 wsize = env->me_psize;
2083 if (IS_OVERFLOW(dp)) wsize *= dp->mp_pages;
2084 rc = WriteFile(env->me_fd, dp, wsize, NULL, &ov);
2087 DPRINTF("WriteFile: %d", n);
2094 struct iovec iov[MDB_COMMIT_PAGES];
2098 for (; i<=txn->mt_u.dirty_list[0].mid; i++) {
2099 dp = txn->mt_u.dirty_list[i].mptr;
2100 if (dp->mp_pgno != next) {
2102 rc = writev(env->me_fd, iov, n);
2106 DPUTS("short write, filesystem full?");
2108 DPRINTF("writev: %s", strerror(n));
2115 lseek(env->me_fd, dp->mp_pgno * env->me_psize, SEEK_SET);
2118 DPRINTF("committing page %zu", dp->mp_pgno);
2119 iov[n].iov_len = env->me_psize;
2120 if (IS_OVERFLOW(dp)) iov[n].iov_len *= dp->mp_pages;
2121 iov[n].iov_base = (char *)dp;
2122 size += iov[n].iov_len;
2123 next = dp->mp_pgno + (IS_OVERFLOW(dp) ? dp->mp_pages : 1);
2124 /* clear dirty flag */
2125 dp->mp_flags &= ~P_DIRTY;
2126 if (++n >= MDB_COMMIT_PAGES) {
2136 rc = writev(env->me_fd, iov, n);
2140 DPUTS("short write, filesystem full?");
2142 DPRINTF("writev: %s", strerror(n));
2149 /* Drop the dirty pages.
2151 for (i=1; i<=txn->mt_u.dirty_list[0].mid; i++) {
2152 dp = txn->mt_u.dirty_list[i].mptr;
2153 if (!IS_OVERFLOW(dp) || dp->mp_pages == 1) {
2154 dp->mp_next = txn->mt_env->me_dpages;
2155 VGMEMP_FREE(txn->mt_env, dp);
2156 txn->mt_env->me_dpages = dp;
2158 VGMEMP_FREE(txn->mt_env, dp);
2161 txn->mt_u.dirty_list[i].mid = 0;
2163 txn->mt_u.dirty_list[0].mid = 0;
2165 if ((n = mdb_env_sync(env, 0)) != 0 ||
2166 (n = mdb_env_write_meta(txn)) != MDB_SUCCESS) {
2170 env->me_wtxnid = txn->mt_txnid;
2174 /* update the DB tables */
2176 int toggle = !env->me_db_toggle;
2180 ip = &env->me_dbs[toggle][2];
2181 jp = &txn->mt_dbs[2];
2182 LAZY_RWLOCK_WRLOCK(&env->me_dblock);
2183 for (i = 2; i < txn->mt_numdbs; i++) {
2184 if (ip->md_root != jp->md_root)
2189 env->me_db_toggle = toggle;
2190 env->me_numdbs = txn->mt_numdbs;
2191 LAZY_RWLOCK_UNLOCK(&env->me_dblock);
2194 UNLOCK_MUTEX_W(env);
2200 /** Read the environment parameters of a DB environment before
2201 * mapping it into memory.
2202 * @param[in] env the environment handle
2203 * @param[out] meta address of where to store the meta information
2204 * @return 0 on success, non-zero on failure.
2207 mdb_env_read_header(MDB_env *env, MDB_meta *meta)
2214 /* We don't know the page size yet, so use a minimum value.
2218 if (!ReadFile(env->me_fd, &pbuf, MDB_PAGESIZE, (DWORD *)&rc, NULL) || rc == 0)
2220 if ((rc = read(env->me_fd, &pbuf, MDB_PAGESIZE)) == 0)
2225 else if (rc != MDB_PAGESIZE) {
2229 DPRINTF("read: %s", strerror(err));
2233 p = (MDB_page *)&pbuf;
2235 if (!F_ISSET(p->mp_flags, P_META)) {
2236 DPRINTF("page %zu not a meta page", p->mp_pgno);
2241 if (m->mm_magic != MDB_MAGIC) {
2242 DPUTS("meta has invalid magic");
2246 if (m->mm_version != MDB_VERSION) {
2247 DPRINTF("database is version %u, expected version %u",
2248 m->mm_version, MDB_VERSION);
2249 return MDB_VERSION_MISMATCH;
2252 memcpy(meta, m, sizeof(*m));
2256 /** Write the environment parameters of a freshly created DB environment.
2257 * @param[in] env the environment handle
2258 * @param[out] meta address of where to store the meta information
2259 * @return 0 on success, non-zero on failure.
2262 mdb_env_init_meta(MDB_env *env, MDB_meta *meta)
2269 DPUTS("writing new meta page");
2271 GET_PAGESIZE(psize);
2273 meta->mm_magic = MDB_MAGIC;
2274 meta->mm_version = MDB_VERSION;
2275 meta->mm_psize = psize;
2276 meta->mm_last_pg = 1;
2277 meta->mm_flags = env->me_flags & 0xffff;
2278 meta->mm_flags |= MDB_INTEGERKEY;
2279 meta->mm_dbs[0].md_root = P_INVALID;
2280 meta->mm_dbs[1].md_root = P_INVALID;
2282 p = calloc(2, psize);
2284 p->mp_flags = P_META;
2287 memcpy(m, meta, sizeof(*meta));
2289 q = (MDB_page *)((char *)p + psize);
2292 q->mp_flags = P_META;
2295 memcpy(m, meta, sizeof(*meta));
2300 rc = WriteFile(env->me_fd, p, psize * 2, &len, NULL);
2301 rc = (len == psize * 2) ? MDB_SUCCESS : ErrCode();
2304 rc = write(env->me_fd, p, psize * 2);
2305 rc = (rc == (int)psize * 2) ? MDB_SUCCESS : ErrCode();
2311 /** Update the environment info to commit a transaction.
2312 * @param[in] txn the transaction that's being committed
2313 * @return 0 on success, non-zero on failure.
2316 mdb_env_write_meta(MDB_txn *txn)
2319 MDB_meta meta, metab;
2321 int rc, len, toggle;
2327 assert(txn != NULL);
2328 assert(txn->mt_env != NULL);
2330 toggle = !txn->mt_toggle;
2331 DPRINTF("writing meta page %d for root page %zu",
2332 toggle, txn->mt_dbs[MAIN_DBI].md_root);
2336 metab.mm_txnid = env->me_metas[toggle]->mm_txnid;
2337 metab.mm_last_pg = env->me_metas[toggle]->mm_last_pg;
2339 ptr = (char *)&meta;
2340 off = offsetof(MDB_meta, mm_dbs[0].md_depth);
2341 len = sizeof(MDB_meta) - off;
2344 meta.mm_dbs[0] = txn->mt_dbs[0];
2345 meta.mm_dbs[1] = txn->mt_dbs[1];
2346 meta.mm_last_pg = txn->mt_next_pgno - 1;
2347 meta.mm_txnid = txn->mt_txnid;
2350 off += env->me_psize;
2353 /* Write to the SYNC fd */
2356 memset(&ov, 0, sizeof(ov));
2358 WriteFile(env->me_mfd, ptr, len, (DWORD *)&rc, &ov);
2361 rc = pwrite(env->me_mfd, ptr, len, off);
2366 DPUTS("write failed, disk error?");
2367 /* On a failure, the pagecache still contains the new data.
2368 * Write some old data back, to prevent it from being used.
2369 * Use the non-SYNC fd; we know it will fail anyway.
2371 meta.mm_last_pg = metab.mm_last_pg;
2372 meta.mm_txnid = metab.mm_txnid;
2374 WriteFile(env->me_fd, ptr, len, NULL, &ov);
2376 r2 = pwrite(env->me_fd, ptr, len, off);
2378 env->me_flags |= MDB_FATAL_ERROR;
2381 /* Memory ordering issues are irrelevant; since the entire writer
2382 * is wrapped by wmutex, all of these changes will become visible
2383 * after the wmutex is unlocked. Since the DB is multi-version,
2384 * readers will get consistent data regardless of how fresh or
2385 * how stale their view of these values is.
2387 LAZY_MUTEX_LOCK(&env->me_txns->mti_mutex);
2388 txn->mt_env->me_txns->mti_me_toggle = toggle;
2389 txn->mt_env->me_txns->mti_txnid = txn->mt_txnid;
2390 LAZY_MUTEX_UNLOCK(&env->me_txns->mti_mutex);
2395 /** Check both meta pages to see which one is newer.
2396 * @param[in] env the environment handle
2397 * @param[out] which address of where to store the meta toggle ID
2398 * @return 0 on success, non-zero on failure.
2401 mdb_env_read_meta(MDB_env *env, int *which)
2405 assert(env != NULL);
2407 if (env->me_metas[0]->mm_txnid < env->me_metas[1]->mm_txnid)
2410 DPRINTF("Using meta page %d", toggle);
2417 mdb_env_create(MDB_env **env)
2421 e = calloc(1, sizeof(MDB_env));
2425 e->me_free_pgs = mdb_midl_alloc();
2426 if (!e->me_free_pgs) {
2430 e->me_maxreaders = DEFAULT_READERS;
2432 e->me_fd = INVALID_HANDLE_VALUE;
2433 e->me_lfd = INVALID_HANDLE_VALUE;
2434 e->me_mfd = INVALID_HANDLE_VALUE;
2435 VGMEMP_CREATE(e,0,0);
2441 mdb_env_set_mapsize(MDB_env *env, size_t size)
2445 env->me_mapsize = size;
2447 env->me_maxpg = env->me_mapsize / env->me_psize;
2452 mdb_env_set_maxdbs(MDB_env *env, MDB_dbi dbs)
2456 env->me_maxdbs = dbs;
2461 mdb_env_set_maxreaders(MDB_env *env, unsigned int readers)
2463 if (env->me_map || readers < 1)
2465 env->me_maxreaders = readers;
2470 mdb_env_get_maxreaders(MDB_env *env, unsigned int *readers)
2472 if (!env || !readers)
2474 *readers = env->me_maxreaders;
2478 /** Further setup required for opening an MDB environment
2481 mdb_env_open2(MDB_env *env, unsigned int flags)
2483 int i, newenv = 0, toggle;
2487 env->me_flags = flags;
2489 memset(&meta, 0, sizeof(meta));
2491 if ((i = mdb_env_read_header(env, &meta)) != 0) {
2494 DPUTS("new mdbenv");
2498 if (!env->me_mapsize) {
2499 env->me_mapsize = newenv ? DEFAULT_MAPSIZE : meta.mm_mapsize;
2505 LONG sizelo, sizehi;
2506 sizelo = env->me_mapsize & 0xffffffff;
2507 sizehi = env->me_mapsize >> 16; /* pointless on WIN32, only needed on W64 */
2509 /* Windows won't create mappings for zero length files.
2510 * Just allocate the maxsize right now.
2513 SetFilePointer(env->me_fd, sizelo, sizehi ? &sizehi : NULL, 0);
2514 if (!SetEndOfFile(env->me_fd))
2516 SetFilePointer(env->me_fd, 0, NULL, 0);
2518 mh = CreateFileMapping(env->me_fd, NULL, PAGE_READONLY,
2519 sizehi, sizelo, NULL);
2522 env->me_map = MapViewOfFileEx(mh, FILE_MAP_READ, 0, 0, env->me_mapsize,
2530 if (meta.mm_address && (flags & MDB_FIXEDMAP))
2532 env->me_map = mmap(meta.mm_address, env->me_mapsize, PROT_READ, i,
2534 if (env->me_map == MAP_FAILED) {
2541 meta.mm_mapsize = env->me_mapsize;
2542 if (flags & MDB_FIXEDMAP)
2543 meta.mm_address = env->me_map;
2544 i = mdb_env_init_meta(env, &meta);
2545 if (i != MDB_SUCCESS) {
2546 munmap(env->me_map, env->me_mapsize);
2550 env->me_psize = meta.mm_psize;
2552 env->me_maxpg = env->me_mapsize / env->me_psize;
2554 p = (MDB_page *)env->me_map;
2555 env->me_metas[0] = METADATA(p);
2556 env->me_metas[1] = (MDB_meta *)((char *)env->me_metas[0] + meta.mm_psize);
2558 if ((i = mdb_env_read_meta(env, &toggle)) != 0)
2561 DPRINTF("opened database version %u, pagesize %u",
2562 env->me_metas[toggle]->mm_version, env->me_psize);
2563 DPRINTF("depth: %u", env->me_metas[toggle]->mm_dbs[MAIN_DBI].md_depth);
2564 DPRINTF("entries: %zu", env->me_metas[toggle]->mm_dbs[MAIN_DBI].md_entries);
2565 DPRINTF("branch pages: %zu", env->me_metas[toggle]->mm_dbs[MAIN_DBI].md_branch_pages);
2566 DPRINTF("leaf pages: %zu", env->me_metas[toggle]->mm_dbs[MAIN_DBI].md_leaf_pages);
2567 DPRINTF("overflow pages: %zu", env->me_metas[toggle]->mm_dbs[MAIN_DBI].md_overflow_pages);
2568 DPRINTF("root: %zu", env->me_metas[toggle]->mm_dbs[MAIN_DBI].md_root);
2574 /** Release a reader thread's slot in the reader lock table.
2575 * This function is called automatically when a thread exits.
2576 * Windows doesn't support destructor callbacks for thread-specific storage,
2577 * so this function is not compiled there.
2578 * @param[in] ptr This points to the slot in the reader lock table.
2581 mdb_env_reader_dest(void *ptr)
2583 MDB_reader *reader = ptr;
2585 reader->mr_txnid = 0;
2591 /** Downgrade the exclusive lock on the region back to shared */
2593 mdb_env_share_locks(MDB_env *env)
2597 if (env->me_metas[0]->mm_txnid < env->me_metas[1]->mm_txnid)
2599 env->me_txns->mti_me_toggle = toggle;
2600 env->me_txns->mti_txnid = env->me_metas[toggle]->mm_txnid;
2605 /* First acquire a shared lock. The Unlock will
2606 * then release the existing exclusive lock.
2608 memset(&ov, 0, sizeof(ov));
2609 LockFileEx(env->me_lfd, 0, 0, 1, 0, &ov);
2610 UnlockFile(env->me_lfd, 0, 0, 1, 0);
2614 struct flock lock_info;
2615 /* The shared lock replaces the existing lock */
2616 memset((void *)&lock_info, 0, sizeof(lock_info));
2617 lock_info.l_type = F_RDLCK;
2618 lock_info.l_whence = SEEK_SET;
2619 lock_info.l_start = 0;
2620 lock_info.l_len = 1;
2621 fcntl(env->me_lfd, F_SETLK, &lock_info);
2625 #if defined(_WIN32) || defined(__APPLE__)
2627 * hash_64 - 64 bit Fowler/Noll/Vo-0 FNV-1a hash code
2629 * @(#) $Revision: 5.1 $
2630 * @(#) $Id: hash_64a.c,v 5.1 2009/06/30 09:01:38 chongo Exp $
2631 * @(#) $Source: /usr/local/src/cmd/fnv/RCS/hash_64a.c,v $
2633 * http://www.isthe.com/chongo/tech/comp/fnv/index.html
2637 * Please do not copyright this code. This code is in the public domain.
2639 * LANDON CURT NOLL DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
2640 * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO
2641 * EVENT SHALL LANDON CURT NOLL BE LIABLE FOR ANY SPECIAL, INDIRECT OR
2642 * CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF
2643 * USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
2644 * OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
2645 * PERFORMANCE OF THIS SOFTWARE.
2648 * chongo <Landon Curt Noll> /\oo/\
2649 * http://www.isthe.com/chongo/
2651 * Share and Enjoy! :-)
2654 typedef unsigned long long mdb_hash_t;
2655 #define MDB_HASH_INIT ((mdb_hash_t)0xcbf29ce484222325ULL)
2657 /** perform a 64 bit Fowler/Noll/Vo FNV-1a hash on a buffer
2658 * @param[in] str string to hash
2659 * @param[in] hval initial value for hash
2660 * @return 64 bit hash
2662 * NOTE: To use the recommended 64 bit FNV-1a hash, use MDB_HASH_INIT as the
2663 * hval arg on the first call.
2666 mdb_hash_str(char *str, mdb_hash_t hval)
2668 unsigned char *s = (unsigned char *)str; /* unsigned string */
2670 * FNV-1a hash each octet of the string
2673 /* xor the bottom with the current octet */
2674 hval ^= (mdb_hash_t)*s++;
2676 /* multiply by the 64 bit FNV magic prime mod 2^64 */
2677 hval += (hval << 1) + (hval << 4) + (hval << 5) +
2678 (hval << 7) + (hval << 8) + (hval << 40);
2680 /* return our new hash value */
2684 /** Hash the string and output the hash in hex.
2685 * @param[in] str string to hash
2686 * @param[out] hexbuf an array of 17 chars to hold the hash
2689 mdb_hash_hex(char *str, char *hexbuf)
2692 mdb_hash_t h = mdb_hash_str(str, MDB_HASH_INIT);
2693 for (i=0; i<8; i++) {
2694 hexbuf += sprintf(hexbuf, "%02x", (unsigned int)h & 0xff);
2700 /** Open and/or initialize the lock region for the environment.
2701 * @param[in] env The MDB environment.
2702 * @param[in] lpath The pathname of the file used for the lock region.
2703 * @param[in] mode The Unix permissions for the file, if we create it.
2704 * @param[out] excl Set to true if we got an exclusive lock on the region.
2705 * @return 0 on success, non-zero on failure.
2708 mdb_env_setup_locks(MDB_env *env, char *lpath, int mode, int *excl)
2716 if ((env->me_lfd = CreateFile(lpath, GENERIC_READ|GENERIC_WRITE,
2717 FILE_SHARE_READ|FILE_SHARE_WRITE, NULL, OPEN_ALWAYS,
2718 FILE_ATTRIBUTE_NORMAL, NULL)) == INVALID_HANDLE_VALUE) {
2722 /* Try to get exclusive lock. If we succeed, then
2723 * nobody is using the lock region and we should initialize it.
2726 if (LockFile(env->me_lfd, 0, 0, 1, 0)) {
2730 memset(&ov, 0, sizeof(ov));
2731 if (!LockFileEx(env->me_lfd, 0, 0, 1, 0, &ov)) {
2737 size = GetFileSize(env->me_lfd, NULL);
2743 if ((env->me_lfd = open(lpath, O_RDWR|O_CREAT, mode)) == -1)
2745 /* Lose record locks when exec*() */
2746 if ((fdflags = fcntl(env->me_lfd, F_GETFD) | FD_CLOEXEC) >= 0)
2747 fcntl(env->me_lfd, F_SETFD, fdflags);
2749 #else /* O_CLOEXEC on Linux: Open file and set FD_CLOEXEC atomically */
2750 if ((env->me_lfd = open(lpath, O_RDWR|O_CREAT|O_CLOEXEC, mode)) == -1)
2754 /* Try to get exclusive lock. If we succeed, then
2755 * nobody is using the lock region and we should initialize it.
2758 struct flock lock_info;
2759 memset((void *)&lock_info, 0, sizeof(lock_info));
2760 lock_info.l_type = F_WRLCK;
2761 lock_info.l_whence = SEEK_SET;
2762 lock_info.l_start = 0;
2763 lock_info.l_len = 1;
2764 rc = fcntl(env->me_lfd, F_SETLK, &lock_info);
2768 lock_info.l_type = F_RDLCK;
2769 rc = fcntl(env->me_lfd, F_SETLKW, &lock_info);
2776 size = lseek(env->me_lfd, 0, SEEK_END);
2778 rsize = (env->me_maxreaders-1) * sizeof(MDB_reader) + sizeof(MDB_txninfo);
2779 if (size < rsize && *excl) {
2781 SetFilePointer(env->me_lfd, rsize, NULL, 0);
2782 if (!SetEndOfFile(env->me_lfd)) {
2787 if (ftruncate(env->me_lfd, rsize) != 0) {
2794 size = rsize - sizeof(MDB_txninfo);
2795 env->me_maxreaders = size/sizeof(MDB_reader) + 1;
2800 mh = CreateFileMapping(env->me_lfd, NULL, PAGE_READWRITE,
2806 env->me_txns = MapViewOfFileEx(mh, FILE_MAP_WRITE, 0, 0, rsize, NULL);
2808 if (!env->me_txns) {
2813 void *m = mmap(NULL, rsize, PROT_READ|PROT_WRITE, MAP_SHARED,
2815 if (m == MAP_FAILED) {
2816 env->me_txns = NULL;
2826 if (!mdb_sec_inited) {
2827 InitializeSecurityDescriptor(&mdb_null_sd,
2828 SECURITY_DESCRIPTOR_REVISION);
2829 SetSecurityDescriptorDacl(&mdb_null_sd, TRUE, 0, FALSE);
2830 mdb_all_sa.nLength = sizeof(SECURITY_ATTRIBUTES);
2831 mdb_all_sa.bInheritHandle = FALSE;
2832 mdb_all_sa.lpSecurityDescriptor = &mdb_null_sd;
2835 mdb_hash_hex(lpath, hexbuf);
2836 sprintf(env->me_txns->mti_rmname, "Global\\MDBr%s", hexbuf);
2837 env->me_rmutex = CreateMutex(&mdb_all_sa, FALSE, env->me_txns->mti_rmname);
2838 if (!env->me_rmutex) {
2842 sprintf(env->me_txns->mti_wmname, "Global\\MDBw%s", hexbuf);
2843 env->me_wmutex = CreateMutex(&mdb_all_sa, FALSE, env->me_txns->mti_wmname);
2844 if (!env->me_wmutex) {
2851 mdb_hash_hex(lpath, hexbuf);
2852 sprintf(env->me_txns->mti_rmname, "MDBr%s", hexbuf);
2853 if (sem_unlink(env->me_txns->mti_rmname)) {
2855 if (rc != ENOENT && rc != EINVAL)
2858 env->me_rmutex = sem_open(env->me_txns->mti_rmname, O_CREAT, mode, 1);
2859 if (!env->me_rmutex) {
2863 sprintf(env->me_txns->mti_wmname, "MDBw%s", hexbuf);
2864 if (sem_unlink(env->me_txns->mti_wmname)) {
2866 if (rc != ENOENT && rc != EINVAL)
2869 env->me_wmutex = sem_open(env->me_txns->mti_wmname, O_CREAT, mode, 1);
2870 if (!env->me_wmutex) {
2874 #else /* __APPLE__ */
2875 pthread_mutexattr_t mattr;
2877 pthread_mutexattr_init(&mattr);
2878 rc = pthread_mutexattr_setpshared(&mattr, PTHREAD_PROCESS_SHARED);
2882 pthread_mutex_init(&env->me_txns->mti_mutex, &mattr);
2883 pthread_mutex_init(&env->me_txns->mti_wmutex, &mattr);
2884 #endif /* __APPLE__ */
2886 env->me_txns->mti_version = MDB_VERSION;
2887 env->me_txns->mti_magic = MDB_MAGIC;
2888 env->me_txns->mti_txnid = 0;
2889 env->me_txns->mti_numreaders = 0;
2890 env->me_txns->mti_me_toggle = 0;
2893 if (env->me_txns->mti_magic != MDB_MAGIC) {
2894 DPUTS("lock region has invalid magic");
2898 if (env->me_txns->mti_version != MDB_VERSION) {
2899 DPRINTF("lock region is version %u, expected version %u",
2900 env->me_txns->mti_version, MDB_VERSION);
2901 rc = MDB_VERSION_MISMATCH;
2905 if (rc != EACCES && rc != EAGAIN) {
2909 env->me_rmutex = OpenMutex(SYNCHRONIZE, FALSE, env->me_txns->mti_rmname);
2910 if (!env->me_rmutex) {
2914 env->me_wmutex = OpenMutex(SYNCHRONIZE, FALSE, env->me_txns->mti_wmname);
2915 if (!env->me_wmutex) {
2921 env->me_rmutex = sem_open(env->me_txns->mti_rmname, 0);
2922 if (!env->me_rmutex) {
2926 env->me_wmutex = sem_open(env->me_txns->mti_wmname, 0);
2927 if (!env->me_wmutex) {
2937 env->me_lfd = INVALID_HANDLE_VALUE;
2942 /** The name of the lock file in the DB environment */
2943 #define LOCKNAME "/lock.mdb"
2944 /** The name of the data file in the DB environment */
2945 #define DATANAME "/data.mdb"
2946 /** The suffix of the lock file when no subdir is used */
2947 #define LOCKSUFF "-lock"
2950 mdb_env_open(MDB_env *env, const char *path, unsigned int flags, mode_t mode)
2952 int oflags, rc, len, excl;
2953 char *lpath, *dpath;
2956 if (flags & MDB_NOSUBDIR) {
2957 rc = len + sizeof(LOCKSUFF) + len + 1;
2959 rc = len + sizeof(LOCKNAME) + len + sizeof(DATANAME);
2964 if (flags & MDB_NOSUBDIR) {
2965 dpath = lpath + len + sizeof(LOCKSUFF);
2966 sprintf(lpath, "%s" LOCKSUFF, path);
2967 strcpy(dpath, path);
2969 dpath = lpath + len + sizeof(LOCKNAME);
2970 sprintf(lpath, "%s" LOCKNAME, path);
2971 sprintf(dpath, "%s" DATANAME, path);
2974 rc = mdb_env_setup_locks(env, lpath, mode, &excl);
2979 if (F_ISSET(flags, MDB_RDONLY)) {
2980 oflags = GENERIC_READ;
2981 len = OPEN_EXISTING;
2983 oflags = GENERIC_READ|GENERIC_WRITE;
2986 mode = FILE_ATTRIBUTE_NORMAL;
2987 env->me_fd = CreateFile(dpath, oflags, FILE_SHARE_READ|FILE_SHARE_WRITE,
2988 NULL, len, mode, NULL);
2990 if (F_ISSET(flags, MDB_RDONLY))
2993 oflags = O_RDWR | O_CREAT;
2995 env->me_fd = open(dpath, oflags, mode);
2997 if (env->me_fd == INVALID_HANDLE_VALUE) {
3002 if ((rc = mdb_env_open2(env, flags)) == MDB_SUCCESS) {
3003 if (flags & (MDB_RDONLY|MDB_NOSYNC)) {
3004 env->me_mfd = env->me_fd;
3006 /* synchronous fd for meta writes */
3008 env->me_mfd = CreateFile(dpath, oflags,
3009 FILE_SHARE_READ|FILE_SHARE_WRITE, NULL, len,
3010 mode | FILE_FLAG_WRITE_THROUGH, NULL);
3012 env->me_mfd = open(dpath, oflags | MDB_DSYNC, mode);
3014 if (env->me_mfd == INVALID_HANDLE_VALUE) {
3019 env->me_path = strdup(path);
3020 DPRINTF("opened dbenv %p", (void *) env);
3021 pthread_key_create(&env->me_txkey, mdb_env_reader_dest);
3022 LAZY_RWLOCK_INIT(&env->me_dblock, NULL);
3024 mdb_env_share_locks(env);
3025 env->me_dbxs = calloc(env->me_maxdbs, sizeof(MDB_dbx));
3026 env->me_dbs[0] = calloc(env->me_maxdbs, sizeof(MDB_db));
3027 env->me_dbs[1] = calloc(env->me_maxdbs, sizeof(MDB_db));
3033 if (env->me_fd != INVALID_HANDLE_VALUE) {
3035 env->me_fd = INVALID_HANDLE_VALUE;
3037 if (env->me_lfd != INVALID_HANDLE_VALUE) {
3039 env->me_lfd = INVALID_HANDLE_VALUE;
3047 mdb_env_close(MDB_env *env)
3054 VGMEMP_DESTROY(env);
3055 while (env->me_dpages) {
3056 dp = env->me_dpages;
3057 VGMEMP_DEFINED(&dp->mp_next, sizeof(dp->mp_next));
3058 env->me_dpages = dp->mp_next;
3062 free(env->me_dbs[1]);
3063 free(env->me_dbs[0]);
3067 LAZY_RWLOCK_DESTROY(&env->me_dblock);
3068 pthread_key_delete(env->me_txkey);
3071 munmap(env->me_map, env->me_mapsize);
3073 if (env->me_mfd != env->me_fd)
3077 pid_t pid = getpid();
3079 for (i=0; i<env->me_txns->mti_numreaders; i++)
3080 if (env->me_txns->mti_readers[i].mr_pid == pid)
3081 env->me_txns->mti_readers[i].mr_pid = 0;
3082 munmap((void *)env->me_txns, (env->me_maxreaders-1)*sizeof(MDB_reader)+sizeof(MDB_txninfo));
3085 mdb_midl_free(env->me_free_pgs);
3089 /** Compare two items pointing at aligned size_t's */
3091 mdb_cmp_long(const MDB_val *a, const MDB_val *b)
3093 return (*(size_t *)a->mv_data < *(size_t *)b->mv_data) ? -1 :
3094 *(size_t *)a->mv_data > *(size_t *)b->mv_data;
3097 /** Compare two items pointing at aligned int's */
3099 mdb_cmp_int(const MDB_val *a, const MDB_val *b)
3101 return (*(unsigned int *)a->mv_data < *(unsigned int *)b->mv_data) ? -1 :
3102 *(unsigned int *)a->mv_data > *(unsigned int *)b->mv_data;
3105 /** Compare two items pointing at ints of unknown alignment.
3106 * Nodes and keys are guaranteed to be 2-byte aligned.
3109 mdb_cmp_cint(const MDB_val *a, const MDB_val *b)
3111 #if BYTE_ORDER == LITTLE_ENDIAN
3112 unsigned short *u, *c;
3115 u = (unsigned short *) ((char *) a->mv_data + a->mv_size);
3116 c = (unsigned short *) ((char *) b->mv_data + a->mv_size);
3119 } while(!x && u > (unsigned short *)a->mv_data);
3122 return memcmp(a->mv_data, b->mv_data, a->mv_size);
3126 /** Compare two items lexically */
3128 mdb_cmp_memn(const MDB_val *a, const MDB_val *b)
3135 len_diff = (ssize_t) a->mv_size - (ssize_t) b->mv_size;
3141 diff = memcmp(a->mv_data, b->mv_data, len);
3142 return diff ? diff : len_diff<0 ? -1 : len_diff;
3145 /** Compare two items in reverse byte order */
3147 mdb_cmp_memnr(const MDB_val *a, const MDB_val *b)
3149 const unsigned char *p1, *p2, *p1_lim;
3153 p1_lim = (const unsigned char *)a->mv_data;
3154 p1 = (const unsigned char *)a->mv_data + a->mv_size;
3155 p2 = (const unsigned char *)b->mv_data + b->mv_size;
3157 len_diff = (ssize_t) a->mv_size - (ssize_t) b->mv_size;
3163 while (p1 > p1_lim) {
3164 diff = *--p1 - *--p2;
3168 return len_diff<0 ? -1 : len_diff;
3171 /** Search for key within a page, using binary search.
3172 * Returns the smallest entry larger or equal to the key.
3173 * If exactp is non-null, stores whether the found entry was an exact match
3174 * in *exactp (1 or 0).
3175 * Updates the cursor index with the index of the found entry.
3176 * If no entry larger or equal to the key is found, returns NULL.
3179 mdb_node_search(MDB_cursor *mc, MDB_val *key, int *exactp)
3181 unsigned int i = 0, nkeys;
3184 MDB_page *mp = mc->mc_pg[mc->mc_top];
3185 MDB_node *node = NULL;
3190 nkeys = NUMKEYS(mp);
3195 COPY_PGNO(pgno, mp->mp_pgno);
3196 DPRINTF("searching %u keys in %s %spage %zu",
3197 nkeys, IS_LEAF(mp) ? "leaf" : "branch", IS_SUBP(mp) ? "sub-" : "",
3204 low = IS_LEAF(mp) ? 0 : 1;
3206 cmp = mc->mc_dbx->md_cmp;
3208 /* Branch pages have no data, so if using integer keys,
3209 * alignment is guaranteed. Use faster mdb_cmp_int.
3211 if (cmp == mdb_cmp_cint && IS_BRANCH(mp)) {
3212 if (NODEPTR(mp, 1)->mn_ksize == sizeof(size_t))
3219 nodekey.mv_size = mc->mc_db->md_pad;
3220 node = NODEPTR(mp, 0); /* fake */
3221 while (low <= high) {
3222 i = (low + high) >> 1;
3223 nodekey.mv_data = LEAF2KEY(mp, i, nodekey.mv_size);
3224 rc = cmp(key, &nodekey);
3225 DPRINTF("found leaf index %u [%s], rc = %i",
3226 i, DKEY(&nodekey), rc);
3235 while (low <= high) {
3236 i = (low + high) >> 1;
3238 node = NODEPTR(mp, i);
3239 nodekey.mv_size = NODEKSZ(node);
3240 nodekey.mv_data = NODEKEY(node);
3242 rc = cmp(key, &nodekey);
3245 DPRINTF("found leaf index %u [%s], rc = %i",
3246 i, DKEY(&nodekey), rc);
3248 DPRINTF("found branch index %u [%s -> %zu], rc = %i",
3249 i, DKEY(&nodekey), NODEPGNO(node), rc);
3260 if (rc > 0) { /* Found entry is less than the key. */
3261 i++; /* Skip to get the smallest entry larger than key. */
3263 node = NODEPTR(mp, i);
3266 *exactp = (rc == 0);
3267 /* store the key index */
3268 mc->mc_ki[mc->mc_top] = i;
3270 /* There is no entry larger or equal to the key. */
3273 /* nodeptr is fake for LEAF2 */
3279 mdb_cursor_adjust(MDB_cursor *mc, func)
3283 for (m2 = mc->mc_txn->mt_cursors[mc->mc_dbi]; m2; m2=m2->mc_next) {
3284 if (m2->mc_pg[m2->mc_top] == mc->mc_pg[mc->mc_top]) {
3291 /** Pop a page off the top of the cursor's stack. */
3293 mdb_cursor_pop(MDB_cursor *mc)
3298 top = mc->mc_pg[mc->mc_top];
3303 DPRINTF("popped page %zu off db %u cursor %p", top->mp_pgno,
3304 mc->mc_dbi, (void *) mc);
3308 /** Push a page onto the top of the cursor's stack. */
3310 mdb_cursor_push(MDB_cursor *mc, MDB_page *mp)
3312 DPRINTF("pushing page %zu on db %u cursor %p", mp->mp_pgno,
3313 mc->mc_dbi, (void *) mc);
3315 if (mc->mc_snum >= CURSOR_STACK) {
3316 assert(mc->mc_snum < CURSOR_STACK);
3320 mc->mc_top = mc->mc_snum++;
3321 mc->mc_pg[mc->mc_top] = mp;
3322 mc->mc_ki[mc->mc_top] = 0;
3327 /** Find the address of the page corresponding to a given page number.
3328 * @param[in] txn the transaction for this access.
3329 * @param[in] pgno the page number for the page to retrieve.
3330 * @param[out] ret address of a pointer where the page's address will be stored.
3331 * @return 0 on success, non-zero on failure.
3334 mdb_page_get(MDB_txn *txn, pgno_t pgno, MDB_page **ret)
3338 if (!F_ISSET(txn->mt_flags, MDB_TXN_RDONLY) && txn->mt_u.dirty_list[0].mid) {
3340 x = mdb_mid2l_search(txn->mt_u.dirty_list, pgno);
3341 if (x <= txn->mt_u.dirty_list[0].mid && txn->mt_u.dirty_list[x].mid == pgno) {
3342 p = txn->mt_u.dirty_list[x].mptr;
3346 if (pgno <= txn->mt_env->me_metas[txn->mt_toggle]->mm_last_pg)
3347 p = (MDB_page *)(txn->mt_env->me_map + txn->mt_env->me_psize * pgno);
3351 DPRINTF("page %zu not found", pgno);
3354 return (p != NULL) ? MDB_SUCCESS : MDB_PAGE_NOTFOUND;
3357 /** Search for the page a given key should be in.
3358 * Pushes parent pages on the cursor stack. This function continues a
3359 * search on a cursor that has already been initialized. (Usually by
3360 * #mdb_page_search() but also by #mdb_node_move().)
3361 * @param[in,out] mc the cursor for this operation.
3362 * @param[in] key the key to search for. If NULL, search for the lowest
3363 * page. (This is used by #mdb_cursor_first().)
3364 * @param[in] modify If true, visited pages are updated with new page numbers.
3365 * @return 0 on success, non-zero on failure.
3368 mdb_page_search_root(MDB_cursor *mc, MDB_val *key, int modify)
3370 MDB_page *mp = mc->mc_pg[mc->mc_top];
3375 while (IS_BRANCH(mp)) {
3379 DPRINTF("branch page %zu has %u keys", mp->mp_pgno, NUMKEYS(mp));
3380 assert(NUMKEYS(mp) > 1);
3381 DPRINTF("found index 0 to page %zu", NODEPGNO(NODEPTR(mp, 0)));
3383 if (key == NULL) /* Initialize cursor to first page. */
3385 else if (key->mv_size > MAXKEYSIZE && key->mv_data == NULL) {
3386 /* cursor to last page */
3390 node = mdb_node_search(mc, key, &exact);
3392 i = NUMKEYS(mp) - 1;
3394 i = mc->mc_ki[mc->mc_top];
3403 DPRINTF("following index %u for key [%s]",
3405 assert(i < NUMKEYS(mp));
3406 node = NODEPTR(mp, i);
3408 if ((rc = mdb_page_get(mc->mc_txn, NODEPGNO(node), &mp)))
3411 mc->mc_ki[mc->mc_top] = i;
3412 if ((rc = mdb_cursor_push(mc, mp)))
3416 if ((rc = mdb_page_touch(mc)) != 0)
3418 mp = mc->mc_pg[mc->mc_top];
3423 DPRINTF("internal error, index points to a %02X page!?",
3425 return MDB_CORRUPTED;
3428 DPRINTF("found leaf page %zu for key [%s]", mp->mp_pgno,
3429 key ? DKEY(key) : NULL);
3434 /** Search for the page a given key should be in.
3435 * Pushes parent pages on the cursor stack. This function just sets up
3436 * the search; it finds the root page for \b mc's database and sets this
3437 * as the root of the cursor's stack. Then #mdb_page_search_root() is
3438 * called to complete the search.
3439 * @param[in,out] mc the cursor for this operation.
3440 * @param[in] key the key to search for. If NULL, search for the lowest
3441 * page. (This is used by #mdb_cursor_first().)
3442 * @param[in] modify If true, visited pages are updated with new page numbers.
3443 * @return 0 on success, non-zero on failure.
3446 mdb_page_search(MDB_cursor *mc, MDB_val *key, int modify)
3451 /* Make sure the txn is still viable, then find the root from
3452 * the txn's db table.
3454 if (F_ISSET(mc->mc_txn->mt_flags, MDB_TXN_ERROR)) {
3455 DPUTS("transaction has failed, must abort");
3458 /* Make sure we're using an up-to-date root */
3459 if (mc->mc_dbi > MAIN_DBI) {
3460 if ((*mc->mc_dbflag & DB_STALE) ||
3461 (modify && !(*mc->mc_dbflag & DB_DIRTY))) {
3463 unsigned char dbflag = 0;
3464 mdb_cursor_init(&mc2, mc->mc_txn, MAIN_DBI, NULL);
3465 rc = mdb_page_search(&mc2, &mc->mc_dbx->md_name, modify);
3468 if (*mc->mc_dbflag & DB_STALE) {
3471 MDB_node *leaf = mdb_node_search(&mc2,
3472 &mc->mc_dbx->md_name, &exact);
3474 return MDB_NOTFOUND;
3475 mdb_node_read(mc->mc_txn, leaf, &data);
3476 memcpy(mc->mc_db, data.mv_data, sizeof(MDB_db));
3480 *mc->mc_dbflag = dbflag;
3483 root = mc->mc_db->md_root;
3485 if (root == P_INVALID) { /* Tree is empty. */
3486 DPUTS("tree is empty");
3487 return MDB_NOTFOUND;
3492 if ((rc = mdb_page_get(mc->mc_txn, root, &mc->mc_pg[0])))
3498 DPRINTF("db %u root page %zu has flags 0x%X",
3499 mc->mc_dbi, root, mc->mc_pg[0]->mp_flags);
3502 if ((rc = mdb_page_touch(mc)))
3506 return mdb_page_search_root(mc, key, modify);
3509 /** Return the data associated with a given node.
3510 * @param[in] txn The transaction for this operation.
3511 * @param[in] leaf The node being read.
3512 * @param[out] data Updated to point to the node's data.
3513 * @return 0 on success, non-zero on failure.
3516 mdb_node_read(MDB_txn *txn, MDB_node *leaf, MDB_val *data)
3518 MDB_page *omp; /* overflow page */
3522 if (!F_ISSET(leaf->mn_flags, F_BIGDATA)) {
3523 data->mv_size = NODEDSZ(leaf);
3524 data->mv_data = NODEDATA(leaf);
3528 /* Read overflow data.
3530 data->mv_size = NODEDSZ(leaf);
3531 memcpy(&pgno, NODEDATA(leaf), sizeof(pgno));
3532 if ((rc = mdb_page_get(txn, pgno, &omp))) {
3533 DPRINTF("read overflow page %zu failed", pgno);
3536 data->mv_data = METADATA(omp);
3542 mdb_get(MDB_txn *txn, MDB_dbi dbi,
3543 MDB_val *key, MDB_val *data)
3552 DPRINTF("===> get db %u key [%s]", dbi, DKEY(key));
3554 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs)
3557 if (key->mv_size == 0 || key->mv_size > MAXKEYSIZE) {
3561 mdb_cursor_init(&mc, txn, dbi, &mx);
3562 return mdb_cursor_set(&mc, key, data, MDB_SET, &exact);
3565 /** Find a sibling for a page.
3566 * Replaces the page at the top of the cursor's stack with the
3567 * specified sibling, if one exists.
3568 * @param[in] mc The cursor for this operation.
3569 * @param[in] move_right Non-zero if the right sibling is requested,
3570 * otherwise the left sibling.
3571 * @return 0 on success, non-zero on failure.
3574 mdb_cursor_sibling(MDB_cursor *mc, int move_right)
3580 if (mc->mc_snum < 2) {
3581 return MDB_NOTFOUND; /* root has no siblings */
3585 DPRINTF("parent page is page %zu, index %u",
3586 mc->mc_pg[mc->mc_top]->mp_pgno, mc->mc_ki[mc->mc_top]);
3588 if (move_right ? (mc->mc_ki[mc->mc_top] + 1u >= NUMKEYS(mc->mc_pg[mc->mc_top]))
3589 : (mc->mc_ki[mc->mc_top] == 0)) {
3590 DPRINTF("no more keys left, moving to %s sibling",
3591 move_right ? "right" : "left");
3592 if ((rc = mdb_cursor_sibling(mc, move_right)) != MDB_SUCCESS)
3596 mc->mc_ki[mc->mc_top]++;
3598 mc->mc_ki[mc->mc_top]--;
3599 DPRINTF("just moving to %s index key %u",
3600 move_right ? "right" : "left", mc->mc_ki[mc->mc_top]);
3602 assert(IS_BRANCH(mc->mc_pg[mc->mc_top]));
3604 indx = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
3605 if ((rc = mdb_page_get(mc->mc_txn, NODEPGNO(indx), &mp)))
3608 mdb_cursor_push(mc, mp);
3613 /** Move the cursor to the next data item. */
3615 mdb_cursor_next(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op)
3621 if (mc->mc_flags & C_EOF) {
3622 return MDB_NOTFOUND;
3625 assert(mc->mc_flags & C_INITIALIZED);
3627 mp = mc->mc_pg[mc->mc_top];
3629 if (mc->mc_db->md_flags & MDB_DUPSORT) {
3630 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
3631 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
3632 if (op == MDB_NEXT || op == MDB_NEXT_DUP) {
3633 rc = mdb_cursor_next(&mc->mc_xcursor->mx_cursor, data, NULL, MDB_NEXT);
3634 if (op != MDB_NEXT || rc == MDB_SUCCESS)
3638 mc->mc_xcursor->mx_cursor.mc_flags &= ~C_INITIALIZED;
3639 if (op == MDB_NEXT_DUP)
3640 return MDB_NOTFOUND;
3644 DPRINTF("cursor_next: top page is %zu in cursor %p", mp->mp_pgno, (void *) mc);
3646 if (mc->mc_ki[mc->mc_top] + 1u >= NUMKEYS(mp)) {
3647 DPUTS("=====> move to next sibling page");
3648 if (mdb_cursor_sibling(mc, 1) != MDB_SUCCESS) {
3649 mc->mc_flags |= C_EOF;
3650 mc->mc_flags &= ~C_INITIALIZED;
3651 return MDB_NOTFOUND;
3653 mp = mc->mc_pg[mc->mc_top];
3654 DPRINTF("next page is %zu, key index %u", mp->mp_pgno, mc->mc_ki[mc->mc_top]);
3656 mc->mc_ki[mc->mc_top]++;
3658 DPRINTF("==> cursor points to page %zu with %u keys, key index %u",
3659 mp->mp_pgno, NUMKEYS(mp), mc->mc_ki[mc->mc_top]);
3662 key->mv_size = mc->mc_db->md_pad;
3663 key->mv_data = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], key->mv_size);
3667 assert(IS_LEAF(mp));
3668 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
3670 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
3671 mdb_xcursor_init1(mc, leaf);
3674 if ((rc = mdb_node_read(mc->mc_txn, leaf, data) != MDB_SUCCESS))
3677 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
3678 rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
3679 if (rc != MDB_SUCCESS)
3684 MDB_SET_KEY(leaf, key);
3688 /** Move the cursor to the previous data item. */
3690 mdb_cursor_prev(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op)
3696 assert(mc->mc_flags & C_INITIALIZED);
3698 mp = mc->mc_pg[mc->mc_top];
3700 if (mc->mc_db->md_flags & MDB_DUPSORT) {
3701 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
3702 if (op == MDB_PREV || op == MDB_PREV_DUP) {
3703 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
3704 rc = mdb_cursor_prev(&mc->mc_xcursor->mx_cursor, data, NULL, MDB_PREV);
3705 if (op != MDB_PREV || rc == MDB_SUCCESS)
3708 mc->mc_xcursor->mx_cursor.mc_flags &= ~C_INITIALIZED;
3709 if (op == MDB_PREV_DUP)
3710 return MDB_NOTFOUND;
3715 DPRINTF("cursor_prev: top page is %zu in cursor %p", mp->mp_pgno, (void *) mc);
3717 if (mc->mc_ki[mc->mc_top] == 0) {
3718 DPUTS("=====> move to prev sibling page");
3719 if (mdb_cursor_sibling(mc, 0) != MDB_SUCCESS) {
3720 mc->mc_flags &= ~C_INITIALIZED;
3721 return MDB_NOTFOUND;
3723 mp = mc->mc_pg[mc->mc_top];
3724 mc->mc_ki[mc->mc_top] = NUMKEYS(mp) - 1;
3725 DPRINTF("prev page is %zu, key index %u", mp->mp_pgno, mc->mc_ki[mc->mc_top]);
3727 mc->mc_ki[mc->mc_top]--;
3729 mc->mc_flags &= ~C_EOF;
3731 DPRINTF("==> cursor points to page %zu with %u keys, key index %u",
3732 mp->mp_pgno, NUMKEYS(mp), mc->mc_ki[mc->mc_top]);
3735 key->mv_size = mc->mc_db->md_pad;
3736 key->mv_data = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], key->mv_size);
3740 assert(IS_LEAF(mp));
3741 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
3743 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
3744 mdb_xcursor_init1(mc, leaf);
3747 if ((rc = mdb_node_read(mc->mc_txn, leaf, data) != MDB_SUCCESS))
3750 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
3751 rc = mdb_cursor_last(&mc->mc_xcursor->mx_cursor, data, NULL);
3752 if (rc != MDB_SUCCESS)
3757 MDB_SET_KEY(leaf, key);
3761 /** Set the cursor on a specific data item. */
3763 mdb_cursor_set(MDB_cursor *mc, MDB_val *key, MDB_val *data,
3764 MDB_cursor_op op, int *exactp)
3773 assert(key->mv_size > 0);
3775 /* See if we're already on the right page */
3776 if (mc->mc_flags & C_INITIALIZED) {
3779 mp = mc->mc_pg[mc->mc_top];
3781 mc->mc_ki[mc->mc_top] = 0;
3782 return MDB_NOTFOUND;
3784 if (mp->mp_flags & P_LEAF2) {
3785 nodekey.mv_size = mc->mc_db->md_pad;
3786 nodekey.mv_data = LEAF2KEY(mp, 0, nodekey.mv_size);
3788 leaf = NODEPTR(mp, 0);
3789 MDB_SET_KEY(leaf, &nodekey);
3791 rc = mc->mc_dbx->md_cmp(key, &nodekey);
3793 /* Probably happens rarely, but first node on the page
3794 * was the one we wanted.
3796 mc->mc_ki[mc->mc_top] = 0;
3797 leaf = NODEPTR(mp, 0);
3804 unsigned int nkeys = NUMKEYS(mp);
3806 if (mp->mp_flags & P_LEAF2) {
3807 nodekey.mv_data = LEAF2KEY(mp,
3808 nkeys-1, nodekey.mv_size);
3810 leaf = NODEPTR(mp, nkeys-1);
3811 MDB_SET_KEY(leaf, &nodekey);
3813 rc = mc->mc_dbx->md_cmp(key, &nodekey);
3815 /* last node was the one we wanted */
3816 mc->mc_ki[mc->mc_top] = nkeys-1;
3817 leaf = NODEPTR(mp, nkeys-1);
3823 /* This is definitely the right page, skip search_page */
3828 /* If any parents have right-sibs, search.
3829 * Otherwise, there's nothing further.
3831 for (i=0; i<mc->mc_top; i++)
3833 NUMKEYS(mc->mc_pg[i])-1)
3835 if (i == mc->mc_top) {
3836 /* There are no other pages */
3837 mc->mc_ki[mc->mc_top] = nkeys;
3838 return MDB_NOTFOUND;
3842 /* There are no other pages */
3843 mc->mc_ki[mc->mc_top] = 0;
3844 return MDB_NOTFOUND;
3848 rc = mdb_page_search(mc, key, 0);
3849 if (rc != MDB_SUCCESS)
3852 mp = mc->mc_pg[mc->mc_top];
3853 assert(IS_LEAF(mp));
3856 leaf = mdb_node_search(mc, key, exactp);
3857 if (exactp != NULL && !*exactp) {
3858 /* MDB_SET specified and not an exact match. */
3859 return MDB_NOTFOUND;
3863 DPUTS("===> inexact leaf not found, goto sibling");
3864 if ((rc = mdb_cursor_sibling(mc, 1)) != MDB_SUCCESS)
3865 return rc; /* no entries matched */
3866 mp = mc->mc_pg[mc->mc_top];
3867 assert(IS_LEAF(mp));
3868 leaf = NODEPTR(mp, 0);
3872 mc->mc_flags |= C_INITIALIZED;
3873 mc->mc_flags &= ~C_EOF;
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 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
3882 mdb_xcursor_init1(mc, leaf);
3885 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
3886 if (op == MDB_SET || op == MDB_SET_RANGE) {
3887 rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
3890 if (op == MDB_GET_BOTH) {
3896 rc = mdb_cursor_set(&mc->mc_xcursor->mx_cursor, data, NULL, MDB_SET_RANGE, ex2p);
3897 if (rc != MDB_SUCCESS)
3900 } else if (op == MDB_GET_BOTH || op == MDB_GET_BOTH_RANGE) {
3902 if ((rc = mdb_node_read(mc->mc_txn, leaf, &d2)) != MDB_SUCCESS)
3904 rc = mc->mc_dbx->md_dcmp(data, &d2);
3906 if (op == MDB_GET_BOTH || rc > 0)
3907 return MDB_NOTFOUND;
3912 mc->mc_xcursor->mx_cursor.mc_flags &= ~C_INITIALIZED;
3913 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
3918 /* The key already matches in all other cases */
3919 if (op == MDB_SET_RANGE)
3920 MDB_SET_KEY(leaf, key);
3921 DPRINTF("==> cursor placed on key [%s]", DKEY(key));
3926 /** Move the cursor to the first item in the database. */
3928 mdb_cursor_first(MDB_cursor *mc, MDB_val *key, MDB_val *data)
3933 if (!(mc->mc_flags & C_INITIALIZED) || mc->mc_top) {
3934 rc = mdb_page_search(mc, NULL, 0);
3935 if (rc != MDB_SUCCESS)
3938 assert(IS_LEAF(mc->mc_pg[mc->mc_top]));
3940 leaf = NODEPTR(mc->mc_pg[mc->mc_top], 0);
3941 mc->mc_flags |= C_INITIALIZED;
3942 mc->mc_flags &= ~C_EOF;
3944 mc->mc_ki[mc->mc_top] = 0;
3946 if (IS_LEAF2(mc->mc_pg[mc->mc_top])) {
3947 key->mv_size = mc->mc_db->md_pad;
3948 key->mv_data = LEAF2KEY(mc->mc_pg[mc->mc_top], 0, key->mv_size);
3953 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
3954 mdb_xcursor_init1(mc, leaf);
3955 rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
3960 mc->mc_xcursor->mx_cursor.mc_flags &= ~C_INITIALIZED;
3961 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
3965 MDB_SET_KEY(leaf, key);
3969 /** Move the cursor to the last item in the database. */
3971 mdb_cursor_last(MDB_cursor *mc, MDB_val *key, MDB_val *data)
3977 lkey.mv_size = MAXKEYSIZE+1;
3978 lkey.mv_data = NULL;
3980 if (!(mc->mc_flags & C_INITIALIZED) || mc->mc_top) {
3981 rc = mdb_page_search(mc, &lkey, 0);
3982 if (rc != MDB_SUCCESS)
3985 assert(IS_LEAF(mc->mc_pg[mc->mc_top]));
3987 leaf = NODEPTR(mc->mc_pg[mc->mc_top], NUMKEYS(mc->mc_pg[mc->mc_top])-1);
3988 mc->mc_flags |= C_INITIALIZED;
3989 mc->mc_flags &= ~C_EOF;
3991 mc->mc_ki[mc->mc_top] = NUMKEYS(mc->mc_pg[mc->mc_top]) - 1;
3993 if (IS_LEAF2(mc->mc_pg[mc->mc_top])) {
3994 key->mv_size = mc->mc_db->md_pad;
3995 key->mv_data = LEAF2KEY(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], key->mv_size);
4000 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4001 mdb_xcursor_init1(mc, leaf);
4002 rc = mdb_cursor_last(&mc->mc_xcursor->mx_cursor, data, NULL);
4007 mc->mc_xcursor->mx_cursor.mc_flags &= ~C_INITIALIZED;
4008 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
4013 MDB_SET_KEY(leaf, key);
4018 mdb_cursor_get(MDB_cursor *mc, MDB_val *key, MDB_val *data,
4028 case MDB_GET_BOTH_RANGE:
4029 if (data == NULL || mc->mc_xcursor == NULL) {
4036 if (key == NULL || key->mv_size == 0 || key->mv_size > MAXKEYSIZE) {
4038 } else if (op == MDB_SET_RANGE)
4039 rc = mdb_cursor_set(mc, key, data, op, NULL);
4041 rc = mdb_cursor_set(mc, key, data, op, &exact);
4043 case MDB_GET_MULTIPLE:
4045 !(mc->mc_db->md_flags & MDB_DUPFIXED) ||
4046 !(mc->mc_flags & C_INITIALIZED)) {
4051 if (!(mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED) ||
4052 (mc->mc_xcursor->mx_cursor.mc_flags & C_EOF))
4055 case MDB_NEXT_MULTIPLE:
4057 !(mc->mc_db->md_flags & MDB_DUPFIXED)) {
4061 if (!(mc->mc_flags & C_INITIALIZED))
4062 rc = mdb_cursor_first(mc, key, data);
4064 rc = mdb_cursor_next(mc, key, data, MDB_NEXT_DUP);
4065 if (rc == MDB_SUCCESS) {
4066 if (mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED) {
4069 mx = &mc->mc_xcursor->mx_cursor;
4070 data->mv_size = NUMKEYS(mx->mc_pg[mx->mc_top]) *
4072 data->mv_data = METADATA(mx->mc_pg[mx->mc_top]);
4073 mx->mc_ki[mx->mc_top] = NUMKEYS(mx->mc_pg[mx->mc_top])-1;
4081 case MDB_NEXT_NODUP:
4082 if (!(mc->mc_flags & C_INITIALIZED))
4083 rc = mdb_cursor_first(mc, key, data);
4085 rc = mdb_cursor_next(mc, key, data, op);
4089 case MDB_PREV_NODUP:
4090 if (!(mc->mc_flags & C_INITIALIZED) || (mc->mc_flags & C_EOF))
4091 rc = mdb_cursor_last(mc, key, data);
4093 rc = mdb_cursor_prev(mc, key, data, op);
4096 rc = mdb_cursor_first(mc, key, data);
4100 !(mc->mc_db->md_flags & MDB_DUPSORT) ||
4101 !(mc->mc_flags & C_INITIALIZED) ||
4102 !(mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED)) {
4106 rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
4109 rc = mdb_cursor_last(mc, key, data);
4113 !(mc->mc_db->md_flags & MDB_DUPSORT) ||
4114 !(mc->mc_flags & C_INITIALIZED) ||
4115 !(mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED)) {
4119 rc = mdb_cursor_last(&mc->mc_xcursor->mx_cursor, data, NULL);
4122 DPRINTF("unhandled/unimplemented cursor operation %u", op);
4130 /** Touch all the pages in the cursor stack.
4131 * Makes sure all the pages are writable, before attempting a write operation.
4132 * @param[in] mc The cursor to operate on.
4135 mdb_cursor_touch(MDB_cursor *mc)
4139 if (mc->mc_dbi > MAIN_DBI && !(*mc->mc_dbflag & DB_DIRTY)) {
4141 mdb_cursor_init(&mc2, mc->mc_txn, MAIN_DBI, NULL);
4142 rc = mdb_page_search(&mc2, &mc->mc_dbx->md_name, 1);
4145 *mc->mc_dbflag = DB_DIRTY;
4147 for (mc->mc_top = 0; mc->mc_top < mc->mc_snum; mc->mc_top++) {
4148 rc = mdb_page_touch(mc);
4152 mc->mc_top = mc->mc_snum-1;
4157 mdb_cursor_put(MDB_cursor *mc, MDB_val *key, MDB_val *data,
4160 MDB_node *leaf = NULL;
4161 MDB_val xdata, *rdata, dkey;
4165 unsigned int mcount = 0;
4169 char dbuf[MAXKEYSIZE+1];
4170 unsigned int nflags;
4173 if (F_ISSET(mc->mc_txn->mt_flags, MDB_TXN_RDONLY))
4176 DPRINTF("==> put db %u key [%s], size %zu, data size %zu",
4177 mc->mc_dbi, DKEY(key), key ? key->mv_size:0, data->mv_size);
4181 if (flags == MDB_CURRENT) {
4182 if (!(mc->mc_flags & C_INITIALIZED))
4185 } else if (mc->mc_db->md_root == P_INVALID) {
4187 /* new database, write a root leaf page */
4188 DPUTS("allocating new root leaf page");
4189 if ((np = mdb_page_new(mc, P_LEAF, 1)) == NULL) {
4193 mdb_cursor_push(mc, np);
4194 mc->mc_db->md_root = np->mp_pgno;
4195 mc->mc_db->md_depth++;
4196 *mc->mc_dbflag = DB_DIRTY;
4197 if ((mc->mc_db->md_flags & (MDB_DUPSORT|MDB_DUPFIXED))
4199 np->mp_flags |= P_LEAF2;
4200 mc->mc_flags |= C_INITIALIZED;
4206 rc = mdb_cursor_set(mc, key, &d2, MDB_SET, &exact);
4207 if ((flags & MDB_NOOVERWRITE) && rc == 0) {
4208 DPRINTF("duplicate key [%s]", DKEY(key));
4210 return MDB_KEYEXIST;
4212 if (rc && rc != MDB_NOTFOUND)
4216 /* Cursor is positioned, now make sure all pages are writable */
4217 rc2 = mdb_cursor_touch(mc);
4222 /* The key already exists */
4223 if (rc == MDB_SUCCESS) {
4224 /* there's only a key anyway, so this is a no-op */
4225 if (IS_LEAF2(mc->mc_pg[mc->mc_top])) {
4226 unsigned int ksize = mc->mc_db->md_pad;
4227 if (key->mv_size != ksize)
4229 if (flags == MDB_CURRENT) {
4230 char *ptr = LEAF2KEY(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], ksize);
4231 memcpy(ptr, key->mv_data, ksize);
4236 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
4239 if (F_ISSET(mc->mc_db->md_flags, MDB_DUPSORT)) {
4240 /* Was a single item before, must convert now */
4242 if (!F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4243 /* Just overwrite the current item */
4244 if (flags == MDB_CURRENT)
4247 dkey.mv_size = NODEDSZ(leaf);
4248 dkey.mv_data = NODEDATA(leaf);
4249 #if UINT_MAX < SIZE_MAX
4250 if (mc->mc_dbx->md_dcmp == mdb_cmp_int && dkey.mv_size == sizeof(size_t))
4251 #ifdef MISALIGNED_OK
4252 mc->mc_dbx->md_dcmp = mdb_cmp_long;
4254 mc->mc_dbx->md_dcmp = mdb_cmp_cint;
4257 /* if data matches, ignore it */
4258 if (!mc->mc_dbx->md_dcmp(data, &dkey))
4259 return (flags == MDB_NODUPDATA) ? MDB_KEYEXIST : MDB_SUCCESS;
4261 /* create a fake page for the dup items */
4262 memcpy(dbuf, dkey.mv_data, dkey.mv_size);
4263 dkey.mv_data = dbuf;
4264 fp = (MDB_page *)&pbuf;
4265 fp->mp_pgno = mc->mc_pg[mc->mc_top]->mp_pgno;
4266 fp->mp_flags = P_LEAF|P_DIRTY|P_SUBP;
4267 fp->mp_lower = PAGEHDRSZ;
4268 fp->mp_upper = PAGEHDRSZ + dkey.mv_size + data->mv_size;
4269 if (mc->mc_db->md_flags & MDB_DUPFIXED) {
4270 fp->mp_flags |= P_LEAF2;
4271 fp->mp_pad = data->mv_size;
4273 fp->mp_upper += 2 * sizeof(indx_t) + 2 * NODESIZE +
4274 (dkey.mv_size & 1) + (data->mv_size & 1);
4276 mdb_node_del(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], 0);
4279 xdata.mv_size = fp->mp_upper;
4284 if (!F_ISSET(leaf->mn_flags, F_SUBDATA)) {
4285 /* See if we need to convert from fake page to subDB */
4287 unsigned int offset;
4290 fp = NODEDATA(leaf);
4291 if (flags == MDB_CURRENT) {
4292 fp->mp_flags |= P_DIRTY;
4293 COPY_PGNO(fp->mp_pgno, mc->mc_pg[mc->mc_top]->mp_pgno);
4294 mc->mc_xcursor->mx_cursor.mc_pg[0] = fp;
4298 if (mc->mc_db->md_flags & MDB_DUPFIXED) {
4299 offset = fp->mp_pad;
4301 offset = NODESIZE + sizeof(indx_t) + data->mv_size;
4303 offset += offset & 1;
4304 if (NODESIZE + sizeof(indx_t) + NODEKSZ(leaf) + NODEDSZ(leaf) +
4305 offset >= (mc->mc_txn->mt_env->me_psize - PAGEHDRSZ) /
4307 /* yes, convert it */
4309 if (mc->mc_db->md_flags & MDB_DUPFIXED) {
4310 dummy.md_pad = fp->mp_pad;
4311 dummy.md_flags = MDB_DUPFIXED;
4312 if (mc->mc_db->md_flags & MDB_INTEGERDUP)
4313 dummy.md_flags |= MDB_INTEGERKEY;
4316 dummy.md_branch_pages = 0;
4317 dummy.md_leaf_pages = 1;
4318 dummy.md_overflow_pages = 0;
4319 dummy.md_entries = NUMKEYS(fp);
4321 xdata.mv_size = sizeof(MDB_db);
4322 xdata.mv_data = &dummy;
4323 mp = mdb_page_alloc(mc, 1);
4326 offset = mc->mc_txn->mt_env->me_psize - NODEDSZ(leaf);
4327 flags |= F_DUPDATA|F_SUBDATA;
4328 dummy.md_root = mp->mp_pgno;
4330 /* no, just grow it */
4332 xdata.mv_size = NODEDSZ(leaf) + offset;
4333 xdata.mv_data = &pbuf;
4334 mp = (MDB_page *)&pbuf;
4335 mp->mp_pgno = mc->mc_pg[mc->mc_top]->mp_pgno;
4338 mp->mp_flags = fp->mp_flags | P_DIRTY;
4339 mp->mp_pad = fp->mp_pad;
4340 mp->mp_lower = fp->mp_lower;
4341 mp->mp_upper = fp->mp_upper + offset;
4343 memcpy(METADATA(mp), METADATA(fp), NUMKEYS(fp) * fp->mp_pad);
4345 nsize = NODEDSZ(leaf) - fp->mp_upper;
4346 memcpy((char *)mp + mp->mp_upper, (char *)fp + fp->mp_upper, nsize);
4347 for (i=0; i<NUMKEYS(fp); i++)
4348 mp->mp_ptrs[i] = fp->mp_ptrs[i] + offset;
4350 mdb_node_del(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], 0);
4354 /* data is on sub-DB, just store it */
4355 flags |= F_DUPDATA|F_SUBDATA;
4359 /* overflow page overwrites need special handling */
4360 if (F_ISSET(leaf->mn_flags, F_BIGDATA)) {
4363 int ovpages, dpages;
4365 ovpages = OVPAGES(NODEDSZ(leaf), mc->mc_txn->mt_env->me_psize);
4366 dpages = OVPAGES(data->mv_size, mc->mc_txn->mt_env->me_psize);
4367 memcpy(&pg, NODEDATA(leaf), sizeof(pg));
4368 mdb_page_get(mc->mc_txn, pg, &omp);
4369 /* Is the ov page writable and large enough? */
4370 if ((omp->mp_flags & P_DIRTY) && ovpages >= dpages) {
4371 /* yes, overwrite it. Note in this case we don't
4372 * bother to try shrinking the node if the new data
4373 * is smaller than the overflow threshold.
4375 if (F_ISSET(flags, MDB_RESERVE))
4376 data->mv_data = METADATA(omp);
4378 memcpy(METADATA(omp), data->mv_data, data->mv_size);
4381 /* no, free ovpages */
4383 mc->mc_db->md_overflow_pages -= ovpages;
4384 for (i=0; i<ovpages; i++) {
4385 DPRINTF("freed ov page %zu", pg);
4386 mdb_midl_append(&mc->mc_txn->mt_free_pgs, pg);
4390 } else if (NODEDSZ(leaf) == data->mv_size) {
4391 /* same size, just replace it. Note that we could
4392 * also reuse this node if the new data is smaller,
4393 * but instead we opt to shrink the node in that case.
4395 if (F_ISSET(flags, MDB_RESERVE))
4396 data->mv_data = NODEDATA(leaf);
4398 memcpy(NODEDATA(leaf), data->mv_data, data->mv_size);
4401 mdb_node_del(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], 0);
4402 mc->mc_db->md_entries--;
4404 DPRINTF("inserting key at index %i", mc->mc_ki[mc->mc_top]);
4410 nflags = flags & NODE_ADD_FLAGS;
4411 nsize = IS_LEAF2(mc->mc_pg[mc->mc_top]) ? key->mv_size : mdb_leaf_size(mc->mc_txn->mt_env, key, rdata);
4412 if (SIZELEFT(mc->mc_pg[mc->mc_top]) < nsize) {
4413 if (( flags & (F_DUPDATA|F_SUBDATA)) == F_DUPDATA )
4414 nflags &= ~MDB_APPEND;
4415 rc = mdb_page_split(mc, key, rdata, P_INVALID, nflags);
4417 /* There is room already in this leaf page. */
4418 rc = mdb_node_add(mc, mc->mc_ki[mc->mc_top], key, rdata, 0, nflags);
4419 if (rc == 0 && !do_sub) {
4420 /* Adjust other cursors pointing to mp */
4421 MDB_cursor *m2, *m3;
4422 MDB_dbi dbi = mc->mc_dbi;
4423 unsigned i = mc->mc_top;
4424 MDB_page *mp = mc->mc_pg[i];
4426 if (mc->mc_flags & C_SUB)
4429 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
4430 if (mc->mc_flags & C_SUB)
4431 m3 = &m2->mc_xcursor->mx_cursor;
4434 if (m3 == mc || m3->mc_snum < mc->mc_snum) continue;
4435 if (m3->mc_pg[i] == mp && m3->mc_ki[i] >= mc->mc_ki[i]) {
4442 if (rc != MDB_SUCCESS)
4443 mc->mc_txn->mt_flags |= MDB_TXN_ERROR;
4445 /* Now store the actual data in the child DB. Note that we're
4446 * storing the user data in the keys field, so there are strict
4447 * size limits on dupdata. The actual data fields of the child
4448 * DB are all zero size.
4455 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
4456 if (flags & MDB_CURRENT) {
4457 xflags = MDB_CURRENT;
4459 mdb_xcursor_init1(mc, leaf);
4460 xflags = (flags & MDB_NODUPDATA) ? MDB_NOOVERWRITE : 0;
4462 /* converted, write the original data first */
4464 rc = mdb_cursor_put(&mc->mc_xcursor->mx_cursor, &dkey, &xdata, xflags);
4468 /* Adjust other cursors pointing to mp */
4470 unsigned i = mc->mc_top;
4471 MDB_page *mp = mc->mc_pg[i];
4473 for (m2 = mc->mc_txn->mt_cursors[mc->mc_dbi]; m2; m2=m2->mc_next) {
4474 if (m2 == mc || m2->mc_snum < mc->mc_snum) continue;
4475 if (m2->mc_pg[i] == mp && m2->mc_ki[i] == mc->mc_ki[i]) {
4476 mdb_xcursor_init1(m2, leaf);
4481 xflags |= (flags & MDB_APPEND);
4482 rc = mdb_cursor_put(&mc->mc_xcursor->mx_cursor, data, &xdata, xflags);
4483 if (flags & F_SUBDATA) {
4484 void *db = NODEDATA(leaf);
4485 memcpy(db, &mc->mc_xcursor->mx_db, sizeof(MDB_db));
4488 /* sub-writes might have failed so check rc again.
4489 * Don't increment count if we just replaced an existing item.
4491 if (!rc && !(flags & MDB_CURRENT))
4492 mc->mc_db->md_entries++;
4493 if (flags & MDB_MULTIPLE) {
4495 if (mcount < data[1].mv_size) {
4496 data[0].mv_data = (char *)data[0].mv_data + data[0].mv_size;
4497 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
4507 mdb_cursor_del(MDB_cursor *mc, unsigned int flags)
4512 if (F_ISSET(mc->mc_txn->mt_flags, MDB_TXN_RDONLY))
4515 if (!mc->mc_flags & C_INITIALIZED)
4518 rc = mdb_cursor_touch(mc);
4522 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
4524 if (!IS_LEAF2(mc->mc_pg[mc->mc_top]) && F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4525 if (flags != MDB_NODUPDATA) {
4526 if (!F_ISSET(leaf->mn_flags, F_SUBDATA)) {
4527 mc->mc_xcursor->mx_cursor.mc_pg[0] = NODEDATA(leaf);
4529 rc = mdb_cursor_del(&mc->mc_xcursor->mx_cursor, 0);
4530 /* If sub-DB still has entries, we're done */
4531 if (mc->mc_xcursor->mx_db.md_entries) {
4532 if (leaf->mn_flags & F_SUBDATA) {
4533 /* update subDB info */
4534 void *db = NODEDATA(leaf);
4535 memcpy(db, &mc->mc_xcursor->mx_db, sizeof(MDB_db));
4537 /* shrink fake page */
4538 mdb_node_shrink(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
4540 mc->mc_db->md_entries--;
4543 /* otherwise fall thru and delete the sub-DB */
4546 if (leaf->mn_flags & F_SUBDATA) {
4547 /* add all the child DB's pages to the free list */
4548 rc = mdb_drop0(&mc->mc_xcursor->mx_cursor, 0);
4549 if (rc == MDB_SUCCESS) {
4550 mc->mc_db->md_entries -=
4551 mc->mc_xcursor->mx_db.md_entries;
4556 return mdb_cursor_del0(mc, leaf);
4559 /** Allocate and initialize new pages for a database.
4560 * @param[in] mc a cursor on the database being added to.
4561 * @param[in] flags flags defining what type of page is being allocated.
4562 * @param[in] num the number of pages to allocate. This is usually 1,
4563 * unless allocating overflow pages for a large record.
4564 * @return Address of a page, or NULL on failure.
4567 mdb_page_new(MDB_cursor *mc, uint32_t flags, int num)
4571 if ((np = mdb_page_alloc(mc, num)) == NULL)
4573 DPRINTF("allocated new mpage %zu, page size %u",
4574 np->mp_pgno, mc->mc_txn->mt_env->me_psize);
4575 np->mp_flags = flags | P_DIRTY;
4576 np->mp_lower = PAGEHDRSZ;
4577 np->mp_upper = mc->mc_txn->mt_env->me_psize;
4580 mc->mc_db->md_branch_pages++;
4581 else if (IS_LEAF(np))
4582 mc->mc_db->md_leaf_pages++;
4583 else if (IS_OVERFLOW(np)) {
4584 mc->mc_db->md_overflow_pages += num;
4591 /** Calculate the size of a leaf node.
4592 * The size depends on the environment's page size; if a data item
4593 * is too large it will be put onto an overflow page and the node
4594 * size will only include the key and not the data. Sizes are always
4595 * rounded up to an even number of bytes, to guarantee 2-byte alignment
4596 * of the #MDB_node headers.
4597 * @param[in] env The environment handle.
4598 * @param[in] key The key for the node.
4599 * @param[in] data The data for the node.
4600 * @return The number of bytes needed to store the node.
4603 mdb_leaf_size(MDB_env *env, MDB_val *key, MDB_val *data)
4607 sz = LEAFSIZE(key, data);
4608 if (sz >= env->me_psize / MDB_MINKEYS) {
4609 /* put on overflow page */
4610 sz -= data->mv_size - sizeof(pgno_t);
4614 return sz + sizeof(indx_t);
4617 /** Calculate the size of a branch node.
4618 * The size should depend on the environment's page size but since
4619 * we currently don't support spilling large keys onto overflow
4620 * pages, it's simply the size of the #MDB_node header plus the
4621 * size of the key. Sizes are always rounded up to an even number
4622 * of bytes, to guarantee 2-byte alignment of the #MDB_node headers.
4623 * @param[in] env The environment handle.
4624 * @param[in] key The key for the node.
4625 * @return The number of bytes needed to store the node.
4628 mdb_branch_size(MDB_env *env, MDB_val *key)
4633 if (sz >= env->me_psize / MDB_MINKEYS) {
4634 /* put on overflow page */
4635 /* not implemented */
4636 /* sz -= key->size - sizeof(pgno_t); */
4639 return sz + sizeof(indx_t);
4642 /** Add a node to the page pointed to by the cursor.
4643 * @param[in] mc The cursor for this operation.
4644 * @param[in] indx The index on the page where the new node should be added.
4645 * @param[in] key The key for the new node.
4646 * @param[in] data The data for the new node, if any.
4647 * @param[in] pgno The page number, if adding a branch node.
4648 * @param[in] flags Flags for the node.
4649 * @return 0 on success, non-zero on failure. Possible errors are:
4651 * <li>ENOMEM - failed to allocate overflow pages for the node.
4652 * <li>ENOSPC - there is insufficient room in the page. This error
4653 * should never happen since all callers already calculate the
4654 * page's free space before calling this function.
4658 mdb_node_add(MDB_cursor *mc, indx_t indx,
4659 MDB_val *key, MDB_val *data, pgno_t pgno, unsigned int flags)
4662 size_t node_size = NODESIZE;
4665 MDB_page *mp = mc->mc_pg[mc->mc_top];
4666 MDB_page *ofp = NULL; /* overflow page */
4669 assert(mp->mp_upper >= mp->mp_lower);
4671 DPRINTF("add to %s %spage %zu index %i, data size %zu key size %zu [%s]",
4672 IS_LEAF(mp) ? "leaf" : "branch",
4673 IS_SUBP(mp) ? "sub-" : "",
4674 mp->mp_pgno, indx, data ? data->mv_size : 0,
4675 key ? key->mv_size : 0, key ? DKEY(key) : NULL);
4678 /* Move higher keys up one slot. */
4679 int ksize = mc->mc_db->md_pad, dif;
4680 char *ptr = LEAF2KEY(mp, indx, ksize);
4681 dif = NUMKEYS(mp) - indx;
4683 memmove(ptr+ksize, ptr, dif*ksize);
4684 /* insert new key */
4685 memcpy(ptr, key->mv_data, ksize);
4687 /* Just using these for counting */
4688 mp->mp_lower += sizeof(indx_t);
4689 mp->mp_upper -= ksize - sizeof(indx_t);
4694 node_size += key->mv_size;
4698 if (F_ISSET(flags, F_BIGDATA)) {
4699 /* Data already on overflow page. */
4700 node_size += sizeof(pgno_t);
4701 } else if (node_size + data->mv_size >= mc->mc_txn->mt_env->me_psize / MDB_MINKEYS) {
4702 int ovpages = OVPAGES(data->mv_size, mc->mc_txn->mt_env->me_psize);
4703 /* Put data on overflow page. */
4704 DPRINTF("data size is %zu, node would be %zu, put data on overflow page",
4705 data->mv_size, node_size+data->mv_size);
4706 node_size += sizeof(pgno_t);
4707 if ((ofp = mdb_page_new(mc, P_OVERFLOW, ovpages)) == NULL)
4709 DPRINTF("allocated overflow page %zu", ofp->mp_pgno);
4712 node_size += data->mv_size;
4715 node_size += node_size & 1;
4717 if (node_size + sizeof(indx_t) > SIZELEFT(mp)) {
4718 DPRINTF("not enough room in page %zu, got %u ptrs",
4719 mp->mp_pgno, NUMKEYS(mp));
4720 DPRINTF("upper - lower = %u - %u = %u", mp->mp_upper, mp->mp_lower,
4721 mp->mp_upper - mp->mp_lower);
4722 DPRINTF("node size = %zu", node_size);
4726 /* Move higher pointers up one slot. */
4727 for (i = NUMKEYS(mp); i > indx; i--)
4728 mp->mp_ptrs[i] = mp->mp_ptrs[i - 1];
4730 /* Adjust free space offsets. */
4731 ofs = mp->mp_upper - node_size;
4732 assert(ofs >= mp->mp_lower + sizeof(indx_t));
4733 mp->mp_ptrs[indx] = ofs;
4735 mp->mp_lower += sizeof(indx_t);
4737 /* Write the node data. */
4738 node = NODEPTR(mp, indx);
4739 node->mn_ksize = (key == NULL) ? 0 : key->mv_size;
4740 node->mn_flags = flags;
4742 SETDSZ(node,data->mv_size);
4747 memcpy(NODEKEY(node), key->mv_data, key->mv_size);
4752 if (F_ISSET(flags, F_BIGDATA))
4753 memcpy(node->mn_data + key->mv_size, data->mv_data,
4755 else if (F_ISSET(flags, MDB_RESERVE))
4756 data->mv_data = node->mn_data + key->mv_size;
4758 memcpy(node->mn_data + key->mv_size, data->mv_data,
4761 memcpy(node->mn_data + key->mv_size, &ofp->mp_pgno,
4763 if (F_ISSET(flags, MDB_RESERVE))
4764 data->mv_data = METADATA(ofp);
4766 memcpy(METADATA(ofp), data->mv_data, data->mv_size);
4773 /** Delete the specified node from a page.
4774 * @param[in] mp The page to operate on.
4775 * @param[in] indx The index of the node to delete.
4776 * @param[in] ksize The size of a node. Only used if the page is
4777 * part of a #MDB_DUPFIXED database.
4780 mdb_node_del(MDB_page *mp, indx_t indx, int ksize)
4783 indx_t i, j, numkeys, ptr;
4790 COPY_PGNO(pgno, mp->mp_pgno);
4791 DPRINTF("delete node %u on %s page %zu", indx,
4792 IS_LEAF(mp) ? "leaf" : "branch", pgno);
4795 assert(indx < NUMKEYS(mp));
4798 int x = NUMKEYS(mp) - 1 - indx;
4799 base = LEAF2KEY(mp, indx, ksize);
4801 memmove(base, base + ksize, x * ksize);
4802 mp->mp_lower -= sizeof(indx_t);
4803 mp->mp_upper += ksize - sizeof(indx_t);
4807 node = NODEPTR(mp, indx);
4808 sz = NODESIZE + node->mn_ksize;
4810 if (F_ISSET(node->mn_flags, F_BIGDATA))
4811 sz += sizeof(pgno_t);
4813 sz += NODEDSZ(node);
4817 ptr = mp->mp_ptrs[indx];
4818 numkeys = NUMKEYS(mp);
4819 for (i = j = 0; i < numkeys; i++) {
4821 mp->mp_ptrs[j] = mp->mp_ptrs[i];
4822 if (mp->mp_ptrs[i] < ptr)
4823 mp->mp_ptrs[j] += sz;
4828 base = (char *)mp + mp->mp_upper;
4829 memmove(base + sz, base, ptr - mp->mp_upper);
4831 mp->mp_lower -= sizeof(indx_t);
4835 /** Compact the main page after deleting a node on a subpage.
4836 * @param[in] mp The main page to operate on.
4837 * @param[in] indx The index of the subpage on the main page.
4840 mdb_node_shrink(MDB_page *mp, indx_t indx)
4847 indx_t i, numkeys, ptr;
4849 node = NODEPTR(mp, indx);
4850 sp = (MDB_page *)NODEDATA(node);
4851 osize = NODEDSZ(node);
4853 delta = sp->mp_upper - sp->mp_lower;
4854 SETDSZ(node, osize - delta);
4855 xp = (MDB_page *)((char *)sp + delta);
4857 /* shift subpage upward */
4859 nsize = NUMKEYS(sp) * sp->mp_pad;
4860 memmove(METADATA(xp), METADATA(sp), nsize);
4863 nsize = osize - sp->mp_upper;
4864 numkeys = NUMKEYS(sp);
4865 for (i=numkeys-1; i>=0; i--)
4866 xp->mp_ptrs[i] = sp->mp_ptrs[i] - delta;
4868 xp->mp_upper = sp->mp_lower;
4869 xp->mp_lower = sp->mp_lower;
4870 xp->mp_flags = sp->mp_flags;
4871 xp->mp_pad = sp->mp_pad;
4872 COPY_PGNO(xp->mp_pgno, mp->mp_pgno);
4874 /* shift lower nodes upward */
4875 ptr = mp->mp_ptrs[indx];
4876 numkeys = NUMKEYS(mp);
4877 for (i = 0; i < numkeys; i++) {
4878 if (mp->mp_ptrs[i] <= ptr)
4879 mp->mp_ptrs[i] += delta;
4882 base = (char *)mp + mp->mp_upper;
4883 memmove(base + delta, base, ptr - mp->mp_upper + NODESIZE + NODEKSZ(node));
4884 mp->mp_upper += delta;
4887 /** Initial setup of a sorted-dups cursor.
4888 * Sorted duplicates are implemented as a sub-database for the given key.
4889 * The duplicate data items are actually keys of the sub-database.
4890 * Operations on the duplicate data items are performed using a sub-cursor
4891 * initialized when the sub-database is first accessed. This function does
4892 * the preliminary setup of the sub-cursor, filling in the fields that
4893 * depend only on the parent DB.
4894 * @param[in] mc The main cursor whose sorted-dups cursor is to be initialized.
4897 mdb_xcursor_init0(MDB_cursor *mc)
4899 MDB_xcursor *mx = mc->mc_xcursor;
4901 mx->mx_cursor.mc_xcursor = NULL;
4902 mx->mx_cursor.mc_txn = mc->mc_txn;
4903 mx->mx_cursor.mc_db = &mx->mx_db;
4904 mx->mx_cursor.mc_dbx = &mx->mx_dbx;
4905 mx->mx_cursor.mc_dbi = mc->mc_dbi+1;
4906 mx->mx_cursor.mc_dbflag = &mx->mx_dbflag;
4907 mx->mx_cursor.mc_snum = 0;
4908 mx->mx_cursor.mc_top = 0;
4909 mx->mx_cursor.mc_flags = C_SUB;
4910 mx->mx_dbx.md_cmp = mc->mc_dbx->md_dcmp;
4911 mx->mx_dbx.md_dcmp = NULL;
4912 mx->mx_dbx.md_rel = mc->mc_dbx->md_rel;
4915 /** Final setup of a sorted-dups cursor.
4916 * Sets up the fields that depend on the data from the main cursor.
4917 * @param[in] mc The main cursor whose sorted-dups cursor is to be initialized.
4918 * @param[in] node The data containing the #MDB_db record for the
4919 * sorted-dup database.
4922 mdb_xcursor_init1(MDB_cursor *mc, MDB_node *node)
4924 MDB_xcursor *mx = mc->mc_xcursor;
4926 if (node->mn_flags & F_SUBDATA) {
4927 memcpy(&mx->mx_db, NODEDATA(node), sizeof(MDB_db));
4928 mx->mx_cursor.mc_snum = 0;
4929 mx->mx_cursor.mc_flags = C_SUB;
4931 MDB_page *fp = NODEDATA(node);
4932 mx->mx_db.md_pad = mc->mc_pg[mc->mc_top]->mp_pad;
4933 mx->mx_db.md_flags = 0;
4934 mx->mx_db.md_depth = 1;
4935 mx->mx_db.md_branch_pages = 0;
4936 mx->mx_db.md_leaf_pages = 1;
4937 mx->mx_db.md_overflow_pages = 0;
4938 mx->mx_db.md_entries = NUMKEYS(fp);
4939 COPY_PGNO(mx->mx_db.md_root, fp->mp_pgno);
4940 mx->mx_cursor.mc_snum = 1;
4941 mx->mx_cursor.mc_flags = C_INITIALIZED|C_SUB;
4942 mx->mx_cursor.mc_top = 0;
4943 mx->mx_cursor.mc_pg[0] = fp;
4944 mx->mx_cursor.mc_ki[0] = 0;
4945 if (mc->mc_db->md_flags & MDB_DUPFIXED) {
4946 mx->mx_db.md_flags = MDB_DUPFIXED;
4947 mx->mx_db.md_pad = fp->mp_pad;
4948 if (mc->mc_db->md_flags & MDB_INTEGERDUP)
4949 mx->mx_db.md_flags |= MDB_INTEGERKEY;
4952 DPRINTF("Sub-db %u for db %u root page %zu", mx->mx_cursor.mc_dbi, mc->mc_dbi,
4954 mx->mx_dbflag = (F_ISSET(mc->mc_pg[mc->mc_top]->mp_flags, P_DIRTY)) ?
4956 mx->mx_dbx.md_name.mv_data = NODEKEY(node);
4957 mx->mx_dbx.md_name.mv_size = node->mn_ksize;
4958 #if UINT_MAX < SIZE_MAX
4959 if (mx->mx_dbx.md_cmp == mdb_cmp_int && mx->mx_db.md_pad == sizeof(size_t))
4960 #ifdef MISALIGNED_OK
4961 mx->mx_dbx.md_cmp = mdb_cmp_long;
4963 mx->mx_dbx.md_cmp = mdb_cmp_cint;
4968 /** Initialize a cursor for a given transaction and database. */
4970 mdb_cursor_init(MDB_cursor *mc, MDB_txn *txn, MDB_dbi dbi, MDB_xcursor *mx)
4975 mc->mc_db = &txn->mt_dbs[dbi];
4976 mc->mc_dbx = &txn->mt_dbxs[dbi];
4977 mc->mc_dbflag = &txn->mt_dbflags[dbi];
4981 if (txn->mt_dbs[dbi].md_flags & MDB_DUPSORT) {
4983 mc->mc_xcursor = mx;
4984 mdb_xcursor_init0(mc);
4986 mc->mc_xcursor = NULL;
4991 mdb_cursor_open(MDB_txn *txn, MDB_dbi dbi, MDB_cursor **ret)
4994 MDB_xcursor *mx = NULL;
4995 size_t size = sizeof(MDB_cursor);
4997 if (txn == NULL || ret == NULL || dbi >= txn->mt_numdbs)
5000 /* Allow read access to the freelist */
5001 if (!dbi && !F_ISSET(txn->mt_flags, MDB_TXN_RDONLY))
5004 if (txn->mt_dbs[dbi].md_flags & MDB_DUPSORT)
5005 size += sizeof(MDB_xcursor);
5007 if ((mc = malloc(size)) != NULL) {
5008 if (txn->mt_dbs[dbi].md_flags & MDB_DUPSORT) {
5009 mx = (MDB_xcursor *)(mc + 1);
5011 mdb_cursor_init(mc, txn, dbi, mx);
5012 if (txn->mt_cursors) {
5013 mc->mc_next = txn->mt_cursors[dbi];
5014 txn->mt_cursors[dbi] = mc;
5016 mc->mc_flags |= C_ALLOCD;
5026 /* Return the count of duplicate data items for the current key */
5028 mdb_cursor_count(MDB_cursor *mc, size_t *countp)
5032 if (mc == NULL || countp == NULL)
5035 if (!(mc->mc_db->md_flags & MDB_DUPSORT))
5038 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
5039 if (!F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5042 if (!(mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED))
5045 *countp = mc->mc_xcursor->mx_db.md_entries;
5051 mdb_cursor_close(MDB_cursor *mc)
5054 /* remove from txn, if tracked */
5055 if (mc->mc_txn->mt_cursors) {
5056 MDB_cursor **prev = &mc->mc_txn->mt_cursors[mc->mc_dbi];
5057 while (*prev && *prev != mc) prev = &(*prev)->mc_next;
5059 *prev = mc->mc_next;
5061 if (mc->mc_flags & C_ALLOCD)
5067 mdb_cursor_txn(MDB_cursor *mc)
5069 if (!mc) return NULL;
5074 mdb_cursor_dbi(MDB_cursor *mc)
5080 /** Replace the key for a node with a new key.
5081 * @param[in] mp The page containing the node to operate on.
5082 * @param[in] indx The index of the node to operate on.
5083 * @param[in] key The new key to use.
5084 * @return 0 on success, non-zero on failure.
5087 mdb_update_key(MDB_page *mp, indx_t indx, MDB_val *key)
5093 indx_t ptr, i, numkeys;
5096 node = NODEPTR(mp, indx);
5097 ptr = mp->mp_ptrs[indx];
5101 char kbuf2[(MAXKEYSIZE*2+1)];
5102 k2.mv_data = NODEKEY(node);
5103 k2.mv_size = node->mn_ksize;
5104 DPRINTF("update key %u (ofs %u) [%s] to [%s] on page %zu",
5106 mdb_dkey(&k2, kbuf2),
5112 delta0 = delta = key->mv_size - node->mn_ksize;
5114 /* Must be 2-byte aligned. If new key is
5115 * shorter by 1, the shift will be skipped.
5117 delta += (delta & 1);
5119 if (delta > 0 && SIZELEFT(mp) < delta) {
5120 DPRINTF("OUCH! Not enough room, delta = %d", delta);
5124 numkeys = NUMKEYS(mp);
5125 for (i = 0; i < numkeys; i++) {
5126 if (mp->mp_ptrs[i] <= ptr)
5127 mp->mp_ptrs[i] -= delta;
5130 base = (char *)mp + mp->mp_upper;
5131 len = ptr - mp->mp_upper + NODESIZE;
5132 memmove(base - delta, base, len);
5133 mp->mp_upper -= delta;
5135 node = NODEPTR(mp, indx);
5138 /* But even if no shift was needed, update ksize */
5140 node->mn_ksize = key->mv_size;
5143 memcpy(NODEKEY(node), key->mv_data, key->mv_size);
5148 /** Move a node from csrc to cdst.
5151 mdb_node_move(MDB_cursor *csrc, MDB_cursor *cdst)
5157 unsigned short flags;
5161 /* Mark src and dst as dirty. */
5162 if ((rc = mdb_page_touch(csrc)) ||
5163 (rc = mdb_page_touch(cdst)))
5166 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
5167 srcnode = NODEPTR(csrc->mc_pg[csrc->mc_top], 0); /* fake */
5168 key.mv_size = csrc->mc_db->md_pad;
5169 key.mv_data = LEAF2KEY(csrc->mc_pg[csrc->mc_top], csrc->mc_ki[csrc->mc_top], key.mv_size);
5171 data.mv_data = NULL;
5175 srcnode = NODEPTR(csrc->mc_pg[csrc->mc_top], csrc->mc_ki[csrc->mc_top]);
5176 assert(!((long)srcnode&1));
5177 srcpg = NODEPGNO(srcnode);
5178 flags = srcnode->mn_flags;
5179 if (csrc->mc_ki[csrc->mc_top] == 0 && IS_BRANCH(csrc->mc_pg[csrc->mc_top])) {
5180 unsigned int snum = csrc->mc_snum;
5182 /* must find the lowest key below src */
5183 mdb_page_search_root(csrc, NULL, 0);
5184 s2 = NODEPTR(csrc->mc_pg[csrc->mc_top], 0);
5185 key.mv_size = NODEKSZ(s2);
5186 key.mv_data = NODEKEY(s2);
5187 csrc->mc_snum = snum--;
5188 csrc->mc_top = snum;
5190 key.mv_size = NODEKSZ(srcnode);
5191 key.mv_data = NODEKEY(srcnode);
5193 data.mv_size = NODEDSZ(srcnode);
5194 data.mv_data = NODEDATA(srcnode);
5196 if (IS_BRANCH(cdst->mc_pg[cdst->mc_top]) && cdst->mc_ki[cdst->mc_top] == 0) {
5197 unsigned int snum = cdst->mc_snum;
5200 /* must find the lowest key below dst */
5201 mdb_page_search_root(cdst, NULL, 0);
5202 s2 = NODEPTR(cdst->mc_pg[cdst->mc_top], 0);
5203 bkey.mv_size = NODEKSZ(s2);
5204 bkey.mv_data = NODEKEY(s2);
5205 cdst->mc_snum = snum--;
5206 cdst->mc_top = snum;
5207 rc = mdb_update_key(cdst->mc_pg[cdst->mc_top], 0, &bkey);
5210 DPRINTF("moving %s node %u [%s] on page %zu to node %u on page %zu",
5211 IS_LEAF(csrc->mc_pg[csrc->mc_top]) ? "leaf" : "branch",
5212 csrc->mc_ki[csrc->mc_top],
5214 csrc->mc_pg[csrc->mc_top]->mp_pgno,
5215 cdst->mc_ki[cdst->mc_top], cdst->mc_pg[cdst->mc_top]->mp_pgno);
5217 /* Add the node to the destination page.
5219 rc = mdb_node_add(cdst, cdst->mc_ki[cdst->mc_top], &key, &data, srcpg, flags);
5220 if (rc != MDB_SUCCESS)
5223 /* Delete the node from the source page.
5225 mdb_node_del(csrc->mc_pg[csrc->mc_top], csrc->mc_ki[csrc->mc_top], key.mv_size);
5228 /* Adjust other cursors pointing to mp */
5229 MDB_cursor *m2, *m3;
5230 MDB_dbi dbi = csrc->mc_dbi;
5231 MDB_page *mp = csrc->mc_pg[csrc->mc_top];
5233 if (csrc->mc_flags & C_SUB)
5236 for (m2 = csrc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
5237 if (m2 == csrc) continue;
5238 if (csrc->mc_flags & C_SUB)
5239 m3 = &m2->mc_xcursor->mx_cursor;
5242 if (m3->mc_pg[csrc->mc_top] == mp && m3->mc_ki[csrc->mc_top] ==
5243 csrc->mc_ki[csrc->mc_top]) {
5244 m3->mc_pg[csrc->mc_top] = cdst->mc_pg[cdst->mc_top];
5245 m3->mc_ki[csrc->mc_top] = cdst->mc_ki[cdst->mc_top];
5250 /* Update the parent separators.
5252 if (csrc->mc_ki[csrc->mc_top] == 0) {
5253 if (csrc->mc_ki[csrc->mc_top-1] != 0) {
5254 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
5255 key.mv_data = LEAF2KEY(csrc->mc_pg[csrc->mc_top], 0, key.mv_size);
5257 srcnode = NODEPTR(csrc->mc_pg[csrc->mc_top], 0);
5258 key.mv_size = NODEKSZ(srcnode);
5259 key.mv_data = NODEKEY(srcnode);
5261 DPRINTF("update separator for source page %zu to [%s]",
5262 csrc->mc_pg[csrc->mc_top]->mp_pgno, DKEY(&key));
5263 if ((rc = mdb_update_key(csrc->mc_pg[csrc->mc_top-1], csrc->mc_ki[csrc->mc_top-1],
5264 &key)) != MDB_SUCCESS)
5267 if (IS_BRANCH(csrc->mc_pg[csrc->mc_top])) {
5269 nullkey.mv_size = 0;
5270 rc = mdb_update_key(csrc->mc_pg[csrc->mc_top], 0, &nullkey);
5271 assert(rc == MDB_SUCCESS);
5275 if (cdst->mc_ki[cdst->mc_top] == 0) {
5276 if (cdst->mc_ki[cdst->mc_top-1] != 0) {
5277 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
5278 key.mv_data = LEAF2KEY(cdst->mc_pg[cdst->mc_top], 0, key.mv_size);
5280 srcnode = NODEPTR(cdst->mc_pg[cdst->mc_top], 0);
5281 key.mv_size = NODEKSZ(srcnode);
5282 key.mv_data = NODEKEY(srcnode);
5284 DPRINTF("update separator for destination page %zu to [%s]",
5285 cdst->mc_pg[cdst->mc_top]->mp_pgno, DKEY(&key));
5286 if ((rc = mdb_update_key(cdst->mc_pg[cdst->mc_top-1], cdst->mc_ki[cdst->mc_top-1],
5287 &key)) != MDB_SUCCESS)
5290 if (IS_BRANCH(cdst->mc_pg[cdst->mc_top])) {
5292 nullkey.mv_size = 0;
5293 rc = mdb_update_key(cdst->mc_pg[cdst->mc_top], 0, &nullkey);
5294 assert(rc == MDB_SUCCESS);
5301 /** Merge one page into another.
5302 * The nodes from the page pointed to by \b csrc will
5303 * be copied to the page pointed to by \b cdst and then
5304 * the \b csrc page will be freed.
5305 * @param[in] csrc Cursor pointing to the source page.
5306 * @param[in] cdst Cursor pointing to the destination page.
5309 mdb_page_merge(MDB_cursor *csrc, MDB_cursor *cdst)
5317 DPRINTF("merging page %zu into %zu", csrc->mc_pg[csrc->mc_top]->mp_pgno,
5318 cdst->mc_pg[cdst->mc_top]->mp_pgno);
5320 assert(csrc->mc_snum > 1); /* can't merge root page */
5321 assert(cdst->mc_snum > 1);
5323 /* Mark dst as dirty. */
5324 if ((rc = mdb_page_touch(cdst)))
5327 /* Move all nodes from src to dst.
5329 j = nkeys = NUMKEYS(cdst->mc_pg[cdst->mc_top]);
5330 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
5331 key.mv_size = csrc->mc_db->md_pad;
5332 key.mv_data = METADATA(csrc->mc_pg[csrc->mc_top]);
5333 for (i = 0; i < NUMKEYS(csrc->mc_pg[csrc->mc_top]); i++, j++) {
5334 rc = mdb_node_add(cdst, j, &key, NULL, 0, 0);
5335 if (rc != MDB_SUCCESS)
5337 key.mv_data = (char *)key.mv_data + key.mv_size;
5340 for (i = 0; i < NUMKEYS(csrc->mc_pg[csrc->mc_top]); i++, j++) {
5341 srcnode = NODEPTR(csrc->mc_pg[csrc->mc_top], i);
5342 if (i == 0 && IS_BRANCH(csrc->mc_pg[csrc->mc_top])) {
5343 unsigned int snum = csrc->mc_snum;
5345 /* must find the lowest key below src */
5346 mdb_page_search_root(csrc, NULL, 0);
5347 s2 = NODEPTR(csrc->mc_pg[csrc->mc_top], 0);
5348 key.mv_size = NODEKSZ(s2);
5349 key.mv_data = NODEKEY(s2);
5350 csrc->mc_snum = snum--;
5351 csrc->mc_top = snum;
5353 key.mv_size = srcnode->mn_ksize;
5354 key.mv_data = NODEKEY(srcnode);
5357 data.mv_size = NODEDSZ(srcnode);
5358 data.mv_data = NODEDATA(srcnode);
5359 rc = mdb_node_add(cdst, j, &key, &data, NODEPGNO(srcnode), srcnode->mn_flags);
5360 if (rc != MDB_SUCCESS)
5365 DPRINTF("dst page %zu now has %u keys (%.1f%% filled)",
5366 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);
5368 /* Unlink the src page from parent and add to free list.
5370 mdb_node_del(csrc->mc_pg[csrc->mc_top-1], csrc->mc_ki[csrc->mc_top-1], 0);
5371 if (csrc->mc_ki[csrc->mc_top-1] == 0) {
5373 if ((rc = mdb_update_key(csrc->mc_pg[csrc->mc_top-1], 0, &key)) != MDB_SUCCESS)
5377 mdb_midl_append(&csrc->mc_txn->mt_free_pgs, csrc->mc_pg[csrc->mc_top]->mp_pgno);
5378 if (IS_LEAF(csrc->mc_pg[csrc->mc_top]))
5379 csrc->mc_db->md_leaf_pages--;
5381 csrc->mc_db->md_branch_pages--;
5383 /* Adjust other cursors pointing to mp */
5384 MDB_cursor *m2, *m3;
5385 MDB_dbi dbi = csrc->mc_dbi;
5386 MDB_page *mp = cdst->mc_pg[cdst->mc_top];
5388 if (csrc->mc_flags & C_SUB)
5391 for (m2 = csrc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
5392 if (csrc->mc_flags & C_SUB)
5393 m3 = &m2->mc_xcursor->mx_cursor;
5396 if (m3 == csrc) continue;
5397 if (m3->mc_snum < csrc->mc_snum) continue;
5398 if (m3->mc_pg[csrc->mc_top] == csrc->mc_pg[csrc->mc_top]) {
5399 m3->mc_pg[csrc->mc_top] = mp;
5400 m3->mc_ki[csrc->mc_top] += nkeys;
5404 mdb_cursor_pop(csrc);
5406 return mdb_rebalance(csrc);
5409 /** Copy the contents of a cursor.
5410 * @param[in] csrc The cursor to copy from.
5411 * @param[out] cdst The cursor to copy to.
5414 mdb_cursor_copy(const MDB_cursor *csrc, MDB_cursor *cdst)
5418 cdst->mc_txn = csrc->mc_txn;
5419 cdst->mc_dbi = csrc->mc_dbi;
5420 cdst->mc_db = csrc->mc_db;
5421 cdst->mc_dbx = csrc->mc_dbx;
5422 cdst->mc_snum = csrc->mc_snum;
5423 cdst->mc_top = csrc->mc_top;
5424 cdst->mc_flags = csrc->mc_flags;
5426 for (i=0; i<csrc->mc_snum; i++) {
5427 cdst->mc_pg[i] = csrc->mc_pg[i];
5428 cdst->mc_ki[i] = csrc->mc_ki[i];
5432 /** Rebalance the tree after a delete operation.
5433 * @param[in] mc Cursor pointing to the page where rebalancing
5435 * @return 0 on success, non-zero on failure.
5438 mdb_rebalance(MDB_cursor *mc)
5448 COPY_PGNO(pgno, mc->mc_pg[mc->mc_top]->mp_pgno);
5449 DPRINTF("rebalancing %s page %zu (has %u keys, %.1f%% full)",
5450 IS_LEAF(mc->mc_pg[mc->mc_top]) ? "leaf" : "branch",
5451 pgno, NUMKEYS(mc->mc_pg[mc->mc_top]), (float)PAGEFILL(mc->mc_txn->mt_env, mc->mc_pg[mc->mc_top]) / 10);
5455 if (PAGEFILL(mc->mc_txn->mt_env, mc->mc_pg[mc->mc_top]) >= FILL_THRESHOLD) {
5458 COPY_PGNO(pgno, mc->mc_pg[mc->mc_top]->mp_pgno);
5459 DPRINTF("no need to rebalance page %zu, above fill threshold",
5465 if (mc->mc_snum < 2) {
5466 MDB_page *mp = mc->mc_pg[0];
5467 if (NUMKEYS(mp) == 0) {
5468 DPUTS("tree is completely empty");
5469 mc->mc_db->md_root = P_INVALID;
5470 mc->mc_db->md_depth = 0;
5471 mc->mc_db->md_leaf_pages = 0;
5472 mdb_midl_append(&mc->mc_txn->mt_free_pgs, mp->mp_pgno);
5476 /* Adjust other cursors pointing to mp */
5477 MDB_cursor *m2, *m3;
5478 MDB_dbi dbi = mc->mc_dbi;
5480 if (mc->mc_flags & C_SUB)
5483 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
5484 if (m2 == mc) continue;
5485 if (mc->mc_flags & C_SUB)
5486 m3 = &m2->mc_xcursor->mx_cursor;
5489 if (m3->mc_snum < mc->mc_snum) continue;
5490 if (m3->mc_pg[0] == mp) {
5496 } else if (IS_BRANCH(mp) && NUMKEYS(mp) == 1) {
5497 DPUTS("collapsing root page!");
5498 mdb_midl_append(&mc->mc_txn->mt_free_pgs, mp->mp_pgno);
5499 mc->mc_db->md_root = NODEPGNO(NODEPTR(mp, 0));
5500 if ((rc = mdb_page_get(mc->mc_txn, mc->mc_db->md_root,
5503 mc->mc_db->md_depth--;
5504 mc->mc_db->md_branch_pages--;
5506 /* Adjust other cursors pointing to mp */
5507 MDB_cursor *m2, *m3;
5508 MDB_dbi dbi = mc->mc_dbi;
5510 if (mc->mc_flags & C_SUB)
5513 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
5514 if (m2 == mc) continue;
5515 if (mc->mc_flags & C_SUB)
5516 m3 = &m2->mc_xcursor->mx_cursor;
5519 if (m3->mc_snum < mc->mc_snum) continue;
5520 if (m3->mc_pg[0] == mp) {
5521 m3->mc_pg[0] = mc->mc_pg[0];
5526 DPUTS("root page doesn't need rebalancing");
5530 /* The parent (branch page) must have at least 2 pointers,
5531 * otherwise the tree is invalid.
5533 ptop = mc->mc_top-1;
5534 assert(NUMKEYS(mc->mc_pg[ptop]) > 1);
5536 /* Leaf page fill factor is below the threshold.
5537 * Try to move keys from left or right neighbor, or
5538 * merge with a neighbor page.
5543 mdb_cursor_copy(mc, &mn);
5544 mn.mc_xcursor = NULL;
5546 if (mc->mc_ki[ptop] == 0) {
5547 /* We're the leftmost leaf in our parent.
5549 DPUTS("reading right neighbor");
5551 node = NODEPTR(mc->mc_pg[ptop], mn.mc_ki[ptop]);
5552 if ((rc = mdb_page_get(mc->mc_txn, NODEPGNO(node), &mn.mc_pg[mn.mc_top])))
5554 mn.mc_ki[mn.mc_top] = 0;
5555 mc->mc_ki[mc->mc_top] = NUMKEYS(mc->mc_pg[mc->mc_top]);
5557 /* There is at least one neighbor to the left.
5559 DPUTS("reading left neighbor");
5561 node = NODEPTR(mc->mc_pg[ptop], mn.mc_ki[ptop]);
5562 if ((rc = mdb_page_get(mc->mc_txn, NODEPGNO(node), &mn.mc_pg[mn.mc_top])))
5564 mn.mc_ki[mn.mc_top] = NUMKEYS(mn.mc_pg[mn.mc_top]) - 1;
5565 mc->mc_ki[mc->mc_top] = 0;
5568 DPRINTF("found neighbor page %zu (%u keys, %.1f%% full)",
5569 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);
5571 /* If the neighbor page is above threshold and has at least two
5572 * keys, move one key from it.
5574 * Otherwise we should try to merge them.
5576 if (PAGEFILL(mc->mc_txn->mt_env, mn.mc_pg[mn.mc_top]) >= FILL_THRESHOLD && NUMKEYS(mn.mc_pg[mn.mc_top]) >= 2)
5577 return mdb_node_move(&mn, mc);
5578 else { /* FIXME: if (has_enough_room()) */
5579 mc->mc_flags &= ~C_INITIALIZED;
5580 if (mc->mc_ki[ptop] == 0)
5581 return mdb_page_merge(&mn, mc);
5583 return mdb_page_merge(mc, &mn);
5587 /** Complete a delete operation started by #mdb_cursor_del(). */
5589 mdb_cursor_del0(MDB_cursor *mc, MDB_node *leaf)
5593 /* add overflow pages to free list */
5594 if (!IS_LEAF2(mc->mc_pg[mc->mc_top]) && F_ISSET(leaf->mn_flags, F_BIGDATA)) {
5598 memcpy(&pg, NODEDATA(leaf), sizeof(pg));
5599 ovpages = OVPAGES(NODEDSZ(leaf), mc->mc_txn->mt_env->me_psize);
5600 mc->mc_db->md_overflow_pages -= ovpages;
5601 for (i=0; i<ovpages; i++) {
5602 DPRINTF("freed ov page %zu", pg);
5603 mdb_midl_append(&mc->mc_txn->mt_free_pgs, pg);
5607 mdb_node_del(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], mc->mc_db->md_pad);
5608 mc->mc_db->md_entries--;
5609 rc = mdb_rebalance(mc);
5610 if (rc != MDB_SUCCESS)
5611 mc->mc_txn->mt_flags |= MDB_TXN_ERROR;
5617 mdb_del(MDB_txn *txn, MDB_dbi dbi,
5618 MDB_val *key, MDB_val *data)
5623 MDB_val rdata, *xdata;
5627 assert(key != NULL);
5629 DPRINTF("====> delete db %u key [%s]", dbi, DKEY(key));
5631 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs)
5634 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY)) {
5638 if (key->mv_size == 0 || key->mv_size > MAXKEYSIZE) {
5642 mdb_cursor_init(&mc, txn, dbi, &mx);
5653 rc = mdb_cursor_set(&mc, key, xdata, op, &exact);
5655 rc = mdb_cursor_del(&mc, data ? 0 : MDB_NODUPDATA);
5659 /** Split a page and insert a new node.
5660 * @param[in,out] mc Cursor pointing to the page and desired insertion index.
5661 * The cursor will be updated to point to the actual page and index where
5662 * the node got inserted after the split.
5663 * @param[in] newkey The key for the newly inserted node.
5664 * @param[in] newdata The data for the newly inserted node.
5665 * @param[in] newpgno The page number, if the new node is a branch node.
5666 * @return 0 on success, non-zero on failure.
5669 mdb_page_split(MDB_cursor *mc, MDB_val *newkey, MDB_val *newdata, pgno_t newpgno,
5670 unsigned int nflags)
5673 int rc = MDB_SUCCESS, ins_new = 0, new_root = 0, newpos = 1;
5676 unsigned int i, j, split_indx, nkeys, pmax;
5678 MDB_val sepkey, rkey, xdata, *rdata = &xdata;
5680 MDB_page *mp, *rp, *pp;
5685 mp = mc->mc_pg[mc->mc_top];
5686 newindx = mc->mc_ki[mc->mc_top];
5688 DPRINTF("-----> splitting %s page %zu and adding [%s] at index %i",
5689 IS_LEAF(mp) ? "leaf" : "branch", mp->mp_pgno,
5690 DKEY(newkey), mc->mc_ki[mc->mc_top]);
5692 /* Create a right sibling. */
5693 if ((rp = mdb_page_new(mc, mp->mp_flags, 1)) == NULL)
5695 DPRINTF("new right sibling: page %zu", rp->mp_pgno);
5697 if (mc->mc_snum < 2) {
5698 if ((pp = mdb_page_new(mc, P_BRANCH, 1)) == NULL)
5700 /* shift current top to make room for new parent */
5701 mc->mc_pg[1] = mc->mc_pg[0];
5702 mc->mc_ki[1] = mc->mc_ki[0];
5705 mc->mc_db->md_root = pp->mp_pgno;
5706 DPRINTF("root split! new root = %zu", pp->mp_pgno);
5707 mc->mc_db->md_depth++;
5710 /* Add left (implicit) pointer. */
5711 if ((rc = mdb_node_add(mc, 0, NULL, NULL, mp->mp_pgno, 0)) != MDB_SUCCESS) {
5712 /* undo the pre-push */
5713 mc->mc_pg[0] = mc->mc_pg[1];
5714 mc->mc_ki[0] = mc->mc_ki[1];
5715 mc->mc_db->md_root = mp->mp_pgno;
5716 mc->mc_db->md_depth--;
5723 ptop = mc->mc_top-1;
5724 DPRINTF("parent branch page is %zu", mc->mc_pg[ptop]->mp_pgno);
5727 mdb_cursor_copy(mc, &mn);
5728 mn.mc_pg[mn.mc_top] = rp;
5729 mn.mc_ki[ptop] = mc->mc_ki[ptop]+1;
5731 if (nflags & MDB_APPEND) {
5732 mn.mc_ki[mn.mc_top] = 0;
5739 nkeys = NUMKEYS(mp);
5740 split_indx = (nkeys + 1) / 2;
5745 unsigned int lsize, rsize, ksize;
5746 /* Move half of the keys to the right sibling */
5748 x = mc->mc_ki[mc->mc_top] - split_indx;
5749 ksize = mc->mc_db->md_pad;
5750 split = LEAF2KEY(mp, split_indx, ksize);
5751 rsize = (nkeys - split_indx) * ksize;
5752 lsize = (nkeys - split_indx) * sizeof(indx_t);
5753 mp->mp_lower -= lsize;
5754 rp->mp_lower += lsize;
5755 mp->mp_upper += rsize - lsize;
5756 rp->mp_upper -= rsize - lsize;
5757 sepkey.mv_size = ksize;
5758 if (newindx == split_indx) {
5759 sepkey.mv_data = newkey->mv_data;
5761 sepkey.mv_data = split;
5764 ins = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], ksize);
5765 memcpy(rp->mp_ptrs, split, rsize);
5766 sepkey.mv_data = rp->mp_ptrs;
5767 memmove(ins+ksize, ins, (split_indx - mc->mc_ki[mc->mc_top]) * ksize);
5768 memcpy(ins, newkey->mv_data, ksize);
5769 mp->mp_lower += sizeof(indx_t);
5770 mp->mp_upper -= ksize - sizeof(indx_t);
5773 memcpy(rp->mp_ptrs, split, x * ksize);
5774 ins = LEAF2KEY(rp, x, ksize);
5775 memcpy(ins, newkey->mv_data, ksize);
5776 memcpy(ins+ksize, split + x * ksize, rsize - x * ksize);
5777 rp->mp_lower += sizeof(indx_t);
5778 rp->mp_upper -= ksize - sizeof(indx_t);
5779 mc->mc_ki[mc->mc_top] = x;
5780 mc->mc_pg[mc->mc_top] = rp;
5785 /* For leaf pages, check the split point based on what
5786 * fits where, since otherwise mdb_node_add can fail.
5788 * This check is only needed when the data items are
5789 * relatively large, such that being off by one will
5790 * make the difference between success or failure.
5791 * When the size of the data items is much smaller than
5792 * one-half of a page, this check is irrelevant.
5795 unsigned int psize, nsize;
5796 /* Maximum free space in an empty page */
5797 pmax = mc->mc_txn->mt_env->me_psize - PAGEHDRSZ;
5798 nsize = mdb_leaf_size(mc->mc_txn->mt_env, newkey, newdata);
5799 if ((nkeys < 20) || (nsize > pmax/4)) {
5800 if (newindx <= split_indx) {
5803 for (i=0; i<split_indx; i++) {
5804 node = NODEPTR(mp, i);
5805 psize += NODESIZE + NODEKSZ(node) + sizeof(indx_t);
5806 if (F_ISSET(node->mn_flags, F_BIGDATA))
5807 psize += sizeof(pgno_t);
5809 psize += NODEDSZ(node);
5812 if (i == split_indx - 1 && newindx == split_indx)
5821 for (i=nkeys-1; i>=split_indx; i--) {
5822 node = NODEPTR(mp, i);
5823 psize += NODESIZE + NODEKSZ(node) + sizeof(indx_t);
5824 if (F_ISSET(node->mn_flags, F_BIGDATA))
5825 psize += sizeof(pgno_t);
5827 psize += NODEDSZ(node);
5838 /* First find the separating key between the split pages.
5839 * The case where newindx == split_indx is ambiguous; the
5840 * new item could go to the new page or stay on the original
5841 * page. If newpos == 1 it goes to the new page.
5843 if (newindx == split_indx && newpos) {
5844 sepkey.mv_size = newkey->mv_size;
5845 sepkey.mv_data = newkey->mv_data;
5847 node = NODEPTR(mp, split_indx);
5848 sepkey.mv_size = node->mn_ksize;
5849 sepkey.mv_data = NODEKEY(node);
5853 DPRINTF("separator is [%s]", DKEY(&sepkey));
5855 /* Copy separator key to the parent.
5857 if (SIZELEFT(mn.mc_pg[ptop]) < mdb_branch_size(mc->mc_txn->mt_env, &sepkey)) {
5860 rc = mdb_page_split(&mn, &sepkey, NULL, rp->mp_pgno, 0);
5862 /* Right page might now have changed parent.
5863 * Check if left page also changed parent.
5865 if (mn.mc_pg[ptop] != mc->mc_pg[ptop] &&
5866 mc->mc_ki[ptop] >= NUMKEYS(mc->mc_pg[ptop])) {
5867 mc->mc_pg[ptop] = mn.mc_pg[ptop];
5868 mc->mc_ki[ptop] = mn.mc_ki[ptop] - 1;
5872 rc = mdb_node_add(&mn, mn.mc_ki[ptop], &sepkey, NULL, rp->mp_pgno, 0);
5875 if (rc != MDB_SUCCESS) {
5878 if (nflags & MDB_APPEND) {
5879 mc->mc_pg[mc->mc_top] = rp;
5880 mc->mc_ki[mc->mc_top] = 0;
5881 rc = mdb_node_add(mc, 0, newkey, newdata, newpgno, nflags);
5890 /* Move half of the keys to the right sibling. */
5892 /* grab a page to hold a temporary copy */
5893 copy = mdb_page_malloc(mc);
5897 copy->mp_pgno = mp->mp_pgno;
5898 copy->mp_flags = mp->mp_flags;
5899 copy->mp_lower = PAGEHDRSZ;
5900 copy->mp_upper = mc->mc_txn->mt_env->me_psize;
5901 mc->mc_pg[mc->mc_top] = copy;
5902 for (i = j = 0; i <= nkeys; j++) {
5903 if (i == split_indx) {
5904 /* Insert in right sibling. */
5905 /* Reset insert index for right sibling. */
5906 if (i != newindx || (newpos ^ ins_new)) {
5908 mc->mc_pg[mc->mc_top] = rp;
5912 if (i == newindx && !ins_new) {
5913 /* Insert the original entry that caused the split. */
5914 rkey.mv_data = newkey->mv_data;
5915 rkey.mv_size = newkey->mv_size;
5924 /* Update index for the new key. */
5925 mc->mc_ki[mc->mc_top] = j;
5926 } else if (i == nkeys) {
5929 node = NODEPTR(mp, i);
5930 rkey.mv_data = NODEKEY(node);
5931 rkey.mv_size = node->mn_ksize;
5933 xdata.mv_data = NODEDATA(node);
5934 xdata.mv_size = NODEDSZ(node);
5937 pgno = NODEPGNO(node);
5938 flags = node->mn_flags;
5943 if (!IS_LEAF(mp) && j == 0) {
5944 /* First branch index doesn't need key data. */
5948 rc = mdb_node_add(mc, j, &rkey, rdata, pgno, flags);
5952 nkeys = NUMKEYS(copy);
5953 for (i=0; i<nkeys; i++)
5954 mp->mp_ptrs[i] = copy->mp_ptrs[i];
5955 mp->mp_lower = copy->mp_lower;
5956 mp->mp_upper = copy->mp_upper;
5957 memcpy(NODEPTR(mp, nkeys-1), NODEPTR(copy, nkeys-1),
5958 mc->mc_txn->mt_env->me_psize - copy->mp_upper);
5960 /* reset back to original page */
5961 if (newindx < split_indx || (!newpos && newindx == split_indx)) {
5962 mc->mc_pg[mc->mc_top] = mp;
5963 if (nflags & MDB_RESERVE) {
5964 node = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
5965 if (!(node->mn_flags & F_BIGDATA))
5966 newdata->mv_data = NODEDATA(node);
5970 /* return tmp page to freelist */
5971 copy->mp_next = mc->mc_txn->mt_env->me_dpages;
5972 VGMEMP_FREE(mc->mc_txn->mt_env, copy);
5973 mc->mc_txn->mt_env->me_dpages = copy;
5976 /* Adjust other cursors pointing to mp */
5977 MDB_cursor *m2, *m3;
5978 MDB_dbi dbi = mc->mc_dbi;
5980 if (mc->mc_flags & C_SUB)
5983 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
5984 if (m2 == mc) continue;
5985 if (mc->mc_flags & C_SUB)
5986 m3 = &m2->mc_xcursor->mx_cursor;
5989 if (!(m3->mc_flags & C_INITIALIZED))
5994 for (k=m3->mc_top; k>=0; k--) {
5995 m3->mc_ki[k+1] = m3->mc_ki[k];
5996 m3->mc_pg[k+1] = m3->mc_pg[k];
5998 m3->mc_ki[0] = mc->mc_ki[0];
5999 m3->mc_pg[0] = mc->mc_pg[0];
6003 if (m3->mc_pg[mc->mc_top] == mp) {
6004 if (m3->mc_ki[m3->mc_top] >= split_indx) {
6005 m3->mc_pg[m3->mc_top] = rp;
6006 m3->mc_ki[m3->mc_top] -= split_indx;
6015 mdb_put(MDB_txn *txn, MDB_dbi dbi,
6016 MDB_val *key, MDB_val *data, unsigned int flags)
6021 assert(key != NULL);
6022 assert(data != NULL);
6024 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs)
6027 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY)) {
6031 if (key->mv_size == 0 || key->mv_size > MAXKEYSIZE) {
6035 if ((flags & (MDB_NOOVERWRITE|MDB_NODUPDATA|MDB_RESERVE|MDB_APPEND)) != flags)
6038 mdb_cursor_init(&mc, txn, dbi, &mx);
6039 return mdb_cursor_put(&mc, key, data, flags);
6042 /** Only a subset of the @ref mdb_env flags can be changed
6043 * at runtime. Changing other flags requires closing the environment
6044 * and re-opening it with the new flags.
6046 #define CHANGEABLE (MDB_NOSYNC)
6048 mdb_env_set_flags(MDB_env *env, unsigned int flag, int onoff)
6050 if ((flag & CHANGEABLE) != flag)
6053 env->me_flags |= flag;
6055 env->me_flags &= ~flag;
6060 mdb_env_get_flags(MDB_env *env, unsigned int *arg)
6065 *arg = env->me_flags;
6070 mdb_env_get_path(MDB_env *env, const char **arg)
6075 *arg = env->me_path;
6079 /** Common code for #mdb_stat() and #mdb_env_stat().
6080 * @param[in] env the environment to operate in.
6081 * @param[in] db the #MDB_db record containing the stats to return.
6082 * @param[out] arg the address of an #MDB_stat structure to receive the stats.
6083 * @return 0, this function always succeeds.
6086 mdb_stat0(MDB_env *env, MDB_db *db, MDB_stat *arg)
6088 arg->ms_psize = env->me_psize;
6089 arg->ms_depth = db->md_depth;
6090 arg->ms_branch_pages = db->md_branch_pages;
6091 arg->ms_leaf_pages = db->md_leaf_pages;
6092 arg->ms_overflow_pages = db->md_overflow_pages;
6093 arg->ms_entries = db->md_entries;
6098 mdb_env_stat(MDB_env *env, MDB_stat *arg)
6102 if (env == NULL || arg == NULL)
6105 mdb_env_read_meta(env, &toggle);
6107 return mdb_stat0(env, &env->me_metas[toggle]->mm_dbs[MAIN_DBI], arg);
6110 /** Set the default comparison functions for a database.
6111 * Called immediately after a database is opened to set the defaults.
6112 * The user can then override them with #mdb_set_compare() or
6113 * #mdb_set_dupsort().
6114 * @param[in] txn A transaction handle returned by #mdb_txn_begin()
6115 * @param[in] dbi A database handle returned by #mdb_open()
6118 mdb_default_cmp(MDB_txn *txn, MDB_dbi dbi)
6120 uint16_t f = txn->mt_dbs[dbi].md_flags;
6122 txn->mt_dbxs[dbi].md_cmp =
6123 (f & MDB_REVERSEKEY) ? mdb_cmp_memnr :
6124 (f & MDB_INTEGERKEY) ? mdb_cmp_cint : mdb_cmp_memn;
6126 txn->mt_dbxs[dbi].md_dcmp =
6127 !(f & MDB_DUPSORT) ? 0 :
6128 ((f & MDB_INTEGERDUP)
6129 ? ((f & MDB_DUPFIXED) ? mdb_cmp_int : mdb_cmp_cint)
6130 : ((f & MDB_REVERSEDUP) ? mdb_cmp_memnr : mdb_cmp_memn));
6133 int mdb_open(MDB_txn *txn, const char *name, unsigned int flags, MDB_dbi *dbi)
6138 int rc, dbflag, exact;
6141 if (txn->mt_dbxs[FREE_DBI].md_cmp == NULL) {
6142 mdb_default_cmp(txn, FREE_DBI);
6148 if (flags & (MDB_DUPSORT|MDB_REVERSEKEY|MDB_INTEGERKEY))
6149 txn->mt_dbs[MAIN_DBI].md_flags |= (flags & (MDB_DUPSORT|MDB_REVERSEKEY|MDB_INTEGERKEY));
6150 mdb_default_cmp(txn, MAIN_DBI);
6154 if (txn->mt_dbxs[MAIN_DBI].md_cmp == NULL) {
6155 mdb_default_cmp(txn, MAIN_DBI);
6158 /* Is the DB already open? */
6160 for (i=2; i<txn->mt_numdbs; i++) {
6161 if (len == txn->mt_dbxs[i].md_name.mv_size &&
6162 !strncmp(name, txn->mt_dbxs[i].md_name.mv_data, len)) {
6168 if (txn->mt_numdbs >= txn->mt_env->me_maxdbs - 1)
6171 /* Find the DB info */
6175 key.mv_data = (void *)name;
6176 mdb_cursor_init(&mc, txn, MAIN_DBI, NULL);
6177 rc = mdb_cursor_set(&mc, &key, &data, MDB_SET, &exact);
6178 if (rc == MDB_SUCCESS) {
6179 /* make sure this is actually a DB */
6180 MDB_node *node = NODEPTR(mc.mc_pg[mc.mc_top], mc.mc_ki[mc.mc_top]);
6181 if (!(node->mn_flags & F_SUBDATA))
6183 } else if (rc == MDB_NOTFOUND && (flags & MDB_CREATE)) {
6184 /* Create if requested */
6186 data.mv_size = sizeof(MDB_db);
6187 data.mv_data = &dummy;
6188 memset(&dummy, 0, sizeof(dummy));
6189 dummy.md_root = P_INVALID;
6190 dummy.md_flags = flags & 0xffff;
6191 rc = mdb_cursor_put(&mc, &key, &data, F_SUBDATA);
6195 /* OK, got info, add to table */
6196 if (rc == MDB_SUCCESS) {
6197 txn->mt_dbxs[txn->mt_numdbs].md_name.mv_data = strdup(name);
6198 txn->mt_dbxs[txn->mt_numdbs].md_name.mv_size = len;
6199 txn->mt_dbxs[txn->mt_numdbs].md_rel = NULL;
6200 txn->mt_dbflags[txn->mt_numdbs] = dbflag;
6201 memcpy(&txn->mt_dbs[txn->mt_numdbs], data.mv_data, sizeof(MDB_db));
6202 *dbi = txn->mt_numdbs;
6203 txn->mt_env->me_dbs[0][txn->mt_numdbs] = txn->mt_dbs[txn->mt_numdbs];
6204 txn->mt_env->me_dbs[1][txn->mt_numdbs] = txn->mt_dbs[txn->mt_numdbs];
6205 mdb_default_cmp(txn, txn->mt_numdbs);
6212 int mdb_stat(MDB_txn *txn, MDB_dbi dbi, MDB_stat *arg)
6214 if (txn == NULL || arg == NULL || dbi >= txn->mt_numdbs)
6217 return mdb_stat0(txn->mt_env, &txn->mt_dbs[dbi], arg);
6220 void mdb_close(MDB_env *env, MDB_dbi dbi)
6223 if (dbi <= MAIN_DBI || dbi >= env->me_numdbs)
6225 ptr = env->me_dbxs[dbi].md_name.mv_data;
6226 env->me_dbxs[dbi].md_name.mv_data = NULL;
6227 env->me_dbxs[dbi].md_name.mv_size = 0;
6231 /** Add all the DB's pages to the free list.
6232 * @param[in] mc Cursor on the DB to free.
6233 * @param[in] subs non-Zero to check for sub-DBs in this DB.
6234 * @return 0 on success, non-zero on failure.
6237 mdb_drop0(MDB_cursor *mc, int subs)
6241 rc = mdb_page_search(mc, NULL, 0);
6242 if (rc == MDB_SUCCESS) {
6247 /* LEAF2 pages have no nodes, cannot have sub-DBs */
6248 if (!subs || IS_LEAF2(mc->mc_pg[mc->mc_top]))
6251 mdb_cursor_copy(mc, &mx);
6252 while (mc->mc_snum > 0) {
6253 if (IS_LEAF(mc->mc_pg[mc->mc_top])) {
6254 for (i=0; i<NUMKEYS(mc->mc_pg[mc->mc_top]); i++) {
6255 ni = NODEPTR(mc->mc_pg[mc->mc_top], i);
6256 if (ni->mn_flags & F_SUBDATA) {
6257 mdb_xcursor_init1(mc, ni);
6258 rc = mdb_drop0(&mc->mc_xcursor->mx_cursor, 0);
6264 for (i=0; i<NUMKEYS(mc->mc_pg[mc->mc_top]); i++) {
6266 ni = NODEPTR(mc->mc_pg[mc->mc_top], i);
6269 mdb_midl_append(&mc->mc_txn->mt_free_pgs, pg);
6274 rc = mdb_cursor_sibling(mc, 1);
6276 /* no more siblings, go back to beginning
6277 * of previous level. (stack was already popped
6278 * by mdb_cursor_sibling)
6280 for (i=1; i<mc->mc_top; i++)
6281 mc->mc_pg[i] = mx.mc_pg[i];
6285 mdb_midl_append(&mc->mc_txn->mt_free_pgs,
6286 mc->mc_db->md_root);
6291 int mdb_drop(MDB_txn *txn, MDB_dbi dbi, int del)
6296 if (!txn || !dbi || dbi >= txn->mt_numdbs)
6299 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY))
6302 rc = mdb_cursor_open(txn, dbi, &mc);
6306 rc = mdb_drop0(mc, mc->mc_db->md_flags & MDB_DUPSORT);
6310 /* Can't delete the main DB */
6311 if (del && dbi > MAIN_DBI) {
6312 rc = mdb_del(txn, MAIN_DBI, &mc->mc_dbx->md_name, NULL);
6314 mdb_close(txn->mt_env, dbi);
6316 txn->mt_dbflags[dbi] |= DB_DIRTY;
6317 txn->mt_dbs[dbi].md_depth = 0;
6318 txn->mt_dbs[dbi].md_branch_pages = 0;
6319 txn->mt_dbs[dbi].md_leaf_pages = 0;
6320 txn->mt_dbs[dbi].md_overflow_pages = 0;
6321 txn->mt_dbs[dbi].md_entries = 0;
6322 txn->mt_dbs[dbi].md_root = P_INVALID;
6325 mdb_cursor_close(mc);
6329 int mdb_set_compare(MDB_txn *txn, MDB_dbi dbi, MDB_cmp_func *cmp)
6331 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs)
6334 txn->mt_dbxs[dbi].md_cmp = cmp;
6338 int mdb_set_dupsort(MDB_txn *txn, MDB_dbi dbi, MDB_cmp_func *cmp)
6340 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs)
6343 txn->mt_dbxs[dbi].md_dcmp = cmp;
6347 int mdb_set_relfunc(MDB_txn *txn, MDB_dbi dbi, MDB_rel_func *rel)
6349 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs)
6352 txn->mt_dbxs[dbi].md_rel = rel;
6356 int mdb_set_relctx(MDB_txn *txn, MDB_dbi dbi, void *ctx)
6358 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs)
6361 txn->mt_dbxs[dbi].md_relctx = ctx;
projects / openldap / blob