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
27 #include <ac/string.h>
28 #include <ac/socket.h>
31 #include "../back-ldap/back-ldap.h"
32 #include "back-meta.h"
35 meta_back_compare( Operation *op, SlapReply *rs )
37 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
41 struct berval mmatch = BER_BVNULL;
52 SlapReply *candidates = meta_back_candidates_get( op );
54 mc = meta_back_getconn( op, rs, NULL, LDAP_BACK_SENDERR );
55 if ( !mc || !meta_back_dobind( op, rs, mc, LDAP_BACK_SENDERR ) ) {
59 msgid = ch_calloc( sizeof( int ), mi->mi_ntargets );
60 if ( msgid == NULL ) {
65 * start an asynchronous compare for each candidate target
71 for ( i = 0; i < mi->mi_ntargets; i++ ) {
72 metasingleconn_t *msc = &mc->mc_conns[ i ];
73 struct berval mdn = BER_BVNULL;
74 struct berval mapped_attr = op->orc_ava->aa_desc->ad_cname;
75 struct berval mapped_value = op->orc_ava->aa_value;
77 if ( candidates[ i ].sr_tag != META_CANDIDATE ) {
83 * Rewrite the compare dn, if needed
85 dc.target = &mi->mi_targets[ i ];
87 switch ( ldap_back_dn_massage( &dc, &op->o_req_dn, &mdn ) ) {
88 case LDAP_UNWILLING_TO_PERFORM:
97 * if attr is objectClass, try to remap the value
99 if ( op->orc_ava->aa_desc == slap_schema.si_ad_objectClass ) {
100 ldap_back_map( &mi->mi_targets[ i ].mt_rwmap.rwm_oc,
101 &op->orc_ava->aa_value,
102 &mapped_value, BACKLDAP_MAP );
104 if ( BER_BVISNULL( &mapped_value ) || mapped_value.bv_val[0] == '\0' ) {
108 * else try to remap the attribute
111 ldap_back_map( &mi->mi_targets[ i ].mt_rwmap.rwm_at,
112 &op->orc_ava->aa_desc->ad_cname,
113 &mapped_attr, BACKLDAP_MAP );
114 if ( BER_BVISNULL( &mapped_attr ) || mapped_attr.bv_val[0] == '\0' ) {
118 if ( op->orc_ava->aa_desc->ad_type->sat_syntax == slap_schema.si_syn_distinguishedName )
120 dc.ctx = "compareAttrDN";
122 switch ( ldap_back_dn_massage( &dc, &op->orc_ava->aa_value, &mapped_value ) )
124 case LDAP_UNWILLING_TO_PERFORM:
135 * the compare op is spawned across the targets and the first
136 * that returns determines the result; a constraint on unicity
137 * of the result ought to be enforced
139 rc = ldap_compare_ext( mc->mc_conns[ i ].msc_ld, mdn.bv_val,
140 mapped_attr.bv_val, &mapped_value,
141 op->o_ctrls, NULL, &msgid[ i ] );
143 if ( mdn.bv_val != op->o_req_dn.bv_val ) {
148 if ( mapped_attr.bv_val != op->orc_ava->aa_desc->ad_cname.bv_val ) {
149 free( mapped_attr.bv_val );
150 BER_BVZERO( &mapped_attr );
153 if ( mapped_value.bv_val != op->orc_ava->aa_value.bv_val ) {
154 free( mapped_value.bv_val );
155 BER_BVZERO( &mapped_value );
158 if ( rc != LDAP_SUCCESS ) {
159 /* FIXME: what should we do with the error? */
169 for ( rc = 0, count = 0; ncandidates > 0; ) {
172 * FIXME: should we check for abandon?
174 for ( i = 0; i < mi->mi_ntargets; i++ ) {
175 metasingleconn_t *msc = &mc->mc_conns[ i ];
177 LDAPMessage *res = NULL;
178 struct timeval tv = { 0 };
183 if ( msgid[ i ] == -1 ) {
187 lrc = ldap_result( msc->msc_ld, msgid[ i ],
191 assert( res == NULL );
194 } else if ( lrc == -1 ) {
195 /* we do not retry in this case;
196 * only for unique operations... */
197 ldap_get_option( msc->msc_ld,
198 LDAP_OPT_ERROR_NUMBER, &rs->sr_err );
199 rres = slap_map_api2result( rs );
204 } else if ( lrc == LDAP_RES_COMPARE ) {
211 rc = ldap_parse_result( msc->msc_ld, res,
213 NULL, NULL, NULL, NULL, 1 );
214 if ( rc != LDAP_SUCCESS ) {
220 switch ( rs->sr_err ) {
221 case LDAP_COMPARE_TRUE:
222 case LDAP_COMPARE_FALSE:
225 * true or false, got it;
226 * sending to cache ...
228 if ( mi->mi_cache.ttl != META_DNCACHE_DISABLED ) {
229 ( void )meta_dncache_update_entry( &mi->mi_cache, &op->o_req_ndn, i );
237 rres = slap_map_api2result( rs );
242 ldap_get_option( msc->msc_ld,
243 LDAP_OPT_ERROR_STRING, &err );
245 if ( match != NULL ) {
248 ldap_get_option( msc->msc_ld,
249 LDAP_OPT_MATCHED_DN, &match );
271 * Rewrite the matched portion of the search base, if required
273 * FIXME: only the last one gets caught!
276 if ( match != NULL ) {
282 * the result of the compare is assigned to the res code
283 * that will be returned
288 * At least one compare failed with matched portion,
289 * and none was successful
291 } else if ( match != NULL && match[0] != '\0' ) {
292 struct berval matched;
294 ber_str2bv( match, 0, 0, &matched );
296 dc.ctx = "matchedDN";
297 ldap_back_dn_massage( &dc, &matched, &mmatch );
300 if ( rres != LDAP_SUCCESS ) {
303 rs->sr_matched = mmatch.bv_val;
304 send_ldap_result( op, rs );
305 rs->sr_matched = NULL;
307 if ( match != NULL ) {
308 if ( mmatch.bv_val != match ) {
309 free( mmatch.bv_val );