1 /* dn2id.c - routines to deal with the dn2id index */
3 * Copyright 1998-1999 The OpenLDAP Foundation, All Rights Reserved.
4 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
11 #include <ac/string.h>
12 #include <ac/socket.h>
15 #include "back-ldbm.h"
16 #include "proto-back-ldbm.h"
28 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
30 ldbm_datum_init( key );
31 ldbm_datum_init( data );
33 Debug( LDAP_DEBUG_TRACE, "=> dn2id_add( \"%s\", %ld )\n", dn, id, 0 );
35 if ( (db = ldbm_cache_open( be, "dn2id", LDBM_SUFFIX, LDBM_WRCREAT ))
37 Debug( LDAP_DEBUG_ANY, "Could not open/create dn2id%s\n",
44 key.dsize = strlen( key.dptr ) + 1;
46 key.dsize = strlen( dn ) + 2;
47 key.dptr = ch_malloc( key.dsize );
48 sprintf( key.dptr, "%c%s", DN_ENTRY_PREFIX, dn );
51 data.dptr = (char *) &id;
52 data.dsize = sizeof(ID);
55 if ( li->li_dbcachewsync ) flags |= LDBM_SYNC;
57 rc = ldbm_cache_store( db, key, data, flags );
63 char *pdn = dn_parent( NULL, dn );
66 key.dsize = strlen( pdn ) + 2;
67 key.dptr = ch_malloc( key.dsize );
68 sprintf( key.dptr, "%c%s", DN_PARENT_PREFIX, pdn );
69 rc = idl_insert_key( be, db, key, id );
75 char **subtree = dn_subtree( NULL, dn );
77 if( subtree != NULL ) {
79 for( i=0; subtree[i] != NULL; i++ ) {
80 key.dsize = strlen( subtree[i] ) + 2;
81 key.dptr = ch_malloc( key.dsize );
82 sprintf( key.dptr, "%c%s", DN_SUBTREE_PREFIX, subtree[i] );
84 rc = idl_insert_key( be, db, key, id );
91 charray_free( subtree );
97 ldbm_cache_close( be, db );
99 Debug( LDAP_DEBUG_TRACE, "<= dn2id_add %d\n", rc, 0, 0 );
109 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
114 ldbm_datum_init( key );
115 ldbm_datum_init( data );
117 Debug( LDAP_DEBUG_TRACE, "=> dn2id( \"%s\" )\n", dn, 0, 0 );
119 /* first check the cache */
120 if ( (id = cache_find_entry_dn2id( be, &li->li_cache, dn )) != NOID ) {
121 Debug( LDAP_DEBUG_TRACE, "<= dn2id %ld (in cache)\n", id,
126 if ( (db = ldbm_cache_open( be, "dn2id", LDBM_SUFFIX, LDBM_WRCREAT ))
128 Debug( LDAP_DEBUG_ANY, "<= dn2id could not open dn2id%s\n",
135 char *pdn = dn_parent( NULL, dn );
138 key.dsize = strlen( pdn ) + 2;
139 key.dptr = ch_malloc( key.dsize );
140 sprintf( key.dptr, "%c%s", DN_PARENT_PREFIX, pdn );
141 (void) idl_delete_key( be, db, key, id );
148 char **subtree = dn_subtree( NULL, dn );
150 if( subtree != NULL ) {
152 for( i=0; subtree[i] != NULL; i++ ) {
153 key.dsize = strlen( dn ) + 2;
154 key.dptr = ch_malloc( key.dsize );
155 sprintf( key.dptr, "%c%s", DN_SUBTREE_PREFIX, dn );
157 (void) idl_delete_key( be, db, key, id );
162 charray_free( subtree );
170 key.dsize = strlen( key.dptr ) + 1;
172 key.dsize = strlen( dn ) + 2;
173 key.dptr = ch_malloc( key.dsize );
174 sprintf( key.dptr, "%c%s", DN_ENTRY_PREFIX, dn );
177 data = ldbm_cache_fetch( db, key );
179 ldbm_cache_close( be, db );
185 if ( data.dptr == NULL ) {
186 Debug( LDAP_DEBUG_TRACE, "<= dn2id NOID\n", 0, 0, 0 );
190 (void) memcpy( (char *) &id, data.dptr, sizeof(ID) );
192 ldbm_datum_free( db->dbc_db, data );
194 Debug( LDAP_DEBUG_TRACE, "<= dn2id %ld\n", id, 0, 0 );
208 ldbm_datum_init( key );
210 Debug( LDAP_DEBUG_TRACE, "=> dn2id_delete( \"%s\" )\n", dn, 0, 0 );
212 if ( (db = ldbm_cache_open( be, "dn2id", LDBM_SUFFIX, LDBM_WRCREAT ))
214 Debug( LDAP_DEBUG_ANY,
215 "<= dn2id_delete could not open dn2id%s\n", LDBM_SUFFIX,
222 key.dsize = strlen( key.dptr ) + 1;
224 key.dsize = strlen( dn ) + 2;
225 key.dptr = ch_malloc( key.dsize );
226 sprintf( key.dptr, "%c%s", DN_ENTRY_PREFIX, dn );
229 rc = ldbm_cache_delete( db, key );
235 ldbm_cache_close( be, db );
237 Debug( LDAP_DEBUG_TRACE, "<= dn2id_delete %d\n", rc, 0, 0 );
242 * dn2entry - look up dn in the cache/indexes and return the corresponding
254 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
259 Debug(LDAP_DEBUG_TRACE, "dn2entry_%s: dn: \"%s\"\n",
260 rw ? "w" : "r", dn, 0);
262 if( matched != NULL ) {
263 /* caller cares about match */
267 if ( (id = dn2id( be, dn )) != NOID &&
268 (e = id2entry_rw( be, id, rw )) != NULL )
274 Debug(LDAP_DEBUG_ANY,
275 "dn2entry_%s: no entry for valid id (%ld), dn \"%s\"\n",
276 rw ? "w" : "r", id, dn);
277 /* must have been deleted from underneath us */
278 /* treat as if NOID was found */
281 /* caller doesn't care about match */
282 if( matched == NULL ) return NULL;
284 /* entry does not exist - see how much of the dn does exist */
285 /* dn_parent checks returns NULL if dn is suffix */
286 if ( (pdn = dn_parent( be, dn )) != NULL ) {
287 /* get entry with reader lock */
288 if ( (e = dn2entry_r( be, pdn, matched )) != NULL ) {