1 /* dn2id.c - routines to deal with the dn2id index */
4 * Copyright 1998-2000 The OpenLDAP Foundation, All Rights Reserved.
5 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
12 #include <ac/string.h>
13 #include <ac/socket.h>
16 #include "back-ldbm.h"
17 #include "proto-back-ldbm.h"
29 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
32 LDAP_LOG(( "backend", LDAP_LEVEL_ENTRY,
33 "dn2id_add: (%s):%ld\n", dn, id ));
35 Debug( LDAP_DEBUG_TRACE, "=> dn2id_add( \"%s\", %ld )\n", dn, id, 0 );
40 if ( (db = ldbm_cache_open( be, "dn2id", LDBM_SUFFIX, LDBM_WRCREAT ))
43 LDAP_LOG(( "backend", LDAP_LEVEL_ERR,
44 "dn2id_add: couldn't open/create dn2id%s\n", LDBM_SUFFIX ));
46 Debug( LDAP_DEBUG_ANY, "Could not open/create dn2id%s\n",
53 ldbm_datum_init( key );
54 key.dsize = strlen( dn ) + 2;
55 key.dptr = ch_malloc( key.dsize );
56 sprintf( key.dptr, "%c%s", DN_BASE_PREFIX, dn );
58 ldbm_datum_init( data );
59 data.dptr = (char *) &id;
60 data.dsize = sizeof(ID);
63 rc = ldbm_cache_store( db, key, data, flags );
68 char *pdn = dn_parent( NULL, dn );
71 ldbm_datum_init( key );
72 key.dsize = strlen( pdn ) + 2;
73 key.dptr = ch_malloc( key.dsize );
74 sprintf( key.dptr, "%c%s", DN_ONE_PREFIX, pdn );
75 rc = idl_insert_key( be, db, key, id );
82 char **subtree = dn_subtree( NULL, dn );
84 if( subtree != NULL ) {
86 for( i=0; subtree[i] != NULL; i++ ) {
87 ldbm_datum_init( key );
88 key.dsize = strlen( subtree[i] ) + 2;
89 key.dptr = ch_malloc( key.dsize );
90 sprintf( key.dptr, "%c%s",
91 DN_SUBTREE_PREFIX, subtree[i] );
93 rc = idl_insert_key( be, db, key, id );
100 charray_free( subtree );
104 ldbm_cache_close( be, db );
107 LDAP_LOG(( "backend", LDAP_LEVEL_ENTRY,
108 "dn2id_add: return %d\n", rc ));
110 Debug( LDAP_DEBUG_TRACE, "<= dn2id_add %d\n", rc, 0, 0 );
123 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
128 LDAP_LOG(( "backend", LDAP_LEVEL_ENTRY,
129 "dn2id: (%s)\n", dn ));
131 Debug( LDAP_DEBUG_TRACE, "=> dn2id( \"%s\" )\n", dn, 0, 0 );
136 /* first check the cache */
137 if ( (*idp = cache_find_entry_dn2id( be, &li->li_cache, dn )) != NOID ) {
139 LDAP_LOG(( "backend", LDAP_LEVEL_DETAIL1,
140 "dn2id: (%s)%ld in cache.\n", dn, *idp ));
142 Debug( LDAP_DEBUG_TRACE, "<= dn2id %ld (in cache)\n", *idp,
149 if ( (db = ldbm_cache_open( be, "dn2id", LDBM_SUFFIX, LDBM_WRCREAT ))
152 LDAP_LOG(( "backend", LDAP_LEVEL_ERR,
153 "dn2id: couldn't open dn2id%s\n", LDBM_SUFFIX ));
155 Debug( LDAP_DEBUG_ANY, "<= dn2id could not open dn2id%s\n",
159 * return code !0 if ldbm cache open failed;
160 * callers should handle this
166 ldbm_datum_init( key );
168 key.dsize = strlen( dn ) + 2;
169 key.dptr = ch_malloc( key.dsize );
170 sprintf( key.dptr, "%c%s", DN_BASE_PREFIX, dn );
172 data = ldbm_cache_fetch( db, key );
174 ldbm_cache_close( be, db );
178 if ( data.dptr == NULL ) {
180 LDAP_LOG(( "backend", LDAP_LEVEL_INFO,
181 "dn2id: (%s) NOID\n", dn ));
183 Debug( LDAP_DEBUG_TRACE, "<= dn2id NOID\n", 0, 0, 0 );
190 AC_MEMCPY( (char *) idp, data.dptr, sizeof(ID) );
192 assert( *idp != NOID );
194 ldbm_datum_free( db->dbc_db, data );
197 LDAP_LOG(( "backend", LDAP_LEVEL_ENTRY,
198 "dn2id: %ld\n", *idp ));
200 Debug( LDAP_DEBUG_TRACE, "<= dn2id %ld\n", *idp, 0, 0 );
218 LDAP_LOG(( "backend", LDAP_LEVEL_ENTRY,
219 "dn2idl: \"%c%s\"\n", prefix, dn ));
221 Debug( LDAP_DEBUG_TRACE, "=> dn2idl( \"%c%s\" )\n", prefix, dn, 0 );
224 assert( idlp != NULL );
227 if ( (db = ldbm_cache_open( be, "dn2id", LDBM_SUFFIX, LDBM_WRCREAT ))
230 LDAP_LOG(( "backend", LDAP_LEVEL_ERR,
231 "dn2idl: could not open dn2id%s\n", LDBM_SUFFIX ));
233 Debug( LDAP_DEBUG_ANY, "<= dn2idl could not open dn2id%s\n",
240 ldbm_datum_init( key );
242 key.dsize = strlen( dn ) + 2;
243 key.dptr = ch_malloc( key.dsize );
244 sprintf( key.dptr, "%c%s", prefix, dn );
246 *idlp = idl_fetch( be, db, key );
248 ldbm_cache_close( be, db );
268 LDAP_LOG(( "backend", LDAP_LEVEL_ENTRY,
269 "dn2id_delete: (%s)%ld\n", dn, id ));
271 Debug( LDAP_DEBUG_TRACE, "=> dn2id_delete( \"%s\", %ld )\n", dn, id, 0 );
275 assert( id != NOID );
277 if ( (db = ldbm_cache_open( be, "dn2id", LDBM_SUFFIX, LDBM_WRCREAT ))
280 LDAP_LOG(( "backend", LDAP_LEVEL_ERR,
281 "dn2id_delete: couldn't open db2id%s\n", LDBM_SUFFIX ));
283 Debug( LDAP_DEBUG_ANY,
284 "<= dn2id_delete could not open dn2id%s\n", LDBM_SUFFIX,
293 char *pdn = dn_parent( NULL, dn );
296 ldbm_datum_init( key );
297 key.dsize = strlen( pdn ) + 2;
298 key.dptr = ch_malloc( key.dsize );
299 sprintf( key.dptr, "%c%s", DN_ONE_PREFIX, pdn );
301 (void) idl_delete_key( be, db, key, id );
309 char **subtree = dn_subtree( NULL, dn );
311 if( subtree != NULL ) {
313 for( i=0; subtree[i] != NULL; i++ ) {
314 ldbm_datum_init( key );
315 key.dsize = strlen( subtree[i] ) + 2;
316 key.dptr = ch_malloc( key.dsize );
317 sprintf( key.dptr, "%c%s",
318 DN_SUBTREE_PREFIX, subtree[i] );
320 (void) idl_delete_key( be, db, key, id );
325 charray_free( subtree );
329 ldbm_datum_init( key );
331 key.dsize = strlen( dn ) + 2;
332 key.dptr = ch_malloc( key.dsize );
333 sprintf( key.dptr, "%c%s", DN_BASE_PREFIX, dn );
335 rc = ldbm_cache_delete( db, key );
339 ldbm_cache_close( be, db );
342 LDAP_LOG(( "backend", LDAP_LEVEL_ENTRY,
343 "dn2id_delete: return %d\n", rc ));
345 Debug( LDAP_DEBUG_TRACE, "<= dn2id_delete %d\n", rc, 0, 0 );
352 * dn2entry - look up dn in the cache/indexes and return the corresponding
369 LDAP_LOG(( "backend", LDAP_LEVEL_ENTRY,
370 "dn2entry_rw: %s entry %s\n", rw ? "w" : "r",
373 Debug(LDAP_DEBUG_TRACE, "dn2entry_%s: dn: \"%s\"\n",
374 rw ? "w" : "r", dn, 0);
378 if( matched != NULL ) {
379 /* caller cares about match */
383 if ( dn2id( be, dn, &id ) ) {
384 /* something bad happened to ldbm cache */
387 } else if ( id != NOID ) {
388 /* try to return the entry */
389 if ((e = id2entry_rw( be, id, rw )) != NULL ) {
394 LDAP_LOG(( "backend", LDAP_LEVEL_ERR,
395 "dn2entry_rw: no entry for valid id (%ld), dn (%s)\n",
398 Debug(LDAP_DEBUG_ANY,
399 "dn2entry_%s: no entry for valid id (%ld), dn \"%s\"\n",
400 rw ? "w" : "r", id, dn);
403 /* must have been deleted from underneath us */
404 /* treat as if NOID was found */
407 /* caller doesn't care about match */
408 if( matched == NULL ) return NULL;
410 /* entry does not exist - see how much of the dn does exist */
411 /* dn_parent checks returns NULL if dn is suffix */
412 if ( (pdn = dn_parent( be, dn )) != NULL ) {
413 /* get entry with reader lock */
414 if ( (e = dn2entry_r( be, pdn, matched )) != NULL ) {