1 /* cache.c - routines to maintain an in-core cache of entries */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 2001-2005 The OpenLDAP Foundation.
6 * Portions Copyright 2001-2003 Pierangelo Masarati.
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted only as authorized by the OpenLDAP
13 * A copy of this license is available in file LICENSE in the
14 * top-level directory of the distribution or, alternatively, at
15 * <http://www.OpenLDAP.org/license.html>.
18 * This work was initially developed by Pierangelo Masarati for inclusion
19 * in OpenLDAP Software.
25 #include "ac/string.h"
29 #include "back-monitor.h"
32 * The cache maps DNs to Entries.
33 * Each entry, on turn, holds the list of its children in the e_private field.
34 * This is used by search operation to perform onelevel and subtree candidate
37 typedef struct monitor_cache_t {
43 * compares entries based on the dn
50 monitor_cache_t *cc1 = ( monitor_cache_t * )c1;
51 monitor_cache_t *cc2 = ( monitor_cache_t * )c2;
54 * case sensitive, because the dn MUST be normalized
56 return ber_bvcmp( &cc1->mc_ndn, &cc2->mc_ndn );
60 * checks for duplicate entries
67 monitor_cache_t *cc1 = ( monitor_cache_t * )c1;
68 monitor_cache_t *cc2 = ( monitor_cache_t * )c2;
71 * case sensitive, because the dn MUST be normalized
73 return ber_bvcmp( &cc1->mc_ndn, &cc2->mc_ndn ) == 0 ? -1 : 0;
77 * adds an entry to the cache and inits the mutex
91 mp = ( monitor_entry_t *)e->e_private;
92 ldap_pvt_thread_mutex_init( &mp->mp_mutex );
94 mc = ( monitor_cache_t * )ch_malloc( sizeof( monitor_cache_t ) );
95 mc->mc_ndn = e->e_nname;
97 ldap_pvt_thread_mutex_lock( &mi->mi_cache_mutex );
98 rc = avl_insert( &mi->mi_cache, ( caddr_t )mc,
99 monitor_cache_cmp, monitor_cache_dup );
100 ldap_pvt_thread_mutex_unlock( &mi->mi_cache_mutex );
106 * locks the entry (no r/w)
115 assert( e->e_private != NULL );
117 mp = ( monitor_entry_t * )e->e_private;
118 ldap_pvt_thread_mutex_lock( &mp->mp_mutex );
124 * gets an entry from the cache based on the normalized dn
133 monitor_cache_t tmp_mc, *mc;
135 assert( mi != NULL );
136 assert( ndn != NULL );
137 assert( ep != NULL );
139 tmp_mc.mc_ndn = *ndn;
140 ldap_pvt_thread_mutex_lock( &mi->mi_cache_mutex );
141 mc = ( monitor_cache_t * )avl_find( mi->mi_cache,
142 ( caddr_t )&tmp_mc, monitor_cache_cmp );
145 /* entry is returned with mutex locked */
146 monitor_cache_lock( mc->mc_e );
147 ldap_pvt_thread_mutex_unlock( &mi->mi_cache_mutex );
153 ldap_pvt_thread_mutex_unlock( &mi->mi_cache_mutex );
160 * If the entry exists in cache, it is returned in locked status;
161 * otherwise, if the parent exists, if it may generate volatile
162 * descendants an attempt to generate the required entry is
163 * performed and, if successful, the entry is returned
166 monitor_cache_dn2entry(
173 monitor_info_t *mi = (monitor_info_t *)op->o_bd->be_private;
175 struct berval p_ndn = BER_BVNULL;
179 assert( mi != NULL );
180 assert( ndn != NULL );
181 assert( ep != NULL );
182 assert( matched != NULL );
186 if ( !dnIsSuffix( ndn, &op->o_bd->be_nsuffix[ 0 ] ) ) {
190 rc = monitor_cache_get( mi, ndn, ep );
191 if ( !rc && *ep != NULL ) {
195 /* try with parent/ancestors */
196 if ( BER_BVISNULL( ndn ) ) {
197 BER_BVSTR( &p_ndn, "" );
200 dnParent( ndn, &p_ndn );
203 rc = monitor_cache_dn2entry( op, rs, &p_ndn, &e_parent, matched );
204 if ( rc || e_parent == NULL ) {
208 mp = ( monitor_entry_t * )e_parent->e_private;
210 if ( mp->mp_flags & MONITOR_F_VOLATILE_CH ) {
211 /* parent entry generates volatile children */
212 rc = monitor_entry_create( op, rs, ndn, e_parent, ep );
216 monitor_cache_lock( *ep );
217 monitor_cache_release( mi, e_parent );
227 * releases the lock of the entry; if it is marked as volatile, it is
231 monitor_cache_release(
237 assert( mi != NULL );
239 assert( e->e_private != NULL );
241 mp = ( monitor_entry_t * )e->e_private;
243 if ( mp->mp_flags & MONITOR_F_VOLATILE ) {
244 monitor_cache_t *mc, tmp_mc;
246 /* volatile entries do not return to cache */
247 ldap_pvt_thread_mutex_lock( &mi->mi_cache_mutex );
248 tmp_mc.mc_ndn = e->e_nname;
249 mc = avl_delete( &mi->mi_cache,
250 ( caddr_t )&tmp_mc, monitor_cache_cmp );
251 ldap_pvt_thread_mutex_unlock( &mi->mi_cache_mutex );
256 ldap_pvt_thread_mutex_unlock( &mp->mp_mutex );
257 ldap_pvt_thread_mutex_destroy( &mp->mp_mutex );
265 ldap_pvt_thread_mutex_unlock( &mp->mp_mutex );
271 monitor_entry_destroy( void *v_mc )
273 monitor_cache_t *mc = (monitor_cache_t *)v_mc;
275 if ( mc->mc_e != NULL ) {
278 assert( mc->mc_e->e_private != NULL );
280 mp = ( monitor_entry_t * )mc->mc_e->e_private;
286 ldap_pvt_thread_mutex_destroy( &mp->mp_mutex );
289 mc->mc_e->e_private = NULL;
290 entry_free( mc->mc_e );
297 monitor_cache_destroy(
300 if ( mi->mi_cache ) {
301 avl_free( mi->mi_cache, monitor_entry_destroy );