2 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
4 * Copyright 1999-2005 The OpenLDAP Foundation.
5 * Portions Copyright 2001-2003 Pierangelo Masarati.
6 * Portions Copyright 1999-2003 Howard Chu.
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 the 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 the Howard Chu for inclusion
19 * in OpenLDAP Software and subsequently enhanced by Pierangelo
28 #include "../back-ldap/back-ldap.h"
29 #include "back-meta.h"
32 * The meta-directory has one suffix, called <suffix>.
33 * It handles a pool of target servers, each with a branch suffix
34 * of the form <branch X>,<suffix>
36 * When the meta-directory receives a request with a dn that belongs
37 * to a branch, the corresponding target is invoked. When the dn
38 * does not belong to a specific branch, all the targets that
39 * are compatible with the dn are selected as candidates, and
40 * the request is spawned to all the candidate targets
42 * A request is characterized by a dn. The following cases are handled:
43 * - the dn is the suffix: <dn> == <suffix>,
44 * all the targets are candidates (search ...)
45 * - the dn is a branch suffix: <dn> == <branch X>,<suffix>, or
46 * - the dn is a subtree of a branch suffix:
47 * <dn> == <rdn>,<branch X>,<suffix>,
48 * the target is the only candidate.
50 * A possible extension will include the handling of multiple suffixes
54 meta_back_count_candidates(
60 meta_back_is_candidate_unique(
66 * returns 1 if suffix is candidate for dn, otherwise 0
68 * Note: this function should never be called if dn is the <suffix>.
71 meta_back_is_candidate(
72 struct berval *nsuffix,
76 if ( dnIsSuffix( nsuffix, ndn ) || dnIsSuffix( ndn, nsuffix ) ) {
78 * suffix longer than dn
80 return META_CANDIDATE;
83 return META_NOT_CANDIDATE;
87 * meta_back_count_candidates
89 * returns a count of the possible candidate targets
90 * Note: dn MUST be normalized
94 meta_back_count_candidates(
102 * I know assertions should not check run-time values;
103 * at present I didn't find a place for such checks
106 assert( li->mi_targets != NULL );
107 assert( li->mi_ntargets != 0 );
109 for ( i = 0; i < li->mi_ntargets; ++i ) {
110 if ( meta_back_is_candidate( &li->mi_targets[ i ]->mt_nsuffix, ndn ) )
120 * meta_back_is_candidate_unique
122 * checks whether a candidate is unique
123 * Note: dn MUST be normalized
126 meta_back_is_candidate_unique(
131 return ( meta_back_count_candidates( li, ndn ) == 1 );
135 * meta_back_select_unique_candidate
137 * returns the index of the candidate in case it is unique, otherwise -1
138 * Note: dn MUST be normalized.
139 * Note: if defined, the default candidate is returned in case of no match.
142 meta_back_select_unique_candidate(
147 int i, candidate = META_TARGET_NONE;
149 for ( i = 0; i < li->mi_ntargets; ++i ) {
150 if ( meta_back_is_candidate( &li->mi_targets[ i ]->mt_nsuffix, ndn ) )
152 if ( candidate == META_TARGET_NONE ) {
156 return META_TARGET_MULTIPLE;
165 * meta_clear_unused_candidates
167 * clears all candidates except candidate
170 meta_clear_unused_candidates(
176 struct metainfo *li = ( struct metainfo * )op->o_bd->be_private;
178 char *candidates = meta_back_candidates_get( op );
180 for ( i = 0; i < li->mi_ntargets; ++i ) {
181 if ( i == candidate ) {
184 candidates[ i ] = META_NOT_CANDIDATE;
191 * meta_clear_one_candidate
193 * clears the selected candidate
196 meta_clear_one_candidate(
197 struct metasingleconn *lsc
201 ldap_unbind_ext_s( lsc->msc_ld, NULL, NULL );
205 if ( !BER_BVISNULL( &lsc->msc_bound_ndn ) ) {
206 ber_memfree( lsc->msc_bound_ndn.bv_val );
207 BER_BVZERO( &lsc->msc_bound_ndn );
210 if ( !BER_BVISNULL( &lsc->msc_cred ) ) {
211 ber_memfree( lsc->msc_cred.bv_val );
212 BER_BVZERO( &lsc->msc_cred );