1 /* dn2id.c - routines to deal with the dn2id index */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 1998-2005 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>.
21 #include <ac/string.h>
22 #include <ac/socket.h>
25 #include "back-ldbm.h"
26 #include "proto-back-ldbm.h"
39 struct berval ptr, pdn;
41 Debug( LDAP_DEBUG_TRACE, "=> dn2id_add( \"%s\", %ld )\n", dn->bv_val, id, 0 );
45 db = ldbm_cache_open( be, "dn2id", LDBM_SUFFIX, LDBM_WRCREAT );
47 Debug( LDAP_DEBUG_ANY, "Could not open/create dn2id%s\n",
53 ldbm_datum_init( key );
54 key.dsize = dn->bv_len + 2;
55 buf = ch_malloc( key.dsize );
57 buf[0] = DN_BASE_PREFIX;
59 ptr.bv_len = dn->bv_len;
60 AC_MEMCPY( ptr.bv_val, dn->bv_val, dn->bv_len );
61 ptr.bv_val[ dn->bv_len ] = '\0';
63 ldbm_datum_init( data );
64 data.dptr = (char *) &id;
65 data.dsize = sizeof(ID);
68 rc = ldbm_cache_store( db, key, data, flags );
70 if ( rc != -1 && !be_issuffix( be, &ptr )) {
71 buf[0] = DN_SUBTREE_PREFIX;
72 ldap_pvt_thread_mutex_lock( &db->dbc_write_mutex );
73 rc = idl_insert_key( be, db, key, id );
74 ldap_pvt_thread_mutex_unlock( &db->dbc_write_mutex );
77 dnParent( &ptr, &pdn );
79 pdn.bv_val[-1] = DN_ONE_PREFIX;
80 key.dsize = pdn.bv_len + 2;
81 key.dptr = pdn.bv_val - 1;
83 ldap_pvt_thread_mutex_lock( &db->dbc_write_mutex );
84 rc = idl_insert_key( be, db, key, id );
85 ldap_pvt_thread_mutex_unlock( &db->dbc_write_mutex );
89 while ( rc != -1 && !be_issuffix( be, &ptr )) {
90 ptr.bv_val[-1] = DN_SUBTREE_PREFIX;
92 ldap_pvt_thread_mutex_lock( &db->dbc_write_mutex );
93 rc = idl_insert_key( be, db, key, id );
94 ldap_pvt_thread_mutex_unlock( &db->dbc_write_mutex );
97 dnParent( &ptr, &pdn );
98 key.dsize = pdn.bv_len + 2;
99 key.dptr = pdn.bv_val - 1;
104 ldbm_cache_close( be, db );
106 Debug( LDAP_DEBUG_TRACE, "<= dn2id_add %d\n", rc, 0, 0 );
118 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
123 Debug( LDAP_DEBUG_TRACE, "=> dn2id( \"%s\" )\n", dn->bv_val, 0, 0 );
125 assert( idp != NULL );
127 /* first check the cache */
128 *idp = cache_find_entry_ndn2id( be, &li->li_cache, dn );
129 if ( *idp != NOID ) {
130 Debug( LDAP_DEBUG_TRACE, "<= dn2id %ld (in cache)\n", *idp,
136 db = ldbm_cache_open( be, "dn2id", LDBM_SUFFIX, LDBM_WRCREAT );
138 Debug( LDAP_DEBUG_ANY, "<= dn2id could not open dn2id%s\n",
141 * return code !0 if ldbm cache open failed;
142 * callers should handle this
148 ldbm_datum_init( key );
150 key.dsize = dn->bv_len + 2;
151 key.dptr = ch_malloc( key.dsize );
152 tmp = (unsigned char *)key.dptr;
153 tmp[0] = DN_BASE_PREFIX;
155 AC_MEMCPY( tmp, dn->bv_val, dn->bv_len );
156 tmp[dn->bv_len] = '\0';
158 data = ldbm_cache_fetch( db, key );
160 ldbm_cache_close( be, db );
164 if ( data.dptr == NULL ) {
165 Debug( LDAP_DEBUG_TRACE, "<= dn2id NOID\n", 0, 0, 0 );
171 AC_MEMCPY( (char *) idp, data.dptr, sizeof(ID) );
173 assert( *idp != NOID );
175 ldbm_datum_free( db->dbc_db, data );
177 Debug( LDAP_DEBUG_TRACE, "<= dn2id %ld\n", *idp, 0, 0 );
194 Debug( LDAP_DEBUG_TRACE, "=> dn2idl( \"%c%s\" )\n", prefix, dn->bv_val, 0 );
196 assert( idlp != NULL );
199 if ( prefix == DN_SUBTREE_PREFIX && be_issuffix(be, dn) ) {
200 *idlp = idl_allids( be );
204 db = ldbm_cache_open( be, "dn2id", LDBM_SUFFIX, LDBM_WRCREAT );
206 Debug( LDAP_DEBUG_ANY, "<= dn2idl could not open dn2id%s\n",
212 ldbm_datum_init( key );
214 key.dsize = dn->bv_len + 2;
215 key.dptr = ch_malloc( key.dsize );
216 tmp = (unsigned char *)key.dptr;
219 AC_MEMCPY( tmp, dn->bv_val, dn->bv_len );
220 tmp[dn->bv_len] = '\0';
222 *idlp = idl_fetch( be, db, key );
224 ldbm_cache_close( be, db );
243 struct berval ptr, pdn;
245 Debug( LDAP_DEBUG_TRACE, "=> dn2id_delete( \"%s\", %ld )\n", dn->bv_val, id, 0 );
248 assert( id != NOID );
250 db = ldbm_cache_open( be, "dn2id", LDBM_SUFFIX, LDBM_WRCREAT );
252 Debug( LDAP_DEBUG_ANY,
253 "<= dn2id_delete could not open dn2id%s\n", LDBM_SUFFIX,
259 ldbm_datum_init( key );
260 key.dsize = dn->bv_len + 2;
261 buf = ch_malloc( key.dsize );
263 buf[0] = DN_BASE_PREFIX;
264 ptr.bv_val = buf + 1;
265 ptr.bv_len = dn->bv_len;
266 AC_MEMCPY( ptr.bv_val, dn->bv_val, dn->bv_len );
267 ptr.bv_val[dn->bv_len] = '\0';
269 rc = ldbm_cache_delete( db, key );
271 if( !be_issuffix( be, &ptr )) {
272 buf[0] = DN_SUBTREE_PREFIX;
273 ldap_pvt_thread_mutex_lock( &db->dbc_write_mutex );
274 (void) idl_delete_key( be, db, key, id );
275 ldap_pvt_thread_mutex_unlock( &db->dbc_write_mutex );
277 dnParent( &ptr, &pdn );
279 pdn.bv_val[-1] = DN_ONE_PREFIX;
280 key.dsize = pdn.bv_len + 2;
281 key.dptr = pdn.bv_val - 1;
284 ldap_pvt_thread_mutex_lock( &db->dbc_write_mutex );
285 (void) idl_delete_key( be, db, key, id );
286 ldap_pvt_thread_mutex_unlock( &db->dbc_write_mutex );
289 while ( rc != -1 && !be_issuffix( be, &ptr )) {
290 ptr.bv_val[-1] = DN_SUBTREE_PREFIX;
292 ldap_pvt_thread_mutex_lock( &db->dbc_write_mutex );
293 (void) idl_delete_key( be, db, key, id );
294 ldap_pvt_thread_mutex_unlock( &db->dbc_write_mutex );
296 dnParent( &ptr, &pdn );
297 key.dsize = pdn.bv_len + 2;
298 key.dptr = pdn.bv_val - 1;
304 ldbm_cache_close( be, db );
306 Debug( LDAP_DEBUG_TRACE, "<= dn2id_delete %d\n", rc, 0, 0 );
312 * dn2entry - look up dn in the cache/indexes and return the corresponding
328 Debug(LDAP_DEBUG_TRACE, "dn2entry_%s: dn: \"%s\"\n",
329 rw ? "w" : "r", dn->bv_val, 0);
332 if( matched != NULL ) {
333 /* caller cares about match */
337 if ( dn2id( be, dn, &id ) ) {
338 /* something bad happened to ldbm cache */
344 /* try to return the entry */
345 if ((e = id2entry_rw( be, id, rw )) != NULL ) {
349 Debug(LDAP_DEBUG_ANY,
350 "dn2entry_%s: no entry for valid id (%ld), dn \"%s\"\n",
351 rw ? "w" : "r", id, dn->bv_val);
353 /* must have been deleted from underneath us */
354 /* treat as if NOID was found */
357 /* caller doesn't care about match */
358 if( matched == NULL ) return NULL;
360 /* entry does not exist - see how much of the dn does exist */
361 if ( !be_issuffix( be, dn ) && (dnParent( dn, &pdn ), pdn.bv_len) ) {
362 /* get entry with reader lock */
363 if ((e = dn2entry_r( be, &pdn, matched )) != NULL )