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 lastres_time = slap_get_time(),
655 int rc = 0, sres = LDAP_SUCCESS;
656 char *matched = NULL;
657 int last = 0, ncandidates = 0,
658 initial_candidates = 0, candidate_match = 0,
660 ldap_back_send_t sendok = LDAP_BACK_SENDERR;
665 SlapReply *candidates = meta_back_candidates_get( op );
668 * controls are set in ldap_back_dobind()
670 * FIXME: in case of values return filter, we might want
671 * to map attrs and maybe rewrite value
674 mc = meta_back_getconn( op, rs, NULL, sendok );
679 dc.conn = op->o_conn;
685 for ( i = 0; i < mi->mi_ntargets; i++ ) {
686 /* reset sr_msgid; it is used in most loops
687 * to check if that target is still to be considered */
688 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
690 /* a target is marked as candidate by meta_back_getconn();
691 * if for any reason (an error, it's over or so) it is
692 * no longer active, sr_msgid is set to META_MSGID_IGNORE
693 * but it remains candidate, which means it has been active
694 * at some point during the operation. This allows to
695 * use its response code and more to compute the final
697 if ( !META_IS_CANDIDATE( &candidates[ i ] ) ) {
701 candidates[ i ].sr_matched = NULL;
702 candidates[ i ].sr_text = NULL;
703 candidates[ i ].sr_ref = NULL;
704 candidates[ i ].sr_ctrls = NULL;
706 /* get largest timeout among candidates */
707 if ( mi->mi_targets[ i ]->mt_timeout[ SLAP_OP_SEARCH ]
708 && mi->mi_targets[ i ]->mt_timeout[ SLAP_OP_SEARCH ] > timeout )
710 timeout = mi->mi_targets[ i ]->mt_timeout[ SLAP_OP_SEARCH ];
714 for ( i = 0; i < mi->mi_ntargets; i++ ) {
715 if ( !META_IS_CANDIDATE( &candidates[ i ] )
716 || candidates[ i ].sr_err != LDAP_SUCCESS )
721 switch ( meta_back_search_start( op, rs, &dc, &mc, i, candidates ) )
723 case META_SEARCH_NOT_CANDIDATE:
724 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
727 case META_SEARCH_NEED_BIND:
731 case META_SEARCH_CANDIDATE:
732 case META_SEARCH_BINDING:
733 candidates[ i ].sr_type = REP_INTERMEDIATE;
737 case META_SEARCH_ERR:
738 savepriv = op->o_private;
739 op->o_private = (void *)i;
740 send_ldap_result( op, rs );
741 op->o_private = savepriv;
751 if ( ncandidates > 0 && needbind == ncandidates ) {
753 * give up the second time...
755 * NOTE: this should not occur the second time, since a fresh
756 * connection has ben created; however, targets may also
757 * need bind because the bind timed out or so.
759 if ( sendok & LDAP_BACK_BINDING ) {
760 Debug( LDAP_DEBUG_ANY,
761 "%s meta_back_search: unable to initialize conn\n",
762 op->o_log_prefix, 0, 0 );
763 rs->sr_err = LDAP_UNAVAILABLE;
764 rs->sr_text = "unable to initialize connection to remote targets";
765 send_ldap_result( op, rs );
770 /* FIXME: better create a separate connection? */
771 sendok |= LDAP_BACK_BINDING;
774 Debug( LDAP_DEBUG_ANY, "*** %s drop mc=%p create new connection\n",
775 op->o_log_prefix, (void *)mc, 0 );
776 #endif /* DEBUG_205 */
778 meta_back_release_conn( mi, mc );
787 initial_candidates = ncandidates;
789 if ( StatslogTest( LDAP_DEBUG_TRACE ) ) {
790 char cnd[ SLAP_TEXT_BUFLEN ];
793 for ( c = 0; c < mi->mi_ntargets; c++ ) {
794 if ( META_IS_CANDIDATE( &candidates[ c ] ) ) {
802 Debug( LDAP_DEBUG_TRACE, "%s meta_back_search: ncandidates=%d "
803 "cnd=\"%s\"\n", op->o_log_prefix, ncandidates, cnd );
806 if ( initial_candidates == 0 ) {
807 /* NOTE: here we are not sending any matchedDN;
808 * this is intended, because if the back-meta
809 * is serving this search request, but no valid
810 * candidate could be looked up, it means that
811 * there is a hole in the mapping of the targets
812 * and thus no knowledge of any remote superior
814 Debug( LDAP_DEBUG_ANY, "%s meta_back_search: "
815 "base=\"%s\" scope=%d: "
816 "no candidate could be selected\n",
817 op->o_log_prefix, op->o_req_dn.bv_val,
820 /* FIXME: we're sending the first error we encounter;
821 * maybe we should pick the worst... */
822 rc = LDAP_NO_SUCH_OBJECT;
823 for ( i = 0; i < mi->mi_ntargets; i++ ) {
824 if ( META_IS_CANDIDATE( &candidates[ i ] )
825 && candidates[ i ].sr_err != LDAP_SUCCESS )
827 rc = candidates[ i ].sr_err;
832 send_ldap_error( op, rs, rc, NULL );
837 /* We pull apart the ber result, stuff it into a slapd entry, and
838 * let send_search_entry stuff it back into ber format. Slow & ugly,
839 * but this is necessary for version matching, and for ACL processing.
842 if ( op->ors_tlimit != SLAP_NO_LIMIT ) {
843 stoptime = op->o_time + op->ors_tlimit;
847 * In case there are no candidates, no cycle takes place...
849 * FIXME: we might use a queue, to better balance the load
850 * among the candidates
852 for ( rc = 0; ncandidates > 0; ) {
855 alreadybound = ncandidates;
858 if ( timeout && lastres_time > 0
859 && ( slap_get_time() - lastres_time ) > timeout )
862 rs->sr_text = "Operation timed out";
863 rc = rs->sr_err = op->o_protocol >= LDAP_VERSION3 ?
864 LDAP_ADMINLIMIT_EXCEEDED : LDAP_OTHER;
865 savepriv = op->o_private;
866 op->o_private = (void *)i;
867 send_ldap_result( op, rs );
868 op->o_private = savepriv;
872 /* check time limit */
873 if ( op->ors_tlimit != SLAP_NO_LIMIT
874 && slap_get_time() > stoptime )
877 rc = rs->sr_err = LDAP_TIMELIMIT_EXCEEDED;
878 savepriv = op->o_private;
879 op->o_private = (void *)i;
880 send_ldap_result( op, rs );
881 op->o_private = savepriv;
885 for ( i = 0; i < mi->mi_ntargets; i++ ) {
886 meta_search_candidate_t retcode = META_SEARCH_UNDEFINED;
887 metasingleconn_t *msc = &mc->mc_conns[ i ];
888 LDAPMessage *res = NULL, *msg;
890 /* if msgid is invalid, don't ldap_result() */
891 if ( candidates[ i ].sr_msgid == META_MSGID_IGNORE ) {
895 /* if target still needs bind, retry */
896 if ( candidates[ i ].sr_msgid == META_MSGID_NEED_BIND ) {
897 /* initiate dobind */
898 retcode = meta_search_dobind_init( op, rs, &mc, i, candidates );
900 Debug( LDAP_DEBUG_TRACE, "%s <<< meta_search_dobind_init[%ld]=%d\n",
901 op->o_log_prefix, i, retcode );
904 case META_SEARCH_NEED_BIND:
908 case META_SEARCH_BINDING:
911 case META_SEARCH_ERR:
912 candidates[ i ].sr_err = rs->sr_err;
913 if ( META_BACK_ONERR_STOP( mi ) ) {
914 savepriv = op->o_private;
915 op->o_private = (void *)i;
916 send_ldap_result( op, rs );
917 op->o_private = savepriv;
922 case META_SEARCH_NOT_CANDIDATE:
924 * When no candidates are left,
925 * the outer cycle finishes
927 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
928 assert( ncandidates > 0 );
932 case META_SEARCH_CANDIDATE:
933 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
934 switch ( meta_back_search_start( op, rs, &dc, &mc, i, candidates ) )
936 case META_SEARCH_CANDIDATE:
937 assert( candidates[ i ].sr_msgid >= 0 );
940 case META_SEARCH_ERR:
941 candidates[ i ].sr_err = rs->sr_err;
942 if ( META_BACK_ONERR_STOP( mi ) ) {
943 savepriv = op->o_private;
944 op->o_private = (void *)i;
945 send_ldap_result( op, rs );
946 op->o_private = savepriv;
951 case META_SEARCH_NOT_CANDIDATE:
952 /* means that meta_back_search_start()
953 * failed but onerr == continue */
954 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
955 assert( ncandidates > 0 );
974 /* check for abandon */
975 if ( op->o_abandon || LDAP_BACK_CONN_ABANDON( mc ) ) {
980 if ( msc->msc_ld == NULL ) {
981 char buf[ SLAP_TEXT_BUFLEN ];
983 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
984 snprintf( buf, sizeof( buf ),
985 "%s meta_back_search[%ld] mc=%p msgid=%d%s%s%s\n",
986 op->o_log_prefix, (long)i, (void *)mc,
987 candidates[ i ].sr_msgid,
988 META_IS_BINDING( &candidates[ i ] ) ? " binding" : "",
989 LDAP_BACK_CONN_BINDING( &mc->mc_conns[ i ] ) ? " connbinding" : "",
990 META_BACK_CONN_CREATING( &mc->mc_conns[ i ] ) ? " conncreating" : "" );
991 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
993 Debug( LDAP_DEBUG_ANY, "!!! %s\n", buf, 0, 0 );
995 #endif /* DEBUG_205 */
998 * FIXME: handle time limit as well?
999 * Note that target servers are likely
1000 * to handle it, so at some time we'll
1001 * get a LDAP_TIMELIMIT_EXCEEDED from
1005 rc = ldap_result( msc->msc_ld, candidates[ i ].sr_msgid,
1006 LDAP_MSG_RECEIVED, &tv, &res );
1009 /* FIXME: res should not need to be freed */
1010 assert( res == NULL );
1015 /* something REALLY bad happened! */
1016 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
1017 candidates[ i ].sr_type = REP_RESULT;
1019 if ( meta_back_retry( op, rs, &mc, i, LDAP_BACK_DONTSEND ) ) {
1020 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1021 switch ( meta_back_search_start( op, rs, &dc, &mc, i, candidates ) )
1023 /* means that failed but onerr == continue */
1024 case META_SEARCH_NOT_CANDIDATE:
1025 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1027 assert( ncandidates > 0 );
1030 candidates[ i ].sr_err = rs->sr_err;
1031 if ( META_BACK_ONERR_STOP( mi ) ) {
1032 savepriv = op->o_private;
1033 op->o_private = (void *)i;
1034 send_ldap_result( op, rs );
1035 op->o_private = savepriv;
1040 case META_SEARCH_CANDIDATE:
1041 /* get back into business... */
1044 case META_SEARCH_BINDING:
1045 case META_SEARCH_NEED_BIND:
1046 case META_SEARCH_UNDEFINED:
1050 /* unrecoverable error */
1051 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1052 rc = rs->sr_err = LDAP_OTHER;
1057 candidates[ i ].sr_err = rs->sr_err;
1058 if ( META_BACK_ONERR_STOP( mi ) ) {
1059 savepriv = op->o_private;
1060 op->o_private = (void *)i;
1061 send_ldap_result( op, rs );
1062 op->o_private = savepriv;
1068 * When no candidates are left,
1069 * the outer cycle finishes
1071 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1072 assert( ncandidates > 0 );
1074 rs->sr_err = candidates[ i ].sr_err;
1078 lastres_time = slap_get_time();
1080 /* only touch when activity actually took place... */
1081 if ( mi->mi_idle_timeout != 0 && msc->msc_time < lastres_time ) {
1082 msc->msc_time = lastres_time;
1087 for ( msg = ldap_first_message( msc->msc_ld, res );
1089 msg = ldap_next_message( msc->msc_ld, msg ) )
1091 rc = ldap_msgtype( msg );
1092 if ( rc == LDAP_RES_SEARCH_ENTRY ) {
1095 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
1096 /* don't retry any more... */
1097 candidates[ i ].sr_type = REP_RESULT;
1102 e = ldap_first_entry( msc->msc_ld, msg );
1103 savepriv = op->o_private;
1104 op->o_private = (void *)i;
1105 rs->sr_err = meta_send_entry( op, rs, mc, i, e );
1107 switch ( rs->sr_err ) {
1108 case LDAP_SIZELIMIT_EXCEEDED:
1109 savepriv = op->o_private;
1110 op->o_private = (void *)i;
1111 send_ldap_result( op, rs );
1112 op->o_private = savepriv;
1113 rs->sr_err = LDAP_SUCCESS;
1114 ldap_msgfree( res );
1118 case LDAP_UNAVAILABLE:
1119 rs->sr_err = LDAP_OTHER;
1120 ldap_msgfree( res );
1124 op->o_private = savepriv;
1126 /* don't wait any longer... */
1129 save_tv.tv_usec = 0;
1131 } else if ( rc == LDAP_RES_SEARCH_REFERENCE ) {
1132 char **references = NULL;
1135 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
1136 /* don't retry any more... */
1137 candidates[ i ].sr_type = REP_RESULT;
1142 rc = ldap_parse_reference( msc->msc_ld, msg,
1143 &references, &rs->sr_ctrls, 0 );
1145 if ( rc != LDAP_SUCCESS ) {
1149 if ( references == NULL ) {
1153 #ifdef ENABLE_REWRITE
1154 dc.ctx = "referralDN";
1155 #else /* ! ENABLE_REWRITE */
1158 #endif /* ! ENABLE_REWRITE */
1160 /* FIXME: merge all and return at the end */
1162 for ( cnt = 0; references[ cnt ]; cnt++ )
1165 rs->sr_ref = ch_calloc( sizeof( struct berval ), cnt + 1 );
1167 for ( cnt = 0; references[ cnt ]; cnt++ ) {
1168 ber_str2bv( references[ cnt ], 0, 1, &rs->sr_ref[ cnt ] );
1170 BER_BVZERO( &rs->sr_ref[ cnt ] );
1172 ( void )ldap_back_referral_result_rewrite( &dc, rs->sr_ref );
1174 if ( rs->sr_ref != NULL && !BER_BVISNULL( &rs->sr_ref[ 0 ] ) ) {
1175 /* ignore return value by now */
1176 savepriv = op->o_private;
1177 op->o_private = (void *)i;
1178 ( void )send_search_reference( op, rs );
1179 op->o_private = savepriv;
1181 ber_bvarray_free( rs->sr_ref );
1187 ber_memvfree( (void **)references );
1190 if ( rs->sr_ctrls ) {
1191 ldap_controls_free( rs->sr_ctrls );
1192 rs->sr_ctrls = NULL;
1195 } else if ( rc == LDAP_RES_SEARCH_RESULT ) {
1196 char buf[ SLAP_TEXT_BUFLEN ];
1197 char **references = NULL;
1199 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
1200 /* don't retry any more... */
1201 candidates[ i ].sr_type = REP_RESULT;
1204 /* NOTE: ignores response controls
1205 * (and intermediate response controls
1206 * as well, except for those with search
1207 * references); this may not be correct,
1208 * but if they're not ignored then
1209 * back-meta would need to merge them
1210 * consistently (think of pagedResults...)
1212 /* FIXME: response controls? */
1213 rs->sr_err = ldap_parse_result( msc->msc_ld,
1215 &candidates[ i ].sr_err,
1216 (char **)&candidates[ i ].sr_matched,
1217 NULL /* (char **)&candidates[ i ].sr_text */ ,
1219 NULL /* &candidates[ i ].sr_ctrls (unused) */ ,
1221 if ( rs->sr_err != LDAP_SUCCESS ) {
1222 sres = slap_map_api2result( &candidates[ i ] );
1223 candidates[ i ].sr_type = REP_RESULT;
1224 ldap_msgfree( res );
1229 rs->sr_err = candidates[ i ].sr_err;
1231 /* massage matchedDN if need be */
1232 if ( candidates[ i ].sr_matched != NULL ) {
1233 struct berval match, mmatch;
1235 ber_str2bv( candidates[ i ].sr_matched,
1237 candidates[ i ].sr_matched = NULL;
1239 dc.ctx = "matchedDN";
1240 dc.target = mi->mi_targets[ i ];
1241 if ( !ldap_back_dn_massage( &dc, &match, &mmatch ) ) {
1242 if ( mmatch.bv_val == match.bv_val ) {
1243 candidates[ i ].sr_matched
1244 = ch_strdup( mmatch.bv_val );
1247 candidates[ i ].sr_matched = mmatch.bv_val;
1252 ldap_memfree( match.bv_val );
1255 /* add references to array */
1256 /* RFC 4511: referrals can only appear
1257 * if result code is LDAP_REFERRAL */
1258 if ( references != NULL
1259 && references[ 0 ] != NULL
1260 && references[ 0 ][ 0 ] != '\0' )
1262 if ( rs->sr_err != LDAP_REFERRAL ) {
1263 Debug( LDAP_DEBUG_ANY,
1264 "%s meta_back_search[%ld]: "
1265 "got referrals with err=%d\n",
1273 for ( cnt = 0; references[ cnt ]; cnt++ )
1276 sr_ref = ch_calloc( sizeof( struct berval ), cnt + 1 );
1278 for ( cnt = 0; references[ cnt ]; cnt++ ) {
1279 ber_str2bv( references[ cnt ], 0, 1, &sr_ref[ cnt ] );
1281 BER_BVZERO( &sr_ref[ cnt ] );
1283 ( void )ldap_back_referral_result_rewrite( &dc, sr_ref );
1285 if ( rs->sr_v2ref == NULL ) {
1286 rs->sr_v2ref = sr_ref;
1289 for ( cnt = 0; !BER_BVISNULL( &sr_ref[ cnt ] ); cnt++ ) {
1290 ber_bvarray_add( &rs->sr_v2ref, &sr_ref[ cnt ] );
1292 ber_memfree( sr_ref );
1296 } else if ( rs->sr_err == LDAP_REFERRAL ) {
1297 Debug( LDAP_DEBUG_ANY,
1298 "%s meta_back_search[%ld]: "
1299 "got err=%d with null "
1300 "or empty referrals\n",
1304 rs->sr_err = LDAP_NO_SUCH_OBJECT;
1308 ber_memvfree( (void **)references );
1310 sres = slap_map_api2result( rs );
1312 if ( StatslogTest( LDAP_DEBUG_TRACE | LDAP_DEBUG_ANY ) ) {
1313 snprintf( buf, sizeof( buf ),
1314 "%s meta_back_search[%ld] "
1315 "match=\"%s\" err=%ld",
1316 op->o_log_prefix, i,
1317 candidates[ i ].sr_matched ? candidates[ i ].sr_matched : "",
1318 (long) candidates[ i ].sr_err );
1319 if ( candidates[ i ].sr_err == LDAP_SUCCESS ) {
1320 Debug( LDAP_DEBUG_TRACE, "%s.\n", buf, 0, 0 );
1323 Debug( LDAP_DEBUG_ANY, "%s (%s).\n",
1324 buf, ldap_err2string( candidates[ i ].sr_err ), 0 );
1329 case LDAP_NO_SUCH_OBJECT:
1330 /* is_ok is touched any time a valid
1331 * (even intermediate) result is
1332 * returned; as a consequence, if
1333 * a candidate returns noSuchObject
1334 * it is ignored and the candidate
1335 * is simply demoted. */
1337 sres = LDAP_SUCCESS;
1346 case LDAP_SIZELIMIT_EXCEEDED:
1347 /* if a target returned sizelimitExceeded
1348 * and the entry count is equal to the
1349 * proxy's limit, the target would have
1350 * returned more, and the error must be
1351 * propagated to the client; otherwise,
1352 * the target enforced a limit lower
1353 * than what requested by the proxy;
1355 candidates[ i ].sr_err = rs->sr_err;
1356 if ( rs->sr_nentries == op->ors_slimit
1357 || META_BACK_ONERR_STOP( mi ) )
1359 savepriv = op->o_private;
1360 op->o_private = (void *)i;
1361 send_ldap_result( op, rs );
1362 op->o_private = savepriv;
1363 ldap_msgfree( res );
1370 candidates[ i ].sr_err = rs->sr_err;
1371 if ( META_BACK_ONERR_STOP( mi ) ) {
1372 savepriv = op->o_private;
1373 op->o_private = (void *)i;
1374 send_ldap_result( op, rs );
1375 op->o_private = savepriv;
1376 ldap_msgfree( res );
1387 * When no candidates are left,
1388 * the outer cycle finishes
1390 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1391 assert( ncandidates > 0 );
1394 } else if ( rc == LDAP_RES_BIND ) {
1395 meta_search_candidate_t retcode;
1397 retcode = meta_search_dobind_result( op, rs, &mc, i, candidates, msg );
1398 if ( retcode == META_SEARCH_CANDIDATE ) {
1399 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1400 retcode = meta_back_search_start( op, rs, &dc, &mc, i, candidates );
1403 switch ( retcode ) {
1404 case META_SEARCH_CANDIDATE:
1407 /* means that failed but onerr == continue */
1408 case META_SEARCH_NOT_CANDIDATE:
1409 case META_SEARCH_ERR:
1410 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1411 assert( ncandidates > 0 );
1414 candidates[ i ].sr_err = rs->sr_err;
1415 if ( META_BACK_ONERR_STOP( mi ) ) {
1416 savepriv = op->o_private;
1417 op->o_private = (void *)i;
1418 send_ldap_result( op, rs );
1419 op->o_private = savepriv;
1420 ldap_msgfree( res );
1433 ldap_msgfree( res );
1440 ldap_msgfree( res );
1444 /* check for abandon */
1445 if ( op->o_abandon || LDAP_BACK_CONN_ABANDON( mc ) ) {
1446 for ( i = 0; i < mi->mi_ntargets; i++ ) {
1447 if ( candidates[ i ].sr_msgid >= 0 ) {
1448 if ( META_IS_BINDING( &candidates[ i ] ) ) {
1449 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
1450 if ( LDAP_BACK_CONN_BINDING( &mc->mc_conns[ i ] ) ) {
1451 /* if still binding, destroy */
1454 char buf[ SLAP_TEXT_BUFLEN ];
1456 snprintf( buf, sizeof( buf), "%s meta_back_search(abandon) "
1457 "ldap_unbind_ext[%ld] mc=%p ld=%p",
1458 op->o_log_prefix, i, (void *)mc,
1459 (void *)mc->mc_conns[i].msc_ld );
1461 Debug( LDAP_DEBUG_ANY, "### %s\n", buf, 0, 0 );
1462 #endif /* DEBUG_205 */
1464 meta_clear_one_candidate( op, mc, i );
1466 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
1467 META_BINDING_CLEAR( &candidates[ i ] );
1470 (void)meta_back_cancel( mc, op, rs,
1471 candidates[ i ].sr_msgid, i,
1472 LDAP_BACK_DONTSEND );
1475 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1476 assert( ncandidates > 0 );
1481 if ( op->o_abandon ) {
1485 /* let send_ldap_result play cleanup handlers (ITS#4645) */
1489 /* if no entry was found during this loop,
1490 * set a minimal timeout */
1491 if ( ncandidates > 0 && gotit == 0 ) {
1492 if ( save_tv.tv_sec == 0 && save_tv.tv_usec == 0 ) {
1493 save_tv.tv_usec = LDAP_BACK_RESULT_UTIMEOUT/initial_candidates;
1495 /* arbitrarily limit to something between 1 and 2 minutes */
1496 } else if ( ( stoptime == -1 && save_tv.tv_sec < 60 )
1497 || save_tv.tv_sec < ( stoptime - slap_get_time() ) / ( 2 * ncandidates ) )
1499 /* double the timeout */
1500 lutil_timermul( &save_tv, 2, &save_tv );
1503 if ( alreadybound == 0 ) {
1505 (void)select( 0, NULL, NULL, NULL, &tv );
1508 ldap_pvt_thread_yield();
1515 * FIXME: need a better strategy to handle errors
1518 rc = meta_back_op_result( mc, op, rs, META_TARGET_NONE,
1519 -1, stoptime != -1 ? (stoptime - slap_get_time()) : 0,
1520 LDAP_BACK_SENDERR );
1528 * Rewrite the matched portion of the search base, if required
1530 * FIXME: only the last one gets caught!
1532 savepriv = op->o_private;
1533 op->o_private = (void *)(long)mi->mi_ntargets;
1534 if ( candidate_match > 0 ) {
1535 struct berval pmatched = BER_BVNULL;
1537 /* we use the first one */
1538 for ( i = 0; i < mi->mi_ntargets; i++ ) {
1539 if ( META_IS_CANDIDATE( &candidates[ i ] )
1540 && candidates[ i ].sr_matched != NULL )
1542 struct berval bv, pbv;
1545 /* if we got success, and this target
1546 * returned noSuchObject, and its suffix
1547 * is a superior of the searchBase,
1548 * ignore the matchedDN */
1549 if ( sres == LDAP_SUCCESS
1550 && candidates[ i ].sr_err == LDAP_NO_SUCH_OBJECT
1551 && op->o_req_ndn.bv_len > mi->mi_targets[ i ]->mt_nsuffix.bv_len )
1553 free( (char *)candidates[ i ].sr_matched );
1554 candidates[ i ].sr_matched = NULL;
1558 ber_str2bv( candidates[ i ].sr_matched, 0, 0, &bv );
1559 rc = dnPretty( NULL, &bv, &pbv, op->o_tmpmemctx );
1561 if ( rc == LDAP_SUCCESS ) {
1563 /* NOTE: if they all are superiors
1564 * of the baseDN, the shorter is also
1565 * superior of the longer... */
1566 if ( pbv.bv_len > pmatched.bv_len ) {
1567 if ( !BER_BVISNULL( &pmatched ) ) {
1568 op->o_tmpfree( pmatched.bv_val, op->o_tmpmemctx );
1571 op->o_private = (void *)i;
1574 op->o_tmpfree( pbv.bv_val, op->o_tmpmemctx );
1578 if ( candidates[ i ].sr_matched != NULL ) {
1579 free( (char *)candidates[ i ].sr_matched );
1580 candidates[ i ].sr_matched = NULL;
1585 if ( !BER_BVISNULL( &pmatched ) ) {
1586 matched = pmatched.bv_val;
1589 } else if ( sres == LDAP_NO_SUCH_OBJECT ) {
1590 matched = op->o_bd->be_suffix[ 0 ].bv_val;
1594 * In case we returned at least one entry, we return LDAP_SUCCESS
1595 * otherwise, the latter error code we got
1598 if ( sres == LDAP_SUCCESS ) {
1599 if ( rs->sr_v2ref ) {
1600 sres = LDAP_REFERRAL;
1603 if ( META_BACK_ONERR_REPORT( mi ) ) {
1605 * Report errors, if any
1607 * FIXME: we should handle error codes and return the more
1608 * important/reasonable
1610 for ( i = 0; i < mi->mi_ntargets; i++ ) {
1611 if ( !META_IS_CANDIDATE( &candidates[ i ] ) ) {
1615 if ( candidates[ i ].sr_err != LDAP_SUCCESS
1616 && candidates[ i ].sr_err != LDAP_NO_SUCH_OBJECT )
1618 sres = candidates[ i ].sr_err;
1626 rs->sr_matched = matched;
1627 rs->sr_ref = ( sres == LDAP_REFERRAL ? rs->sr_v2ref : NULL );
1628 send_ldap_result( op, rs );
1629 op->o_private = savepriv;
1630 rs->sr_matched = NULL;
1634 if ( matched && matched != op->o_bd->be_suffix[ 0 ].bv_val ) {
1635 op->o_tmpfree( matched, op->o_tmpmemctx );
1638 if ( rs->sr_v2ref ) {
1639 ber_bvarray_free( rs->sr_v2ref );
1642 for ( i = 0; i < mi->mi_ntargets; i++ ) {
1643 if ( !META_IS_CANDIDATE( &candidates[ i ] ) ) {
1647 if ( mc && META_IS_BINDING( &candidates[ i ] ) ) {
1648 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
1649 if ( LDAP_BACK_CONN_BINDING( &mc->mc_conns[ i ] ) ) {
1650 assert( candidates[ i ].sr_msgid >= 0 );
1651 assert( mc->mc_conns[ i ].msc_ld != NULL );
1654 Debug( LDAP_DEBUG_ANY, "### %s meta_back_search(cleanup) "
1655 "ldap_unbind_ext[%ld] ld=%p\n",
1656 op->o_log_prefix, i, (void *)mc->mc_conns[i].msc_ld );
1657 #endif /* DEBUG_205 */
1659 /* if still binding, destroy */
1660 meta_clear_one_candidate( op, mc, i );
1662 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
1663 META_BINDING_CLEAR( &candidates[ i ] );
1666 if ( candidates[ i ].sr_matched ) {
1667 free( (char *)candidates[ i ].sr_matched );
1668 candidates[ i ].sr_matched = NULL;
1671 if ( candidates[ i ].sr_text ) {
1672 ldap_memfree( (char *)candidates[ i ].sr_text );
1673 candidates[ i ].sr_text = NULL;
1676 if ( candidates[ i ].sr_ref ) {
1677 ber_bvarray_free( candidates[ i ].sr_ref );
1678 candidates[ i ].sr_ref = NULL;
1681 if ( candidates[ i ].sr_ctrls ) {
1682 ldap_controls_free( candidates[ i ].sr_ctrls );
1683 candidates[ i ].sr_ctrls = NULL;
1686 if ( META_BACK_TGT_QUARANTINE( mi->mi_targets[ i ] ) ) {
1687 meta_back_quarantine( op, &candidates[ i ], i );
1690 /* only in case of timelimit exceeded, if the timelimit exceeded because
1691 * one contacted target never responded, invalidate the connection
1692 * NOTE: should we quarantine the target as well? right now, the connection
1693 * is invalidated; the next time it will be recreated and the target
1694 * will be quarantined if it cannot be contacted */
1695 if ( mi->mi_idle_timeout != 0
1696 && rs->sr_err == LDAP_TIMELIMIT_EXCEEDED
1697 && op->o_time > mc->mc_conns[ i ].msc_time )
1699 /* don't let anyone else use this expired connection */
1700 LDAP_BACK_CONN_TAINTED_SET( mc );
1705 meta_back_release_conn( mi, mc );
1719 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
1720 struct berval a, mapped;
1722 BerElement ber = *e->lm_ber;
1723 Attribute *attr, **attrp;
1730 if ( ber_scanf( &ber, "{m{", &bdn ) == LBER_ERROR ) {
1731 return LDAP_DECODING_ERROR;
1735 * Rewrite the dn of the result, if needed
1737 dc.target = mi->mi_targets[ target ];
1738 dc.conn = op->o_conn;
1740 dc.ctx = "searchResult";
1742 rs->sr_err = ldap_back_dn_massage( &dc, &bdn, &dn );
1743 if ( rs->sr_err != LDAP_SUCCESS) {
1748 * Note: this may fail if the target host(s) schema differs
1749 * from the one known to the meta, and a DN with unknown
1750 * attributes is returned.
1752 * FIXME: should we log anything, or delegate to dnNormalize?
1754 rc = dnPrettyNormal( NULL, &dn, &ent.e_name, &ent.e_nname,
1756 if ( dn.bv_val != bdn.bv_val ) {
1761 if ( rc != LDAP_SUCCESS ) {
1762 return LDAP_INVALID_DN_SYNTAX;
1768 if ( mi->mi_cache.ttl != META_DNCACHE_DISABLED ) {
1769 ( void )meta_dncache_update_entry( &mi->mi_cache,
1770 &ent.e_nname, target );
1773 attrp = &ent.e_attrs;
1775 dc.ctx = "searchAttrDN";
1776 while ( ber_scanf( &ber, "{m", &a ) != LBER_ERROR ) {
1778 slap_syntax_validate_func *validate;
1779 slap_syntax_transform_func *pretty;
1781 ldap_back_map( &mi->mi_targets[ target ]->mt_rwmap.rwm_at,
1782 &a, &mapped, BACKLDAP_REMAP );
1783 if ( BER_BVISNULL( &mapped ) || mapped.bv_val[0] == '\0' ) {
1784 ( void )ber_scanf( &ber, "x" /* [W] */ );
1787 attr = ( Attribute * )ch_calloc( 1, sizeof( Attribute ) );
1788 if ( attr == NULL ) {
1791 if ( slap_bv2ad( &mapped, &attr->a_desc, &text )
1793 if ( slap_bv2undef_ad( &mapped, &attr->a_desc, &text,
1794 SLAP_AD_PROXIED ) != LDAP_SUCCESS )
1796 char buf[ SLAP_TEXT_BUFLEN ];
1798 snprintf( buf, sizeof( buf ),
1799 "%s meta_send_entry(\"%s\"): "
1800 "slap_bv2undef_ad(%s): %s\n",
1801 op->o_log_prefix, ent.e_name.bv_val,
1802 mapped.bv_val, text );
1804 Debug( LDAP_DEBUG_ANY, "%s", buf, 0, 0 );
1810 /* no subschemaSubentry */
1811 if ( attr->a_desc == slap_schema.si_ad_subschemaSubentry
1812 || attr->a_desc == slap_schema.si_ad_entryDN )
1816 * We eat target's subschemaSubentry because
1817 * a search for this value is likely not
1818 * to resolve to the appropriate backend;
1819 * later, the local subschemaSubentry is
1822 * We also eat entryDN because the frontend
1823 * will reattach it without checking if already
1826 ( void )ber_scanf( &ber, "x" /* [W] */ );
1832 if ( ber_scanf( &ber, "[W]", &attr->a_vals ) == LBER_ERROR
1833 || attr->a_vals == NULL )
1835 attr->a_vals = (struct berval *)&slap_dummy_bv;
1838 for ( last = 0; !BER_BVISNULL( &attr->a_vals[ last ] ); ++last )
1842 validate = attr->a_desc->ad_type->sat_syntax->ssyn_validate;
1843 pretty = attr->a_desc->ad_type->sat_syntax->ssyn_pretty;
1845 if ( !validate && !pretty ) {
1850 if ( attr->a_desc == slap_schema.si_ad_objectClass
1851 || attr->a_desc == slap_schema.si_ad_structuralObjectClass )
1855 for ( bv = attr->a_vals; !BER_BVISNULL( bv ); bv++ ) {
1856 ldap_back_map( &mi->mi_targets[ target ]->mt_rwmap.rwm_oc,
1857 bv, &mapped, BACKLDAP_REMAP );
1858 if ( BER_BVISNULL( &mapped ) || mapped.bv_val[0] == '\0') {
1864 *bv = attr->a_vals[ last ];
1865 BER_BVZERO( &attr->a_vals[ last ] );
1868 } else if ( mapped.bv_val != bv->bv_val ) {
1870 ber_dupbv( bv, &mapped );
1874 * It is necessary to try to rewrite attributes with
1875 * dn syntax because they might be used in ACLs as
1876 * members of groups; since ACLs are applied to the
1877 * rewritten stuff, no dn-based subecj clause could
1878 * be used at the ldap backend side (see
1879 * http://www.OpenLDAP.org/faq/data/cache/452.html)
1880 * The problem can be overcome by moving the dn-based
1881 * ACLs to the target directory server, and letting
1882 * everything pass thru the ldap backend.
1887 if ( attr->a_desc->ad_type->sat_syntax ==
1888 slap_schema.si_syn_distinguishedName )
1890 ldap_dnattr_result_rewrite( &dc, attr->a_vals );
1892 } else if ( attr->a_desc == slap_schema.si_ad_ref ) {
1893 ldap_back_referral_result_rewrite( &dc, attr->a_vals );
1897 for ( i = 0; i < last; i++ ) {
1902 rc = pretty( attr->a_desc->ad_type->sat_syntax,
1903 &attr->a_vals[i], &pval, NULL );
1906 rc = validate( attr->a_desc->ad_type->sat_syntax,
1911 LBER_FREE( attr->a_vals[i].bv_val );
1912 if ( --last == i ) {
1913 BER_BVZERO( &attr->a_vals[ i ] );
1916 attr->a_vals[i] = attr->a_vals[last];
1917 BER_BVZERO( &attr->a_vals[last] );
1923 LBER_FREE( attr->a_vals[i].bv_val );
1924 attr->a_vals[i] = pval;
1928 if ( last == 0 && attr->a_vals != &slap_dummy_bv ) {
1934 if ( last && attr->a_desc->ad_type->sat_equality &&
1935 attr->a_desc->ad_type->sat_equality->smr_normalize )
1939 attr->a_nvals = ch_malloc( ( last + 1 ) * sizeof( struct berval ) );
1940 for ( i = 0; i<last; i++ ) {
1941 attr->a_desc->ad_type->sat_equality->smr_normalize(
1942 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
1943 attr->a_desc->ad_type->sat_syntax,
1944 attr->a_desc->ad_type->sat_equality,
1945 &attr->a_vals[i], &attr->a_nvals[i],
1948 BER_BVZERO( &attr->a_nvals[i] );
1951 attr->a_nvals = attr->a_vals;
1955 attrp = &attr->a_next;
1958 rs->sr_entry = &ent;
1959 rs->sr_attrs = op->ors_attrs;
1961 rs->sr_err = LDAP_SUCCESS;
1962 rc = send_search_entry( op, rs );
1964 case LDAP_UNAVAILABLE:
1968 rs->sr_entry = NULL;
1969 rs->sr_attrs = NULL;
1971 if ( !BER_BVISNULL( &ent.e_name ) ) {
1972 free( ent.e_name.bv_val );
1973 BER_BVZERO( &ent.e_name );
1975 if ( !BER_BVISNULL( &ent.e_nname ) ) {
1976 free( ent.e_nname.bv_val );
1977 BER_BVZERO( &ent.e_nname );
1979 entry_clean( &ent );