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 );
33 if ( (db = ldbm_cache_open( be, "dn2id", LDBM_SUFFIX, LDBM_WRCREAT ))
35 Debug( LDAP_DEBUG_ANY, "Could not open/create dn2id%s\n",
40 ldbm_datum_init( key );
41 key.dsize = strlen( dn ) + 2;
42 key.dptr = ch_malloc( key.dsize );
43 sprintf( key.dptr, "%c%s", DN_BASE_PREFIX, dn );
45 ldbm_datum_init( data );
46 data.dptr = (char *) &id;
47 data.dsize = sizeof(ID);
50 if ( li->li_dbcachewsync ) flags |= LDBM_SYNC;
52 rc = ldbm_cache_store( db, key, data, flags );
57 char *pdn = dn_parent( NULL, dn );
60 ldbm_datum_init( key );
61 key.dsize = strlen( pdn ) + 2;
62 key.dptr = ch_malloc( key.dsize );
63 sprintf( key.dptr, "%c%s", DN_ONE_PREFIX, pdn );
64 rc = idl_insert_key( be, db, key, id );
71 char **subtree = dn_subtree( NULL, dn );
73 if( subtree != NULL ) {
75 for( i=0; subtree[i] != NULL; i++ ) {
76 ldbm_datum_init( key );
77 key.dsize = strlen( subtree[i] ) + 2;
78 key.dptr = ch_malloc( key.dsize );
79 sprintf( key.dptr, "%c%s",
80 DN_SUBTREE_PREFIX, subtree[i] );
82 rc = idl_insert_key( be, db, key, id );
89 charray_free( subtree );
93 ldbm_cache_close( be, db );
95 Debug( LDAP_DEBUG_TRACE, "<= dn2id_add %d\n", rc, 0, 0 );
105 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
110 Debug( LDAP_DEBUG_TRACE, "=> dn2id( \"%s\" )\n", dn, 0, 0 );
112 /* first check the cache */
113 if ( (id = cache_find_entry_dn2id( be, &li->li_cache, dn )) != NOID ) {
114 Debug( LDAP_DEBUG_TRACE, "<= dn2id %ld (in cache)\n", id,
119 if ( (db = ldbm_cache_open( be, "dn2id", LDBM_SUFFIX, LDBM_WRCREAT ))
121 Debug( LDAP_DEBUG_ANY, "<= dn2id could not open dn2id%s\n",
126 ldbm_datum_init( key );
128 key.dsize = strlen( dn ) + 2;
129 key.dptr = ch_malloc( key.dsize );
130 sprintf( key.dptr, "%c%s", DN_BASE_PREFIX, dn );
132 data = ldbm_cache_fetch( db, key );
134 ldbm_cache_close( be, db );
138 if ( data.dptr == NULL ) {
139 Debug( LDAP_DEBUG_TRACE, "<= dn2id NOID\n", 0, 0, 0 );
143 (void) memcpy( (char *) &id, data.dptr, sizeof(ID) );
145 assert( id != NOID );
147 ldbm_datum_free( db->dbc_db, data );
149 Debug( LDAP_DEBUG_TRACE, "<= dn2id %ld\n", id, 0, 0 );
164 Debug( LDAP_DEBUG_TRACE, "=> dn2idl( \"%c%s\" )\n", prefix, dn, 0 );
166 if ( (db = ldbm_cache_open( be, "dn2id", LDBM_SUFFIX, LDBM_WRCREAT ))
168 Debug( LDAP_DEBUG_ANY, "<= dn2idl could not open dn2id%s\n",
173 ldbm_datum_init( key );
175 key.dsize = strlen( dn ) + 2;
176 key.dptr = ch_malloc( key.dsize );
177 sprintf( key.dptr, "%c%s", prefix, dn );
179 idl = idl_fetch( be, db, key );
181 ldbm_cache_close( be, db );
200 Debug( LDAP_DEBUG_TRACE, "=> dn2id_delete( \"%s\", %ld )\n", dn, id, 0 );
202 assert( id != NOID );
204 if ( (db = ldbm_cache_open( be, "dn2id", LDBM_SUFFIX, LDBM_WRCREAT ))
206 Debug( LDAP_DEBUG_ANY,
207 "<= dn2id_delete could not open dn2id%s\n", LDBM_SUFFIX,
214 char *pdn = dn_parent( NULL, dn );
217 ldbm_datum_init( key );
218 key.dsize = strlen( pdn ) + 2;
219 key.dptr = ch_malloc( key.dsize );
220 sprintf( key.dptr, "%c%s", DN_ONE_PREFIX, pdn );
222 (void) idl_delete_key( be, db, key, id );
230 char **subtree = dn_subtree( NULL, dn );
232 if( subtree != NULL ) {
234 for( i=0; subtree[i] != NULL; i++ ) {
235 ldbm_datum_init( key );
236 key.dsize = strlen( subtree[i] ) + 2;
237 key.dptr = ch_malloc( key.dsize );
238 sprintf( key.dptr, "%c%s",
239 DN_SUBTREE_PREFIX, subtree[i] );
241 (void) idl_delete_key( be, db, key, id );
246 charray_free( subtree );
250 ldbm_datum_init( key );
252 key.dsize = strlen( dn ) + 2;
253 key.dptr = ch_malloc( key.dsize );
254 sprintf( key.dptr, "%c%s", DN_BASE_PREFIX, dn );
256 rc = ldbm_cache_delete( db, key );
260 ldbm_cache_close( be, db );
262 Debug( LDAP_DEBUG_TRACE, "<= dn2id_delete %d\n", rc, 0, 0 );
267 * dn2entry - look up dn in the cache/indexes and return the corresponding
279 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
284 Debug(LDAP_DEBUG_TRACE, "dn2entry_%s: dn: \"%s\"\n",
285 rw ? "w" : "r", dn, 0);
287 if( matched != NULL ) {
288 /* caller cares about match */
292 if ( (id = dn2id( be, dn )) != NOID &&
293 (e = id2entry_rw( be, id, rw )) != NULL )
299 Debug(LDAP_DEBUG_ANY,
300 "dn2entry_%s: no entry for valid id (%ld), dn \"%s\"\n",
301 rw ? "w" : "r", id, dn);
302 /* must have been deleted from underneath us */
303 /* treat as if NOID was found */
306 /* caller doesn't care about match */
307 if( matched == NULL ) return NULL;
309 /* entry does not exist - see how much of the dn does exist */
310 /* dn_parent checks returns NULL if dn is suffix */
311 if ( (pdn = dn_parent( be, dn )) != NULL ) {
312 /* get entry with reader lock */
313 if ( (e = dn2entry_r( be, pdn, matched )) != NULL ) {