1 /* idl.h - ldap mdb back-end ID list header file */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 2000-2011 The OpenLDAP Foundation.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted only as authorized by the OpenLDAP
12 * A copy of this license is available in the file LICENSE in the
13 * top-level directory of the distribution or, alternatively, at
14 * <http://www.OpenLDAP.org/license.html>.
20 /* IDL sizes - likely should be even bigger
21 * limiting factors: sizeof(ID), thread stack size
23 #define MDB_IDL_LOGN 16 /* DB_SIZE is 2^16, UM_SIZE is 2^17 */
24 #define MDB_IDL_DB_SIZE (1<<MDB_IDL_LOGN)
25 #define MDB_IDL_UM_SIZE (1<<(MDB_IDL_LOGN+1))
26 #define MDB_IDL_UM_SIZEOF (MDB_IDL_UM_SIZE * sizeof(ID))
28 #define MDB_IDL_DB_MAX (MDB_IDL_DB_SIZE-1)
30 #define MDB_IDL_UM_MAX (MDB_IDL_UM_SIZE-1)
32 #define MDB_IDL_IS_RANGE(ids) ((ids)[0] == NOID)
33 #define MDB_IDL_RANGE_SIZE (3)
34 #define MDB_IDL_RANGE_SIZEOF (MDB_IDL_RANGE_SIZE * sizeof(ID))
35 #define MDB_IDL_SIZEOF(ids) ((MDB_IDL_IS_RANGE(ids) \
36 ? MDB_IDL_RANGE_SIZE : ((ids)[0]+1)) * sizeof(ID))
38 #define MDB_IDL_RANGE_FIRST(ids) ((ids)[1])
39 #define MDB_IDL_RANGE_LAST(ids) ((ids)[2])
41 #define MDB_IDL_RANGE( ids, f, l ) \
48 #define MDB_IDL_ZERO(ids) \
55 #define MDB_IDL_IS_ZERO(ids) ( (ids)[0] == 0 )
56 #define MDB_IDL_IS_ALL( range, ids ) ( (ids)[0] == NOID \
57 && (ids)[1] <= (range)[1] && (range)[2] <= (ids)[2] )
59 #define MDB_IDL_CPY( dst, src ) (AC_MEMCPY( dst, src, MDB_IDL_SIZEOF( src ) ))
61 #define MDB_IDL_ID( mdb, ids, id ) MDB_IDL_RANGE( ids, id, NOID )
62 #define MDB_IDL_ALL( ids ) MDB_IDL_RANGE( ids, 1, NOID )
64 #define MDB_IDL_FIRST( ids ) ( (ids)[1] )
65 #define MDB_IDL_LAST( ids ) ( MDB_IDL_IS_RANGE(ids) \
66 ? (ids)[2] : (ids)[(ids)[0]] )
68 #define MDB_IDL_N( ids ) ( MDB_IDL_IS_RANGE(ids) \
69 ? ((ids)[2]-(ids)[1])+1 : (ids)[0] )
71 /** An ID2 is an ID/value pair.
74 ID mid; /**< The ID */
75 MDB_val mval; /**< The value */
78 /** An ID2L is an ID2 List, a sorted array of ID2s.
79 * The first element's \b mid member is a count of how many actual
80 * elements are in the array. The \b mptr member of the first element is unused.
81 * The array is sorted in ascending order by \b mid.
85 typedef struct IdScopes {
92 struct berval rdns[MAXRDNS];
93 struct berval nrdns[MAXRDNS];
97 /** Search for an ID in an ID2L.
98 * @param[in] ids The ID2L to search.
99 * @param[in] id The ID to search for.
100 * @return The index of the first ID2 whose \b mid member is greater than or equal to \b id.
102 unsigned mdb_id2l_search( ID2L ids, ID id );
105 /** Insert an ID2 into a ID2L.
106 * @param[in,out] ids The ID2L to insert into.
107 * @param[in] id The ID2 to insert.
108 * @return 0 on success, -1 if the ID was already present in the MIDL2.
110 int mdb_id2l_insert( ID2L ids, ID2 *id );