1 /* dn2id.c - routines to deal with the dn2id index */
6 #include <sys/socket.h>
10 extern struct dbcache *ldbm_cache_open();
11 extern Entry *cache_find_entry_dn();
12 extern Entry *id2entry();
13 extern char *dn_parent();
14 extern Datum ldbm_cache_fetch();
27 Debug( LDAP_DEBUG_TRACE, "=> dn2id_add( \"%s\", %ld )\n", dn, id, 0 );
29 if ( (db = ldbm_cache_open( be, "dn2id", LDBM_SUFFIX, LDBM_WRCREAT ))
31 Debug( LDAP_DEBUG_ANY, "Could not open/create dn2id%s\n",
37 dn_normalize_case( dn );
40 key.dsize = strlen( dn ) + 1;
41 data.dptr = (char *) &id;
42 data.dsize = sizeof(ID);
44 rc = ldbm_cache_store( db, key, data, LDBM_INSERT );
47 ldbm_cache_close( be, db );
49 Debug( LDAP_DEBUG_TRACE, "<= dn2id_add %d\n", rc, 0, 0 );
59 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
65 Debug( LDAP_DEBUG_TRACE, "=> dn2id( \"%s\" )\n", dn, 0, 0 );
68 dn_normalize_case( dn );
70 /* first check the cache */
71 if ( (e = cache_find_entry_dn( &li->li_cache, dn )) != NULL ) {
74 Debug( LDAP_DEBUG_TRACE, "<= dn2id %d (in cache)\n", e->e_id,
76 cache_return_entry( &li->li_cache, e );
81 if ( (db = ldbm_cache_open( be, "dn2id", LDBM_SUFFIX, LDBM_WRCREAT ))
84 Debug( LDAP_DEBUG_ANY, "<= dn2id could not open dn2id%s\n",
90 key.dsize = strlen( dn ) + 1;
92 data = ldbm_cache_fetch( db, key );
94 ldbm_cache_close( be, db );
97 if ( data.dptr == NULL ) {
98 Debug( LDAP_DEBUG_TRACE, "<= dn2id NOID\n", 0, 0, 0 );
102 (void) memcpy( (char *) &id, data.dptr, sizeof(ID) );
104 ldbm_datum_free( db->dbc_db, data );
106 Debug( LDAP_DEBUG_TRACE, "<= dn2id %d\n", id, 0, 0 );
116 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
121 Debug( LDAP_DEBUG_TRACE, "=> dn2id_delete( \"%s\" )\n", dn, 0, 0 );
123 if ( (db = ldbm_cache_open( be, "dn2id", LDBM_SUFFIX, LDBM_WRCREAT ))
125 Debug( LDAP_DEBUG_ANY,
126 "<= dn2id_delete could not open dn2id%s\n", LDBM_SUFFIX,
131 dn_normalize_case( dn );
133 key.dsize = strlen( dn ) + 1;
135 rc = ldbm_cache_delete( db, key );
137 ldbm_cache_close( be, db );
139 Debug( LDAP_DEBUG_TRACE, "<= dn2id_delete %d\n", rc, 0, 0 );
144 * dn2entry - look up dn in the cache/indexes and return the corresponding
155 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
160 if ( (id = dn2id( be, dn )) != NOID && (e = id2entry( be, id ))
166 /* stop when we get to the suffix */
167 if ( be_issuffix( be, dn ) ) {
171 /* entry does not exist - see how much of the dn does exist */
172 if ( (pdn = dn_parent( be, dn )) != NULL ) {
173 if ( (e = dn2entry( be, pdn, matched )) != NULL ) {
175 cache_return_entry( &li->li_cache, e );