1 /* dn2id.c - routines to deal with the dn2id index */
4 * Copyright 1998-2000 The OpenLDAP Foundation, All Rights Reserved.
5 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
11 #include <ac/string.h>
25 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
26 DB *db = bdb->bi_dn2id->bdi_db;
28 Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2id_add( \"%s\", %ld )\n", dn, id, 0 );
32 key.size = strlen( dn ) + 2;
33 key.data = ch_malloc( key.size );
34 ((char *)key.data)[0] = DN_BASE_PREFIX;
35 AC_MEMCPY( &((char *)key.data)[1], dn, key.size - 1 );
38 data.data = (char *) &id;
39 data.size = sizeof( id );
41 /* store it -- don't override */
42 rc = db->put( db, txn, &key, &data, DB_NOOVERWRITE );
48 char *pdn = dn_parent( NULL, dn );
49 ((char *)(key.data))[0] = DN_ONE_PREFIX;
52 key.size = strlen( pdn ) + 2;
53 AC_MEMCPY( &((char*)key.data)[1],
56 rc = bdb_idl_insert_key( be, db, txn, &key, id );
66 char **subtree = dn_subtree( NULL, dn );
68 if( subtree != NULL ) {
70 ((char *)key.data)[0] = DN_SUBTREE_PREFIX;
71 for( i=0; subtree[i] != NULL; i++ ) {
72 key.size = strlen( subtree[i] ) + 2;
73 AC_MEMCPY( &((char *)key.data)[1],
74 subtree[i], key.size - 1 );
76 rc = bdb_idl_insert_key( be, db, txn, &key, id );
83 charray_free( subtree );
89 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id_add %d\n", rc, 0, 0 );
103 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
104 DB *db = bdb->bi_dn2id->bdi_db;
106 Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2id_delete( \"%s\", %ld )\n", dn, id, 0 );
107 assert( id != NOID );
110 key.size = strlen( dn ) + 2;
111 key.data = ch_malloc( key.size );
112 ((char *)key.data)[0] = DN_BASE_PREFIX;
113 AC_MEMCPY( &((char *)key.data)[1], dn, key.size - 1 );
115 /* store it -- don't override */
116 rc = db->del( db, txn, &key, 0 );
122 char *pdn = dn_parent( NULL, dn );
123 ((char *)(key.data))[0] = DN_ONE_PREFIX;
126 key.size = strlen( pdn ) + 2;
127 AC_MEMCPY( &((char*)key.data)[1],
130 rc = bdb_idl_delete_key( be, db, txn, &key, id );
140 char **subtree = dn_subtree( NULL, dn );
142 if( subtree != NULL ) {
144 ((char *)key.data)[0] = DN_SUBTREE_PREFIX;
145 for( i=0; subtree[i] != NULL; i++ ) {
146 key.size = strlen( subtree[i] ) + 2;
147 AC_MEMCPY( &((char *)key.data)[1],
148 subtree[i], key.size - 1 );
150 rc = bdb_idl_delete_key( be, db, txn, &key, id );
157 charray_free( subtree );
163 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id_delete %d\n", rc, 0, 0 );
176 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
177 DB *db = bdb->bi_dn2id->bdi_db;
180 Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2id_children( %s )\n",
184 key.size = strlen( dn ) + 2;
185 key.data = ch_malloc( key.size );
186 ((char *)key.data)[0] = DN_ONE_PREFIX;
187 AC_MEMCPY( &((char *)key.data)[1], dn, key.size - 1 );
189 /* we actually could do a empty get... */
192 data.ulen = sizeof(id);
193 data.flags = DB_DBT_USERMEM;
195 data.dlen = sizeof(id);
197 rc = db->get( db, txn, &key, &data, 0 );
199 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id_children( %s ): %s (%d)\n",
201 rc == 0 ? "yes" : ( rc == DB_NOTFOUND ? "no" :
202 db_strerror(rc) ), rc );
214 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
219 Debug( LDAP_DEBUG_TRACE, "=> dn2id( \"%s\" )\n", dn, 0, 0 );
221 /* first check the cache */
222 if ( (id = cache_find_entry_dn2id( be, &li->li_cache, dn )) != NOID ) {
223 Debug( LDAP_DEBUG_TRACE, "<= dn2id %ld (in cache)\n", id,
228 if ( (db = ldbm_cache_open( be, "dn2id", LDBM_SUFFIX, LDBM_WRCREAT ))
230 Debug( LDAP_DEBUG_ANY, "<= dn2id could not open dn2id%s\n",
235 ldbm_datum_init( key );
237 key.dsize = strlen( dn ) + 2;
238 key.dptr = ch_malloc( key.dsize );
239 sprintf( key.dptr, "%c%s", DN_BASE_PREFIX, dn );
241 data = ldbm_cache_fetch( db, key );
243 ldbm_cache_close( be, db );
247 if ( data.dptr == NULL ) {
248 Debug( LDAP_DEBUG_TRACE, "<= dn2id NOID\n", 0, 0, 0 );
252 AC_MEMCPY( (char *) &id, data.dptr, sizeof(ID) );
254 assert( id != NOID );
256 ldbm_datum_free( db->dbc_db, data );
258 Debug( LDAP_DEBUG_TRACE, "<= dn2id %ld\n", id, 0, 0 );
273 Debug( LDAP_DEBUG_TRACE, "=> dn2idl( \"%c%s\" )\n", prefix, dn, 0 );
275 if ( (db = ldbm_cache_open( be, "dn2id", LDBM_SUFFIX, LDBM_WRCREAT ))
277 Debug( LDAP_DEBUG_ANY, "<= dn2idl could not open dn2id%s\n",
282 ldbm_datum_init( key );
284 key.dsize = strlen( dn ) + 2;
285 key.dptr = ch_malloc( key.dsize );
286 sprintf( key.dptr, "%c%s", prefix, dn );
288 idl = idl_fetch( be, db, key );
290 ldbm_cache_close( be, db );
299 * dn2entry - look up dn in the cache/indexes and return the corresponding
315 Debug(LDAP_DEBUG_TRACE, "dn2entry_%s: dn: \"%s\"\n",
316 rw ? "w" : "r", dn, 0);
318 if( matched != NULL ) {
319 /* caller cares about match */
323 if ( (id = dn2id( be, dn )) != NOID &&
324 (e = id2entry_rw( be, id, rw )) != NULL )
330 Debug(LDAP_DEBUG_ANY,
331 "dn2entry_%s: no entry for valid id (%ld), dn \"%s\"\n",
332 rw ? "w" : "r", id, dn);
333 /* must have been deleted from underneath us */
334 /* treat as if NOID was found */
337 /* caller doesn't care about match */
338 if( matched == NULL ) return NULL;
340 /* entry does not exist - see how much of the dn does exist */
341 /* dn_parent checks returns NULL if dn is suffix */
342 if ( (pdn = dn_parent( be, dn )) != NULL ) {
343 /* get entry with reader lock */
344 if ( (e = dn2entry_r( be, pdn, matched )) != NULL ) {