1 /* dn2id.c - routines to deal with the dn2id index */
3 * Copyright 1998-1999 The OpenLDAP Foundation, All Rights Reserved.
4 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
11 #include <ac/string.h>
12 #include <ac/socket.h>
15 #include "back-ldbm.h"
16 #include "proto-back-ldbm.h"
28 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
30 Debug( LDAP_DEBUG_TRACE, "=> dn2id_add( \"%s\", %ld )\n", dn, id, 0 );
32 if ( (db = ldbm_cache_open( be, "dn2id", LDBM_SUFFIX, LDBM_WRCREAT ))
34 Debug( LDAP_DEBUG_ANY, "Could not open/create dn2id%s\n",
39 ldbm_datum_init( key );
40 key.dsize = strlen( dn ) + 2;
41 key.dptr = ch_malloc( key.dsize );
42 sprintf( key.dptr, "%c%s", DN_BASE_PREFIX, dn );
44 ldbm_datum_init( data );
45 data.dptr = (char *) &id;
46 data.dsize = sizeof(ID);
49 if ( li->li_dbcachewsync ) flags |= LDBM_SYNC;
51 rc = ldbm_cache_store( db, key, data, flags );
56 char *pdn = dn_parent( NULL, dn );
59 ldbm_datum_init( key );
60 key.dsize = strlen( pdn ) + 2;
61 key.dptr = ch_malloc( key.dsize );
62 sprintf( key.dptr, "%c%s", DN_ONE_PREFIX, pdn );
63 rc = idl_insert_key( be, db, key, id );
70 char **subtree = dn_subtree( NULL, dn );
72 if( subtree != NULL ) {
74 for( i=0; subtree[i] != NULL; i++ ) {
75 ldbm_datum_init( key );
76 key.dsize = strlen( subtree[i] ) + 2;
77 key.dptr = ch_malloc( key.dsize );
78 sprintf( key.dptr, "%c%s",
79 DN_SUBTREE_PREFIX, subtree[i] );
81 rc = idl_insert_key( be, db, key, id );
88 charray_free( subtree );
92 ldbm_cache_close( be, db );
94 Debug( LDAP_DEBUG_TRACE, "<= dn2id_add %d\n", rc, 0, 0 );
104 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
109 Debug( LDAP_DEBUG_TRACE, "=> dn2id( \"%s\" )\n", dn, 0, 0 );
111 /* first check the cache */
112 if ( (id = cache_find_entry_dn2id( be, &li->li_cache, dn )) != NOID ) {
113 Debug( LDAP_DEBUG_TRACE, "<= dn2id %ld (in cache)\n", id,
118 if ( (db = ldbm_cache_open( be, "dn2id", LDBM_SUFFIX, LDBM_WRCREAT ))
120 Debug( LDAP_DEBUG_ANY, "<= dn2id could not open dn2id%s\n",
125 ldbm_datum_init( key );
127 key.dsize = strlen( dn ) + 2;
128 key.dptr = ch_malloc( key.dsize );
129 sprintf( key.dptr, "%c%s", DN_BASE_PREFIX, dn );
131 data = ldbm_cache_fetch( db, key );
133 ldbm_cache_close( be, db );
137 if ( data.dptr == NULL ) {
138 Debug( LDAP_DEBUG_TRACE, "<= dn2id NOID\n", 0, 0, 0 );
142 (void) memcpy( (char *) &id, data.dptr, sizeof(ID) );
144 ldbm_datum_free( db->dbc_db, data );
146 Debug( LDAP_DEBUG_TRACE, "<= dn2id %ld\n", id, 0, 0 );
161 Debug( LDAP_DEBUG_TRACE, "=> dn2idl( \"%c%s\" )\n", prefix, dn, 0 );
163 if ( (db = ldbm_cache_open( be, "dn2id", LDBM_SUFFIX, LDBM_WRCREAT ))
165 Debug( LDAP_DEBUG_ANY, "<= dn2idl could not open dn2id%s\n",
170 ldbm_datum_init( key );
172 key.dsize = strlen( dn ) + 2;
173 key.dptr = ch_malloc( key.dsize );
174 sprintf( key.dptr, "%c%s", prefix, dn );
176 idl = idl_fetch( be, db, key );
178 ldbm_cache_close( be, db );
197 Debug( LDAP_DEBUG_TRACE, "=> dn2id_delete( \"%s\", %ld )\n", dn, id, 0 );
199 if ( (db = ldbm_cache_open( be, "dn2id", LDBM_SUFFIX, LDBM_WRCREAT ))
201 Debug( LDAP_DEBUG_ANY,
202 "<= dn2id_delete could not open dn2id%s\n", LDBM_SUFFIX,
209 char *pdn = dn_parent( NULL, dn );
212 ldbm_datum_init( key );
213 key.dsize = strlen( pdn ) + 2;
214 key.dptr = ch_malloc( key.dsize );
215 sprintf( key.dptr, "%c%s", DN_ONE_PREFIX, pdn );
216 (void) idl_delete_key( be, db, key, id );
223 char **subtree = dn_subtree( NULL, dn );
225 if( subtree != NULL ) {
227 for( i=0; subtree[i] != NULL; i++ ) {
228 ldbm_datum_init( key );
229 key.dsize = strlen( subtree[i] ) + 2;
230 key.dptr = ch_malloc( key.dsize );
231 sprintf( key.dptr, "%c%s",
232 DN_SUBTREE_PREFIX, subtree[i] );
234 (void) idl_delete_key( be, db, key, id );
239 charray_free( subtree );
243 ldbm_datum_init( key );
245 key.dsize = strlen( dn ) + 2;
246 key.dptr = ch_malloc( key.dsize );
247 sprintf( key.dptr, "%c%s", DN_BASE_PREFIX, dn );
249 rc = ldbm_cache_delete( db, key );
253 ldbm_cache_close( be, db );
255 Debug( LDAP_DEBUG_TRACE, "<= dn2id_delete %d\n", rc, 0, 0 );
260 * dn2entry - look up dn in the cache/indexes and return the corresponding
272 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
277 Debug(LDAP_DEBUG_TRACE, "dn2entry_%s: dn: \"%s\"\n",
278 rw ? "w" : "r", dn, 0);
280 if( matched != NULL ) {
281 /* caller cares about match */
285 if ( (id = dn2id( be, dn )) != NOID &&
286 (e = id2entry_rw( be, id, rw )) != NULL )
292 Debug(LDAP_DEBUG_ANY,
293 "dn2entry_%s: no entry for valid id (%ld), dn \"%s\"\n",
294 rw ? "w" : "r", id, dn);
295 /* must have been deleted from underneath us */
296 /* treat as if NOID was found */
299 /* caller doesn't care about match */
300 if( matched == NULL ) return NULL;
302 /* entry does not exist - see how much of the dn does exist */
303 /* dn_parent checks returns NULL if dn is suffix */
304 if ( (pdn = dn_parent( be, dn )) != NULL ) {
305 /* get entry with reader lock */
306 if ( (e = dn2entry_r( be, pdn, matched )) != NULL ) {