2 * @brief LMDB ID List header file.
4 * This file was originally part of back-bdb but has been
5 * modified for use in libmdb. Most of the macros defined
6 * in this file are unused, just left over from the original.
8 * This file is only used internally in libmdb and its definitions
9 * are not exposed publicly.
12 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
14 * Copyright 2000-2016 The OpenLDAP Foundation.
15 * All rights reserved.
17 * Redistribution and use in source and binary forms, with or without
18 * modification, are permitted only as authorized by the OpenLDAP
21 * A copy of this license is available in the file LICENSE in the
22 * top-level directory of the distribution or, alternatively, at
23 * <http://www.OpenLDAP.org/license.html>.
35 /** @defgroup internal LMDB Internals
39 /** @defgroup idls ID List Management
42 /** A generic unsigned ID number. These were entryIDs in back-bdb.
43 * Preferably it should have the same size as a pointer.
45 typedef mdb_size_t MDB_ID;
47 /** An IDL is an ID List, a sorted array of IDs. The first
48 * element of the array is a counter for how many actual
49 * IDs are in the list. In the original back-bdb code, IDLs are
50 * sorted in ascending order. For libmdb IDLs are sorted in
53 typedef MDB_ID *MDB_IDL;
55 /* IDL sizes - likely should be even bigger
56 * limiting factors: sizeof(ID), thread stack size
59 #define MDB_IDL_LOGN 14 /* DB_SIZE is 2^14, UM_SIZE is 2^15 */
61 #define MDB_IDL_LOGN 16 /* DB_SIZE is 2^16, UM_SIZE is 2^17 */
63 #define MDB_IDL_DB_SIZE (1<<MDB_IDL_LOGN)
64 #define MDB_IDL_UM_SIZE (1<<(MDB_IDL_LOGN+1))
66 #define MDB_IDL_DB_MAX (MDB_IDL_DB_SIZE-1)
67 #define MDB_IDL_UM_MAX (MDB_IDL_UM_SIZE-1)
69 #define MDB_IDL_SIZEOF(ids) (((ids)[0]+1) * sizeof(MDB_ID))
70 #define MDB_IDL_IS_ZERO(ids) ( (ids)[0] == 0 )
71 #define MDB_IDL_CPY( dst, src ) (memcpy( dst, src, MDB_IDL_SIZEOF( src ) ))
72 #define MDB_IDL_FIRST( ids ) ( (ids)[1] )
73 #define MDB_IDL_LAST( ids ) ( (ids)[(ids)[0]] )
75 /** Current max length of an #mdb_midl_alloc()ed IDL */
76 #define MDB_IDL_ALLOCLEN( ids ) ( (ids)[-1] )
78 /** Append ID to IDL. The IDL must be big enough. */
79 #define mdb_midl_xappend(idl, id) do { \
80 MDB_ID *xidl = (idl), xlen = ++(xidl[0]); \
84 /** Search for an ID in an IDL.
85 * @param[in] ids The IDL to search.
86 * @param[in] id The ID to search for.
87 * @return The index of the first ID greater than or equal to \b id.
89 unsigned mdb_midl_search( MDB_IDL ids, MDB_ID id );
92 * Allocates memory for an IDL of the given size.
93 * @return IDL on success, NULL on failure.
95 MDB_IDL mdb_midl_alloc(int num);
98 * @param[in] ids The IDL to free.
100 void mdb_midl_free(MDB_IDL ids);
103 * Return the IDL to the default size if it has grown larger.
104 * @param[in,out] idp Address of the IDL to shrink.
106 void mdb_midl_shrink(MDB_IDL *idp);
108 /** Make room for num additional elements in an IDL.
109 * @param[in,out] idp Address of the IDL.
110 * @param[in] num Number of elements to make room for.
111 * @return 0 on success, ENOMEM on failure.
113 int mdb_midl_need(MDB_IDL *idp, unsigned num);
115 /** Append an ID onto an IDL.
116 * @param[in,out] idp Address of the IDL to append to.
117 * @param[in] id The ID to append.
118 * @return 0 on success, ENOMEM if the IDL is too large.
120 int mdb_midl_append( MDB_IDL *idp, MDB_ID id );
122 /** Append an IDL onto an IDL.
123 * @param[in,out] idp Address of the IDL to append to.
124 * @param[in] app The IDL to append.
125 * @return 0 on success, ENOMEM if the IDL is too large.
127 int mdb_midl_append_list( MDB_IDL *idp, MDB_IDL app );
129 /** Append an ID range onto an IDL.
130 * @param[in,out] idp Address of the IDL to append to.
131 * @param[in] id The lowest ID to append.
132 * @param[in] n Number of IDs to append.
133 * @return 0 on success, ENOMEM if the IDL is too large.
135 int mdb_midl_append_range( MDB_IDL *idp, MDB_ID id, unsigned n );
137 /** Merge an IDL onto an IDL. The destination IDL must be big enough.
138 * @param[in] idl The IDL to merge into.
139 * @param[in] merge The IDL to merge.
141 void mdb_midl_xmerge( MDB_IDL idl, MDB_IDL merge );
144 * @param[in,out] ids The IDL to sort.
146 void mdb_midl_sort( MDB_IDL ids );
148 /** An ID2 is an ID/pointer pair.
150 typedef struct MDB_ID2 {
151 MDB_ID mid; /**< The ID */
152 void *mptr; /**< The pointer */
155 /** An ID2L is an ID2 List, a sorted array of ID2s.
156 * The first element's \b mid member is a count of how many actual
157 * elements are in the array. The \b mptr member of the first element is unused.
158 * The array is sorted in ascending order by \b mid.
160 typedef MDB_ID2 *MDB_ID2L;
162 /** Search for an ID in an ID2L.
163 * @param[in] ids The ID2L to search.
164 * @param[in] id The ID to search for.
165 * @return The index of the first ID2 whose \b mid member is greater than or equal to \b id.
167 unsigned mdb_mid2l_search( MDB_ID2L ids, MDB_ID id );
170 /** Insert an ID2 into a ID2L.
171 * @param[in,out] ids The ID2L to insert into.
172 * @param[in] id The ID2 to insert.
173 * @return 0 on success, -1 if the ID was already present in the ID2L.
175 int mdb_mid2l_insert( MDB_ID2L ids, MDB_ID2 *id );
177 /** Append an ID2 into a ID2L.
178 * @param[in,out] ids The ID2L to append into.
179 * @param[in] id The ID2 to append.
180 * @return 0 on success, -2 if the ID2L is too big.
182 int mdb_mid2l_append( MDB_ID2L ids, MDB_ID2 *id );
185 typedef struct MDB_ID3 {
186 MDB_ID mid; /**< The ID */
187 void *mptr; /**< The pointer */
188 unsigned int mcnt; /**< Number of pages */
189 unsigned int mref; /**< Refcounter */
192 typedef MDB_ID3 *MDB_ID3L;
194 unsigned mdb_mid3l_search( MDB_ID3L ids, MDB_ID id );
195 int mdb_mid3l_insert( MDB_ID3L ids, MDB_ID3 *id );
197 #endif /* MDB_VL32 */
203 #endif /* _MDB_MIDL_H_ */