2 * Copyright 1998-2002 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.
71 #include <ac/socket.h>
74 #include "../back-ldap/back-ldap.h"
75 #include "back-meta.h"
77 #ifdef SLAPD_META_DYNAMIC
80 back_meta_LTX_init_module( int argc, char *argv[] ) {
83 memset( &bi, '\0', sizeof( bi ) );
85 bi.bi_init = meta_back_initialize;
91 #endif /* SLAPD_META_DYNAMIC */
98 bi->bi_controls = slap_known_controls;
105 bi->bi_db_init = meta_back_db_init;
106 bi->bi_db_config = meta_back_db_config;
109 bi->bi_db_destroy = meta_back_db_destroy;
111 bi->bi_op_bind = meta_back_bind;
112 bi->bi_op_unbind = 0;
113 bi->bi_op_search = meta_back_search;
114 bi->bi_op_compare = meta_back_compare;
115 bi->bi_op_modify = meta_back_modify;
116 bi->bi_op_modrdn = meta_back_modrdn;
117 bi->bi_op_add = meta_back_add;
118 bi->bi_op_delete = meta_back_delete;
119 bi->bi_op_abandon = 0;
123 bi->bi_acl_group = meta_back_group;
124 bi->bi_acl_attribute = meta_back_attribute;
125 bi->bi_chk_referrals = 0;
127 bi->bi_connection_init = 0;
128 bi->bi_connection_destroy = meta_back_conn_destroy;
140 li = ch_calloc( 1, sizeof( struct metainfo ) );
146 * At present the default is no default target;
149 li->defaulttarget = META_DEFAULT_TARGET_NONE;
151 ldap_pvt_thread_mutex_init( &li->conn_mutex );
152 ldap_pvt_thread_mutex_init( &li->cache.mutex );
163 struct metasingleconn *lsc;
165 for ( lsc = lc->conns; !META_LAST(lsc); lsc++ ) {
166 if ( lsc->ld != NULL ) {
167 ldap_unbind( lsc->ld );
169 if ( lsc->bound_dn.bv_val ) {
170 ber_memfree( lsc->bound_dn.bv_val );
180 struct metatarget *lt
186 if ( lt->psuffix.bv_val ) {
187 free( lt->psuffix.bv_val );
189 if ( lt->suffix.bv_val ) {
190 free( lt->suffix.bv_val );
192 if ( lt->binddn.bv_val ) {
193 free( lt->binddn.bv_val );
195 if ( lt->bindpw.bv_val ) {
196 free( lt->bindpw.bv_val );
198 if ( lt->pseudorootdn.bv_val ) {
199 free( lt->pseudorootdn.bv_val );
201 if ( lt->pseudorootpw.bv_val ) {
202 free( lt->pseudorootpw.bv_val );
205 rewrite_info_delete( lt->rwinfo );
207 avl_free( lt->oc_map.remap, NULL );
208 avl_free( lt->oc_map.map, ( AVL_FREE )mapping_free );
209 avl_free( lt->at_map.remap, NULL );
210 avl_free( lt->at_map.map, ( AVL_FREE )mapping_free );
214 meta_back_db_destroy(
220 if ( be->be_private ) {
223 li = ( struct metainfo * )be->be_private;
226 * Destroy the connection tree
228 ldap_pvt_thread_mutex_lock( &li->conn_mutex );
230 if ( li->conntree ) {
231 avl_free( li->conntree,
232 ( AVL_FREE )conn_free );
236 * Destroy the per-target stuff (assuming there's at
239 for ( i = 0; i < li->ntargets; i++ ) {
240 target_free( li->targets[ i ] );
241 free( li->targets[ i ] );
246 ldap_pvt_thread_mutex_lock( &li->cache.mutex );
247 if ( li->cache.tree ) {
248 avl_free( li->cache.tree,
249 ( AVL_FREE )meta_dncache_free );
252 ldap_pvt_thread_mutex_unlock( &li->cache.mutex );
253 ldap_pvt_thread_mutex_destroy( &li->cache.mutex );
255 ldap_pvt_thread_mutex_unlock( &li->conn_mutex );
256 ldap_pvt_thread_mutex_destroy( &li->conn_mutex );
259 free( be->be_private );