/* $OpenLDAP$ */ /* This work is part of OpenLDAP Software . * * Copyright 1999-2004 The OpenLDAP Foundation. * Portions Copyright 2001-2003 Pierangelo Masarati. * Portions Copyright 1999-2003 Howard Chu. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted only as authorized by the OpenLDAP * Public License. * * A copy of this license is available in the file LICENSE in the * top-level directory of the distribution or, alternatively, at * . */ /* ACKNOWLEDGEMENTS: * This work was initially developed by the Howard Chu for inclusion * in OpenLDAP Software and subsequently enhanced by Pierangelo * Masarati. */ #include "portable.h" #include #include #include #include "slap.h" #include "../back-ldap/back-ldap.h" #include "back-meta.h" int meta_back_compare( Operation *op, SlapReply *rs ) { struct metainfo *li = ( struct metainfo * )op->o_bd->be_private; struct metaconn *lc; struct metasingleconn *lsc; char *match = NULL, *err = NULL; struct berval mmatch = BER_BVNULL; int candidates = 0, last = 0, i, count = 0, rc; int cres = LDAP_SUCCESS, rres = LDAP_SUCCESS; int *msgid; dncookie dc; lc = meta_back_getconn( op, rs, META_OP_ALLOW_MULTIPLE, &op->o_req_ndn, NULL ); if ( !lc ) { send_ldap_result( op, rs ); return -1; } if ( !meta_back_dobind( lc, op ) ) { rs->sr_err = LDAP_OTHER; send_ldap_result( op, rs ); return -1; } msgid = ch_calloc( sizeof( int ), li->ntargets ); if ( msgid == NULL ) { return -1; } /* * start an asynchronous compare for each candidate target */ dc.conn = op->o_conn; dc.rs = rs; dc.ctx = "compareDN"; for ( i = 0, lsc = lc->conns; !META_LAST(lsc); ++i, ++lsc ) { struct berval mdn = BER_BVNULL; struct berval mapped_attr = op->oq_compare.rs_ava->aa_desc->ad_cname; struct berval mapped_value = op->oq_compare.rs_ava->aa_value; if ( lsc->candidate != META_CANDIDATE ) { msgid[ i ] = -1; continue; } /* * Rewrite the compare dn, if needed */ dc.rwmap = &li->targets[ i ]->rwmap; switch ( ldap_back_dn_massage( &dc, &op->o_req_dn, &mdn ) ) { case LDAP_UNWILLING_TO_PERFORM: rc = 1; goto finish; default: break; } /* * if attr is objectClass, try to remap the value */ if ( op->oq_compare.rs_ava->aa_desc == slap_schema.si_ad_objectClass ) { ldap_back_map( &li->targets[ i ]->rwmap.rwm_oc, &op->oq_compare.rs_ava->aa_value, &mapped_value, BACKLDAP_MAP ); if ( mapped_value.bv_val == NULL || mapped_value.bv_val[0] == '\0' ) { continue; } /* * else try to remap the attribute */ } else { ldap_back_map( &li->targets[ i ]->rwmap.rwm_at, &op->oq_compare.rs_ava->aa_desc->ad_cname, &mapped_attr, BACKLDAP_MAP ); if ( mapped_attr.bv_val == NULL || mapped_attr.bv_val[0] == '\0' ) { continue; } if ( op->oq_compare.rs_ava->aa_desc->ad_type->sat_syntax == slap_schema.si_syn_distinguishedName ) { dc.ctx = "compareAttrDN"; switch ( ldap_back_dn_massage( &dc, &op->oq_compare.rs_ava->aa_value, &mapped_value ) ) { case LDAP_UNWILLING_TO_PERFORM: rc = 1; goto finish; default: break; } } } /* * 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.bv_val, mapped_attr.bv_val, mapped_value.bv_val ); if ( mdn.bv_val != op->o_req_dn.bv_val ) { free( mdn.bv_val ); mdn.bv_val = NULL; } if ( mapped_attr.bv_val != op->oq_compare.rs_ava->aa_desc->ad_cname.bv_val ) { free( mapped_attr.bv_val ); } if ( mapped_value.bv_val != op->oq_compare.rs_ava->aa_value.bv_val ) { free( mapped_value.bv_val ); } if ( msgid[ i ] == -1 ) { continue; } ++candidates; } /* * wait for replies */ for ( rc = 0, count = 0; candidates > 0; ) { /* * FIXME: should we check for abandon? */ for ( i = 0, lsc = lc->conns; !META_LAST(lsc); lsc++, i++ ) { int lrc; LDAPMessage *res = NULL; if ( msgid[ i ] == -1 ) { continue; } lrc = ldap_result( lsc->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_OTHER; rc = -1; goto finish; } rs->sr_err = ldap_result2error( lsc->ld, res, 1 ); switch ( rs->sr_err ) { 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, &op->o_req_ndn, i ); } count++; rc = 0; break; default: rres = slap_map_api2result( rs ); if ( err != NULL ) { free( err ); } ldap_get_option( lsc->ld, LDAP_OPT_ERROR_STRING, &err ); if ( match != NULL ) { free( match ); } ldap_get_option( lsc->ld, LDAP_OPT_MATCHED_DN, &match ); last = i; break; } msgid[ i ] = -1; --candidates; } else { msgid[ i ] = -1; --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; /* * At least one compare failed with matched portion, * and none was successful */ } else if ( match != NULL && match[0] != '\0' ) { struct berval matched; matched.bv_val = match; matched.bv_len = strlen( match ); dc.ctx = "matchedDN"; ldap_back_dn_massage( &dc, &matched, &mmatch ); } if ( rres != LDAP_SUCCESS ) { rs->sr_err = rres; } rs->sr_matched = mmatch.bv_val; send_ldap_result( op, rs ); rs->sr_matched = NULL; if ( match != NULL ) { if ( mmatch.bv_val != match ) { free( mmatch.bv_val ); } free( match ); } if ( msgid ) { free( msgid ); } return rc; }