2 * Copyright 1998-2001 The OpenLDAP Foundation, All Rights Reserved.
3 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
5 * Copyright 2001, Pierangelo Masarati, All rights reserved. <ando@sys-net.it>
7 * This work has been developed to fulfill the requirements
8 * of SysNet s.n.c. <http:www.sys-net.it> and it has been donated
9 * to the OpenLDAP Foundation in the hope that it may be useful
10 * to the Open Source community, but WITHOUT ANY WARRANTY.
12 * Permission is granted to anyone to use this software for any purpose
13 * on any computer system, and to alter it and redistribute it, subject
14 * to the following restrictions:
16 * 1. The author and SysNet s.n.c. are not responsible for the consequences
17 * of use of this software, no matter how awful, even if they arise from
20 * 2. The origin of this software must not be misrepresented, either by
21 * explicit claim or by omission. Since few users ever read sources,
22 * credits should appear in the documentation.
24 * 3. Altered versions must be plainly marked as such, and must not be
25 * misrepresented as being the original software. Since few users
26 * ever read sources, credits should appear in the documentation.
27 * SysNet s.n.c. cannot be responsible for the consequences of the
30 * 4. This notice may not be removed or altered.
33 * This software is based on the backend back-ldap, implemented
34 * by Howard Chu <hyc@highlandsun.com>, and modified by Mark Valence
35 * <kurash@sassafras.com>, Pierangelo Masarati <ando@sys-net.it> and other
36 * contributors. The contribution of the original software to the present
37 * implementation is acknowledged in this copyright statement.
39 * A special acknowledgement goes to Howard for the overall architecture
40 * (and for borrowing large pieces of code), and to Mark, who implemented
41 * from scratch the attribute/objectclass mapping.
43 * The original copyright statement follows.
45 * Copyright 1999, Howard Chu, All rights reserved. <hyc@highlandsun.com>
47 * Permission is granted to anyone to use this software for any purpose
48 * on any computer system, and to alter it and redistribute it, subject
49 * to the following restrictions:
51 * 1. The author is not responsible for the consequences of use of this
52 * software, no matter how awful, even if they arise from flaws in it.
54 * 2. The origin of this software must not be misrepresented, either by
55 * explicit claim or by omission. Since few users ever read sources,
56 * credits should appear in the documentation.
58 * 3. Altered versions must be plainly marked as such, and must not be
59 * misrepresented as being the original software. Since few users
60 * ever read sources, credits should appear in the
63 * 4. This notice may not be removed or altered.
72 #include "../back-ldap/back-ldap.h"
73 #include "back-meta.h"
76 * The dncache, at present, maps an entry to the target that holds it.
79 struct metadncacheentry {
89 * compares two struct metadncacheentry; used by avl stuff
90 * FIXME: modify avl stuff to delete an entry based on cmp
91 * (e.g. when ttl expired?)
99 struct metadncacheentry *cc1 = ( struct metadncacheentry * )c1;
100 struct metadncacheentry *cc2 = ( struct metadncacheentry * )c2;
102 int d = cc1->dn->bv_len - cc2->dn->bv_len;
105 * case sensitive, because the dn MUST be normalized
107 return d != 0 ? d : strcmp( cc1->dn->bv_val, cc2->dn->bv_val );
113 * returns -1 in case a duplicate struct metadncacheentry has been inserted;
122 struct metadncacheentry *cc1 = ( struct metadncacheentry * )c1;
123 struct metadncacheentry *cc2 = ( struct metadncacheentry * )c2;
125 int d = cc1->dn->bv_len - cc2->dn->bv_len;
129 * case sensitive, because the dn MUST be normalized
131 cmp = d != 0 ? d : strcmp( cc1->dn->bv_val, cc2->dn->bv_val );
133 return ( cmp == 0 ) ? -1 : 0;
137 * meta_dncache_get_target
139 * returns the target a dn belongs to, or -1 in case the dn is not
143 meta_dncache_get_target(
144 struct metadncache *cache,
148 struct metadncacheentry tmp_entry, *entry;
153 ldap_pvt_thread_mutex_lock( &cache->mutex );
154 entry = ( struct metadncacheentry * )avl_find( cache->tree,
155 ( caddr_t )&tmp_entry, meta_dncache_cmp );
157 if ( entry != NULL ) {
160 * if cache->ttl < 0, cache never expires;
161 * if cache->ttl = 0 no cache is used; shouldn't get here
162 * else, cache is used with ttl
164 if ( cache->ttl < 0 ) {
165 target = entry->target;
171 curr_time = time( NULL );
173 if ( entry->lastupdated+cache->ttl > curr_time ) {
174 target = entry->target;
178 ldap_pvt_thread_mutex_unlock( &cache->mutex );
184 * meta_dncache_update_entry
186 * updates target and lastupdated of a struct metadncacheentry if exists,
187 * otherwise it gets created; returns -1 in case of error
190 meta_dncache_update_entry(
191 struct metadncache *cache,
196 struct metadncacheentry *entry, tmp_entry;
197 time_t curr_time = 0L;
201 * if cache->ttl < 0, cache never expires;
202 * if cache->ttl = 0 no cache is used; shouldn't get here
203 * else, cache is used with ttl
205 if ( cache->ttl > 0 ) {
210 curr_time = time( NULL );
215 ldap_pvt_thread_mutex_lock( &cache->mutex );
216 entry = ( struct metadncacheentry * )avl_find( cache->tree,
217 ( caddr_t )&tmp_entry, meta_dncache_cmp );
219 if ( entry != NULL ) {
220 entry->target = target;
221 entry->lastupdated = curr_time;
223 entry = ch_calloc( sizeof( struct metadncacheentry ), 1 );
224 if ( entry == NULL ) {
225 ldap_pvt_thread_mutex_unlock( &cache->mutex );
229 entry->dn = ber_bvdup( ndn );
230 if ( entry->dn == NULL ) {
231 ldap_pvt_thread_mutex_unlock( &cache->mutex );
234 entry->target = target;
235 entry->lastupdated = curr_time;
237 err = avl_insert( &cache->tree, ( caddr_t )entry,
238 meta_dncache_cmp, meta_dncache_dup );
240 ldap_pvt_thread_mutex_unlock( &cache->mutex );
246 * meta_dncache_update_entry
248 * updates target and lastupdated of a struct metadncacheentry if exists,
249 * otherwise it gets created; returns -1 in case of error
252 meta_dncache_delete_entry(
253 struct metadncache *cache,
257 struct metadncacheentry *entry, tmp_entry;
261 ldap_pvt_thread_mutex_lock( &cache->mutex );
262 entry = avl_delete( &cache->tree, ( caddr_t )&tmp_entry,
264 ldap_pvt_thread_mutex_lock( &cache->mutex );
266 if ( entry != NULL ) {
267 meta_dncache_free( ( void * )entry );
284 struct metadncacheentry *entry = ( struct metadncacheentry * )e;
286 ber_bvfree( entry->dn );