/* * Copyright 1998-2001 The OpenLDAP Foundation, All Rights Reserved. * COPYING RESTRICTIONS APPLY, see COPYRIGHT file * * Copyright 2001, Pierangelo Masarati, All rights reserved. * * This work has been developed to fulfill the requirements * of SysNet s.n.c. and it has been donated * to the OpenLDAP Foundation in the hope that it may be useful * to the Open Source community, but WITHOUT ANY WARRANTY. * * Permission is granted to anyone to use this software for any purpose * on any computer system, and to alter it and redistribute it, subject * to the following restrictions: * * 1. The author and SysNet s.n.c. are not responsible for the consequences * of use of this software, no matter how awful, even if they arise from * flaws in it. * * 2. The origin of this software must not be misrepresented, either by * explicit claim or by omission. Since few users ever read sources, * credits should appear in the documentation. * * 3. Altered versions must be plainly marked as such, and must not be * misrepresented as being the original software. Since few users * ever read sources, credits should appear in the documentation. * SysNet s.n.c. cannot be responsible for the consequences of the * alterations. * * 4. This notice may not be removed or altered. * * * This software is based on the backend back-ldap, implemented * by Howard Chu , and modified by Mark Valence * , Pierangelo Masarati and other * contributors. The contribution of the original software to the present * implementation is acknowledged in this copyright statement. * * A special acknowledgement goes to Howard for the overall architecture * (and for borrowing large pieces of code), and to Mark, who implemented * from scratch the attribute/objectclass mapping. * * The original copyright statement follows. * * Copyright 1999, Howard Chu, All rights reserved. * * Permission is granted to anyone to use this software for any purpose * on any computer system, and to alter it and redistribute it, subject * to the following restrictions: * * 1. The author is not responsible for the consequences of use of this * software, no matter how awful, even if they arise from flaws in it. * * 2. The origin of this software must not be misrepresented, either by * explicit claim or by omission. Since few users ever read sources, * credits should appear in the documentation. * * 3. Altered versions must be plainly marked as such, and must not be * misrepresented as being the original software. Since few users * ever read sources, credits should appear in the * documentation. * * 4. This notice may not be removed or altered. * */ #include "portable.h" #include #include #include #include "slap.h" #include "../back-ldap/back-ldap.h" #include "back-meta.h" int meta_back_compare( Backend *be, Connection *conn, Operation *op, struct berval *dn, struct berval *ndn, AttributeAssertion *ava ) { struct metainfo *li = ( struct metainfo * )be->be_private; struct metaconn *lc; struct metasingleconn **lsc; char *match = NULL, *err = NULL, *mmatch = NULL; int candidates = 0, last = 0, i, count, rc; int cres = LDAP_SUCCESS, rres = LDAP_SUCCESS; int *msgid; lc = meta_back_getconn( li, conn, op, META_OP_ALLOW_MULTIPLE, ndn, NULL ); if ( !lc || !meta_back_dobind( lc, op ) ) { return -1; } msgid = ch_calloc( sizeof( int ), li->ntargets ); if ( msgid == NULL ) { return -1; } /* * start an asynchronous compare for each candidate target */ for ( i = 0, lsc = lc->conns; lsc[ 0 ] != NULL; ++i, ++lsc ) { char *mdn = NULL; char *mapped_attr = ava->aa_desc->ad_cname.bv_val; char *mapped_value = ava->aa_value.bv_val; if ( lsc[ 0 ]->candidate != META_CANDIDATE ) { continue; } /* * Rewrite the compare dn, if needed */ switch ( rewrite_session( li->targets[ i ]->rwinfo, "compareDn", dn->bv_val, conn, &mdn ) ) { case REWRITE_REGEXEC_OK: if ( mdn == NULL ) { mdn = ( char * )dn->bv_val; } #ifdef NEW_LOGGING LDAP_LOG(( "backend", LDAP_LEVEL_DETAIL1, "[rw] compareDn: \"%s\" -> \"%s\"\n", dn->bv_val, mdn )); #else /* !NEW_LOGGING */ Debug( LDAP_DEBUG_ARGS, "rw> compareDn: \"%s\" -> \"%s\"\n%s", dn->bv_val, mdn, "" ); #endif /* !NEW_LOGGING */ break; case REWRITE_REGEXEC_UNWILLING: send_ldap_result( conn, op, LDAP_UNWILLING_TO_PERFORM, NULL, "Unwilling to perform", NULL, NULL ); return -1; case REWRITE_REGEXEC_ERR: send_ldap_result( conn, op, LDAP_OPERATIONS_ERROR, NULL, "Operations error", NULL, NULL ); return -1; } /* * if attr is objectClass, try to remap the value */ if ( ava->aa_desc->ad_type->sat_oid == slap_schema.si_ad_objectClass->ad_type->sat_oid ) { mapped_value = ldap_back_map( &li->targets[ i ]->oc_map, ava->aa_value.bv_val, 0 ); if ( mapped_value == NULL ) { lsc[ 0 ]->candidate = META_NOT_CANDIDATE; continue; } /* * else try to remap the attribute */ } else { mapped_attr = ldap_back_map( &li->targets[ i ]->at_map, ava->aa_desc->ad_cname.bv_val, 0 ); if ( mapped_attr == NULL ) { lsc[ 0 ]->candidate = META_NOT_CANDIDATE; continue; } } /* * the compare op is spawned across the targets and the first * that returns determines the result; a constraint on unicity * of the result ought to be enforced */ msgid[ i ] = ldap_compare( lc->conns[ i ]->ld, mdn, mapped_attr, mapped_value ); if ( msgid[ i ] == -1 ) { lsc[ 0 ]->candidate = META_NOT_CANDIDATE; continue; } if ( mdn != dn->bv_val ) { free( mdn ); } if ( mapped_attr != ava->aa_desc->ad_cname.bv_val ) { free( mapped_attr ); } if ( mapped_value != ava->aa_value.bv_val ) { free( mapped_value ); } ++candidates; } /* * wait for replies */ for ( rc = 0, count = 0; candidates > 0; ) { /* * FIXME: should we check for abandon? */ for ( i = 0, lsc = lc->conns; lsc[ 0 ] != NULL; lsc++, i++ ) { int lrc; LDAPMessage *res = NULL; if ( lsc[ 0 ]->candidate != META_CANDIDATE ) { continue; } lrc = ldap_result( lsc[ 0 ]->ld, msgid[ i ], 0, NULL, &res ); if ( lrc == 0 ) { /* * FIXME: should we yield? */ if ( res ) { ldap_msgfree( res ); } continue; } else if ( lrc == LDAP_RES_COMPARE ) { if ( count > 0 ) { rres = LDAP_OPERATIONS_ERROR; rc = -1; goto finish; } cres = ldap_result2error( lsc[ 0 ]->ld, res, 1 ); switch ( cres ) { case LDAP_COMPARE_TRUE: case LDAP_COMPARE_FALSE: /* * true or flase, got it; * sending to cache ... */ if ( li->cache.ttl != META_DNCACHE_DISABLED ) { ( void )meta_dncache_update_entry( &li->cache, ber_bvdup( ndn ), i ); } count++; rc = 0; break; default: rres = ldap_back_map_result( cres ); if ( err != NULL ) { free( err ); } ldap_get_option( lsc[ 0 ]->ld, LDAP_OPT_ERROR_STRING, &err ); if ( match != NULL ) { free( match ); } ldap_get_option( lsc[ 0 ]->ld, LDAP_OPT_MATCHED_DN, &match ); last = i; break; } lsc[ 0 ]->candidate = META_NOT_CANDIDATE; --candidates; } else { lsc[ 0 ]->candidate = META_NOT_CANDIDATE; --candidates; if ( res ) { ldap_msgfree( res ); } break; } } } finish:; /* * Rewrite the matched portion of the search base, if required * * FIXME: only the last one gets caught! */ if ( count == 1 ) { if ( match != NULL ) { free( match ); match = NULL; } /* * the result of the compare is assigned to the res code * that will be returned */ rres = cres; } else if ( match != NULL ) { /* * At least one compare failed with matched portion, * and none was successful */ switch ( rewrite_session( li->targets[ last ]->rwinfo, "matchedDn", match, conn, &mmatch ) ) { case REWRITE_REGEXEC_OK: if ( mmatch == NULL ) { mmatch = ( char * )match; } #ifdef NEW_LOGGING LDAP_LOG(( "backend", LDAP_LEVEL_DETAIL1, "[rw] matchedDn: \"%s\" -> \"%s\"\n", match, mmatch )); #else /* !NEW_LOGGING */ Debug( LDAP_DEBUG_ARGS, "rw> matchedDn:" " \"%s\" -> \"%s\"\n%s", match, mmatch, "" ); #endif /* !NEW_LOGGING */ break; case REWRITE_REGEXEC_UNWILLING: send_ldap_result( conn, op, LDAP_UNWILLING_TO_PERFORM, NULL, "Unwilling to perform", NULL, NULL ); rc = -1; goto cleanup; case REWRITE_REGEXEC_ERR: send_ldap_result( conn, op, LDAP_OPERATIONS_ERROR, NULL, "Operations error", NULL, NULL ); rc = -1; goto cleanup; } } send_ldap_result( conn, op, rres, mmatch, err, NULL, NULL ); cleanup:; if ( match != NULL ) { if ( mmatch != match ) { free( mmatch ); } free( match ); } if ( msgid ) { free( msgid ); } return rc; }