1 /* id2entry.c - routines to deal with the id2entry index */
10 #include "back-ldbm.h"
12 extern struct dbcache *ldbm_cache_open();
13 extern Datum ldbm_cache_fetch();
14 extern char *dn_parent();
15 extern Entry *str2entry();
16 extern char *entry2str();
17 extern pthread_mutex_t entry2str_mutex;
20 id2entry_add( Backend *be, Entry *e )
22 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
27 #ifdef HAVE_BERKELEY_DB2
28 memset( &key, 0, sizeof( key ) );
29 memset( &data, 0, sizeof( data ) );
32 Debug( LDAP_DEBUG_TRACE, "=> id2entry_add( %d, \"%s\" )\n", e->e_id,
35 if ( (db = ldbm_cache_open( be, "id2entry", LDBM_SUFFIX, LDBM_WRCREAT ))
37 Debug( LDAP_DEBUG_ANY, "Could not open/create id2entry%s\n",
42 key.dptr = (char *) &e->e_id;
43 key.dsize = sizeof(ID);
45 pthread_mutex_lock( &entry2str_mutex );
46 data.dptr = entry2str( e, &len, 1 );
51 if ( li->li_dbcachewsync ) flags |= LDBM_SYNC;
52 rc = ldbm_cache_store( db, key, data, flags );
54 pthread_mutex_unlock( &entry2str_mutex );
56 ldbm_cache_close( be, db );
57 (void) cache_add_entry_lock( &li->li_cache, e, 0 );
59 Debug( LDAP_DEBUG_TRACE, "<= id2entry_add %d\n", rc, 0, 0 );
61 /* XXX should entries be born locked, i.e. apply writer lock here? */
66 id2entry_delete( Backend *be, Entry *e )
68 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
73 Debug( LDAP_DEBUG_TRACE, "=> id2entry_delete( %d, \"%s\" )\n", e->e_id,
76 /* XXX - check for writer lock - should also check no reader pending */
78 assert(pthread_rdwr_wchk_np(&e->e_rdwr));
81 #ifdef HAVE_BERKELEY_DB2
82 memset( &key, 0, sizeof( key ) );
85 /* XXX - check for writer lock - should also check no reader pending */
86 Debug (LDAP_DEBUG_TRACE,
87 "rdwr_Xchk: readers_reading: %d writer_writing: %d\n",
88 e->e_rdwr.readers_reading, e->e_rdwr.writer_writing, 0);
90 if ( (db = ldbm_cache_open( be, "id2entry", LDBM_SUFFIX, LDBM_WRCREAT ))
92 Debug( LDAP_DEBUG_ANY, "Could not open/create id2entry%s\n",
97 if ( cache_delete_entry( &li->li_cache, e ) != 0 ) {
98 Debug( LDAP_DEBUG_ANY, "could not delete %d (%s) from cache\n",
99 e->e_id, e->e_dn, 0 );
102 key.dptr = (char *) &e->e_id;
103 key.dsize = sizeof(ID);
105 rc = ldbm_cache_delete( db, key );
107 ldbm_cache_close( be, db );
109 Debug( LDAP_DEBUG_TRACE, "<= id2entry_delete %d\n", rc, 0, 0 );
113 /* XXX returns entry with reader/writer lock */
115 id2entry( Backend *be, ID id, int rw )
117 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
122 #ifdef HAVE_BERKELEY_DB2
123 memset( &key, 0, sizeof( key ) );
124 memset( &data, 0, sizeof( data ) );
127 Debug( LDAP_DEBUG_TRACE, "=> id2entry_%s( %ld )\n",
128 rw ? "w" : "r", id, 0 );
130 if ( (e = cache_find_entry_id( &li->li_cache, id, rw )) != NULL ) {
131 Debug( LDAP_DEBUG_TRACE, "<= id2entry_%s 0x%x (cache)\n",
132 rw ? "w" : "r", e, 0 );
136 if ( (db = ldbm_cache_open( be, "id2entry", LDBM_SUFFIX, LDBM_WRCREAT ))
138 Debug( LDAP_DEBUG_ANY, "Could not open id2entry%s\n",
143 key.dptr = (char *) &id;
144 key.dsize = sizeof(ID);
146 data = ldbm_cache_fetch( db, key );
148 if ( data.dptr == NULL ) {
149 Debug( LDAP_DEBUG_TRACE, "<= id2entry_%s( %ld ) not found\n",
150 rw ? "w" : "r", id, 0 );
151 ldbm_cache_close( be, db );
155 e = str2entry( data.dptr );
157 ldbm_datum_free( db->dbc_db, data );
158 ldbm_cache_close( be, db );
161 Debug( LDAP_DEBUG_TRACE, "<= id2entry_%s( %ld ) (failed)\n",
162 rw ? "w" : "r", id, 0 );
166 /* acquire required reader/writer lock */
167 if (entry_rdwr_lock(e, rw)) {
168 /* XXX set DELETE flag?? */
174 (void) cache_add_entry_lock( &li->li_cache, e, 0 );
176 Debug( LDAP_DEBUG_TRACE, "<= id2entry_%s( %ld ) (disk)\n",
177 rw ? "w" : "r", id, 0 );
182 id2entry_r( Backend *be, ID id )
184 return( id2entry( be, id, 0 ) );
188 id2entry_2( Backend *be, ID id )
190 return( id2entry( be, id, 1 ) );