2 * Copyright 1998-2003 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>
72 #include <ac/string.h>
77 #include "../back-ldap/back-ldap.h"
78 #include "back-meta.h"
81 * Set PRINT_CONNTREE larger than 0 to dump the connection tree (debug only)
83 #define PRINT_CONNTREE 0
88 * compares two struct metaconn based on the value of the conn pointer;
97 struct metaconn *lc1 = ( struct metaconn * )c1;
98 struct metaconn *lc2 = ( struct metaconn * )c2;
100 return ( ( lc1->conn < lc2->conn ) ? -1 :
101 ( ( lc1->conn > lc2-> conn ) ? 1 : 0 ) );
107 * returns -1 in case a duplicate struct metaconn has been inserted;
116 struct metaconn *lc1 = ( struct metaconn * )c1;
117 struct metaconn *lc2 = ( struct metaconn * )c2;
119 return( ( lc1->conn == lc2->conn ) ? -1 : 0 );
123 * Debug stuff (got it from libavl)
125 #if PRINT_CONNTREE > 0
127 ravl_print( Avlnode *root, int depth )
135 ravl_print( root->avl_right, depth+1 );
137 for ( i = 0; i < depth; i++ ) {
141 printf( "c(%d) %d\n", ( ( struct metaconn * )root->avl_data )->conn->c_connid, root->avl_bf );
143 ravl_print( root->avl_left, depth+1 );
147 myprint( Avlnode *root )
149 printf( "********\n" );
152 printf( "\tNULL\n" );
154 ravl_print( root, 0 );
157 printf( "********\n" );
159 #endif /* PRINT_CONNTREE */
167 * Allocates a connection structure, making room for all the referenced targets
169 static struct metaconn *
170 metaconn_alloc( int ntargets )
174 assert( ntargets > 0 );
176 lc = ch_calloc( sizeof( struct metaconn ), 1 );
182 * make it a null-terminated array ...
184 lc->conns = ch_calloc( sizeof( struct metasingleconn ), ntargets+1 );
185 if ( lc->conns == NULL ) {
189 lc->conns[ ntargets ].candidate = META_LAST_CONN;
191 lc->bound_target = META_BOUND_NONE;
211 ch_free( lc->conns );
220 * Initializes one connection
226 struct metatarget *lt,
227 struct metasingleconn *lsc
236 if ( lsc->ld != NULL ) {
241 * Attempts to initialize the connection to the target ds
243 rs->sr_err = ldap_initialize( &lsc->ld, lt->uri );
244 if ( rs->sr_err != LDAP_SUCCESS ) {
245 return ldap_back_map_result( rs );
249 * Set LDAP version. This will always succeed: If the client
250 * bound with a particular version, then so can we.
252 vers = op->o_conn->c_protocol;
253 ldap_set_option( lsc->ld, LDAP_OPT_PROTOCOL_VERSION, &vers );
254 /* FIXME: configurable? */
255 ldap_set_option(lsc->ld, LDAP_OPT_REFERRALS, LDAP_OPT_ON);
258 * Sets a cookie for the rewrite session
260 ( void )rewrite_session_init( lt->rwmap.rwm_rw, op->o_conn );
263 * If the connection dn is not null, an attempt to rewrite it is made
265 if ( op->o_conn->c_dn.bv_len != 0 ) {
266 dc.rwmap = <->rwmap;
267 dc.conn = op->o_conn;
272 * Rewrite the bind dn if needed
274 if ( ldap_back_dn_massage( &dc, &op->o_conn->c_dn, &lsc->bound_dn) ) {
275 send_ldap_result( op, rs );
279 assert( lsc->bound_dn.bv_val );
282 ber_str2bv( "", 0, 1, &lsc->bound_dn );
285 lsc->bound = META_UNBOUND;
288 * The candidate is activated
290 lsc->candidate = META_CANDIDATE;
297 * Prepares the connection structure
299 * FIXME: This function needs to receive some info on the type of operation
300 * it is invoked by, so that only the correct pool of candidate targets
301 * is initialized in case no connection was available yet.
303 * At present a flag that says whether the candidate target must be unique
304 * is passed; eventually an operation agent will be used.
314 struct metainfo *li = ( struct metainfo * )op->o_bd->be_private;
315 struct metaconn *lc, lc_curr;
316 int cached = -1, i = -1, err = LDAP_SUCCESS;
319 /* Searches for a metaconn in the avl tree */
320 lc_curr.conn = op->o_conn;
321 ldap_pvt_thread_mutex_lock( &li->conn_mutex );
322 lc = (struct metaconn *)avl_find( li->conntree,
323 (caddr_t)&lc_curr, meta_back_conn_cmp );
324 ldap_pvt_thread_mutex_unlock( &li->conn_mutex );
326 /* Looks like we didn't get a bind. Open a new session... */
328 lc = metaconn_alloc( li->ntargets );
329 lc->conn = op->o_conn;
334 * looks in cache, if any
336 if ( li->cache.ttl != META_DNCACHE_DISABLED ) {
337 cached = i = meta_dncache_get_target( &li->cache, ndn );
340 if ( op_type == META_OP_REQUIRE_SINGLE ) {
343 * tries to get a unique candidate
344 * (takes care of default target
347 i = meta_back_select_unique_candidate( li, ndn );
351 * if any is found, inits the connection
358 rs->sr_err = LDAP_NO_SUCH_OBJECT;
363 LDAP_LOG( BACK_META, INFO,
364 "meta_back_getconn: got target %d for ndn=\"%s\" from cache\n",
366 #else /* !NEW_LOGGING */
367 Debug( LDAP_DEBUG_CACHE,
368 "==>meta_back_getconn: got target %d for ndn=\"%s\" from cache\n%s",
369 i, ndn->bv_val, "" );
370 #endif /* !NEW_LOGGING */
373 * Clear all other candidates
375 ( void )meta_clear_unused_candidates( li, lc, i, 0 );
378 * The target is activated; if needed, it is
379 * also init'd. In case of error, init_one_conn
380 * sends the appropriate result.
382 err = init_one_conn( op, rs, li->targets[ i ],
384 if ( err != LDAP_SUCCESS ) {
387 * FIXME: in case one target cannot
388 * be init'd, should the other ones
391 ( void )meta_clear_one_candidate( &lc->conns[ i ], 1 );
403 * require all connections ...
405 } else if (op_type == META_OP_REQUIRE_ALL) {
406 for ( i = 0; i < li->ntargets; i++ ) {
409 * The target is activated; if needed, it is
412 int lerr = init_one_conn( op, rs, li->targets[ i ],
414 if ( lerr != LDAP_SUCCESS ) {
417 * FIXME: in case one target cannot
418 * be init'd, should the other ones
421 ( void )meta_clear_one_candidate( &lc->conns[ i ], 1 );
428 * if no unique candidate ...
431 for ( i = 0; i < li->ntargets; i++ ) {
433 || meta_back_is_candidate( &li->targets[ i ]->suffix, ndn ) ) {
436 * The target is activated; if needed, it is
439 int lerr = init_one_conn( op, rs,
442 if ( lerr != LDAP_SUCCESS ) {
445 * FIXME: in case one target cannot
446 * be init'd, should the other ones
449 ( void )meta_clear_one_candidate( &lc->conns[ i ], 1 );
457 /* clear out init_one_conn non-fatal errors */
458 rs->sr_err = LDAP_SUCCESS;
464 * Inserts the newly created metaconn in the avl tree
466 ldap_pvt_thread_mutex_lock( &li->conn_mutex );
467 err = avl_insert( &li->conntree, ( caddr_t )lc,
468 meta_back_conn_cmp, meta_back_conn_dup );
470 #if PRINT_CONNTREE > 0
471 myprint( li->conntree );
472 #endif /* PRINT_CONNTREE */
474 ldap_pvt_thread_mutex_unlock( &li->conn_mutex );
477 LDAP_LOG( BACK_META, INFO,
478 "meta_back_getconn: conn %ld inserted\n", lc->conn->c_connid, 0, 0);
479 #else /* !NEW_LOGGING */
480 Debug( LDAP_DEBUG_TRACE,
481 "=>meta_back_getconn: conn %ld inserted\n%s%s",
482 lc->conn->c_connid, "", "" );
483 #endif /* !NEW_LOGGING */
486 * Err could be -1 in case a duplicate metaconn is inserted
489 rs->sr_err = LDAP_OTHER;
490 rs->sr_text = "Internal server error";
496 LDAP_LOG( BACK_META, INFO,
497 "meta_back_getconn: conn %ld fetched\n", lc->conn->c_connid, 0, 0 );
498 #else /* !NEW_LOGGING */
499 Debug( LDAP_DEBUG_TRACE,
500 "=>meta_back_getconn: conn %ld fetched\n%s%s",
501 lc->conn->c_connid, "", "" );
502 #endif /* !NEW_LOGGING */