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
55 * returns 1 if suffix is candidate for dn, otherwise 0
57 * Note: this function should never be called if dn is the <suffix>.
60 meta_back_is_candidate(
61 struct berval *nsuffix,
65 if ( dnIsSuffix( ndn, nsuffix ) ) {
66 return META_CANDIDATE;
69 if ( scope == LDAP_SCOPE_SUBTREE && dnIsSuffix( nsuffix, ndn ) ) {
71 * suffix longer than dn, but common part matches
73 return META_CANDIDATE;
76 return META_NOT_CANDIDATE;
81 * meta_back_is_candidate_unique
83 * checks whether a candidate is unique
84 * Note: dn MUST be normalized
87 meta_back_is_candidate_unique(
91 switch ( meta_back_select_unique_candidate( mi, ndn ) ) {
92 case META_TARGET_MULTIPLE:
93 case META_TARGET_NONE:
102 * meta_back_select_unique_candidate
104 * returns the index of the candidate in case it is unique, otherwise
105 * META_TARGET_NONE if none matches, or
106 * META_TARGET_MULTIPLE if more than one matches
107 * Note: ndn MUST be normalized.
110 meta_back_select_unique_candidate(
114 int i, candidate = META_TARGET_NONE;
116 for ( i = 0; i < mi->mi_ntargets; ++i ) {
117 if ( meta_back_is_candidate( &mi->mi_targets[ i ].mt_nsuffix, ndn, LDAP_SCOPE_BASE ) )
119 if ( candidate == META_TARGET_NONE ) {
123 return META_TARGET_MULTIPLE;
132 * meta_clear_unused_candidates
134 * clears all candidates except candidate
137 meta_clear_unused_candidates(
141 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
143 SlapReply *candidates = meta_back_candidates_get( op );
145 for ( i = 0; i < mi->mi_ntargets; ++i ) {
146 if ( i == candidate ) {
149 candidates[ i ].sr_tag = META_NOT_CANDIDATE;
156 * meta_clear_one_candidate
158 * clears the selected candidate
161 meta_clear_one_candidate(
162 metasingleconn_t *msc )
165 ldap_unbind_ext_s( msc->msc_ld, NULL, NULL );
169 if ( !BER_BVISNULL( &msc->msc_bound_ndn ) ) {
170 ber_memfree( msc->msc_bound_ndn.bv_val );
171 BER_BVZERO( &msc->msc_bound_ndn );
174 if ( !BER_BVISNULL( &msc->msc_cred ) ) {
175 ber_memfree( msc->msc_cred.bv_val );
176 BER_BVZERO( &msc->msc_cred );