mirror of
https://git.openldap.org/openldap/openldap.git
synced 2025-12-21 07:09:34 -05:00
Merge remote-tracking branch 'origin/mdb.RE/0.9'
This commit is contained in:
commit
cf81bfb2e4
23 changed files with 146 additions and 135 deletions
|
|
@ -1,5 +1,10 @@
|
||||||
LMDB 0.9 Change Log
|
LMDB 0.9 Change Log
|
||||||
|
|
||||||
|
LMDB 0.9.28 Engineering
|
||||||
|
|
||||||
|
LMDB 0.9.27 Release (2020/10/26)
|
||||||
|
ITS#9376 fix repeated DUPSORT cursor deletes
|
||||||
|
|
||||||
LMDB 0.9.26 Release (2020/08/11)
|
LMDB 0.9.26 Release (2020/08/11)
|
||||||
ITS#9278 fix robust mutex cleanup for FreeBSD
|
ITS#9278 fix robust mutex cleanup for FreeBSD
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -1,4 +1,4 @@
|
||||||
Copyright 2011-2020 Howard Chu, Symas Corp.
|
Copyright 2011-2021 Howard Chu, Symas Corp.
|
||||||
All rights reserved.
|
All rights reserved.
|
||||||
|
|
||||||
Redistribution and use in source and binary forms, with or without
|
Redistribution and use in source and binary forms, with or without
|
||||||
|
|
|
||||||
|
|
@ -1,5 +1,5 @@
|
||||||
/*
|
/*
|
||||||
* Copyright 2015-2020 Howard Chu, Symas Corp.
|
* Copyright 2015-2021 Howard Chu, Symas Corp.
|
||||||
* All rights reserved.
|
* All rights reserved.
|
||||||
*
|
*
|
||||||
* Redistribution and use in source and binary forms, with or without
|
* Redistribution and use in source and binary forms, with or without
|
||||||
|
|
|
||||||
|
|
@ -135,7 +135,7 @@
|
||||||
*
|
*
|
||||||
* @author Howard Chu, Symas Corporation.
|
* @author Howard Chu, Symas Corporation.
|
||||||
*
|
*
|
||||||
* @copyright Copyright 2011-2020 Howard Chu, Symas Corp. All rights reserved.
|
* @copyright Copyright 2011-2021 Howard Chu, Symas Corp. All rights reserved.
|
||||||
*
|
*
|
||||||
* Redistribution and use in source and binary forms, with or without
|
* Redistribution and use in source and binary forms, with or without
|
||||||
* modification, are permitted only as authorized by the OpenLDAP
|
* modification, are permitted only as authorized by the OpenLDAP
|
||||||
|
|
@ -200,7 +200,7 @@ typedef int mdb_filehandle_t;
|
||||||
/** Library minor version */
|
/** Library minor version */
|
||||||
#define MDB_VERSION_MINOR 9
|
#define MDB_VERSION_MINOR 9
|
||||||
/** Library patch version */
|
/** Library patch version */
|
||||||
#define MDB_VERSION_PATCH 26
|
#define MDB_VERSION_PATCH 27
|
||||||
|
|
||||||
/** Combine args a,b,c into a single integer for easy version comparisons */
|
/** Combine args a,b,c into a single integer for easy version comparisons */
|
||||||
#define MDB_VERINT(a,b,c) (((a) << 24) | ((b) << 16) | (c))
|
#define MDB_VERINT(a,b,c) (((a) << 24) | ((b) << 16) | (c))
|
||||||
|
|
@ -210,7 +210,7 @@ typedef int mdb_filehandle_t;
|
||||||
MDB_VERINT(MDB_VERSION_MAJOR,MDB_VERSION_MINOR,MDB_VERSION_PATCH)
|
MDB_VERINT(MDB_VERSION_MAJOR,MDB_VERSION_MINOR,MDB_VERSION_PATCH)
|
||||||
|
|
||||||
/** The release date of this library version */
|
/** The release date of this library version */
|
||||||
#define MDB_VERSION_DATE "August 11, 2020"
|
#define MDB_VERSION_DATE "October 26, 2020"
|
||||||
|
|
||||||
/** A stringifier for the version info */
|
/** A stringifier for the version info */
|
||||||
#define MDB_VERSTR(a,b,c,d) "LMDB " #a "." #b "." #c ": (" d ")"
|
#define MDB_VERSTR(a,b,c,d) "LMDB " #a "." #b "." #c ": (" d ")"
|
||||||
|
|
|
||||||
|
|
@ -5,7 +5,7 @@
|
||||||
* BerkeleyDB API, but much simplified.
|
* BerkeleyDB API, but much simplified.
|
||||||
*/
|
*/
|
||||||
/*
|
/*
|
||||||
* Copyright 2011-2020 Howard Chu, Symas Corp.
|
* Copyright 2011-2021 Howard Chu, Symas Corp.
|
||||||
* All rights reserved.
|
* All rights reserved.
|
||||||
*
|
*
|
||||||
* Redistribution and use in source and binary forms, with or without
|
* Redistribution and use in source and binary forms, with or without
|
||||||
|
|
@ -5942,16 +5942,12 @@ skip:
|
||||||
|
|
||||||
if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
|
if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
|
||||||
mdb_xcursor_init1(mc, leaf);
|
mdb_xcursor_init1(mc, leaf);
|
||||||
}
|
|
||||||
if (data) {
|
|
||||||
if ((rc = mdb_node_read(mc, leaf, data)) != MDB_SUCCESS)
|
|
||||||
return rc;
|
|
||||||
|
|
||||||
if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
|
|
||||||
rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
|
rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
|
||||||
if (rc != MDB_SUCCESS)
|
if (rc != MDB_SUCCESS)
|
||||||
return rc;
|
return rc;
|
||||||
}
|
} else if (data) {
|
||||||
|
if ((rc = mdb_node_read(mc, leaf, data)) != MDB_SUCCESS)
|
||||||
|
return rc;
|
||||||
}
|
}
|
||||||
|
|
||||||
MDB_GET_KEY(leaf, key);
|
MDB_GET_KEY(leaf, key);
|
||||||
|
|
@ -5975,7 +5971,8 @@ mdb_cursor_prev(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op)
|
||||||
|
|
||||||
mp = mc->mc_pg[mc->mc_top];
|
mp = mc->mc_pg[mc->mc_top];
|
||||||
|
|
||||||
if (mc->mc_db->md_flags & MDB_DUPSORT) {
|
if ((mc->mc_db->md_flags & MDB_DUPSORT) &&
|
||||||
|
mc->mc_ki[mc->mc_top] < NUMKEYS(mp)) {
|
||||||
leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
|
leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
|
||||||
if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
|
if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
|
||||||
if (op == MDB_PREV || op == MDB_PREV_DUP) {
|
if (op == MDB_PREV || op == MDB_PREV_DUP) {
|
||||||
|
|
@ -6014,27 +6011,25 @@ mdb_cursor_prev(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op)
|
||||||
DPRINTF(("==> cursor points to page %"Z"u with %u keys, key index %u",
|
DPRINTF(("==> cursor points to page %"Z"u with %u keys, key index %u",
|
||||||
mdb_dbg_pgno(mp), NUMKEYS(mp), mc->mc_ki[mc->mc_top]));
|
mdb_dbg_pgno(mp), NUMKEYS(mp), mc->mc_ki[mc->mc_top]));
|
||||||
|
|
||||||
|
if (!IS_LEAF(mp))
|
||||||
|
return MDB_CORRUPTED;
|
||||||
|
|
||||||
if (IS_LEAF2(mp)) {
|
if (IS_LEAF2(mp)) {
|
||||||
key->mv_size = mc->mc_db->md_pad;
|
key->mv_size = mc->mc_db->md_pad;
|
||||||
key->mv_data = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], key->mv_size);
|
key->mv_data = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], key->mv_size);
|
||||||
return MDB_SUCCESS;
|
return MDB_SUCCESS;
|
||||||
}
|
}
|
||||||
|
|
||||||
mdb_cassert(mc, IS_LEAF(mp));
|
|
||||||
leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
|
leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
|
||||||
|
|
||||||
if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
|
if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
|
||||||
mdb_xcursor_init1(mc, leaf);
|
mdb_xcursor_init1(mc, leaf);
|
||||||
}
|
|
||||||
if (data) {
|
|
||||||
if ((rc = mdb_node_read(mc, leaf, data)) != MDB_SUCCESS)
|
|
||||||
return rc;
|
|
||||||
|
|
||||||
if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
|
|
||||||
rc = mdb_cursor_last(&mc->mc_xcursor->mx_cursor, data, NULL);
|
rc = mdb_cursor_last(&mc->mc_xcursor->mx_cursor, data, NULL);
|
||||||
if (rc != MDB_SUCCESS)
|
if (rc != MDB_SUCCESS)
|
||||||
return rc;
|
return rc;
|
||||||
}
|
} else if (data) {
|
||||||
|
if ((rc = mdb_node_read(mc, leaf, data)) != MDB_SUCCESS)
|
||||||
|
return rc;
|
||||||
}
|
}
|
||||||
|
|
||||||
MDB_GET_KEY(leaf, key);
|
MDB_GET_KEY(leaf, key);
|
||||||
|
|
@ -6190,9 +6185,6 @@ set1:
|
||||||
|
|
||||||
if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
|
if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
|
||||||
mdb_xcursor_init1(mc, leaf);
|
mdb_xcursor_init1(mc, leaf);
|
||||||
}
|
|
||||||
if (data) {
|
|
||||||
if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
|
|
||||||
if (op == MDB_SET || op == MDB_SET_KEY || op == MDB_SET_RANGE) {
|
if (op == MDB_SET || op == MDB_SET_KEY || op == MDB_SET_RANGE) {
|
||||||
rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
|
rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
|
||||||
} else {
|
} else {
|
||||||
|
|
@ -6207,7 +6199,8 @@ set1:
|
||||||
if (rc != MDB_SUCCESS)
|
if (rc != MDB_SUCCESS)
|
||||||
return rc;
|
return rc;
|
||||||
}
|
}
|
||||||
} else if (op == MDB_GET_BOTH || op == MDB_GET_BOTH_RANGE) {
|
} else if (data) {
|
||||||
|
if (op == MDB_GET_BOTH || op == MDB_GET_BOTH_RANGE) {
|
||||||
MDB_val olddata;
|
MDB_val olddata;
|
||||||
MDB_cmp_func *dcmp;
|
MDB_cmp_func *dcmp;
|
||||||
if ((rc = mdb_node_read(mc, leaf, &olddata)) != MDB_SUCCESS)
|
if ((rc = mdb_node_read(mc, leaf, &olddata)) != MDB_SUCCESS)
|
||||||
|
|
@ -6265,22 +6258,23 @@ mdb_cursor_first(MDB_cursor *mc, MDB_val *key, MDB_val *data)
|
||||||
mc->mc_ki[mc->mc_top] = 0;
|
mc->mc_ki[mc->mc_top] = 0;
|
||||||
|
|
||||||
if (IS_LEAF2(mc->mc_pg[mc->mc_top])) {
|
if (IS_LEAF2(mc->mc_pg[mc->mc_top])) {
|
||||||
|
if ( key ) {
|
||||||
key->mv_size = mc->mc_db->md_pad;
|
key->mv_size = mc->mc_db->md_pad;
|
||||||
key->mv_data = LEAF2KEY(mc->mc_pg[mc->mc_top], 0, key->mv_size);
|
key->mv_data = LEAF2KEY(mc->mc_pg[mc->mc_top], 0, key->mv_size);
|
||||||
|
}
|
||||||
return MDB_SUCCESS;
|
return MDB_SUCCESS;
|
||||||
}
|
}
|
||||||
|
|
||||||
if (data) {
|
|
||||||
if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
|
if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
|
||||||
mdb_xcursor_init1(mc, leaf);
|
mdb_xcursor_init1(mc, leaf);
|
||||||
rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
|
rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
|
||||||
if (rc)
|
if (rc)
|
||||||
return rc;
|
return rc;
|
||||||
} else {
|
} else if (data) {
|
||||||
if ((rc = mdb_node_read(mc, leaf, data)) != MDB_SUCCESS)
|
if ((rc = mdb_node_read(mc, leaf, data)) != MDB_SUCCESS)
|
||||||
return rc;
|
return rc;
|
||||||
}
|
}
|
||||||
}
|
|
||||||
MDB_GET_KEY(leaf, key);
|
MDB_GET_KEY(leaf, key);
|
||||||
return MDB_SUCCESS;
|
return MDB_SUCCESS;
|
||||||
}
|
}
|
||||||
|
|
@ -6307,22 +6301,22 @@ mdb_cursor_last(MDB_cursor *mc, MDB_val *key, MDB_val *data)
|
||||||
leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
|
leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
|
||||||
|
|
||||||
if (IS_LEAF2(mc->mc_pg[mc->mc_top])) {
|
if (IS_LEAF2(mc->mc_pg[mc->mc_top])) {
|
||||||
|
if (key) {
|
||||||
key->mv_size = mc->mc_db->md_pad;
|
key->mv_size = mc->mc_db->md_pad;
|
||||||
key->mv_data = LEAF2KEY(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], key->mv_size);
|
key->mv_data = LEAF2KEY(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], key->mv_size);
|
||||||
|
}
|
||||||
return MDB_SUCCESS;
|
return MDB_SUCCESS;
|
||||||
}
|
}
|
||||||
|
|
||||||
if (data) {
|
|
||||||
if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
|
if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
|
||||||
mdb_xcursor_init1(mc, leaf);
|
mdb_xcursor_init1(mc, leaf);
|
||||||
rc = mdb_cursor_last(&mc->mc_xcursor->mx_cursor, data, NULL);
|
rc = mdb_cursor_last(&mc->mc_xcursor->mx_cursor, data, NULL);
|
||||||
if (rc)
|
if (rc)
|
||||||
return rc;
|
return rc;
|
||||||
} else {
|
} else if (data) {
|
||||||
if ((rc = mdb_node_read(mc, leaf, data)) != MDB_SUCCESS)
|
if ((rc = mdb_node_read(mc, leaf, data)) != MDB_SUCCESS)
|
||||||
return rc;
|
return rc;
|
||||||
}
|
}
|
||||||
}
|
|
||||||
|
|
||||||
MDB_GET_KEY(leaf, key);
|
MDB_GET_KEY(leaf, key);
|
||||||
return MDB_SUCCESS;
|
return MDB_SUCCESS;
|
||||||
|
|
@ -7102,6 +7096,8 @@ mdb_cursor_del(MDB_cursor *mc, unsigned int flags)
|
||||||
return rc;
|
return rc;
|
||||||
|
|
||||||
mp = mc->mc_pg[mc->mc_top];
|
mp = mc->mc_pg[mc->mc_top];
|
||||||
|
if (!IS_LEAF(mp))
|
||||||
|
return MDB_CORRUPTED;
|
||||||
if (IS_LEAF2(mp))
|
if (IS_LEAF2(mp))
|
||||||
goto del_key;
|
goto del_key;
|
||||||
leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
|
leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
|
||||||
|
|
@ -8473,28 +8469,31 @@ mdb_cursor_del0(MDB_cursor *mc)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
rc = mdb_rebalance(mc);
|
rc = mdb_rebalance(mc);
|
||||||
|
if (rc)
|
||||||
|
goto fail;
|
||||||
|
|
||||||
if (rc == MDB_SUCCESS) {
|
|
||||||
/* DB is totally empty now, just bail out.
|
/* DB is totally empty now, just bail out.
|
||||||
* Other cursors adjustments were already done
|
* Other cursors adjustments were already done
|
||||||
* by mdb_rebalance and aren't needed here.
|
* by mdb_rebalance and aren't needed here.
|
||||||
*/
|
*/
|
||||||
if (!mc->mc_snum)
|
if (!mc->mc_snum) {
|
||||||
|
mc->mc_flags |= C_EOF;
|
||||||
return rc;
|
return rc;
|
||||||
|
}
|
||||||
|
|
||||||
|
ki = mc->mc_ki[mc->mc_top];
|
||||||
mp = mc->mc_pg[mc->mc_top];
|
mp = mc->mc_pg[mc->mc_top];
|
||||||
nkeys = NUMKEYS(mp);
|
nkeys = NUMKEYS(mp);
|
||||||
|
|
||||||
/* Adjust other cursors pointing to mp */
|
/* Adjust other cursors pointing to mp */
|
||||||
for (m2 = mc->mc_txn->mt_cursors[dbi]; !rc && m2; m2=m2->mc_next) {
|
for (m2 = mc->mc_txn->mt_cursors[dbi]; !rc && m2; m2=m2->mc_next) {
|
||||||
m3 = (mc->mc_flags & C_SUB) ? &m2->mc_xcursor->mx_cursor : m2;
|
m3 = (mc->mc_flags & C_SUB) ? &m2->mc_xcursor->mx_cursor : m2;
|
||||||
if (! (m2->mc_flags & m3->mc_flags & C_INITIALIZED))
|
if (!(m2->mc_flags & m3->mc_flags & C_INITIALIZED))
|
||||||
continue;
|
continue;
|
||||||
if (m3->mc_snum < mc->mc_snum)
|
if (m3->mc_snum < mc->mc_snum)
|
||||||
continue;
|
continue;
|
||||||
if (m3->mc_pg[mc->mc_top] == mp) {
|
if (m3->mc_pg[mc->mc_top] == mp) {
|
||||||
/* if m3 points past last node in page, find next sibling */
|
/* if m3 points past last node in page, find next sibling */
|
||||||
if (m3->mc_ki[mc->mc_top] >= mc->mc_ki[mc->mc_top]) {
|
|
||||||
if (m3->mc_ki[mc->mc_top] >= nkeys) {
|
if (m3->mc_ki[mc->mc_top] >= nkeys) {
|
||||||
rc = mdb_cursor_sibling(m3, 1);
|
rc = mdb_cursor_sibling(m3, 1);
|
||||||
if (rc == MDB_NOTFOUND) {
|
if (rc == MDB_NOTFOUND) {
|
||||||
|
|
@ -8502,8 +8501,12 @@ mdb_cursor_del0(MDB_cursor *mc)
|
||||||
rc = MDB_SUCCESS;
|
rc = MDB_SUCCESS;
|
||||||
continue;
|
continue;
|
||||||
}
|
}
|
||||||
|
if (rc)
|
||||||
|
goto fail;
|
||||||
}
|
}
|
||||||
if (mc->mc_db->md_flags & MDB_DUPSORT) {
|
if (m3->mc_ki[mc->mc_top] >= ki ||
|
||||||
|
/* moved to right sibling */ m3->mc_pg[mc->mc_top] != mp) {
|
||||||
|
if (m3->mc_xcursor && !(m3->mc_flags & C_EOF)) {
|
||||||
MDB_node *node = NODEPTR(m3->mc_pg[m3->mc_top], m3->mc_ki[m3->mc_top]);
|
MDB_node *node = NODEPTR(m3->mc_pg[m3->mc_top], m3->mc_ki[m3->mc_top]);
|
||||||
/* If this node has dupdata, it may need to be reinited
|
/* If this node has dupdata, it may need to be reinited
|
||||||
* because its data has moved.
|
* because its data has moved.
|
||||||
|
|
@ -8517,16 +8520,19 @@ mdb_cursor_del0(MDB_cursor *mc)
|
||||||
m3->mc_xcursor->mx_cursor.mc_pg[0] = NODEDATA(node);
|
m3->mc_xcursor->mx_cursor.mc_pg[0] = NODEDATA(node);
|
||||||
} else {
|
} else {
|
||||||
mdb_xcursor_init1(m3, node);
|
mdb_xcursor_init1(m3, node);
|
||||||
|
rc = mdb_cursor_first(&m3->mc_xcursor->mx_cursor, NULL, NULL);
|
||||||
|
if (rc)
|
||||||
|
goto fail;
|
||||||
|
}
|
||||||
|
}
|
||||||
m3->mc_xcursor->mx_cursor.mc_flags |= C_DEL;
|
m3->mc_xcursor->mx_cursor.mc_flags |= C_DEL;
|
||||||
}
|
}
|
||||||
|
m3->mc_flags |= C_DEL;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
|
||||||
}
|
|
||||||
mc->mc_flags |= C_DEL;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
fail:
|
||||||
if (rc)
|
if (rc)
|
||||||
mc->mc_txn->mt_flags |= MDB_TXN_ERROR;
|
mc->mc_txn->mt_flags |= MDB_TXN_ERROR;
|
||||||
return rc;
|
return rc;
|
||||||
|
|
|
||||||
|
|
@ -1,5 +1,5 @@
|
||||||
.TH MDB_COPY 1 "2014/07/01" "LMDB 0.9.14"
|
.TH MDB_COPY 1 "2014/07/01" "LMDB 0.9.14"
|
||||||
.\" Copyright 2012-2020 Howard Chu, Symas Corp. All Rights Reserved.
|
.\" Copyright 2012-2021 Howard Chu, Symas Corp. All Rights Reserved.
|
||||||
.\" Copying restrictions apply. See COPYRIGHT/LICENSE.
|
.\" Copying restrictions apply. See COPYRIGHT/LICENSE.
|
||||||
.SH NAME
|
.SH NAME
|
||||||
mdb_copy \- LMDB environment copy tool
|
mdb_copy \- LMDB environment copy tool
|
||||||
|
|
|
||||||
|
|
@ -1,6 +1,6 @@
|
||||||
/* mdb_copy.c - memory-mapped database backup tool */
|
/* mdb_copy.c - memory-mapped database backup tool */
|
||||||
/*
|
/*
|
||||||
* Copyright 2012-2020 Howard Chu, Symas Corp.
|
* Copyright 2012-2021 Howard Chu, Symas Corp.
|
||||||
* All rights reserved.
|
* All rights reserved.
|
||||||
*
|
*
|
||||||
* Redistribution and use in source and binary forms, with or without
|
* Redistribution and use in source and binary forms, with or without
|
||||||
|
|
|
||||||
|
|
@ -1,5 +1,5 @@
|
||||||
.TH MDB_DUMP 1 "2015/09/30" "LMDB 0.9.17"
|
.TH MDB_DUMP 1 "2015/09/30" "LMDB 0.9.17"
|
||||||
.\" Copyright 2014-2020 Howard Chu, Symas Corp. All Rights Reserved.
|
.\" Copyright 2014-2021 Howard Chu, Symas Corp. All Rights Reserved.
|
||||||
.\" Copying restrictions apply. See COPYRIGHT/LICENSE.
|
.\" Copying restrictions apply. See COPYRIGHT/LICENSE.
|
||||||
.SH NAME
|
.SH NAME
|
||||||
mdb_dump \- LMDB environment export tool
|
mdb_dump \- LMDB environment export tool
|
||||||
|
|
|
||||||
|
|
@ -1,6 +1,6 @@
|
||||||
/* mdb_dump.c - memory-mapped database dump tool */
|
/* mdb_dump.c - memory-mapped database dump tool */
|
||||||
/*
|
/*
|
||||||
* Copyright 2011-2020 Howard Chu, Symas Corp.
|
* Copyright 2011-2021 Howard Chu, Symas Corp.
|
||||||
* All rights reserved.
|
* All rights reserved.
|
||||||
*
|
*
|
||||||
* Redistribution and use in source and binary forms, with or without
|
* Redistribution and use in source and binary forms, with or without
|
||||||
|
|
|
||||||
|
|
@ -1,5 +1,5 @@
|
||||||
.TH MDB_LOAD 1 "2015/09/30" "LMDB 0.9.17"
|
.TH MDB_LOAD 1 "2015/09/30" "LMDB 0.9.17"
|
||||||
.\" Copyright 2014-2020 Howard Chu, Symas Corp. All Rights Reserved.
|
.\" Copyright 2014-2021 Howard Chu, Symas Corp. All Rights Reserved.
|
||||||
.\" Copying restrictions apply. See COPYRIGHT/LICENSE.
|
.\" Copying restrictions apply. See COPYRIGHT/LICENSE.
|
||||||
.SH NAME
|
.SH NAME
|
||||||
mdb_load \- LMDB environment import tool
|
mdb_load \- LMDB environment import tool
|
||||||
|
|
|
||||||
|
|
@ -1,6 +1,6 @@
|
||||||
/* mdb_load.c - memory-mapped database load tool */
|
/* mdb_load.c - memory-mapped database load tool */
|
||||||
/*
|
/*
|
||||||
* Copyright 2011-2020 Howard Chu, Symas Corp.
|
* Copyright 2011-2021 Howard Chu, Symas Corp.
|
||||||
* All rights reserved.
|
* All rights reserved.
|
||||||
*
|
*
|
||||||
* Redistribution and use in source and binary forms, with or without
|
* Redistribution and use in source and binary forms, with or without
|
||||||
|
|
|
||||||
|
|
@ -1,5 +1,5 @@
|
||||||
.TH MDB_STAT 1 "2015/09/30" "LMDB 0.9.17"
|
.TH MDB_STAT 1 "2015/09/30" "LMDB 0.9.17"
|
||||||
.\" Copyright 2012-2020 Howard Chu, Symas Corp. All Rights Reserved.
|
.\" Copyright 2012-2021 Howard Chu, Symas Corp. All Rights Reserved.
|
||||||
.\" Copying restrictions apply. See COPYRIGHT/LICENSE.
|
.\" Copying restrictions apply. See COPYRIGHT/LICENSE.
|
||||||
.SH NAME
|
.SH NAME
|
||||||
mdb_stat \- LMDB environment status tool
|
mdb_stat \- LMDB environment status tool
|
||||||
|
|
|
||||||
|
|
@ -1,6 +1,6 @@
|
||||||
/* mdb_stat.c - memory-mapped database status tool */
|
/* mdb_stat.c - memory-mapped database status tool */
|
||||||
/*
|
/*
|
||||||
* Copyright 2011-2020 Howard Chu, Symas Corp.
|
* Copyright 2011-2021 Howard Chu, Symas Corp.
|
||||||
* All rights reserved.
|
* All rights reserved.
|
||||||
*
|
*
|
||||||
* Redistribution and use in source and binary forms, with or without
|
* Redistribution and use in source and binary forms, with or without
|
||||||
|
|
|
||||||
|
|
@ -3,8 +3,8 @@
|
||||||
/* $OpenLDAP$ */
|
/* $OpenLDAP$ */
|
||||||
/* This work is part of OpenLDAP Software <http://www.openldap.org/>.
|
/* This work is part of OpenLDAP Software <http://www.openldap.org/>.
|
||||||
*
|
*
|
||||||
* Copyright 2000-2020 The OpenLDAP Foundation.
|
* Copyright 2000-2021 The OpenLDAP Foundation.
|
||||||
* Portions Copyright 2001-2020 Howard Chu, Symas Corp.
|
* Portions Copyright 2001-2021 Howard Chu, Symas Corp.
|
||||||
* All rights reserved.
|
* All rights reserved.
|
||||||
*
|
*
|
||||||
* Redistribution and use in source and binary forms, with or without
|
* Redistribution and use in source and binary forms, with or without
|
||||||
|
|
|
||||||
|
|
@ -11,8 +11,8 @@
|
||||||
/* $OpenLDAP$ */
|
/* $OpenLDAP$ */
|
||||||
/* This work is part of OpenLDAP Software <http://www.openldap.org/>.
|
/* This work is part of OpenLDAP Software <http://www.openldap.org/>.
|
||||||
*
|
*
|
||||||
* Copyright 2000-2020 The OpenLDAP Foundation.
|
* Copyright 2000-2021 The OpenLDAP Foundation.
|
||||||
* Portions Copyright 2001-2020 Howard Chu, Symas Corp.
|
* Portions Copyright 2001-2021 Howard Chu, Symas Corp.
|
||||||
* All rights reserved.
|
* All rights reserved.
|
||||||
*
|
*
|
||||||
* Redistribution and use in source and binary forms, with or without
|
* Redistribution and use in source and binary forms, with or without
|
||||||
|
|
|
||||||
|
|
@ -1,6 +1,6 @@
|
||||||
/* mtest.c - memory-mapped database tester/toy */
|
/* mtest.c - memory-mapped database tester/toy */
|
||||||
/*
|
/*
|
||||||
* Copyright 2011-2020 Howard Chu, Symas Corp.
|
* Copyright 2011-2021 Howard Chu, Symas Corp.
|
||||||
* All rights reserved.
|
* All rights reserved.
|
||||||
*
|
*
|
||||||
* Redistribution and use in source and binary forms, with or without
|
* Redistribution and use in source and binary forms, with or without
|
||||||
|
|
|
||||||
|
|
@ -1,6 +1,6 @@
|
||||||
/* mtest2.c - memory-mapped database tester/toy */
|
/* mtest2.c - memory-mapped database tester/toy */
|
||||||
/*
|
/*
|
||||||
* Copyright 2011-2020 Howard Chu, Symas Corp.
|
* Copyright 2011-2021 Howard Chu, Symas Corp.
|
||||||
* All rights reserved.
|
* All rights reserved.
|
||||||
*
|
*
|
||||||
* Redistribution and use in source and binary forms, with or without
|
* Redistribution and use in source and binary forms, with or without
|
||||||
|
|
|
||||||
|
|
@ -1,6 +1,6 @@
|
||||||
/* mtest3.c - memory-mapped database tester/toy */
|
/* mtest3.c - memory-mapped database tester/toy */
|
||||||
/*
|
/*
|
||||||
* Copyright 2011-2020 Howard Chu, Symas Corp.
|
* Copyright 2011-2021 Howard Chu, Symas Corp.
|
||||||
* All rights reserved.
|
* All rights reserved.
|
||||||
*
|
*
|
||||||
* Redistribution and use in source and binary forms, with or without
|
* Redistribution and use in source and binary forms, with or without
|
||||||
|
|
|
||||||
|
|
@ -1,6 +1,6 @@
|
||||||
/* mtest4.c - memory-mapped database tester/toy */
|
/* mtest4.c - memory-mapped database tester/toy */
|
||||||
/*
|
/*
|
||||||
* Copyright 2011-2020 Howard Chu, Symas Corp.
|
* Copyright 2011-2021 Howard Chu, Symas Corp.
|
||||||
* All rights reserved.
|
* All rights reserved.
|
||||||
*
|
*
|
||||||
* Redistribution and use in source and binary forms, with or without
|
* Redistribution and use in source and binary forms, with or without
|
||||||
|
|
|
||||||
|
|
@ -1,6 +1,6 @@
|
||||||
/* mtest5.c - memory-mapped database tester/toy */
|
/* mtest5.c - memory-mapped database tester/toy */
|
||||||
/*
|
/*
|
||||||
* Copyright 2011-2020 Howard Chu, Symas Corp.
|
* Copyright 2011-2021 Howard Chu, Symas Corp.
|
||||||
* All rights reserved.
|
* All rights reserved.
|
||||||
*
|
*
|
||||||
* Redistribution and use in source and binary forms, with or without
|
* Redistribution and use in source and binary forms, with or without
|
||||||
|
|
|
||||||
|
|
@ -1,6 +1,6 @@
|
||||||
/* mtest6.c - memory-mapped database tester/toy */
|
/* mtest6.c - memory-mapped database tester/toy */
|
||||||
/*
|
/*
|
||||||
* Copyright 2011-2020 Howard Chu, Symas Corp.
|
* Copyright 2011-2021 Howard Chu, Symas Corp.
|
||||||
* All rights reserved.
|
* All rights reserved.
|
||||||
*
|
*
|
||||||
* Redistribution and use in source and binary forms, with or without
|
* Redistribution and use in source and binary forms, with or without
|
||||||
|
|
|
||||||
|
|
@ -3,7 +3,7 @@
|
||||||
* Do a line-by-line comparison of this and sample-mdb.txt
|
* Do a line-by-line comparison of this and sample-mdb.txt
|
||||||
*/
|
*/
|
||||||
/*
|
/*
|
||||||
* Copyright 2012-2020 Howard Chu, Symas Corp.
|
* Copyright 2012-2021 Howard Chu, Symas Corp.
|
||||||
* All rights reserved.
|
* All rights reserved.
|
||||||
*
|
*
|
||||||
* Redistribution and use in source and binary forms, with or without
|
* Redistribution and use in source and binary forms, with or without
|
||||||
|
|
|
||||||
|
|
@ -3,7 +3,7 @@
|
||||||
* Do a line-by-line comparison of this and sample-bdb.txt
|
* Do a line-by-line comparison of this and sample-bdb.txt
|
||||||
*/
|
*/
|
||||||
/*
|
/*
|
||||||
* Copyright 2012-2020 Howard Chu, Symas Corp.
|
* Copyright 2012-2021 Howard Chu, Symas Corp.
|
||||||
* All rights reserved.
|
* All rights reserved.
|
||||||
*
|
*
|
||||||
* Redistribution and use in source and binary forms, with or without
|
* Redistribution and use in source and binary forms, with or without
|
||||||
|
|
|
||||||
Loading…
Reference in a new issue