1 /* dn2id.c - routines to deal with the dn2id index */
8 #include <sys/socket.h>
10 #include "back-ldbm.h"
11 #include "proto-back-ldbm.h"
13 extern struct dbcache *ldbm_cache_open();
14 extern char *dn_parent();
15 extern Datum ldbm_cache_fetch();
27 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
30 memset( &key, 0, sizeof( key ) );
31 memset( &data, 0, sizeof( data ) );
34 Debug( LDAP_DEBUG_TRACE, "=> dn2id_add( \"%s\", %ld )\n", dn, id, 0 );
36 if ( (db = ldbm_cache_open( be, "dn2id", LDBM_SUFFIX, LDBM_WRCREAT ))
38 Debug( LDAP_DEBUG_ANY, "Could not open/create dn2id%s\n",
44 dn_normalize_case( dn );
47 key.dsize = strlen( dn ) + 1;
48 data.dptr = (char *) &id;
49 data.dsize = sizeof(ID);
52 if ( li->li_flush_wrt ) flags |= LDBM_SYNC;
54 rc = ldbm_cache_store( db, key, data, flags );
57 ldbm_cache_close( be, db );
59 Debug( LDAP_DEBUG_TRACE, "<= dn2id_add %d\n", rc, 0, 0 );
69 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
75 memset( &key, 0, sizeof( key ) );
76 memset( &data, 0, sizeof( data ) );
80 Debug( LDAP_DEBUG_TRACE, "=> dn2id( \"%s\" )\n", dn, 0, 0 );
81 dn_normalize_case( dn );
83 /* first check the cache */
84 if ( (id = cache_find_entry_dn2id( be, &li->li_cache, dn )) != NOID ) {
86 Debug( LDAP_DEBUG_TRACE, "<= dn2id %d (in cache)\n", id,
91 if ( (db = ldbm_cache_open( be, "dn2id", LDBM_SUFFIX, LDBM_WRCREAT ))
94 Debug( LDAP_DEBUG_ANY, "<= dn2id could not open dn2id%s\n",
100 key.dsize = strlen( dn ) + 1;
102 data = ldbm_cache_fetch( db, key );
104 ldbm_cache_close( be, db );
107 if ( data.dptr == NULL ) {
108 Debug( LDAP_DEBUG_TRACE, "<= dn2id NOID\n", 0, 0, 0 );
112 (void) memcpy( (char *) &id, data.dptr, sizeof(ID) );
114 ldbm_datum_free( db->dbc_db, data );
116 Debug( LDAP_DEBUG_TRACE, "<= dn2id %d\n", id, 0, 0 );
126 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
132 memset( &key, 0, sizeof( key ) );
135 Debug( LDAP_DEBUG_TRACE, "=> dn2id_delete( \"%s\" )\n", dn, 0, 0 );
137 if ( (db = ldbm_cache_open( be, "dn2id", LDBM_SUFFIX, LDBM_WRCREAT ))
139 Debug( LDAP_DEBUG_ANY,
140 "<= dn2id_delete could not open dn2id%s\n", LDBM_SUFFIX,
145 dn_normalize_case( dn );
147 key.dsize = strlen( dn ) + 1;
149 rc = ldbm_cache_delete( db, key );
151 ldbm_cache_close( be, db );
153 Debug( LDAP_DEBUG_TRACE, "<= dn2id_delete %d\n", rc, 0, 0 );
158 * dn2entry - look up dn in the cache/indexes and return the corresponding
170 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
175 Debug(LDAP_DEBUG_TRACE, "dn2entry_%s: dn: %s\n",
176 rw ? "w" : "r", dn, 0);
178 if ( (id = dn2id( be, dn )) != NOID &&
179 (e = id2entry( be, id, rw )) != NULL )
185 /* stop when we get to the suffix */
186 if ( be_issuffix( be, dn ) ) {
190 /* entry does not exist - see how much of the dn does exist */
191 if ( (pdn = dn_parent( be, dn )) != NULL ) {
192 /* get entry with reader lock */
193 if ( (e = dn2entry_r( be, pdn, matched )) != NULL ) {
195 /* free entry with reader lock */
196 cache_return_entry_r( &li->li_cache, e );
206 if (e->e_state == ENTRY_STATE_DELETED)
209 if (strcmp(dn, e->e_dn) != 0)
212 /* return locked entry entry */
225 return( dn2entry( be, dn, matched, 0 ) );
235 return( dn2entry( be, dn, matched, 1 ) );