2 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
4 * Copyright 1999-2003 The OpenLDAP Foundation.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted only as authorized by the OpenLDAP
11 * A copy of this license is available in the file LICENSE in the
12 * top-level directory of the distribution or, alternatively, at
13 * <http://www.OpenLDAP.org/license.html>.
16 * This work was initially developed by the Howard Chu for inclusion
17 * in OpenLDAP Software and subsequently enhanced by Pierangelo
20 /* This is an altered version */
22 * Copyright 2001, Pierangelo Masarati, All rights reserved. <ando@sys-net.it>
24 * This work has been developed to fulfill the requirements
25 * of SysNet s.n.c. <http:www.sys-net.it> and it has been donated
26 * to the OpenLDAP Foundation in the hope that it may be useful
27 * to the Open Source community, but WITHOUT ANY WARRANTY.
29 * Permission is granted to anyone to use this software for any purpose
30 * on any computer system, and to alter it and redistribute it, subject
31 * to the following restrictions:
33 * 1. The author and SysNet s.n.c. are not responsible for the consequences
34 * of use of this software, no matter how awful, even if they arise from
37 * 2. The origin of this software must not be misrepresented, either by
38 * explicit claim or by omission. Since few users ever read sources,
39 * credits should appear in the documentation.
41 * 3. Altered versions must be plainly marked as such, and must not be
42 * misrepresented as being the original software. Since few users
43 * ever read sources, credits should appear in the documentation.
44 * SysNet s.n.c. cannot be responsible for the consequences of the
47 * 4. This notice may not be removed or altered.
50 * This software is based on the backend back-ldap, implemented
51 * by Howard Chu <hyc@highlandsun.com>, and modified by Mark Valence
52 * <kurash@sassafras.com>, Pierangelo Masarati <ando@sys-net.it> and other
53 * contributors. The contribution of the original software to the present
54 * implementation is acknowledged in this copyright statement.
56 * A special acknowledgement goes to Howard for the overall architecture
57 * (and for borrowing large pieces of code), and to Mark, who implemented
58 * from scratch the attribute/objectclass mapping.
60 * The original copyright statement follows.
62 * Copyright 1999, Howard Chu, All rights reserved. <hyc@highlandsun.com>
64 * Permission is granted to anyone to use this software for any purpose
65 * on any computer system, and to alter it and redistribute it, subject
66 * to the following restrictions:
68 * 1. The author is not responsible for the consequences of use of this
69 * software, no matter how awful, even if they arise from flaws in it.
71 * 2. The origin of this software must not be misrepresented, either by
72 * explicit claim or by omission. Since few users ever read sources,
73 * credits should appear in the documentation.
75 * 3. Altered versions must be plainly marked as such, and must not be
76 * misrepresented as being the original software. Since few users
77 * ever read sources, credits should appear in the
80 * 4. This notice may not be removed or altered.
88 #include <ac/string.h>
89 #include <ac/socket.h>
92 #include "../back-ldap/back-ldap.h"
93 #include "back-meta.h"
95 #ifdef SLAPD_META_DYNAMIC
98 init_module( int argc, char *argv[] ) {
101 memset( &bi, '\0', sizeof( bi ) );
103 bi.bi_init = meta_back_initialize;
109 #endif /* SLAPD_META_DYNAMIC */
112 meta_back_initialize(
116 bi->bi_controls = slap_known_controls;
123 bi->bi_db_init = meta_back_db_init;
124 bi->bi_db_config = meta_back_db_config;
127 bi->bi_db_destroy = meta_back_db_destroy;
129 bi->bi_op_bind = meta_back_bind;
130 bi->bi_op_unbind = 0;
131 bi->bi_op_search = meta_back_search;
132 bi->bi_op_compare = meta_back_compare;
133 bi->bi_op_modify = meta_back_modify;
134 bi->bi_op_modrdn = meta_back_modrdn;
135 bi->bi_op_add = meta_back_add;
136 bi->bi_op_delete = meta_back_delete;
137 bi->bi_op_abandon = 0;
141 bi->bi_chk_referrals = 0;
143 bi->bi_connection_init = 0;
144 bi->bi_connection_destroy = meta_back_conn_destroy;
156 struct rewrite_info *rwinfo;
160 rwinfo = rewrite_info_init( REWRITE_MODE_USE_DEFAULT );
161 if ( rwinfo == NULL ) {
165 cm = (cache_manager *)ch_malloc(sizeof(cache_manager));
167 rewrite_info_delete( &rwinfo );
171 qm = (query_manager*)ch_malloc(sizeof(query_manager));
173 rewrite_info_delete( &rwinfo );
181 cm->numtemplates = 0;
182 cm->num_entries_limit = 5;
184 cm->thresh_hi = 500000;
185 cm->thresh_lo = 700000;
186 cm->num_cached_queries = 0;
187 cm->total_entries = 0;
188 cm->max_queries = 10000;
190 cm->cc_thread_started = 0;
191 cm->cc_period = 1000;
193 qm->attr_sets = NULL;
194 qm->templates = NULL;
196 qm->lru_bottom = NULL;
198 qm->qcfunc = query_containment;
199 qm->crfunc = cache_replacement;
200 qm->addfunc = add_query;
201 ldap_pvt_thread_mutex_init(&qm->lru_mutex);
203 ldap_pvt_thread_mutex_init(&cm->cache_mutex);
204 ldap_pvt_thread_mutex_init(&cm->remove_mutex);
205 ldap_pvt_thread_mutex_init( &cm->cc_mutex );
207 li = ch_calloc( 1, sizeof( struct metainfo ) );
213 * At present the default is no default target;
216 li->defaulttarget = META_DEFAULT_TARGET_NONE;
219 /* FIXME: what about qm ? */
221 ldap_pvt_thread_mutex_init( &li->conn_mutex );
222 ldap_pvt_thread_mutex_init( &li->cache.mutex );
233 struct metaconn *lc = v_lc;
234 struct metasingleconn *lsc;
236 for ( lsc = lc->conns; !META_LAST(lsc); lsc++ ) {
237 if ( lsc->ld != NULL ) {
238 ldap_unbind( lsc->ld );
240 if ( lsc->bound_dn.bv_val ) {
241 ber_memfree( lsc->bound_dn.bv_val );
243 if ( lsc->cred.bv_val ) {
244 memset( lsc->cred.bv_val, 0, lsc->cred.bv_len );
245 ber_memfree( lsc->cred.bv_val );
254 struct metatarget *lt
260 if ( lt->psuffix.bv_val ) {
261 free( lt->psuffix.bv_val );
263 if ( lt->suffix.bv_val ) {
264 free( lt->suffix.bv_val );
266 if ( lt->binddn.bv_val ) {
267 free( lt->binddn.bv_val );
269 if ( lt->bindpw.bv_val ) {
270 free( lt->bindpw.bv_val );
272 if ( lt->pseudorootdn.bv_val ) {
273 free( lt->pseudorootdn.bv_val );
275 if ( lt->pseudorootpw.bv_val ) {
276 free( lt->pseudorootpw.bv_val );
278 if ( lt->rwmap.rwm_rw ) {
279 rewrite_info_delete( <->rwmap.rwm_rw );
281 avl_free( lt->rwmap.rwm_oc.remap, NULL );
282 avl_free( lt->rwmap.rwm_oc.map, mapping_free );
283 avl_free( lt->rwmap.rwm_at.remap, NULL );
284 avl_free( lt->rwmap.rwm_at.map, mapping_free );
288 meta_back_db_destroy(
294 if ( be->be_private ) {
297 li = ( struct metainfo * )be->be_private;
300 * Destroy the connection tree
302 ldap_pvt_thread_mutex_lock( &li->conn_mutex );
304 if ( li->conntree ) {
305 avl_free( li->conntree, conn_free );
309 * Destroy the per-target stuff (assuming there's at
312 for ( i = 0; i < li->ntargets; i++ ) {
313 target_free( li->targets[ i ] );
314 free( li->targets[ i ] );
319 ldap_pvt_thread_mutex_lock( &li->cache.mutex );
320 if ( li->cache.tree ) {
321 avl_free( li->cache.tree, meta_dncache_free );
324 ldap_pvt_thread_mutex_unlock( &li->cache.mutex );
325 ldap_pvt_thread_mutex_destroy( &li->cache.mutex );
327 ldap_pvt_thread_mutex_unlock( &li->conn_mutex );
328 ldap_pvt_thread_mutex_destroy( &li->conn_mutex );
331 free( be->be_private );