1 /* dn2id.c - routines to deal with the dn2id index */
12 #include "back-bdb2.h"
13 #include "proto-back-bdb2.h"
25 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
27 Debug( LDAP_DEBUG_TRACE, "=> bdb2i_dn2id_add( \"%s\", %ld )\n", dn, id, 0 );
29 if ( (db = bdb2i_cache_open( be, "dn2id", BDB2_SUFFIX, LDBM_WRCREAT ))
31 Debug( LDAP_DEBUG_ANY, "Could not open/create dn2id%s\n",
36 ldbm_datum_init( key );
37 key.dsize = strlen( dn ) + 2;
38 key.dptr = ch_malloc( key.dsize );
39 sprintf( key.dptr, "%c%s", DN_BASE_PREFIX, dn );
41 ldbm_datum_init( data );
42 data.dptr = (char *) &id;
43 data.dsize = sizeof(ID);
46 rc = bdb2i_cache_store( db, key, data, flags );
51 char *pdn = dn_parent( NULL, dn );
54 ldbm_datum_init( key );
55 key.dsize = strlen( pdn ) + 2;
56 key.dptr = ch_malloc( key.dsize );
57 sprintf( key.dptr, "%c%s", DN_ONE_PREFIX, pdn );
58 rc = bdb2i_idl_insert_key( be, db, key, id );
65 char **subtree = dn_subtree( NULL, dn );
67 if( subtree != NULL ) {
69 for( i=0; subtree[i] != NULL; i++ ) {
70 ldbm_datum_init( key );
71 key.dsize = strlen( subtree[i] ) + 2;
72 key.dptr = ch_malloc( key.dsize );
73 sprintf( key.dptr, "%c%s", DN_SUBTREE_PREFIX, subtree[i] );
75 rc = bdb2i_idl_insert_key( be, db, key, id );
80 charray_free( subtree );
84 bdb2i_cache_close( be, db );
86 Debug( LDAP_DEBUG_TRACE, "<= bdb2i_dn2id_add %d\n", rc, 0, 0 );
96 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
101 Debug( LDAP_DEBUG_TRACE, "=> bdb2i_dn2id( \"%s\" )\n", dn, 0, 0 );
103 /* first check the cache */
104 if ( (id = bdb2i_cache_find_entry_dn2id( be, &li->li_cache, dn )) != NOID ) {
105 Debug( LDAP_DEBUG_TRACE, "<= bdb2i_dn2id %ld (in cache)\n", id,
110 if ( (db = bdb2i_cache_open( be, "dn2id", BDB2_SUFFIX, LDBM_WRCREAT ))
112 Debug( LDAP_DEBUG_ANY, "<= bdb2i_dn2id could not open dn2id%s\n",
117 ldbm_datum_init( key );
119 key.dsize = strlen( dn ) + 2;
120 key.dptr = ch_malloc( key.dsize );
121 sprintf( key.dptr, "%c%s", DN_BASE_PREFIX, dn );
123 data = bdb2i_cache_fetch( db, key );
125 bdb2i_cache_close( be, db );
129 if ( data.dptr == NULL ) {
130 Debug( LDAP_DEBUG_TRACE, "<= bdb2i_dn2id NOID\n", 0, 0, 0 );
134 (void) memcpy( (char *) &id, data.dptr, sizeof(ID) );
136 ldbm_datum_free( db->dbc_db, data );
138 Debug( LDAP_DEBUG_TRACE, "<= bdb2i_dn2id %ld\n", id, 0, 0 );
152 Debug( LDAP_DEBUG_TRACE, "=> bdb2i_dn2idl( \"%c%s\" )\n", prefix, dn, 0 );
154 if ( (db = bdb2i_cache_open( be, "dn2id", BDB2_SUFFIX, LDBM_WRCREAT ))
156 Debug( LDAP_DEBUG_ANY,
157 "<= bdb2i_dn2idl could not open dn2id%s\n", BDB2_SUFFIX,
162 ldbm_datum_init( key );
164 key.dsize = strlen( dn ) + 2;
165 key.dptr = ch_malloc( key.dsize );
166 sprintf( key.dptr, "%c%s", prefix, dn );
168 idl = bdb2i_idl_fetch( be, db, key );
172 bdb2i_cache_close( be, db );
188 Debug( LDAP_DEBUG_TRACE, "=> bdb2i_dn2id_delete( \"%s\", %ld )\n",
191 if ( (db = bdb2i_cache_open( be, "dn2id", BDB2_SUFFIX, LDBM_WRCREAT ))
193 Debug( LDAP_DEBUG_ANY,
194 "<= bdb2i_dn2id_delete could not open dn2id%s\n", BDB2_SUFFIX,
200 char *pdn = dn_parent( NULL, dn );
203 ldbm_datum_init( key );
204 key.dsize = strlen( pdn ) + 2;
205 key.dptr = ch_malloc( key.dsize );
206 sprintf( key.dptr, "%c%s", DN_ONE_PREFIX, pdn );
207 (void) bdb2i_idl_delete_key( be, db, key, id );
214 char **subtree = dn_subtree( NULL, dn );
216 if( subtree != NULL ) {
218 for( i=0; subtree[i] != NULL; i++ ) {
219 ldbm_datum_init( key );
220 key.dsize = strlen( subtree[i] ) + 2;
221 key.dptr = ch_malloc( key.dsize );
222 sprintf( key.dptr, "%c%s", DN_SUBTREE_PREFIX, subtree[i] );
224 (void) bdb2i_idl_delete_key( be, db, key, id );
229 charray_free( subtree );
233 ldbm_datum_init( key );
235 key.dsize = strlen( dn ) + 2;
236 key.dptr = ch_malloc( key.dsize );
237 sprintf( key.dptr, "%c%s", DN_BASE_PREFIX, dn );
239 rc = bdb2i_cache_delete( db, key );
243 bdb2i_cache_close( be, db );
245 Debug( LDAP_DEBUG_TRACE, "<= bdb2i_dn2id_delete %d\n", rc, 0, 0 );
250 * dn2entry - look up dn in the cache/indexes and return the corresponding
262 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
267 Debug(LDAP_DEBUG_TRACE, "dn2entry_%s: dn: \"%s\"\n",
268 rw ? "w" : "r", dn, 0);
270 if( matched != NULL ) {
271 /* caller cares about match */
275 if ( (id = bdb2i_dn2id( be, dn )) != NOID &&
276 (e = bdb2i_id2entry_rw( be, id, rw )) != NULL )
282 Debug(LDAP_DEBUG_ANY,
283 "dn2entry_%s: no entry for valid id (%ld), dn \"%s\"\n",
284 rw ? "w" : "r", id, dn);
285 /* must have been deleted from underneath us */
286 /* treat as if NOID was found */
289 /* caller doesn't care about match */
290 if( matched == NULL ) return NULL;
292 /* entry does not exist - see how much of the dn does exist */
293 /* dn_parent checks returns NULL if dn is suffix */
294 if ( (pdn = dn_parent( be, dn )) != NULL ) {
295 /* get entry with reader lock */
296 if ( (e = bdb2i_dn2entry_r( be, pdn, matched )) != NULL ) {