2 * Copyright 1998-2001 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/string.h>
72 #include <ac/socket.h>
75 #include "../back-ldap/back-ldap.h"
76 #include "back-meta.h"
85 AttributeAssertion *ava
88 struct metainfo *li = ( struct metainfo * )be->be_private;
90 struct metasingleconn **lsc;
91 char *match = NULL, *err = NULL, *mmatch = NULL;
92 int candidates = 0, last = 0, i, count, rc;
93 int cres = LDAP_SUCCESS, rres = LDAP_SUCCESS;
96 lc = meta_back_getconn( li, conn, op, META_OP_ALLOW_MULTIPLE,
98 if ( !lc || !meta_back_dobind( lc, op ) ) {
102 msgid = ch_calloc( sizeof( int ), li->ntargets );
103 if ( msgid == NULL ) {
108 * start an asynchronous compare for each candidate target
110 for ( i = 0, lsc = lc->conns; lsc[ 0 ] != NULL; ++i, ++lsc ) {
112 char *mapped_attr = ava->aa_desc->ad_cname.bv_val;
113 char *mapped_value = ava->aa_value->bv_val;
115 if ( lsc[ 0 ]->candidate != META_CANDIDATE ) {
120 * Rewrite the compare dn, if needed
122 switch ( rewrite_session( li->targets[ i ]->rwinfo,
123 "compareDn", dn, conn, &mdn ) ) {
124 case REWRITE_REGEXEC_OK:
129 LDAP_LOG(( "backend", LDAP_LEVEL_DETAIL1,
130 "[rw] compareDn: \"%s\" -> \"%s\"\n",
132 #else /* !NEW_LOGGING */
133 Debug( LDAP_DEBUG_ARGS,
134 "rw> compareDn: \"%s\" -> \"%s\"\n%s",
136 #endif /* !NEW_LOGGING */
139 case REWRITE_REGEXEC_UNWILLING:
140 send_ldap_result( conn, op, LDAP_UNWILLING_TO_PERFORM,
141 NULL, "Unwilling to perform",
145 case REWRITE_REGEXEC_ERR:
146 send_ldap_result( conn, op, LDAP_OPERATIONS_ERROR,
147 NULL, "Operations error",
153 * if attr is objectClass, try to remap the value
155 if ( ava->aa_desc->ad_type->sat_oid
156 == slap_schema.si_ad_objectClass->ad_type->sat_oid ) {
157 mapped_value = ldap_back_map( &li->targets[ i ]->oc_map,
158 ava->aa_value->bv_val, 0 );
160 if ( mapped_value == NULL ) {
161 lsc[ 0 ]->candidate = META_NOT_CANDIDATE;
165 * else try to remap the attribute
168 mapped_attr = ldap_back_map( &li->targets[ i ]->at_map,
169 ava->aa_desc->ad_cname.bv_val, 0 );
170 if ( mapped_attr == NULL ) {
171 lsc[ 0 ]->candidate = META_NOT_CANDIDATE;
177 * the compare op is spawned across the targets and the first
178 * that returns determines the result; a constraint on unicity
179 * of the result ought to be enforced
181 msgid[ i ] = ldap_compare( lc->conns[ i ]->ld, mdn,
182 mapped_attr, mapped_value );
183 if ( msgid[ i ] == -1 ) {
184 lsc[ 0 ]->candidate = META_NOT_CANDIDATE;
191 if ( mapped_attr != ava->aa_desc->ad_cname.bv_val ) {
194 if ( mapped_value != ava->aa_value->bv_val ) {
195 free( mapped_value );
204 for ( rc = 0, count = 0; candidates > 0; ) {
207 * FIXME: should we check for abandon?
209 for ( i = 0, lsc = lc->conns; lsc[ 0 ] != NULL; lsc++, i++ ) {
211 LDAPMessage *res = NULL;
213 if ( lsc[ 0 ]->candidate != META_CANDIDATE ) {
217 lrc = ldap_result( lsc[ 0 ]->ld, msgid[ i ],
222 * FIXME: should we yield?
228 } else if ( lrc == LDAP_RES_COMPARE ) {
230 rres = LDAP_OPERATIONS_ERROR;
235 cres = ldap_result2error( lsc[ 0 ]->ld,
238 case LDAP_COMPARE_TRUE:
239 case LDAP_COMPARE_FALSE:
242 * true or flase, got it;
243 * sending to cache ...
245 if ( li->cache.ttl != META_DNCACHE_DISABLED ) {
246 ( void )meta_dncache_update_entry( &li->cache, ch_strdup( ndn ), i );
254 rres = ldap_back_map_result( cres );
259 ldap_get_option( lsc[ 0 ]->ld,
260 LDAP_OPT_ERROR_STRING, &err );
262 if ( match != NULL ) {
265 ldap_get_option( lsc[ 0 ]->ld,
266 LDAP_OPT_MATCHED_DN, &match );
271 lsc[ 0 ]->candidate = META_NOT_CANDIDATE;
274 lsc[ 0 ]->candidate = META_NOT_CANDIDATE;
287 * Rewrite the matched portion of the search base, if required
289 * FIXME: only the last one gets caught!
292 if ( match != NULL ) {
298 * the result of the compare is assigned to the res code
299 * that will be returned
303 } else if ( match != NULL ) {
306 * At least one compare failed with matched portion,
307 * and none was successful
309 switch ( rewrite_session( li->targets[ last ]->rwinfo,
310 "matchedDn", match, conn, &mmatch ) ) {
311 case REWRITE_REGEXEC_OK:
312 if ( mmatch == NULL ) {
313 mmatch = ( char * )match;
316 LDAP_LOG(( "backend", LDAP_LEVEL_DETAIL1,
317 "[rw] matchedDn: \"%s\" -> \"%s\"\n",
319 #else /* !NEW_LOGGING */
320 Debug( LDAP_DEBUG_ARGS, "rw> matchedDn:"
321 " \"%s\" -> \"%s\"\n%s",
323 #endif /* !NEW_LOGGING */
327 case REWRITE_REGEXEC_UNWILLING:
328 send_ldap_result( conn, op, LDAP_UNWILLING_TO_PERFORM,
329 NULL, "Unwilling to perform",
334 case REWRITE_REGEXEC_ERR:
335 send_ldap_result( conn, op, LDAP_OPERATIONS_ERROR,
336 NULL, "Operations error",
343 send_ldap_result( conn, op, rres, mmatch, err, NULL, NULL );
346 if ( match != NULL ) {
347 if ( mmatch != match ) {