2 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
4 * Copyright 1999-2007 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/socket.h>
28 #include <ac/string.h>
33 #include "../back-ldap/back-ldap.h"
34 #include "back-meta.h"
35 #undef ldap_debug /* silence a warning in ldap-int.h */
37 #include "../../../libraries/libldap/ldap-int.h"
39 /* IGNORE means that target does not (no longer) participate
41 * NOTREADY means the search on that target has not been initialized yet
43 #define META_MSGID_IGNORE (-1)
44 #define META_MSGID_NEED_BIND (-2)
54 typedef enum meta_search_candidate_t {
55 META_SEARCH_UNDEFINED = -2,
57 META_SEARCH_NOT_CANDIDATE,
58 META_SEARCH_CANDIDATE,
61 } meta_search_candidate_t;
64 * meta_search_dobind_init()
66 * initiates bind for a candidate target of a search.
68 static meta_search_candidate_t
69 meta_search_dobind_init(
74 SlapReply *candidates )
76 metaconn_t *mc = *mcp;
77 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
78 metatarget_t *mt = mi->mi_targets[ candidate ];
79 metasingleconn_t *msc = &mc->mc_conns[ candidate ];
81 struct berval binddn = msc->msc_bound_ndn,
87 meta_search_candidate_t retcode;
89 Debug( LDAP_DEBUG_TRACE, "%s >>> meta_search_dobind_init[%d]\n",
90 op->o_log_prefix, candidate, 0 );
93 * all the targets are already bound as pseudoroot
95 if ( mc->mc_authz_target == META_BOUND_ALL ) {
96 return META_SEARCH_CANDIDATE;
99 retcode = META_SEARCH_BINDING;
100 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
101 if ( LDAP_BACK_CONN_ISBOUND( msc ) || LDAP_BACK_CONN_ISANON( msc ) ) {
102 /* already bound (or anonymous) */
105 char buf[ SLAP_TEXT_BUFLEN ] = { '\0' };
108 if ( LDAP_BACK_CONN_ISBOUND( msc ) ) {
112 snprintf( buf, sizeof( buf ), " mc=%p ld=%p%s DN=\"%s\"",
113 (void *)mc, (void *)msc->msc_ld,
114 bound ? " bound" : " anonymous",
115 bound == 0 ? "" : msc->msc_bound_ndn.bv_val );
116 Debug( LDAP_DEBUG_ANY, "### %s meta_search_dobind_init[%d]%s\n",
117 op->o_log_prefix, candidate, buf );
118 #endif /* DEBUG_205 */
120 retcode = META_SEARCH_CANDIDATE;
122 } else if ( META_BACK_CONN_CREATING( msc ) || LDAP_BACK_CONN_BINDING( msc ) ) {
123 /* another thread is binding the target for this conn; wait */
126 char buf[ SLAP_TEXT_BUFLEN ] = { '\0' };
128 snprintf( buf, sizeof( buf ), " mc=%p ld=%p needbind",
129 (void *)mc, (void *)msc->msc_ld );
130 Debug( LDAP_DEBUG_ANY, "### %s meta_search_dobind_init[%d]%s\n",
131 op->o_log_prefix, candidate, buf );
132 #endif /* DEBUG_205 */
134 candidates[ candidate ].sr_msgid = META_MSGID_NEED_BIND;
135 retcode = META_SEARCH_NEED_BIND;
138 /* we'll need to bind the target for this conn */
141 char buf[ SLAP_TEXT_BUFLEN ];
143 snprintf( buf, sizeof( buf ), " mc=%p ld=%p binding",
144 (void *)mc, (void *)msc->msc_ld );
145 Debug( LDAP_DEBUG_ANY, "### %s meta_search_dobind_init[%d]%s\n",
146 op->o_log_prefix, candidate, buf );
147 #endif /* DEBUG_205 */
149 if ( msc->msc_ld == NULL ) {
150 /* for some reason (e.g. because formerly in "binding"
151 * state, with eventual connection expiration or invalidation)
152 * it was not initialized as expected */
154 Debug( LDAP_DEBUG_ANY, "%s meta_search_dobind_init[%d] mc=%p ld=NULL\n",
155 op->o_log_prefix, candidate, (void *)mc );
157 rc = meta_back_init_one_conn( op, rs, *mcp, candidate,
158 LDAP_BACK_CONN_ISPRIV( *mcp ), LDAP_BACK_DONTSEND, 0 );
161 assert( msc->msc_ld != NULL );
164 case LDAP_SERVER_DOWN:
165 case LDAP_UNAVAILABLE:
166 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
170 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
175 LDAP_BACK_CONN_BINDING_SET( msc );
178 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
180 if ( retcode != META_SEARCH_BINDING ) {
184 /* NOTE: this obsoletes pseudorootdn */
185 if ( op->o_conn != NULL &&
186 !op->o_do_not_cache &&
187 ( BER_BVISNULL( &msc->msc_bound_ndn ) ||
188 BER_BVISEMPTY( &msc->msc_bound_ndn ) ||
189 ( mt->mt_idassert_flags & LDAP_BACK_AUTH_OVERRIDE ) ) )
191 rc = meta_back_proxy_authz_cred( mc, candidate, op, rs, LDAP_BACK_DONTSEND, &binddn, &cred, &method );
192 if ( rc != LDAP_SUCCESS ) {
196 /* NOTE: we copy things here, even if bind didn't succeed yet,
197 * because the connection is not shared until bind is over */
198 if ( !BER_BVISNULL( &binddn ) ) {
199 ber_bvreplace( &msc->msc_bound_ndn, &binddn );
200 if ( LDAP_BACK_SAVECRED( mi ) && !BER_BVISNULL( &cred ) ) {
201 if ( !BER_BVISNULL( &msc->msc_cred ) ) {
202 memset( msc->msc_cred.bv_val, 0,
203 msc->msc_cred.bv_len );
205 ber_bvreplace( &msc->msc_cred, &cred );
209 if ( LDAP_BACK_CONN_ISBOUND( msc ) ) {
210 /* apparently, idassert was configured with SASL bind,
211 * so bind occurred inside meta_back_proxy_authz_cred() */
212 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
213 LDAP_BACK_CONN_BINDING_CLEAR( msc );
214 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
215 return META_SEARCH_CANDIDATE;
221 case LDAP_AUTH_SIMPLE:
222 /* do a simple bind with binddn, cred */
231 assert( msc->msc_ld != NULL );
234 rc = ldap_sasl_bind( msc->msc_ld, binddn.bv_val, LDAP_SASL_SIMPLE, &cred,
235 NULL, NULL, &candidates[ candidate ].sr_msgid );
239 char buf[ SLAP_TEXT_BUFLEN ];
241 snprintf( buf, sizeof( buf ), "meta_search_dobind_init[%d] mc=%p ld=%p rc=%d",
242 candidate, (void *)mc, (void *)mc->mc_conns[ candidate ].msc_ld, rc );
243 Debug( LDAP_DEBUG_ANY, "### %s %s\n",
244 op->o_log_prefix, buf, 0 );
246 #endif /* DEBUG_205 */
250 assert( candidates[ candidate ].sr_msgid >= 0 );
251 META_BINDING_SET( &candidates[ candidate ] );
252 return META_SEARCH_BINDING;
254 case LDAP_SERVER_DOWN:
256 /* This is the worst thing that could happen:
257 * the search will wait until the retry is over. */
258 if ( !META_IS_RETRYING( &candidates[ candidate ] ) ) {
259 META_RETRYING_SET( &candidates[ candidate ] );
261 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
263 assert( mc->mc_refcnt > 0 );
264 if ( StatslogTest( LDAP_DEBUG_ANY ) ) {
265 char buf[ SLAP_TEXT_BUFLEN ];
267 /* this lock is required; however,
268 * it's invoked only when logging is on */
269 ldap_pvt_thread_mutex_lock( &mt->mt_uri_mutex );
270 snprintf( buf, sizeof( buf ),
271 "retrying URI=\"%s\" DN=\"%s\"",
273 BER_BVISNULL( &msc->msc_bound_ndn ) ?
274 "" : msc->msc_bound_ndn.bv_val );
275 ldap_pvt_thread_mutex_unlock( &mt->mt_uri_mutex );
277 Debug( LDAP_DEBUG_ANY,
278 "%s meta_search_dobind_init[%d]: %s.\n",
279 op->o_log_prefix, candidate, buf );
282 meta_clear_one_candidate( op, mc, candidate );
283 LDAP_BACK_CONN_ISBOUND_CLEAR( msc );
285 ( void )rewrite_session_delete( mt->mt_rwmap.rwm_rw, op->o_conn );
287 /* mc here must be the regular mc, reset and ready for init */
288 rc = meta_back_init_one_conn( op, rs, mc, candidate,
289 LDAP_BACK_CONN_ISPRIV( mc ), LDAP_BACK_DONTSEND, 0 );
291 if ( rc == LDAP_SUCCESS ) {
292 LDAP_BACK_CONN_BINDING_SET( msc );
295 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
297 if ( rc == LDAP_SUCCESS ) {
298 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
303 if ( *mcp == NULL ) {
304 retcode = META_SEARCH_ERR;
305 rs->sr_err = LDAP_UNAVAILABLE;
313 rc = slap_map_api2result( rs );
315 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
316 meta_clear_one_candidate( op, mc, candidate );
317 candidates[ candidate ].sr_err = rc;
318 if ( META_BACK_ONERR_STOP( mi ) ) {
319 LDAP_BACK_CONN_TAINTED_SET( mc );
320 meta_back_release_conn_lock( mi, mc, 0 );
324 retcode = META_SEARCH_ERR;
327 retcode = META_SEARCH_NOT_CANDIDATE;
329 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
330 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
337 static meta_search_candidate_t
338 meta_search_dobind_result(
343 SlapReply *candidates,
346 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
347 metaconn_t *mc = *mcp;
348 metasingleconn_t *msc = &mc->mc_conns[ candidate ];
350 meta_search_candidate_t retcode = META_SEARCH_NOT_CANDIDATE;
353 assert( msc->msc_ld != NULL );
355 /* FIXME: matched? referrals? response controls? */
356 rc = ldap_parse_result( msc->msc_ld, res,
357 &candidates[ candidate ].sr_err,
358 NULL, NULL, NULL, NULL, 0 );
359 if ( rc != LDAP_SUCCESS ) {
360 candidates[ candidate ].sr_err = rc;
363 rc = slap_map_api2result( &candidates[ candidate ] );
366 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
367 LDAP_BACK_CONN_BINDING_CLEAR( msc );
368 if ( rc != LDAP_SUCCESS ) {
369 meta_clear_one_candidate( op, mc, candidate );
370 candidates[ candidate ].sr_err = rc;
371 if ( META_BACK_ONERR_STOP( mi ) ) {
372 LDAP_BACK_CONN_TAINTED_SET( mc );
373 meta_back_release_conn_lock( mi, mc, 0 );
375 retcode = META_SEARCH_ERR;
380 /* FIXME: check if bound as idassert authcDN! */
381 if ( BER_BVISNULL( &msc->msc_bound_ndn )
382 || BER_BVISEMPTY( &msc->msc_bound_ndn ) )
384 LDAP_BACK_CONN_ISANON_SET( msc );
387 LDAP_BACK_CONN_ISBOUND_SET( msc );
389 retcode = META_SEARCH_CANDIDATE;
392 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
393 META_BINDING_CLEAR( &candidates[ candidate ] );
395 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
400 static meta_search_candidate_t
401 meta_back_search_start(
407 SlapReply *candidates )
409 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
410 metatarget_t *mt = mi->mi_targets[ candidate ];
411 metasingleconn_t *msc = &(*mcp)->mc_conns[ candidate ];
412 struct berval realbase = op->o_req_dn;
413 int realscope = op->ors_scope;
414 struct berval mbase = BER_BVNULL;
415 struct berval mfilter = BER_BVNULL;
416 char **mapped_attrs = NULL;
418 meta_search_candidate_t retcode;
419 struct timeval tv, *tvp = NULL;
421 LDAPControl **ctrls = NULL;
423 /* this should not happen; just in case... */
424 if ( msc->msc_ld == NULL ) {
425 Debug( LDAP_DEBUG_ANY,
426 "%s: meta_back_search_start candidate=%d ld=NULL%s.\n",
427 op->o_log_prefix, candidate,
428 META_BACK_ONERR_STOP( mi ) ? "" : " (ignored)" );
429 candidates[ candidate ].sr_err = LDAP_OTHER;
430 if ( META_BACK_ONERR_STOP( mi ) ) {
431 return META_SEARCH_ERR;
433 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
434 return META_SEARCH_NOT_CANDIDATE;
437 Debug( LDAP_DEBUG_TRACE, "%s >>> meta_back_search_start[%d]\n", op->o_log_prefix, candidate, 0 );
440 * modifies the base according to the scope, if required
442 if ( mt->mt_nsuffix.bv_len > op->o_req_ndn.bv_len ) {
443 switch ( op->ors_scope ) {
444 case LDAP_SCOPE_SUBTREE:
446 * make the target suffix the new base
447 * FIXME: this is very forgiving, because
448 * "illegal" searchBases may be turned
449 * into the suffix of the target; however,
450 * the requested searchBase already passed
451 * thru the candidate analyzer...
453 if ( dnIsSuffix( &mt->mt_nsuffix, &op->o_req_ndn ) ) {
454 realbase = mt->mt_nsuffix;
455 if ( mt->mt_scope == LDAP_SCOPE_SUBORDINATE ) {
456 realscope = LDAP_SCOPE_SUBORDINATE;
461 * this target is no longer candidate
463 retcode = META_SEARCH_NOT_CANDIDATE;
468 case LDAP_SCOPE_SUBORDINATE:
469 case LDAP_SCOPE_ONELEVEL:
471 struct berval rdn = mt->mt_nsuffix;
472 rdn.bv_len -= op->o_req_ndn.bv_len + STRLENOF( "," );
473 if ( dnIsOneLevelRDN( &rdn )
474 && dnIsSuffix( &mt->mt_nsuffix, &op->o_req_ndn ) )
477 * if there is exactly one level,
478 * make the target suffix the new
479 * base, and make scope "base"
481 realbase = mt->mt_nsuffix;
482 if ( op->ors_scope == LDAP_SCOPE_SUBORDINATE ) {
483 if ( mt->mt_scope == LDAP_SCOPE_SUBORDINATE ) {
484 realscope = LDAP_SCOPE_SUBORDINATE;
486 realscope = LDAP_SCOPE_SUBTREE;
489 realscope = LDAP_SCOPE_BASE;
492 } /* else continue with the next case */
495 case LDAP_SCOPE_BASE:
497 * this target is no longer candidate
499 retcode = META_SEARCH_NOT_CANDIDATE;
504 /* initiate dobind */
505 retcode = meta_search_dobind_init( op, rs, mcp, candidate, candidates );
507 Debug( LDAP_DEBUG_TRACE, "%s <<< meta_search_dobind_init[%d]=%d\n", op->o_log_prefix, candidate, retcode );
509 if ( retcode != META_SEARCH_CANDIDATE ) {
514 * Rewrite the search base, if required
517 dc->ctx = "searchBase";
518 switch ( ldap_back_dn_massage( dc, &realbase, &mbase ) ) {
522 case LDAP_UNWILLING_TO_PERFORM:
523 rs->sr_err = LDAP_UNWILLING_TO_PERFORM;
524 rs->sr_text = "Operation not allowed";
525 send_ldap_result( op, rs );
526 retcode = META_SEARCH_ERR;
532 * this target is no longer candidate
534 retcode = META_SEARCH_NOT_CANDIDATE;
541 rc = ldap_back_filter_map_rewrite( dc, op->ors_filter,
542 &mfilter, BACKLDAP_MAP );
547 case LDAP_COMPARE_FALSE:
550 * this target is no longer candidate
552 retcode = META_SEARCH_NOT_CANDIDATE;
557 * Maps required attributes
559 rc = ldap_back_map_attrs( &mt->mt_rwmap.rwm_at,
560 op->ors_attrs, BACKLDAP_MAP, &mapped_attrs );
561 if ( rc != LDAP_SUCCESS ) {
563 * this target is no longer candidate
565 retcode = META_SEARCH_NOT_CANDIDATE;
569 /* should we check return values? */
570 if ( op->ors_deref != -1 ) {
571 assert( msc->msc_ld != NULL );
572 (void)ldap_set_option( msc->msc_ld, LDAP_OPT_DEREF,
573 ( void * )&op->ors_deref );
576 if ( op->ors_tlimit != SLAP_NO_LIMIT ) {
577 tv.tv_sec = op->ors_tlimit > 0 ? op->ors_tlimit : 1;
584 if ( ldap_back_proxy_authz_ctrl( &msc->msc_bound_ndn,
585 mt->mt_version, &mt->mt_idassert, op, rs, &ctrls )
588 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
589 retcode = META_SEARCH_NOT_CANDIDATE;
596 assert( msc->msc_ld != NULL );
597 rc = ldap_search_ext( msc->msc_ld,
598 mbase.bv_val, realscope, mfilter.bv_val,
599 mapped_attrs, op->ors_attrsonly,
600 ctrls, NULL, tvp, op->ors_slimit,
601 &candidates[ candidate ].sr_msgid );
604 retcode = META_SEARCH_CANDIDATE;
607 case LDAP_SERVER_DOWN:
608 if ( nretries && meta_back_retry( op, rs, mcp, candidate, LDAP_BACK_DONTSEND ) ) {
610 /* if the identity changed, there might be need to re-authz */
611 (void)ldap_back_proxy_authz_ctrl_free( op, &ctrls );
615 if ( *mcp == NULL ) {
616 retcode = META_SEARCH_ERR;
622 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
623 retcode = META_SEARCH_NOT_CANDIDATE;
627 (void)ldap_back_proxy_authz_ctrl_free( op, &ctrls );
629 if ( mapped_attrs ) {
630 free( mapped_attrs );
632 if ( mfilter.bv_val != op->ors_filterstr.bv_val ) {
633 free( mfilter.bv_val );
635 if ( mbase.bv_val != realbase.bv_val ) {
636 free( mbase.bv_val );
640 Debug( LDAP_DEBUG_TRACE, "%s <<< meta_back_search_start[%d]=%d\n", op->o_log_prefix, candidate, retcode );
646 meta_back_search( Operation *op, SlapReply *rs )
648 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
650 struct timeval save_tv = { 0, 0 },
652 time_t stoptime = (time_t)-1;
653 int rc = 0, sres = LDAP_SUCCESS;
654 char *matched = NULL;
655 int last = 0, ncandidates = 0,
656 initial_candidates = 0, candidate_match = 0,
658 ldap_back_send_t sendok = LDAP_BACK_SENDERR;
663 SlapReply *candidates = meta_back_candidates_get( op );
666 * controls are set in ldap_back_dobind()
668 * FIXME: in case of values return filter, we might want
669 * to map attrs and maybe rewrite value
672 mc = meta_back_getconn( op, rs, NULL, sendok );
677 dc.conn = op->o_conn;
683 for ( i = 0; i < mi->mi_ntargets; i++ ) {
684 /* reset sr_msgid; it is used in most loops
685 * to check if that target is still to be considered */
686 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
688 /* a target is marked as candidate by meta_back_getconn();
689 * if for any reason (an error, it's over or so) it is
690 * no longer active, sr_msgid is set to META_MSGID_IGNORE
691 * but it remains candidate, which means it has been active
692 * at some point during the operation. This allows to
693 * use its response code and more to compute the final
695 if ( !META_IS_CANDIDATE( &candidates[ i ] ) ) {
699 candidates[ i ].sr_matched = NULL;
700 candidates[ i ].sr_text = NULL;
701 candidates[ i ].sr_ref = NULL;
702 candidates[ i ].sr_ctrls = NULL;
705 for ( i = 0; i < mi->mi_ntargets; i++ ) {
706 if ( !META_IS_CANDIDATE( &candidates[ i ] )
707 || candidates[ i ].sr_err != LDAP_SUCCESS )
712 switch ( meta_back_search_start( op, rs, &dc, &mc, i, candidates ) )
714 case META_SEARCH_NOT_CANDIDATE:
715 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
718 case META_SEARCH_NEED_BIND:
722 case META_SEARCH_CANDIDATE:
723 case META_SEARCH_BINDING:
724 candidates[ i ].sr_type = REP_INTERMEDIATE;
728 case META_SEARCH_ERR:
729 savepriv = op->o_private;
730 op->o_private = (void *)i;
731 send_ldap_result( op, rs );
732 op->o_private = savepriv;
742 if ( ncandidates > 0 && needbind == ncandidates ) {
744 * give up the second time...
746 * NOTE: this should not occur the second time, since a fresh
747 * connection has ben created; however, targets may also
748 * need bind because the bind timed out or so.
750 if ( sendok & LDAP_BACK_BINDING ) {
751 Debug( LDAP_DEBUG_ANY,
752 "%s meta_back_search: unable to initialize conn\n",
753 op->o_log_prefix, 0, 0 );
754 rs->sr_err = LDAP_UNAVAILABLE;
755 rs->sr_text = "unable to initialize connection to remote targets";
756 send_ldap_result( op, rs );
761 /* FIXME: better create a separate connection? */
762 sendok |= LDAP_BACK_BINDING;
765 Debug( LDAP_DEBUG_ANY, "*** %s drop mc=%p create new connection\n",
766 op->o_log_prefix, (void *)mc, 0 );
767 #endif /* DEBUG_205 */
769 meta_back_release_conn( mi, mc );
778 initial_candidates = ncandidates;
780 if ( StatslogTest( LDAP_DEBUG_TRACE ) ) {
781 char cnd[ SLAP_TEXT_BUFLEN ];
784 for ( c = 0; c < mi->mi_ntargets; c++ ) {
785 if ( META_IS_CANDIDATE( &candidates[ c ] ) ) {
793 Debug( LDAP_DEBUG_TRACE, "%s meta_back_search: ncandidates=%d "
794 "cnd=\"%s\"\n", op->o_log_prefix, ncandidates, cnd );
797 if ( initial_candidates == 0 ) {
798 /* NOTE: here we are not sending any matchedDN;
799 * this is intended, because if the back-meta
800 * is serving this search request, but no valid
801 * candidate could be looked up, it means that
802 * there is a hole in the mapping of the targets
803 * and thus no knowledge of any remote superior
805 Debug( LDAP_DEBUG_ANY, "%s meta_back_search: "
806 "base=\"%s\" scope=%d: "
807 "no candidate could be selected\n",
808 op->o_log_prefix, op->o_req_dn.bv_val,
811 /* FIXME: we're sending the first error we encounter;
812 * maybe we should pick the worst... */
813 rc = LDAP_NO_SUCH_OBJECT;
814 for ( i = 0; i < mi->mi_ntargets; i++ ) {
815 if ( META_IS_CANDIDATE( &candidates[ i ] )
816 && candidates[ i ].sr_err != LDAP_SUCCESS )
818 rc = candidates[ i ].sr_err;
823 send_ldap_error( op, rs, rc, NULL );
828 /* We pull apart the ber result, stuff it into a slapd entry, and
829 * let send_search_entry stuff it back into ber format. Slow & ugly,
830 * but this is necessary for version matching, and for ACL processing.
833 if ( op->ors_tlimit != SLAP_NO_LIMIT ) {
834 stoptime = op->o_time + op->ors_tlimit;
838 * In case there are no candidates, no cycle takes place...
840 * FIXME: we might use a queue, to better balance the load
841 * among the candidates
843 for ( rc = 0; ncandidates > 0; ) {
846 alreadybound = ncandidates;
848 /* check time limit */
849 if ( op->ors_tlimit != SLAP_NO_LIMIT
850 && slap_get_time() > stoptime )
853 rc = rs->sr_err = LDAP_TIMELIMIT_EXCEEDED;
854 savepriv = op->o_private;
855 op->o_private = (void *)i;
856 send_ldap_result( op, rs );
857 op->o_private = savepriv;
861 for ( i = 0; i < mi->mi_ntargets; i++ ) {
862 meta_search_candidate_t retcode = META_SEARCH_UNDEFINED;
863 metasingleconn_t *msc = &mc->mc_conns[ i ];
864 LDAPMessage *res = NULL, *msg;
866 /* if msgid is invalid, don't ldap_result() */
867 if ( candidates[ i ].sr_msgid == META_MSGID_IGNORE ) {
871 /* if target still needs bind, retry */
872 if ( candidates[ i ].sr_msgid == META_MSGID_NEED_BIND ) {
873 /* initiate dobind */
874 retcode = meta_search_dobind_init( op, rs, &mc, i, candidates );
876 Debug( LDAP_DEBUG_TRACE, "%s <<< meta_search_dobind_init[%ld]=%d\n",
877 op->o_log_prefix, i, retcode );
880 case META_SEARCH_NEED_BIND:
884 case META_SEARCH_BINDING:
887 case META_SEARCH_ERR:
888 candidates[ i ].sr_err = rs->sr_err;
889 if ( META_BACK_ONERR_STOP( mi ) ) {
890 savepriv = op->o_private;
891 op->o_private = (void *)i;
892 send_ldap_result( op, rs );
893 op->o_private = savepriv;
898 case META_SEARCH_NOT_CANDIDATE:
900 * When no candidates are left,
901 * the outer cycle finishes
903 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
904 assert( ncandidates > 0 );
908 case META_SEARCH_CANDIDATE:
909 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
910 switch ( meta_back_search_start( op, rs, &dc, &mc, i, candidates ) )
912 case META_SEARCH_CANDIDATE:
913 assert( candidates[ i ].sr_msgid >= 0 );
916 case META_SEARCH_ERR:
917 candidates[ i ].sr_err = rs->sr_err;
918 if ( META_BACK_ONERR_STOP( mi ) ) {
919 savepriv = op->o_private;
920 op->o_private = (void *)i;
921 send_ldap_result( op, rs );
922 op->o_private = savepriv;
927 case META_SEARCH_NOT_CANDIDATE:
928 /* means that meta_back_search_start()
929 * failed but onerr == continue */
930 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
931 assert( ncandidates > 0 );
950 /* check for abandon */
951 if ( op->o_abandon || LDAP_BACK_CONN_ABANDON( mc ) ) {
956 if ( msc->msc_ld == NULL ) {
957 char buf[ SLAP_TEXT_BUFLEN ];
959 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
960 snprintf( buf, sizeof( buf ),
961 "%s meta_back_search[%ld] mc=%p msgid=%d%s%s%s\n",
962 op->o_log_prefix, (long)i, (void *)mc,
963 candidates[ i ].sr_msgid,
964 META_IS_BINDING( &candidates[ i ] ) ? " binding" : "",
965 LDAP_BACK_CONN_BINDING( &mc->mc_conns[ i ] ) ? " connbinding" : "",
966 META_BACK_CONN_CREATING( &mc->mc_conns[ i ] ) ? " conncreating" : "" );
967 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
969 Debug( LDAP_DEBUG_ANY, "!!! %s\n", buf, 0, 0 );
971 #endif /* DEBUG_205 */
974 * FIXME: handle time limit as well?
975 * Note that target servers are likely
976 * to handle it, so at some time we'll
977 * get a LDAP_TIMELIMIT_EXCEEDED from
981 rc = ldap_result( msc->msc_ld, candidates[ i ].sr_msgid,
982 LDAP_MSG_RECEIVED, &tv, &res );
985 /* FIXME: res should not need to be freed */
986 assert( res == NULL );
991 /* something REALLY bad happened! */
992 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
993 candidates[ i ].sr_type = REP_RESULT;
995 if ( meta_back_retry( op, rs, &mc, i, LDAP_BACK_DONTSEND ) ) {
996 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
997 switch ( meta_back_search_start( op, rs, &dc, &mc, i, candidates ) )
999 /* means that failed but onerr == continue */
1000 case META_SEARCH_NOT_CANDIDATE:
1001 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1003 assert( ncandidates > 0 );
1006 candidates[ i ].sr_err = rs->sr_err;
1007 if ( META_BACK_ONERR_STOP( mi ) ) {
1008 savepriv = op->o_private;
1009 op->o_private = (void *)i;
1010 send_ldap_result( op, rs );
1011 op->o_private = savepriv;
1016 case META_SEARCH_CANDIDATE:
1017 /* get back into business... */
1020 case META_SEARCH_BINDING:
1021 case META_SEARCH_NEED_BIND:
1022 case META_SEARCH_UNDEFINED:
1026 /* unrecoverable error */
1027 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1028 rc = rs->sr_err = LDAP_OTHER;
1033 candidates[ i ].sr_err = rs->sr_err;
1034 if ( META_BACK_ONERR_STOP( mi ) ) {
1035 savepriv = op->o_private;
1036 op->o_private = (void *)i;
1037 send_ldap_result( op, rs );
1038 op->o_private = savepriv;
1044 * When no candidates are left,
1045 * the outer cycle finishes
1047 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1048 assert( ncandidates > 0 );
1050 rs->sr_err = candidates[ i ].sr_err;
1054 /* only touch when activity actually took place... */
1055 if ( mi->mi_idle_timeout != 0 && msc->msc_time < op->o_time ) {
1056 msc->msc_time = op->o_time;
1061 for ( msg = ldap_first_message( msc->msc_ld, res );
1063 msg = ldap_next_message( msc->msc_ld, msg ) )
1065 rc = ldap_msgtype( msg );
1066 if ( rc == LDAP_RES_SEARCH_ENTRY ) {
1069 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
1070 /* don't retry any more... */
1071 candidates[ i ].sr_type = REP_RESULT;
1076 e = ldap_first_entry( msc->msc_ld, msg );
1077 savepriv = op->o_private;
1078 op->o_private = (void *)i;
1079 rs->sr_err = meta_send_entry( op, rs, mc, i, e );
1081 switch ( rs->sr_err ) {
1082 case LDAP_SIZELIMIT_EXCEEDED:
1083 savepriv = op->o_private;
1084 op->o_private = (void *)i;
1085 send_ldap_result( op, rs );
1086 op->o_private = savepriv;
1087 rs->sr_err = LDAP_SUCCESS;
1088 ldap_msgfree( res );
1092 case LDAP_UNAVAILABLE:
1093 rs->sr_err = LDAP_OTHER;
1094 ldap_msgfree( res );
1098 op->o_private = savepriv;
1100 /* don't wait any longer... */
1103 save_tv.tv_usec = 0;
1105 } else if ( rc == LDAP_RES_SEARCH_REFERENCE ) {
1106 char **references = NULL;
1109 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
1110 /* don't retry any more... */
1111 candidates[ i ].sr_type = REP_RESULT;
1116 rc = ldap_parse_reference( msc->msc_ld, msg,
1117 &references, &rs->sr_ctrls, 0 );
1119 if ( rc != LDAP_SUCCESS ) {
1123 if ( references == NULL ) {
1127 #ifdef ENABLE_REWRITE
1128 dc.ctx = "referralDN";
1129 #else /* ! ENABLE_REWRITE */
1132 #endif /* ! ENABLE_REWRITE */
1134 /* FIXME: merge all and return at the end */
1136 for ( cnt = 0; references[ cnt ]; cnt++ )
1139 rs->sr_ref = ch_calloc( sizeof( struct berval ), cnt + 1 );
1141 for ( cnt = 0; references[ cnt ]; cnt++ ) {
1142 ber_str2bv( references[ cnt ], 0, 1, &rs->sr_ref[ cnt ] );
1144 BER_BVZERO( &rs->sr_ref[ cnt ] );
1146 ( void )ldap_back_referral_result_rewrite( &dc, rs->sr_ref );
1148 if ( rs->sr_ref != NULL && !BER_BVISNULL( &rs->sr_ref[ 0 ] ) ) {
1149 /* ignore return value by now */
1150 savepriv = op->o_private;
1151 op->o_private = (void *)i;
1152 ( void )send_search_reference( op, rs );
1153 op->o_private = savepriv;
1155 ber_bvarray_free( rs->sr_ref );
1161 ber_memvfree( (void **)references );
1164 if ( rs->sr_ctrls ) {
1165 ldap_controls_free( rs->sr_ctrls );
1166 rs->sr_ctrls = NULL;
1169 } else if ( rc == LDAP_RES_SEARCH_RESULT ) {
1170 char buf[ SLAP_TEXT_BUFLEN ];
1171 char **references = NULL;
1173 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
1174 /* don't retry any more... */
1175 candidates[ i ].sr_type = REP_RESULT;
1178 /* NOTE: ignores response controls
1179 * (and intermediate response controls
1180 * as well, except for those with search
1181 * references); this may not be correct,
1182 * but if they're not ignored then
1183 * back-meta would need to merge them
1184 * consistently (think of pagedResults...)
1186 /* FIXME: response controls? */
1187 rs->sr_err = ldap_parse_result( msc->msc_ld,
1189 &candidates[ i ].sr_err,
1190 (char **)&candidates[ i ].sr_matched,
1191 NULL /* (char **)&candidates[ i ].sr_text */ ,
1193 NULL /* &candidates[ i ].sr_ctrls (unused) */ ,
1195 if ( rs->sr_err != LDAP_SUCCESS ) {
1196 ldap_get_option( msc->msc_ld,
1197 LDAP_OPT_ERROR_NUMBER,
1199 sres = slap_map_api2result( rs );
1200 candidates[ i ].sr_type = REP_RESULT;
1201 ldap_msgfree( res );
1206 /* massage matchedDN if need be */
1207 if ( candidates[ i ].sr_matched != NULL ) {
1208 struct berval match, mmatch;
1210 ber_str2bv( candidates[ i ].sr_matched,
1212 candidates[ i ].sr_matched = NULL;
1214 dc.ctx = "matchedDN";
1215 dc.target = mi->mi_targets[ i ];
1216 if ( !ldap_back_dn_massage( &dc, &match, &mmatch ) ) {
1217 if ( mmatch.bv_val == match.bv_val ) {
1218 candidates[ i ].sr_matched
1219 = ch_strdup( mmatch.bv_val );
1222 candidates[ i ].sr_matched = mmatch.bv_val;
1227 ldap_memfree( match.bv_val );
1230 /* add references to array */
1235 for ( cnt = 0; references[ cnt ]; cnt++ )
1238 sr_ref = ch_calloc( sizeof( struct berval ), cnt + 1 );
1240 for ( cnt = 0; references[ cnt ]; cnt++ ) {
1241 ber_str2bv( references[ cnt ], 0, 1, &sr_ref[ cnt ] );
1243 BER_BVZERO( &sr_ref[ cnt ] );
1245 ( void )ldap_back_referral_result_rewrite( &dc, sr_ref );
1248 ber_memvfree( (void **)references );
1250 if ( rs->sr_v2ref == NULL ) {
1251 rs->sr_v2ref = sr_ref;
1254 for ( cnt = 0; !BER_BVISNULL( &sr_ref[ cnt ] ); cnt++ ) {
1255 ber_bvarray_add( &rs->sr_v2ref, &sr_ref[ cnt ] );
1257 ber_memfree( sr_ref );
1261 rs->sr_err = candidates[ i ].sr_err;
1262 sres = slap_map_api2result( rs );
1264 if ( StatslogTest( LDAP_DEBUG_TRACE | LDAP_DEBUG_ANY ) ) {
1265 snprintf( buf, sizeof( buf ),
1266 "%s meta_back_search[%ld] "
1267 "match=\"%s\" err=%ld",
1268 op->o_log_prefix, i,
1269 candidates[ i ].sr_matched ? candidates[ i ].sr_matched : "",
1270 (long) candidates[ i ].sr_err );
1271 if ( candidates[ i ].sr_err == LDAP_SUCCESS ) {
1272 Debug( LDAP_DEBUG_TRACE, "%s.\n", buf, 0, 0 );
1275 Debug( LDAP_DEBUG_ANY, "%s (%s).\n",
1276 buf, ldap_err2string( candidates[ i ].sr_err ), 0 );
1281 case LDAP_NO_SUCH_OBJECT:
1282 /* is_ok is touched any time a valid
1283 * (even intermediate) result is
1284 * returned; as a consequence, if
1285 * a candidate returns noSuchObject
1286 * it is ignored and the candidate
1287 * is simply demoted. */
1289 sres = LDAP_SUCCESS;
1298 case LDAP_SIZELIMIT_EXCEEDED:
1299 /* if a target returned sizelimitExceeded
1300 * and the entry count is equal to the
1301 * proxy's limit, the target would have
1302 * returned more, and the error must be
1303 * propagated to the client; otherwise,
1304 * the target enforced a limit lower
1305 * than what requested by the proxy;
1307 candidates[ i ].sr_err = rs->sr_err;
1308 if ( rs->sr_nentries == op->ors_slimit
1309 || META_BACK_ONERR_STOP( mi ) )
1311 savepriv = op->o_private;
1312 op->o_private = (void *)i;
1313 send_ldap_result( op, rs );
1314 op->o_private = savepriv;
1315 ldap_msgfree( res );
1322 candidates[ i ].sr_err = rs->sr_err;
1323 if ( META_BACK_ONERR_STOP( mi ) ) {
1324 savepriv = op->o_private;
1325 op->o_private = (void *)i;
1326 send_ldap_result( op, rs );
1327 op->o_private = savepriv;
1328 ldap_msgfree( res );
1339 * When no candidates are left,
1340 * the outer cycle finishes
1342 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1343 assert( ncandidates > 0 );
1346 } else if ( rc == LDAP_RES_BIND ) {
1347 meta_search_candidate_t retcode;
1349 retcode = meta_search_dobind_result( op, rs, &mc, i, candidates, msg );
1350 if ( retcode == META_SEARCH_CANDIDATE ) {
1351 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1352 retcode = meta_back_search_start( op, rs, &dc, &mc, i, candidates );
1355 switch ( retcode ) {
1356 case META_SEARCH_CANDIDATE:
1359 /* means that failed but onerr == continue */
1360 case META_SEARCH_NOT_CANDIDATE:
1361 case META_SEARCH_ERR:
1362 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1363 assert( ncandidates > 0 );
1366 candidates[ i ].sr_err = rs->sr_err;
1367 if ( META_BACK_ONERR_STOP( mi ) ) {
1368 savepriv = op->o_private;
1369 op->o_private = (void *)i;
1370 send_ldap_result( op, rs );
1371 op->o_private = savepriv;
1372 ldap_msgfree( res );
1385 ldap_msgfree( res );
1392 ldap_msgfree( res );
1396 /* check for abandon */
1397 if ( op->o_abandon || LDAP_BACK_CONN_ABANDON( mc ) ) {
1398 for ( i = 0; i < mi->mi_ntargets; i++ ) {
1399 if ( candidates[ i ].sr_msgid >= 0 ) {
1400 if ( META_IS_BINDING( &candidates[ i ] ) ) {
1401 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
1402 if ( LDAP_BACK_CONN_BINDING( &mc->mc_conns[ i ] ) ) {
1403 /* if still binding, destroy */
1406 char buf[ SLAP_TEXT_BUFLEN ];
1408 snprintf( buf, sizeof( buf), "%s meta_back_search(abandon) "
1409 "ldap_unbind_ext[%ld] mc=%p ld=%p",
1410 op->o_log_prefix, i, (void *)mc,
1411 (void *)mc->mc_conns[i].msc_ld );
1413 Debug( LDAP_DEBUG_ANY, "### %s\n", buf, 0, 0 );
1414 #endif /* DEBUG_205 */
1416 meta_clear_one_candidate( op, mc, i );
1418 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
1419 META_BINDING_CLEAR( &candidates[ i ] );
1422 (void)meta_back_cancel( mc, op, rs,
1423 candidates[ i ].sr_msgid, i,
1424 LDAP_BACK_DONTSEND );
1427 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1428 assert( ncandidates > 0 );
1433 if ( op->o_abandon ) {
1437 /* let send_ldap_result play cleanup handlers (ITS#4645) */
1441 /* if no entry was found during this loop,
1442 * set a minimal timeout */
1443 if ( ncandidates > 0 && gotit == 0 ) {
1444 if ( save_tv.tv_sec == 0 && save_tv.tv_usec == 0 ) {
1445 save_tv.tv_usec = LDAP_BACK_RESULT_UTIMEOUT/initial_candidates;
1447 /* arbitrarily limit to something between 1 and 2 minutes */
1448 } else if ( ( stoptime == -1 && save_tv.tv_sec < 60 )
1449 || save_tv.tv_sec < ( stoptime - slap_get_time() ) / ( 2 * ncandidates ) )
1451 /* double the timeout */
1452 lutil_timermul( &save_tv, 2, &save_tv );
1455 if ( alreadybound == 0 ) {
1457 (void)select( 0, NULL, NULL, NULL, &tv );
1460 ldap_pvt_thread_yield();
1467 * FIXME: need a better strategy to handle errors
1470 rc = meta_back_op_result( mc, op, rs, META_TARGET_NONE,
1471 -1, stoptime != -1 ? (stoptime - slap_get_time()) : 0,
1472 LDAP_BACK_SENDERR );
1480 * Rewrite the matched portion of the search base, if required
1482 * FIXME: only the last one gets caught!
1484 savepriv = op->o_private;
1485 op->o_private = (void *)(long)mi->mi_ntargets;
1486 if ( candidate_match > 0 ) {
1487 struct berval pmatched = BER_BVNULL;
1489 /* we use the first one */
1490 for ( i = 0; i < mi->mi_ntargets; i++ ) {
1491 if ( META_IS_CANDIDATE( &candidates[ i ] )
1492 && candidates[ i ].sr_matched != NULL )
1494 struct berval bv, pbv;
1497 /* if we got success, and this target
1498 * returned noSuchObject, and its suffix
1499 * is a superior of the searchBase,
1500 * ignore the matchedDN */
1501 if ( sres == LDAP_SUCCESS
1502 && candidates[ i ].sr_err == LDAP_NO_SUCH_OBJECT
1503 && op->o_req_ndn.bv_len > mi->mi_targets[ i ]->mt_nsuffix.bv_len )
1505 free( (char *)candidates[ i ].sr_matched );
1506 candidates[ i ].sr_matched = NULL;
1510 ber_str2bv( candidates[ i ].sr_matched, 0, 0, &bv );
1511 rc = dnPretty( NULL, &bv, &pbv, op->o_tmpmemctx );
1513 if ( rc == LDAP_SUCCESS ) {
1515 /* NOTE: if they all are superiors
1516 * of the baseDN, the shorter is also
1517 * superior of the longer... */
1518 if ( pbv.bv_len > pmatched.bv_len ) {
1519 if ( !BER_BVISNULL( &pmatched ) ) {
1520 op->o_tmpfree( pmatched.bv_val, op->o_tmpmemctx );
1523 op->o_private = (void *)i;
1526 op->o_tmpfree( pbv.bv_val, op->o_tmpmemctx );
1530 if ( candidates[ i ].sr_matched != NULL ) {
1531 free( (char *)candidates[ i ].sr_matched );
1532 candidates[ i ].sr_matched = NULL;
1537 if ( !BER_BVISNULL( &pmatched ) ) {
1538 matched = pmatched.bv_val;
1541 } else if ( sres == LDAP_NO_SUCH_OBJECT ) {
1542 matched = op->o_bd->be_suffix[ 0 ].bv_val;
1546 * In case we returned at least one entry, we return LDAP_SUCCESS
1547 * otherwise, the latter error code we got
1550 if ( sres == LDAP_SUCCESS ) {
1551 if ( rs->sr_v2ref ) {
1552 sres = LDAP_REFERRAL;
1555 if ( META_BACK_ONERR_REPORT( mi ) ) {
1557 * Report errors, if any
1559 * FIXME: we should handle error codes and return the more
1560 * important/reasonable
1562 for ( i = 0; i < mi->mi_ntargets; i++ ) {
1563 if ( !META_IS_CANDIDATE( &candidates[ i ] ) ) {
1567 if ( candidates[ i ].sr_err != LDAP_SUCCESS
1568 && candidates[ i ].sr_err != LDAP_NO_SUCH_OBJECT )
1570 sres = candidates[ i ].sr_err;
1578 rs->sr_matched = matched;
1579 rs->sr_ref = ( sres == LDAP_REFERRAL ? rs->sr_v2ref : NULL );
1580 send_ldap_result( op, rs );
1581 op->o_private = savepriv;
1582 rs->sr_matched = NULL;
1586 if ( matched && matched != op->o_bd->be_suffix[ 0 ].bv_val ) {
1587 op->o_tmpfree( matched, op->o_tmpmemctx );
1590 if ( rs->sr_v2ref ) {
1591 ber_bvarray_free( rs->sr_v2ref );
1594 for ( i = 0; i < mi->mi_ntargets; i++ ) {
1595 if ( !META_IS_CANDIDATE( &candidates[ i ] ) ) {
1599 if ( mc && META_IS_BINDING( &candidates[ i ] ) ) {
1600 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
1601 if ( LDAP_BACK_CONN_BINDING( &mc->mc_conns[ i ] ) ) {
1602 assert( candidates[ i ].sr_msgid >= 0 );
1603 assert( mc->mc_conns[ i ].msc_ld != NULL );
1606 Debug( LDAP_DEBUG_ANY, "### %s meta_back_search(cleanup) "
1607 "ldap_unbind_ext[%ld] ld=%p\n",
1608 op->o_log_prefix, i, (void *)mc->mc_conns[i].msc_ld );
1609 #endif /* DEBUG_205 */
1611 /* if still binding, destroy */
1612 meta_clear_one_candidate( op, mc, i );
1614 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
1615 META_BINDING_CLEAR( &candidates[ i ] );
1618 if ( candidates[ i ].sr_matched ) {
1619 free( (char *)candidates[ i ].sr_matched );
1620 candidates[ i ].sr_matched = NULL;
1623 if ( candidates[ i ].sr_text ) {
1624 ldap_memfree( (char *)candidates[ i ].sr_text );
1625 candidates[ i ].sr_text = NULL;
1628 if ( candidates[ i ].sr_ref ) {
1629 ber_bvarray_free( candidates[ i ].sr_ref );
1630 candidates[ i ].sr_ref = NULL;
1633 if ( candidates[ i ].sr_ctrls ) {
1634 ldap_controls_free( candidates[ i ].sr_ctrls );
1635 candidates[ i ].sr_ctrls = NULL;
1638 if ( META_BACK_TGT_QUARANTINE( mi->mi_targets[ i ] ) ) {
1639 meta_back_quarantine( op, &candidates[ i ], i );
1642 /* only in case of timelimit exceeded, if the timelimit exceeded because
1643 * one contacted target never responded, invalidate the connection
1644 * NOTE: should we quarantine the target as well? right now, the connection
1645 * is invalidated; the next time it will be recreated and the target
1646 * will be quarantined if it cannot be contacted */
1647 if ( mi->mi_idle_timeout != 0
1648 && rs->sr_err == LDAP_TIMELIMIT_EXCEEDED
1649 && op->o_time > mc->mc_conns[ i ].msc_time )
1651 /* don't let anyone else use this expired connection */
1652 LDAP_BACK_CONN_TAINTED_SET( mc );
1657 meta_back_release_conn( mi, mc );
1671 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
1672 struct berval a, mapped;
1674 BerElement ber = *e->lm_ber;
1675 Attribute *attr, **attrp;
1682 if ( ber_scanf( &ber, "{m{", &bdn ) == LBER_ERROR ) {
1683 return LDAP_DECODING_ERROR;
1687 * Rewrite the dn of the result, if needed
1689 dc.target = mi->mi_targets[ target ];
1690 dc.conn = op->o_conn;
1692 dc.ctx = "searchResult";
1694 rs->sr_err = ldap_back_dn_massage( &dc, &bdn, &dn );
1695 if ( rs->sr_err != LDAP_SUCCESS) {
1700 * Note: this may fail if the target host(s) schema differs
1701 * from the one known to the meta, and a DN with unknown
1702 * attributes is returned.
1704 * FIXME: should we log anything, or delegate to dnNormalize?
1706 rc = dnPrettyNormal( NULL, &dn, &ent.e_name, &ent.e_nname,
1708 if ( dn.bv_val != bdn.bv_val ) {
1713 if ( rc != LDAP_SUCCESS ) {
1714 return LDAP_INVALID_DN_SYNTAX;
1720 if ( mi->mi_cache.ttl != META_DNCACHE_DISABLED ) {
1721 ( void )meta_dncache_update_entry( &mi->mi_cache,
1722 &ent.e_nname, target );
1725 attrp = &ent.e_attrs;
1727 dc.ctx = "searchAttrDN";
1728 while ( ber_scanf( &ber, "{m", &a ) != LBER_ERROR ) {
1730 slap_syntax_validate_func *validate;
1731 slap_syntax_transform_func *pretty;
1733 ldap_back_map( &mi->mi_targets[ target ]->mt_rwmap.rwm_at,
1734 &a, &mapped, BACKLDAP_REMAP );
1735 if ( BER_BVISNULL( &mapped ) || mapped.bv_val[0] == '\0' ) {
1736 ( void )ber_scanf( &ber, "x" /* [W] */ );
1739 attr = ( Attribute * )ch_calloc( 1, sizeof( Attribute ) );
1740 if ( attr == NULL ) {
1743 if ( slap_bv2ad( &mapped, &attr->a_desc, &text )
1745 if ( slap_bv2undef_ad( &mapped, &attr->a_desc, &text,
1746 SLAP_AD_PROXIED ) != LDAP_SUCCESS )
1748 char buf[ SLAP_TEXT_BUFLEN ];
1750 snprintf( buf, sizeof( buf ),
1751 "%s meta_send_entry(\"%s\"): "
1752 "slap_bv2undef_ad(%s): %s\n",
1753 op->o_log_prefix, ent.e_name.bv_val,
1754 mapped.bv_val, text );
1756 Debug( LDAP_DEBUG_ANY, "%s", buf, 0, 0 );
1762 /* no subschemaSubentry */
1763 if ( attr->a_desc == slap_schema.si_ad_subschemaSubentry
1764 || attr->a_desc == slap_schema.si_ad_entryDN )
1768 * We eat target's subschemaSubentry because
1769 * a search for this value is likely not
1770 * to resolve to the appropriate backend;
1771 * later, the local subschemaSubentry is
1774 * We also eat entryDN because the frontend
1775 * will reattach it without checking if already
1778 ( void )ber_scanf( &ber, "x" /* [W] */ );
1784 if ( ber_scanf( &ber, "[W]", &attr->a_vals ) == LBER_ERROR
1785 || attr->a_vals == NULL )
1787 attr->a_vals = (struct berval *)&slap_dummy_bv;
1790 for ( last = 0; !BER_BVISNULL( &attr->a_vals[ last ] ); ++last )
1794 validate = attr->a_desc->ad_type->sat_syntax->ssyn_validate;
1795 pretty = attr->a_desc->ad_type->sat_syntax->ssyn_pretty;
1797 if ( !validate && !pretty ) {
1802 if ( attr->a_desc == slap_schema.si_ad_objectClass
1803 || attr->a_desc == slap_schema.si_ad_structuralObjectClass )
1807 for ( bv = attr->a_vals; !BER_BVISNULL( bv ); bv++ ) {
1808 ldap_back_map( &mi->mi_targets[ target ]->mt_rwmap.rwm_oc,
1809 bv, &mapped, BACKLDAP_REMAP );
1810 if ( BER_BVISNULL( &mapped ) || mapped.bv_val[0] == '\0') {
1816 *bv = attr->a_vals[ last ];
1817 BER_BVZERO( &attr->a_vals[ last ] );
1820 } else if ( mapped.bv_val != bv->bv_val ) {
1822 ber_dupbv( bv, &mapped );
1826 * It is necessary to try to rewrite attributes with
1827 * dn syntax because they might be used in ACLs as
1828 * members of groups; since ACLs are applied to the
1829 * rewritten stuff, no dn-based subecj clause could
1830 * be used at the ldap backend side (see
1831 * http://www.OpenLDAP.org/faq/data/cache/452.html)
1832 * The problem can be overcome by moving the dn-based
1833 * ACLs to the target directory server, and letting
1834 * everything pass thru the ldap backend.
1839 if ( attr->a_desc->ad_type->sat_syntax ==
1840 slap_schema.si_syn_distinguishedName )
1842 ldap_dnattr_result_rewrite( &dc, attr->a_vals );
1844 } else if ( attr->a_desc == slap_schema.si_ad_ref ) {
1845 ldap_back_referral_result_rewrite( &dc, attr->a_vals );
1849 for ( i = 0; i < last; i++ ) {
1854 rc = pretty( attr->a_desc->ad_type->sat_syntax,
1855 &attr->a_vals[i], &pval, NULL );
1858 rc = validate( attr->a_desc->ad_type->sat_syntax,
1863 LBER_FREE( attr->a_vals[i].bv_val );
1864 if ( --last == i ) {
1865 BER_BVZERO( &attr->a_vals[ i ] );
1868 attr->a_vals[i] = attr->a_vals[last];
1869 BER_BVZERO( &attr->a_vals[last] );
1875 LBER_FREE( attr->a_vals[i].bv_val );
1876 attr->a_vals[i] = pval;
1880 if ( last == 0 && attr->a_vals != &slap_dummy_bv ) {
1886 if ( last && attr->a_desc->ad_type->sat_equality &&
1887 attr->a_desc->ad_type->sat_equality->smr_normalize )
1891 attr->a_nvals = ch_malloc( ( last + 1 ) * sizeof( struct berval ) );
1892 for ( i = 0; i<last; i++ ) {
1893 attr->a_desc->ad_type->sat_equality->smr_normalize(
1894 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
1895 attr->a_desc->ad_type->sat_syntax,
1896 attr->a_desc->ad_type->sat_equality,
1897 &attr->a_vals[i], &attr->a_nvals[i],
1900 BER_BVZERO( &attr->a_nvals[i] );
1903 attr->a_nvals = attr->a_vals;
1907 attrp = &attr->a_next;
1910 rs->sr_entry = &ent;
1911 rs->sr_attrs = op->ors_attrs;
1913 rs->sr_err = LDAP_SUCCESS;
1914 rc = send_search_entry( op, rs );
1916 case LDAP_UNAVAILABLE:
1920 rs->sr_entry = NULL;
1921 rs->sr_attrs = NULL;
1923 if ( !BER_BVISNULL( &ent.e_name ) ) {
1924 free( ent.e_name.bv_val );
1925 BER_BVZERO( &ent.e_name );
1927 if ( !BER_BVISNULL( &ent.e_nname ) ) {
1928 free( ent.e_nname.bv_val );
1929 BER_BVZERO( &ent.e_nname );
1931 entry_clean( &ent );