1 /* dn2id.c - routines to deal with the dn2id index */
11 #include "back-ldbm.h"
12 #include "proto-back-ldbm.h"
14 extern struct dbcache *ldbm_cache_open();
15 extern char *dn_parent();
16 extern Datum ldbm_cache_fetch();
28 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
30 #ifdef HAVE_BERKELEY_DB2
31 memset( &key, 0, sizeof( key ) );
32 memset( &data, 0, sizeof( data ) );
35 Debug( LDAP_DEBUG_TRACE, "=> dn2id_add( \"%s\", %ld )\n", dn, id, 0 );
37 if ( (db = ldbm_cache_open( be, "dn2id", LDBM_SUFFIX, LDBM_WRCREAT ))
39 Debug( LDAP_DEBUG_ANY, "Could not open/create dn2id%s\n",
45 dn_normalize_case( dn );
48 key.dsize = strlen( dn ) + 1;
49 data.dptr = (char *) &id;
50 data.dsize = sizeof(ID);
53 if ( li->li_dbcachewsync ) flags |= LDBM_SYNC;
55 rc = ldbm_cache_store( db, key, data, flags );
58 ldbm_cache_close( be, db );
60 Debug( LDAP_DEBUG_TRACE, "<= dn2id_add %d\n", rc, 0, 0 );
70 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
75 #ifdef HAVE_BERKELEY_DB2
76 memset( &key, 0, sizeof( key ) );
77 memset( &data, 0, sizeof( data ) );
81 Debug( LDAP_DEBUG_TRACE, "=> dn2id( \"%s\" )\n", dn, 0, 0 );
82 dn_normalize_case( dn );
84 /* first check the cache */
85 if ( (id = cache_find_entry_dn2id( be, &li->li_cache, dn )) != NOID ) {
87 Debug( LDAP_DEBUG_TRACE, "<= dn2id %d (in cache)\n", id,
92 if ( (db = ldbm_cache_open( be, "dn2id", LDBM_SUFFIX, LDBM_WRCREAT ))
95 Debug( LDAP_DEBUG_ANY, "<= dn2id could not open dn2id%s\n",
101 key.dsize = strlen( dn ) + 1;
103 data = ldbm_cache_fetch( db, key );
105 ldbm_cache_close( be, db );
108 if ( data.dptr == NULL ) {
109 Debug( LDAP_DEBUG_TRACE, "<= dn2id NOID\n", 0, 0, 0 );
113 (void) memcpy( (char *) &id, data.dptr, sizeof(ID) );
115 ldbm_datum_free( db->dbc_db, data );
117 Debug( LDAP_DEBUG_TRACE, "<= dn2id %d\n", id, 0, 0 );
127 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
132 #ifdef HAVE_BERKELEY_DB2
133 memset( &key, 0, sizeof( key ) );
136 Debug( LDAP_DEBUG_TRACE, "=> dn2id_delete( \"%s\" )\n", dn, 0, 0 );
138 if ( (db = ldbm_cache_open( be, "dn2id", LDBM_SUFFIX, LDBM_WRCREAT ))
140 Debug( LDAP_DEBUG_ANY,
141 "<= dn2id_delete could not open dn2id%s\n", LDBM_SUFFIX,
146 dn_normalize_case( dn );
148 key.dsize = strlen( dn ) + 1;
150 rc = ldbm_cache_delete( db, key );
152 ldbm_cache_close( be, db );
154 Debug( LDAP_DEBUG_TRACE, "<= dn2id_delete %d\n", rc, 0, 0 );
159 * dn2entry - look up dn in the cache/indexes and return the corresponding
171 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
176 Debug(LDAP_DEBUG_TRACE, "dn2entry_%s: dn: %s\n",
177 rw ? "w" : "r", dn, 0);
179 if ( (id = dn2id( be, dn )) != NOID &&
180 (e = id2entry( be, id, rw )) != NULL )
186 /* stop when we get to the suffix */
187 if ( be_issuffix( be, dn ) ) {
191 /* entry does not exist - see how much of the dn does exist */
192 if ( (pdn = dn_parent( be, dn )) != NULL ) {
193 /* get entry with reader lock */
194 if ( (e = dn2entry_r( be, pdn, matched )) != NULL ) {
196 /* free entry with reader lock */
197 cache_return_entry_r( &li->li_cache, e );
207 if (e->e_state == ENTRY_STATE_DELETED)
210 if (strcmp(dn, e->e_dn) != 0)
213 /* return locked entry entry */
226 return( dn2entry( be, dn, matched, 0 ) );
236 return( dn2entry( be, dn, matched, 1 ) );