1 /* dn2id.c - routines to deal with the dn2id index */
11 #include "back-ldbm.h"
12 #include "proto-back-ldbm.h"
24 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
26 #ifdef HAVE_BERKELEY_DB2
27 memset( &key, 0, sizeof( key ) );
28 memset( &data, 0, sizeof( data ) );
31 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",
41 dn_normalize_case( dn );
44 key.dsize = strlen( dn ) + 1;
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 );
54 ldbm_cache_close( be, db );
56 Debug( LDAP_DEBUG_TRACE, "<= dn2id_add %d\n", rc, 0, 0 );
66 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
71 #ifdef HAVE_BERKELEY_DB2
72 memset( &key, 0, sizeof( key ) );
73 memset( &data, 0, sizeof( data ) );
77 Debug( LDAP_DEBUG_TRACE, "=> dn2id( \"%s\" )\n", dn, 0, 0 );
78 dn_normalize_case( dn );
80 /* first check the cache */
81 if ( (id = cache_find_entry_dn2id( be, &li->li_cache, dn )) != NOID ) {
83 Debug( LDAP_DEBUG_TRACE, "<= dn2id %lu (in cache)\n", id,
88 if ( (db = ldbm_cache_open( be, "dn2id", LDBM_SUFFIX, LDBM_WRCREAT ))
91 Debug( LDAP_DEBUG_ANY, "<= dn2id could not open dn2id%s\n",
97 key.dsize = strlen( dn ) + 1;
99 data = ldbm_cache_fetch( db, key );
101 ldbm_cache_close( be, db );
104 if ( data.dptr == NULL ) {
105 Debug( LDAP_DEBUG_TRACE, "<= dn2id NOID\n", 0, 0, 0 );
109 (void) memcpy( (char *) &id, data.dptr, sizeof(ID) );
111 ldbm_datum_free( db->dbc_db, data );
113 Debug( LDAP_DEBUG_TRACE, "<= dn2id %lu\n", id, 0, 0 );
123 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
128 #ifdef HAVE_BERKELEY_DB2
129 memset( &key, 0, sizeof( key ) );
132 Debug( LDAP_DEBUG_TRACE, "=> dn2id_delete( \"%s\" )\n", dn, 0, 0 );
134 if ( (db = ldbm_cache_open( be, "dn2id", LDBM_SUFFIX, LDBM_WRCREAT ))
136 Debug( LDAP_DEBUG_ANY,
137 "<= dn2id_delete could not open dn2id%s\n", LDBM_SUFFIX,
142 dn_normalize_case( dn );
144 key.dsize = strlen( dn ) + 1;
146 rc = ldbm_cache_delete( db, key );
148 ldbm_cache_close( be, db );
150 Debug( LDAP_DEBUG_TRACE, "<= dn2id_delete %d\n", rc, 0, 0 );
155 * dn2entry - look up dn in the cache/indexes and return the corresponding
167 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
172 Debug(LDAP_DEBUG_TRACE, "dn2entry_%s: dn: %s\n",
173 rw ? "w" : "r", dn, 0);
177 if ( (id = dn2id( be, dn )) != NOID &&
178 (e = id2entry( be, id, rw )) != NULL )
183 /* stop when we get to the suffix */
184 if ( be_issuffix( be, dn ) ) {
188 /* entry does not exist - see how much of the dn does exist */
189 if ( (pdn = dn_parent( be, dn )) != NULL ) {
190 /* get entry with reader lock */
191 if ( (e = dn2entry_r( be, pdn, matched )) != NULL ) {
193 /* free entry with reader lock */
194 cache_return_entry_r( &li->li_cache, e );
210 return( dn2entry( be, dn, matched, 0 ) );
220 return( dn2entry( be, dn, matched, 1 ) );