1 /* dn2id.c - routines to deal with the dn2id index */
11 #include "back-bdb2.h"
12 #include "proto-back-bdb2.h"
24 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
26 Debug( LDAP_DEBUG_TRACE, "=> bdb2i_dn2id_add( \"%s\", %ld )\n", dn, id, 0 );
28 if ( (db = bdb2i_cache_open( be, "dn2id", BDB2_SUFFIX, LDBM_WRCREAT ))
30 Debug( LDAP_DEBUG_ANY, "Could not open/create dn2id%s\n",
35 ldbm_datum_init( key );
36 key.dsize = strlen( dn ) + 2;
37 key.dptr = ch_malloc( key.dsize );
38 sprintf( key.dptr, "%c%s", DN_BASE_PREFIX, dn );
40 ldbm_datum_init( data );
41 data.dptr = (char *) &id;
42 data.dsize = sizeof(ID);
45 if ( li->li_dbcachewsync ) flags |= LDBM_SYNC;
47 rc = bdb2i_cache_store( db, key, data, flags );
52 char *pdn = dn_parent( NULL, dn );
55 ldbm_datum_init( key );
56 key.dsize = strlen( pdn ) + 2;
57 key.dptr = ch_malloc( key.dsize );
58 sprintf( key.dptr, "%c%s", DN_ONE_PREFIX, pdn );
59 rc = bdb2i_idl_insert_key( be, db, key, id );
66 char **subtree = dn_subtree( NULL, dn );
68 if( subtree != NULL ) {
70 for( i=0; subtree[i] != NULL; i++ ) {
71 ldbm_datum_init( key );
72 key.dsize = strlen( subtree[i] ) + 2;
73 key.dptr = ch_malloc( key.dsize );
74 sprintf( key.dptr, "%c%s", DN_SUBTREE_PREFIX, subtree[i] );
76 rc = bdb2i_idl_insert_key( be, db, key, id );
81 charray_free( subtree );
85 bdb2i_cache_close( be, db );
87 Debug( LDAP_DEBUG_TRACE, "<= bdb2i_dn2id_add %d\n", rc, 0, 0 );
97 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
102 Debug( LDAP_DEBUG_TRACE, "=> bdb2i_dn2id( \"%s\" )\n", dn, 0, 0 );
104 /* first check the cache */
105 if ( (id = bdb2i_cache_find_entry_dn2id( be, &li->li_cache, dn )) != NOID ) {
106 Debug( LDAP_DEBUG_TRACE, "<= bdb2i_dn2id %ld (in cache)\n", id,
111 if ( (db = bdb2i_cache_open( be, "dn2id", BDB2_SUFFIX, LDBM_WRCREAT ))
113 Debug( LDAP_DEBUG_ANY, "<= bdb2i_dn2id could not open dn2id%s\n",
118 ldbm_datum_init( key );
120 key.dsize = strlen( dn ) + 2;
121 key.dptr = ch_malloc( key.dsize );
122 sprintf( key.dptr, "%c%s", DN_BASE_PREFIX, dn );
124 data = bdb2i_cache_fetch( db, key );
126 bdb2i_cache_close( be, db );
130 if ( data.dptr == NULL ) {
131 Debug( LDAP_DEBUG_TRACE, "<= bdb2i_dn2id NOID\n", 0, 0, 0 );
135 (void) memcpy( (char *) &id, data.dptr, sizeof(ID) );
137 ldbm_datum_free( db->dbc_db, data );
139 Debug( LDAP_DEBUG_TRACE, "<= bdb2i_dn2id %ld\n", id, 0, 0 );
153 Debug( LDAP_DEBUG_TRACE, "=> bdb2i_dn2idl( \"%c%s\" )\n", prefix, dn, 0 );
155 if ( (db = bdb2i_cache_open( be, "dn2id", BDB2_SUFFIX, LDBM_WRCREAT ))
157 Debug( LDAP_DEBUG_ANY,
158 "<= bdb2i_dn2idl could not open dn2id%s\n", BDB2_SUFFIX,
163 ldbm_datum_init( key );
165 key.dsize = strlen( dn ) + 2;
166 key.dptr = ch_malloc( key.dsize );
167 sprintf( key.dptr, "%c%s", prefix, dn );
169 idl = bdb2i_idl_fetch( be, db, key );
173 bdb2i_cache_close( be, db );
188 Debug( LDAP_DEBUG_TRACE, "=> bdb2i_dn2id_delete( \"%s\" )\n", dn, 0, 0 );
190 if ( (db = bdb2i_cache_open( be, "dn2id", BDB2_SUFFIX, LDBM_WRCREAT ))
192 Debug( LDAP_DEBUG_ANY,
193 "<= bdb2i_dn2id_delete could not open dn2id%s\n", BDB2_SUFFIX,
198 ldbm_datum_init( key );
200 key.dsize = strlen( dn ) + 2;
201 key.dptr = ch_malloc( key.dsize );
202 sprintf( key.dptr, "%c%s", DN_BASE_PREFIX, dn );
204 rc = bdb2i_cache_delete( db, key );
208 bdb2i_cache_close( be, db );
210 Debug( LDAP_DEBUG_TRACE, "<= bdb2i_dn2id_delete %d\n", rc, 0, 0 );
215 * dn2entry - look up dn in the cache/indexes and return the corresponding
227 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
232 Debug(LDAP_DEBUG_TRACE, "dn2entry_%s: dn: \"%s\"\n",
233 rw ? "w" : "r", dn, 0);
235 if( matched != NULL ) {
236 /* caller cares about match */
240 if ( (id = bdb2i_dn2id( be, dn )) != NOID &&
241 (e = bdb2i_id2entry_rw( be, id, rw )) != NULL )
247 Debug(LDAP_DEBUG_ANY,
248 "dn2entry_%s: no entry for valid id (%ld), dn \"%s\"\n",
249 rw ? "w" : "r", id, dn);
250 /* must have been deleted from underneath us */
251 /* treat as if NOID was found */
254 /* caller doesn't care about match */
255 if( matched == NULL ) return NULL;
257 /* entry does not exist - see how much of the dn does exist */
258 /* dn_parent checks returns NULL if dn is suffix */
259 if ( (pdn = dn_parent( be, dn )) != NULL ) {
260 /* get entry with reader lock */
261 if ( (e = bdb2i_dn2entry_r( be, pdn, matched )) != NULL ) {