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 struct berval mapped_attr = ava->aa_desc->ad_cname;
113 struct berval mapped_value = ava->aa_value;
115 if ( lsc[ 0 ]->candidate != META_CANDIDATE ) {
120 * Rewrite the compare dn, if needed
122 switch ( rewrite_session( li->targets[ i ]->rwinfo,
124 dn->bv_val, conn, &mdn ) ) {
125 case REWRITE_REGEXEC_OK:
127 mdn = ( char * )dn->bv_val;
130 LDAP_LOG(( "backend", LDAP_LEVEL_DETAIL1,
131 "[rw] compareDn: \"%s\" -> \"%s\"\n",
133 #else /* !NEW_LOGGING */
134 Debug( LDAP_DEBUG_ARGS,
135 "rw> compareDn: \"%s\" -> \"%s\"\n%s",
136 dn->bv_val, mdn, "" );
137 #endif /* !NEW_LOGGING */
140 case REWRITE_REGEXEC_UNWILLING:
141 send_ldap_result( conn, op, LDAP_UNWILLING_TO_PERFORM,
142 NULL, "Unwilling to perform",
146 case REWRITE_REGEXEC_ERR:
147 send_ldap_result( conn, op, LDAP_OPERATIONS_ERROR,
148 NULL, "Operations error",
154 * if attr is objectClass, try to remap the value
156 if ( ava->aa_desc->ad_type->sat_oid
157 == slap_schema.si_ad_objectClass->ad_type->sat_oid ) {
158 ldap_back_map( &li->targets[ i ]->oc_map,
159 &ava->aa_value, &mapped_value, 0 );
161 if ( mapped_value.bv_val == NULL ) {
162 lsc[ 0 ]->candidate = META_NOT_CANDIDATE;
166 * else try to remap the attribute
169 ldap_back_map( &li->targets[ i ]->at_map,
170 &ava->aa_desc->ad_cname, &mapped_attr, 0 );
171 if ( mapped_attr.bv_val == NULL ) {
172 lsc[ 0 ]->candidate = META_NOT_CANDIDATE;
178 * the compare op is spawned across the targets and the first
179 * that returns determines the result; a constraint on unicity
180 * of the result ought to be enforced
182 msgid[ i ] = ldap_compare( lc->conns[ i ]->ld, mdn,
183 mapped_attr.bv_val, mapped_value.bv_val );
184 if ( msgid[ i ] == -1 ) {
185 lsc[ 0 ]->candidate = META_NOT_CANDIDATE;
189 if ( mdn != dn->bv_val ) {
192 if ( mapped_attr.bv_val != ava->aa_desc->ad_cname.bv_val ) {
193 free( mapped_attr.bv_val );
195 if ( mapped_value.bv_val != ava->aa_value.bv_val ) {
196 free( mapped_value.bv_val );
205 for ( rc = 0, count = 0; candidates > 0; ) {
208 * FIXME: should we check for abandon?
210 for ( i = 0, lsc = lc->conns; lsc[ 0 ] != NULL; lsc++, i++ ) {
212 LDAPMessage *res = NULL;
214 if ( lsc[ 0 ]->candidate != META_CANDIDATE ) {
218 lrc = ldap_result( lsc[ 0 ]->ld, msgid[ i ],
223 * FIXME: should we yield?
229 } else if ( lrc == LDAP_RES_COMPARE ) {
231 rres = LDAP_OPERATIONS_ERROR;
236 cres = ldap_result2error( lsc[ 0 ]->ld,
239 case LDAP_COMPARE_TRUE:
240 case LDAP_COMPARE_FALSE:
243 * true or flase, got it;
244 * sending to cache ...
246 if ( li->cache.ttl != META_DNCACHE_DISABLED ) {
247 ( void )meta_dncache_update_entry( &li->cache, ndn, i );
255 rres = ldap_back_map_result( cres );
260 ldap_get_option( lsc[ 0 ]->ld,
261 LDAP_OPT_ERROR_STRING, &err );
263 if ( match != NULL ) {
266 ldap_get_option( lsc[ 0 ]->ld,
267 LDAP_OPT_MATCHED_DN, &match );
272 lsc[ 0 ]->candidate = META_NOT_CANDIDATE;
275 lsc[ 0 ]->candidate = META_NOT_CANDIDATE;
288 * Rewrite the matched portion of the search base, if required
290 * FIXME: only the last one gets caught!
293 if ( match != NULL ) {
299 * the result of the compare is assigned to the res code
300 * that will be returned
304 } else if ( match != NULL ) {
307 * At least one compare failed with matched portion,
308 * and none was successful
310 switch ( rewrite_session( li->targets[ last ]->rwinfo,
311 "matchedDn", match, conn, &mmatch ) ) {
312 case REWRITE_REGEXEC_OK:
313 if ( mmatch == NULL ) {
314 mmatch = ( char * )match;
317 LDAP_LOG(( "backend", LDAP_LEVEL_DETAIL1,
318 "[rw] matchedDn: \"%s\" -> \"%s\"\n",
320 #else /* !NEW_LOGGING */
321 Debug( LDAP_DEBUG_ARGS, "rw> matchedDn:"
322 " \"%s\" -> \"%s\"\n%s",
324 #endif /* !NEW_LOGGING */
328 case REWRITE_REGEXEC_UNWILLING:
329 send_ldap_result( conn, op, LDAP_UNWILLING_TO_PERFORM,
330 NULL, "Unwilling to perform",
335 case REWRITE_REGEXEC_ERR:
336 send_ldap_result( conn, op, LDAP_OPERATIONS_ERROR,
337 NULL, "Operations error",
344 send_ldap_result( conn, op, rres, mmatch, err, NULL, NULL );
347 if ( match != NULL ) {
348 if ( mmatch != match ) {