1 /* id2entry.c - routines to deal with the id2entry database */
4 * Copyright 1998-2003 The OpenLDAP Foundation, All Rights Reserved.
5 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
11 #include <ac/string.h>
21 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
22 DB *db = bdb->bi_id2entry->bdi_db;
27 struct berval odn, ondn;
29 /* We only store rdns, and they go in the id2parent database. */
31 odn = e->e_name; ondn = e->e_nname;
33 e->e_name = slap_empty_bv;
34 e->e_nname = slap_empty_bv;
37 key.data = (char *) &e->e_id;
38 key.size = sizeof(ID);
40 rc = entry_encode( e, &bv );
42 e->e_name = odn; e->e_nname = ondn;
44 if( rc != LDAP_SUCCESS ) {
51 rc = db->put( db, tid, &key, &data, flag );
58 * This routine adds (or updates) an entry on disk.
59 * The cache should be already be updated.
68 return bdb_id2entry_put(be, tid, e, DB_NOOVERWRITE);
71 int bdb_id2entry_update(
76 return bdb_id2entry_put(be, tid, e, 0);
88 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
89 DB *db = bdb->bi_id2entry->bdi_db;
97 key.data = (char *) &id;
98 key.size = sizeof(ID);
101 data.flags = DB_DBT_MALLOC;
103 if ((*e = bdb_cache_find_entry_id(bdb->bi_dbenv, &bdb->bi_cache, id, rw, locker, lock)) != NULL) {
108 rc = db->get( db, tid, &key, &data, bdb->bi_db_opflags | ( rw ? DB_RMW : 0 ));
114 DBT2bv( &data, &bv );
116 rc = entry_decode( &bv, e );
121 /* only free on error. On success, the entry was
124 ch_free( data.data );
129 bdb_fix_dn(be, id, *e);
131 ret = bdb_cache_add_entry_rw( bdb->bi_dbenv,
132 &bdb->bi_cache, *e, rw, locker, lock);
133 while ( ret == 1 || ret == -1 ) {
135 int add_loop_cnt = 0;
136 if ( (*e)->e_private != NULL ) {
137 free ((*e)->e_private);
139 (*e)->e_private = NULL;
140 if ( (ee = bdb_cache_find_entry_id
141 (bdb->bi_dbenv, &bdb->bi_cache, id, rw, locker, lock) ) != NULL) {
142 bdb_entry_return ( *e );
146 if ( ++add_loop_cnt == BDB_MAX_ADD_LOOP ) {
147 bdb_entry_return ( *e );
153 if ( (*e)->e_private != NULL )
154 free ( (*e)->e_private );
155 bdb_entry_return( *e );
162 bdb_cache_entry_commit(*e);
168 int bdb_id2entry_delete(
173 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
174 DB *db = bdb->bi_id2entry->bdi_db;
178 bdb_cache_delete_entry(&bdb->bi_cache, e);
181 key.data = (char *) &e->e_id;
182 key.size = sizeof(ID);
184 /* delete from database */
185 rc = db->del( db, tid, &key, 0 );
190 int bdb_entry_return(
193 /* Our entries are allocated in two blocks; the data comes from
194 * the db itself and the Entry structure and associated pointers
195 * are allocated in entry_decode. The db data pointer is saved
196 * in e_bv. Since the Entry structure is allocated as a single
197 * block, e_attrs is always a fixed offset from e. The exception
198 * is when an entry has been modified, in which case we also need
201 if( !e->e_bv.bv_val ) { /* A regular entry, from do_add */
205 if( (void *) e->e_attrs != (void *) (e+1)) {
206 attrs_free( e->e_attrs );
208 #if defined(SLAP_NVALUES) && !defined(SLAP_NVALUES_ON_DISK)
210 /* nvals are not contiguous with the rest. oh well. */
212 for (a = e->e_attrs; a; a=a->a_next) {
214 ber_bvarray_free( a->a_nvals );
222 /* See if the DNs were changed by modrdn */
223 if( e->e_nname.bv_val < e->e_bv.bv_val || e->e_nname.bv_val >
224 e->e_bv.bv_val + e->e_bv.bv_len ) {
225 ch_free(e->e_name.bv_val);
226 ch_free(e->e_nname.bv_val);
227 e->e_name.bv_val = NULL;
228 e->e_nname.bv_val = NULL;
231 /* We had to construct the dn and ndn as well, in a single block */
232 if( e->e_name.bv_val ) {
233 free( e->e_name.bv_val );
236 /* In tool mode the e_bv buffer is realloc'd, leave it alone */
237 if( !(slapMode & SLAP_TOOL_MODE) ) {
238 free( e->e_bv.bv_val );
246 int bdb_entry_release(
253 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
255 /* slapMode : SLAP_SERVER_MODE, SLAP_TOOL_MODE,
256 SLAP_TRUNCATE_MODE, SLAP_UNDEFINED_MODE */
258 if ( slapMode == SLAP_SERVER_MODE ) {
259 /* free entry and reader or writer lock */
260 bdb_unlocked_cache_return_entry_rw( &bdb->bi_cache, e, rw );
262 if (e->e_private != NULL)
265 bdb_entry_return ( e );