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 ldbm_datum_init( key );
27 ldbm_datum_init( data );
29 Debug( LDAP_DEBUG_TRACE, "=> bdb2i_dn2id_add( \"%s\", %ld )\n", dn, id, 0 );
31 if ( (db = bdb2i_cache_open( be, "dn2id", BDB2_SUFFIX, LDBM_WRCREAT ))
33 Debug( LDAP_DEBUG_ANY, "Could not open/create dn2id%s\n",
39 (void) 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 = bdb2i_cache_store( db, key, data, flags );
52 bdb2i_cache_close( be, db );
54 Debug( LDAP_DEBUG_TRACE, "<= bdb2i_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, "=> bdb2i_dn2id( \"%s\" )\n", dn, 0, 0 );
74 (void) dn_normalize_case( dn );
76 /* first check the cache */
77 if ( (id = bdb2i_cache_find_entry_dn2id( be, &li->li_cache, dn )) != NOID ) {
79 Debug( LDAP_DEBUG_TRACE, "<= bdb2i_dn2id %ld (in cache)\n", id,
84 if ( (db = bdb2i_cache_open( be, "dn2id", BDB2_SUFFIX, LDBM_WRCREAT ))
87 Debug( LDAP_DEBUG_ANY, "<= bdb2i_dn2id could not open dn2id%s\n",
93 key.dsize = strlen( dn ) + 1;
95 data = bdb2i_cache_fetch( db, key );
97 bdb2i_cache_close( be, db );
100 if ( data.dptr == NULL ) {
101 Debug( LDAP_DEBUG_TRACE, "<= bdb2i_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, "<= bdb2i_dn2id %ld\n", id, 0, 0 );
123 ldbm_datum_init( key );
125 Debug( LDAP_DEBUG_TRACE, "=> bdb2i_dn2id_delete( \"%s\" )\n", dn, 0, 0 );
127 if ( (db = bdb2i_cache_open( be, "dn2id", BDB2_SUFFIX, LDBM_WRCREAT ))
129 Debug( LDAP_DEBUG_ANY,
130 "<= bdb2i_dn2id_delete could not open dn2id%s\n", BDB2_SUFFIX,
135 dn = ch_strdup( dn );
136 (void) dn_normalize_case( dn );
138 key.dsize = strlen( dn ) + 1;
140 rc = bdb2i_cache_delete( db, key );
144 bdb2i_cache_close( be, db );
146 Debug( LDAP_DEBUG_TRACE, "<= bdb2i_dn2id_delete %d\n", rc, 0, 0 );
151 * dn2entry - look up dn in the cache/indexes and return the corresponding
163 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
168 Debug(LDAP_DEBUG_TRACE, "dn2entry_%s: dn: \"%s\"\n",
169 rw ? "w" : "r", dn, 0);
171 if( matched != NULL ) {
172 /* caller cares about match */
176 if ( (id = bdb2i_dn2id( be, dn )) != NOID &&
177 (e = bdb2i_id2entry_rw( be, id, rw )) != NULL )
183 Debug(LDAP_DEBUG_ANY,
184 "dn2entry_%s: no entry for valid id (%ld), dn \"%s\"\n",
185 rw ? "w" : "r", id, dn);
186 /* must have been deleted from underneath us */
187 /* treat as if NOID was found */
190 /* caller doesn't care about match */
191 if( matched == NULL ) return NULL;
193 /* entry does not exist - see how much of the dn does exist */
194 /* dn_parent checks returns NULL if dn is suffix */
195 if ( (pdn = dn_parent( be, dn )) != NULL ) {
196 /* get entry with reader lock */
197 if ( (e = bdb2i_dn2entry_r( be, pdn, matched )) != NULL ) {