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 ldbm_datum_init( key );
27 ldbm_datum_init( data );
29 Debug( LDAP_DEBUG_TRACE, "=> dn2id_add( \"%s\", %ld )\n", dn, id, 0 );
31 if ( (db = ldbm_cache_open( be, "dn2id", LDBM_SUFFIX, LDBM_WRCREAT ))
33 Debug( LDAP_DEBUG_ANY, "Could not open/create dn2id%s\n",
39 dn_normalize_case( dn );
42 key.dsize = strlen( dn ) + 1;
43 data.dptr = (char *) &id;
44 data.dsize = sizeof(ID);
47 if ( li->li_dbcachewsync ) flags |= LDBM_SYNC;
49 rc = ldbm_cache_store( db, key, data, flags );
52 ldbm_cache_close( be, db );
54 Debug( LDAP_DEBUG_TRACE, "<= dn2id_add %d\n", rc, 0, 0 );
64 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
69 ldbm_datum_init( key );
70 ldbm_datum_init( data );
73 Debug( LDAP_DEBUG_TRACE, "=> dn2id( \"%s\" )\n", dn, 0, 0 );
74 dn_normalize_case( dn );
76 /* first check the cache */
77 if ( (id = cache_find_entry_dn2id( be, &li->li_cache, dn )) != NOID ) {
79 Debug( LDAP_DEBUG_TRACE, "<= dn2id %lu (in cache)\n", id,
84 if ( (db = ldbm_cache_open( be, "dn2id", LDBM_SUFFIX, LDBM_WRCREAT ))
87 Debug( LDAP_DEBUG_ANY, "<= dn2id could not open dn2id%s\n",
93 key.dsize = strlen( dn ) + 1;
95 data = ldbm_cache_fetch( db, key );
97 ldbm_cache_close( be, db );
100 if ( data.dptr == NULL ) {
101 Debug( LDAP_DEBUG_TRACE, "<= dn2id NOID\n", 0, 0, 0 );
105 (void) memcpy( (char *) &id, data.dptr, sizeof(ID) );
107 ldbm_datum_free( db->dbc_db, data );
109 Debug( LDAP_DEBUG_TRACE, "<= dn2id %lu\n", id, 0, 0 );
119 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
124 ldbm_datum_init( key );
126 Debug( LDAP_DEBUG_TRACE, "=> dn2id_delete( \"%s\" )\n", dn, 0, 0 );
128 if ( (db = ldbm_cache_open( be, "dn2id", LDBM_SUFFIX, LDBM_WRCREAT ))
130 Debug( LDAP_DEBUG_ANY,
131 "<= dn2id_delete could not open dn2id%s\n", LDBM_SUFFIX,
136 dn = ch_strdup( dn );
137 dn_normalize_case( dn );
139 key.dsize = strlen( dn ) + 1;
141 rc = ldbm_cache_delete( db, key );
145 ldbm_cache_close( be, db );
147 Debug( LDAP_DEBUG_TRACE, "<= dn2id_delete %d\n", rc, 0, 0 );
152 * dn2entry - look up dn in the cache/indexes and return the corresponding
164 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
169 Debug(LDAP_DEBUG_TRACE, "dn2entry_%s: dn: \"%s\"\n",
170 rw ? "w" : "r", dn, 0);
174 if ( (id = dn2id( be, dn )) != NOID &&
175 (e = id2entry( be, id, rw )) != NULL )
180 /* stop when we get to the suffix */
181 if ( be_issuffix( be, dn ) ) {
185 /* entry does not exist - see how much of the dn does exist */
186 if ( (pdn = dn_parent( be, dn )) != NULL ) {
187 /* get entry with reader lock */
188 if ( (e = dn2entry_r( be, pdn, matched )) != NULL ) {
189 if(*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 ) );