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 );
233 /* connect must be async */
235 ldap_set_option( msc->msc_ld, LDAP_OPT_CONNECT_ASYNC, LDAP_OPT_ON );
237 rc = ldap_sasl_bind( msc->msc_ld, binddn.bv_val, LDAP_SASL_SIMPLE, &cred,
238 NULL, NULL, &candidates[ candidate ].sr_msgid );
242 char buf[ SLAP_TEXT_BUFLEN ];
244 snprintf( buf, sizeof( buf ), "meta_search_dobind_init[%d] mc=%p ld=%p rc=%d",
245 candidate, (void *)mc, (void *)mc->mc_conns[ candidate ].msc_ld, rc );
246 Debug( LDAP_DEBUG_ANY, "### %s %s\n",
247 op->o_log_prefix, buf, 0 );
249 #endif /* DEBUG_205 */
253 assert( candidates[ candidate ].sr_msgid >= 0 );
254 META_BINDING_SET( &candidates[ candidate ] );
255 return META_SEARCH_BINDING;
257 case LDAP_X_CONNECTING:
258 /* must retry, same conn */
259 candidates[ candidate ].sr_msgid = META_MSGID_NEED_BIND;
260 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
261 LDAP_BACK_CONN_BINDING_CLEAR( msc );
262 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
263 return META_SEARCH_NEED_BIND;
265 case LDAP_SERVER_DOWN:
267 /* This is the worst thing that could happen:
268 * the search will wait until the retry is over. */
269 if ( !META_IS_RETRYING( &candidates[ candidate ] ) ) {
270 META_RETRYING_SET( &candidates[ candidate ] );
272 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
274 assert( mc->mc_refcnt > 0 );
275 if ( LogTest( LDAP_DEBUG_ANY ) ) {
276 char buf[ SLAP_TEXT_BUFLEN ];
278 /* this lock is required; however,
279 * it's invoked only when logging is on */
280 ldap_pvt_thread_mutex_lock( &mt->mt_uri_mutex );
281 snprintf( buf, sizeof( buf ),
282 "retrying URI=\"%s\" DN=\"%s\"",
284 BER_BVISNULL( &msc->msc_bound_ndn ) ?
285 "" : msc->msc_bound_ndn.bv_val );
286 ldap_pvt_thread_mutex_unlock( &mt->mt_uri_mutex );
288 Debug( LDAP_DEBUG_ANY,
289 "%s meta_search_dobind_init[%d]: %s.\n",
290 op->o_log_prefix, candidate, buf );
293 meta_clear_one_candidate( op, mc, candidate );
294 LDAP_BACK_CONN_ISBOUND_CLEAR( msc );
296 ( void )rewrite_session_delete( mt->mt_rwmap.rwm_rw, op->o_conn );
298 /* mc here must be the regular mc, reset and ready for init */
299 rc = meta_back_init_one_conn( op, rs, mc, candidate,
300 LDAP_BACK_CONN_ISPRIV( mc ), LDAP_BACK_DONTSEND, 0 );
302 if ( rc == LDAP_SUCCESS ) {
303 LDAP_BACK_CONN_BINDING_SET( msc );
306 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
308 if ( rc == LDAP_SUCCESS ) {
309 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
314 if ( *mcp == NULL ) {
315 retcode = META_SEARCH_ERR;
316 rs->sr_err = LDAP_UNAVAILABLE;
324 rc = slap_map_api2result( rs );
326 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
327 meta_clear_one_candidate( op, mc, candidate );
328 candidates[ candidate ].sr_err = rc;
329 if ( META_BACK_ONERR_STOP( mi ) ) {
330 LDAP_BACK_CONN_TAINTED_SET( mc );
331 meta_back_release_conn_lock( mi, mc, 0 );
335 retcode = META_SEARCH_ERR;
338 retcode = META_SEARCH_NOT_CANDIDATE;
340 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
341 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
348 static meta_search_candidate_t
349 meta_search_dobind_result(
354 SlapReply *candidates,
357 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
358 metaconn_t *mc = *mcp;
359 metasingleconn_t *msc = &mc->mc_conns[ candidate ];
361 meta_search_candidate_t retcode = META_SEARCH_NOT_CANDIDATE;
364 assert( msc->msc_ld != NULL );
366 /* FIXME: matched? referrals? response controls? */
367 rc = ldap_parse_result( msc->msc_ld, res,
368 &candidates[ candidate ].sr_err,
369 NULL, NULL, NULL, NULL, 0 );
370 if ( rc != LDAP_SUCCESS ) {
371 candidates[ candidate ].sr_err = rc;
374 rc = slap_map_api2result( &candidates[ candidate ] );
377 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
378 LDAP_BACK_CONN_BINDING_CLEAR( msc );
379 if ( rc != LDAP_SUCCESS ) {
380 meta_clear_one_candidate( op, mc, candidate );
381 candidates[ candidate ].sr_err = rc;
382 if ( META_BACK_ONERR_STOP( mi ) ) {
383 LDAP_BACK_CONN_TAINTED_SET( mc );
384 meta_back_release_conn_lock( mi, mc, 0 );
386 retcode = META_SEARCH_ERR;
391 /* FIXME: check if bound as idassert authcDN! */
392 if ( BER_BVISNULL( &msc->msc_bound_ndn )
393 || BER_BVISEMPTY( &msc->msc_bound_ndn ) )
395 LDAP_BACK_CONN_ISANON_SET( msc );
398 LDAP_BACK_CONN_ISBOUND_SET( msc );
400 retcode = META_SEARCH_CANDIDATE;
402 /* connect must be async */
403 ldap_set_option( msc->msc_ld, LDAP_OPT_CONNECT_ASYNC, LDAP_OPT_OFF );
406 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
407 META_BINDING_CLEAR( &candidates[ candidate ] );
409 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
414 static meta_search_candidate_t
415 meta_back_search_start(
421 SlapReply *candidates )
423 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
424 metatarget_t *mt = mi->mi_targets[ candidate ];
425 metasingleconn_t *msc = &(*mcp)->mc_conns[ candidate ];
426 struct berval realbase = op->o_req_dn;
427 int realscope = op->ors_scope;
428 struct berval mbase = BER_BVNULL;
429 struct berval mfilter = BER_BVNULL;
430 char **mapped_attrs = NULL;
432 meta_search_candidate_t retcode;
433 struct timeval tv, *tvp = NULL;
435 LDAPControl **ctrls = NULL;
437 /* this should not happen; just in case... */
438 if ( msc->msc_ld == NULL ) {
439 Debug( LDAP_DEBUG_ANY,
440 "%s: meta_back_search_start candidate=%d ld=NULL%s.\n",
441 op->o_log_prefix, candidate,
442 META_BACK_ONERR_STOP( mi ) ? "" : " (ignored)" );
443 candidates[ candidate ].sr_err = LDAP_OTHER;
444 if ( META_BACK_ONERR_STOP( mi ) ) {
445 return META_SEARCH_ERR;
447 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
448 return META_SEARCH_NOT_CANDIDATE;
451 Debug( LDAP_DEBUG_TRACE, "%s >>> meta_back_search_start[%d]\n", op->o_log_prefix, candidate, 0 );
454 * modifies the base according to the scope, if required
456 if ( mt->mt_nsuffix.bv_len > op->o_req_ndn.bv_len ) {
457 switch ( op->ors_scope ) {
458 case LDAP_SCOPE_SUBTREE:
460 * make the target suffix the new base
461 * FIXME: this is very forgiving, because
462 * "illegal" searchBases may be turned
463 * into the suffix of the target; however,
464 * the requested searchBase already passed
465 * thru the candidate analyzer...
467 if ( dnIsSuffix( &mt->mt_nsuffix, &op->o_req_ndn ) ) {
468 realbase = mt->mt_nsuffix;
469 if ( mt->mt_scope == LDAP_SCOPE_SUBORDINATE ) {
470 realscope = LDAP_SCOPE_SUBORDINATE;
475 * this target is no longer candidate
477 retcode = META_SEARCH_NOT_CANDIDATE;
482 case LDAP_SCOPE_SUBORDINATE:
483 case LDAP_SCOPE_ONELEVEL:
485 struct berval rdn = mt->mt_nsuffix;
486 rdn.bv_len -= op->o_req_ndn.bv_len + STRLENOF( "," );
487 if ( dnIsOneLevelRDN( &rdn )
488 && dnIsSuffix( &mt->mt_nsuffix, &op->o_req_ndn ) )
491 * if there is exactly one level,
492 * make the target suffix the new
493 * base, and make scope "base"
495 realbase = mt->mt_nsuffix;
496 if ( op->ors_scope == LDAP_SCOPE_SUBORDINATE ) {
497 if ( mt->mt_scope == LDAP_SCOPE_SUBORDINATE ) {
498 realscope = LDAP_SCOPE_SUBORDINATE;
500 realscope = LDAP_SCOPE_SUBTREE;
503 realscope = LDAP_SCOPE_BASE;
506 } /* else continue with the next case */
509 case LDAP_SCOPE_BASE:
511 * this target is no longer candidate
513 retcode = META_SEARCH_NOT_CANDIDATE;
518 /* initiate dobind */
519 retcode = meta_search_dobind_init( op, rs, mcp, candidate, candidates );
521 Debug( LDAP_DEBUG_TRACE, "%s <<< meta_search_dobind_init[%d]=%d\n", op->o_log_prefix, candidate, retcode );
523 if ( retcode != META_SEARCH_CANDIDATE ) {
528 * Rewrite the search base, if required
531 dc->ctx = "searchBase";
532 switch ( ldap_back_dn_massage( dc, &realbase, &mbase ) ) {
536 case LDAP_UNWILLING_TO_PERFORM:
537 rs->sr_err = LDAP_UNWILLING_TO_PERFORM;
538 rs->sr_text = "Operation not allowed";
539 send_ldap_result( op, rs );
540 retcode = META_SEARCH_ERR;
546 * this target is no longer candidate
548 retcode = META_SEARCH_NOT_CANDIDATE;
555 rc = ldap_back_filter_map_rewrite( dc, op->ors_filter,
556 &mfilter, BACKLDAP_MAP );
561 case LDAP_COMPARE_FALSE:
564 * this target is no longer candidate
566 retcode = META_SEARCH_NOT_CANDIDATE;
571 * Maps required attributes
573 rc = ldap_back_map_attrs( &mt->mt_rwmap.rwm_at,
574 op->ors_attrs, BACKLDAP_MAP, &mapped_attrs );
575 if ( rc != LDAP_SUCCESS ) {
577 * this target is no longer candidate
579 retcode = META_SEARCH_NOT_CANDIDATE;
583 /* should we check return values? */
584 if ( op->ors_deref != -1 ) {
585 assert( msc->msc_ld != NULL );
586 (void)ldap_set_option( msc->msc_ld, LDAP_OPT_DEREF,
587 ( void * )&op->ors_deref );
590 if ( op->ors_tlimit != SLAP_NO_LIMIT ) {
591 tv.tv_sec = op->ors_tlimit > 0 ? op->ors_tlimit : 1;
598 if ( ldap_back_proxy_authz_ctrl( &msc->msc_bound_ndn,
599 mt->mt_version, &mt->mt_idassert, op, rs, &ctrls )
602 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
603 retcode = META_SEARCH_NOT_CANDIDATE;
610 assert( msc->msc_ld != NULL );
611 rc = ldap_search_ext( msc->msc_ld,
612 mbase.bv_val, realscope, mfilter.bv_val,
613 mapped_attrs, op->ors_attrsonly,
614 ctrls, NULL, tvp, op->ors_slimit,
615 &candidates[ candidate ].sr_msgid );
618 retcode = META_SEARCH_CANDIDATE;
621 case LDAP_SERVER_DOWN:
622 if ( nretries && meta_back_retry( op, rs, mcp, candidate, LDAP_BACK_DONTSEND ) ) {
624 /* if the identity changed, there might be need to re-authz */
625 (void)ldap_back_proxy_authz_ctrl_free( op, &ctrls );
629 if ( *mcp == NULL ) {
630 retcode = META_SEARCH_ERR;
636 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
637 retcode = META_SEARCH_NOT_CANDIDATE;
641 (void)ldap_back_proxy_authz_ctrl_free( op, &ctrls );
643 if ( mapped_attrs ) {
644 free( mapped_attrs );
646 if ( mfilter.bv_val != op->ors_filterstr.bv_val ) {
647 free( mfilter.bv_val );
649 if ( mbase.bv_val != realbase.bv_val ) {
650 free( mbase.bv_val );
654 Debug( LDAP_DEBUG_TRACE, "%s <<< meta_back_search_start[%d]=%d\n", op->o_log_prefix, candidate, retcode );
660 meta_back_search( Operation *op, SlapReply *rs )
662 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
664 struct timeval save_tv = { 0, 0 },
666 time_t stoptime = (time_t)-1;
667 int rc = 0, sres = LDAP_SUCCESS;
668 char *matched = NULL;
669 int last = 0, ncandidates = 0,
670 initial_candidates = 0, candidate_match = 0,
672 ldap_back_send_t sendok = LDAP_BACK_SENDERR;
677 SlapReply *candidates = meta_back_candidates_get( op );
680 * controls are set in ldap_back_dobind()
682 * FIXME: in case of values return filter, we might want
683 * to map attrs and maybe rewrite value
686 mc = meta_back_getconn( op, rs, NULL, sendok );
691 dc.conn = op->o_conn;
697 for ( i = 0; i < mi->mi_ntargets; i++ ) {
698 /* reset sr_msgid; it is used in most loops
699 * to check if that target is still to be considered */
700 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
702 /* a target is marked as candidate by meta_back_getconn();
703 * if for any reason (an error, it's over or so) it is
704 * no longer active, sr_msgid is set to META_MSGID_IGNORE
705 * but it remains candidate, which means it has been active
706 * at some point during the operation. This allows to
707 * use its response code and more to compute the final
709 if ( !META_IS_CANDIDATE( &candidates[ i ] ) ) {
713 candidates[ i ].sr_matched = NULL;
714 candidates[ i ].sr_text = NULL;
715 candidates[ i ].sr_ref = NULL;
716 candidates[ i ].sr_ctrls = NULL;
719 for ( i = 0; i < mi->mi_ntargets; i++ ) {
720 if ( !META_IS_CANDIDATE( &candidates[ i ] )
721 || candidates[ i ].sr_err != LDAP_SUCCESS )
726 switch ( meta_back_search_start( op, rs, &dc, &mc, i, candidates ) )
728 case META_SEARCH_NOT_CANDIDATE:
729 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
732 case META_SEARCH_NEED_BIND:
736 case META_SEARCH_CANDIDATE:
737 case META_SEARCH_BINDING:
738 candidates[ i ].sr_type = REP_INTERMEDIATE;
742 case META_SEARCH_ERR:
743 savepriv = op->o_private;
744 op->o_private = (void *)i;
745 send_ldap_result( op, rs );
746 op->o_private = savepriv;
756 if ( ncandidates > 0 && needbind == ncandidates ) {
758 * give up the second time...
760 * NOTE: this should not occur the second time, since a fresh
761 * connection has ben created; however, targets may also
762 * need bind because the bind timed out or so.
764 if ( sendok & LDAP_BACK_BINDING ) {
765 Debug( LDAP_DEBUG_ANY,
766 "%s meta_back_search: unable to initialize conn\n",
767 op->o_log_prefix, 0, 0 );
768 rs->sr_err = LDAP_UNAVAILABLE;
769 rs->sr_text = "unable to initialize connection to remote targets";
770 send_ldap_result( op, rs );
775 /* FIXME: better create a separate connection? */
776 sendok |= LDAP_BACK_BINDING;
779 Debug( LDAP_DEBUG_ANY, "*** %s drop mc=%p create new connection\n",
780 op->o_log_prefix, (void *)mc, 0 );
781 #endif /* DEBUG_205 */
783 meta_back_release_conn( mi, mc );
792 initial_candidates = ncandidates;
794 if ( LogTest( LDAP_DEBUG_TRACE ) ) {
795 char cnd[ SLAP_TEXT_BUFLEN ];
798 for ( c = 0; c < mi->mi_ntargets; c++ ) {
799 if ( META_IS_CANDIDATE( &candidates[ c ] ) ) {
807 Debug( LDAP_DEBUG_TRACE, "%s meta_back_search: ncandidates=%d "
808 "cnd=\"%s\"\n", op->o_log_prefix, ncandidates, cnd );
811 if ( initial_candidates == 0 ) {
812 /* NOTE: here we are not sending any matchedDN;
813 * this is intended, because if the back-meta
814 * is serving this search request, but no valid
815 * candidate could be looked up, it means that
816 * there is a hole in the mapping of the targets
817 * and thus no knowledge of any remote superior
819 Debug( LDAP_DEBUG_ANY, "%s meta_back_search: "
820 "base=\"%s\" scope=%d: "
821 "no candidate could be selected\n",
822 op->o_log_prefix, op->o_req_dn.bv_val,
825 /* FIXME: we're sending the first error we encounter;
826 * maybe we should pick the worst... */
827 rc = LDAP_NO_SUCH_OBJECT;
828 for ( i = 0; i < mi->mi_ntargets; i++ ) {
829 if ( META_IS_CANDIDATE( &candidates[ i ] )
830 && candidates[ i ].sr_err != LDAP_SUCCESS )
832 rc = candidates[ i ].sr_err;
837 send_ldap_error( op, rs, rc, NULL );
842 /* We pull apart the ber result, stuff it into a slapd entry, and
843 * let send_search_entry stuff it back into ber format. Slow & ugly,
844 * but this is necessary for version matching, and for ACL processing.
847 if ( op->ors_tlimit != SLAP_NO_LIMIT ) {
848 stoptime = op->o_time + op->ors_tlimit;
852 * In case there are no candidates, no cycle takes place...
854 * FIXME: we might use a queue, to better balance the load
855 * among the candidates
857 for ( rc = 0; ncandidates > 0; ) {
860 alreadybound = ncandidates;
862 /* check time limit */
863 if ( op->ors_tlimit != SLAP_NO_LIMIT
864 && slap_get_time() > stoptime )
867 rc = rs->sr_err = LDAP_TIMELIMIT_EXCEEDED;
868 savepriv = op->o_private;
869 op->o_private = (void *)i;
870 send_ldap_result( op, rs );
871 op->o_private = savepriv;
875 for ( i = 0; i < mi->mi_ntargets; i++ ) {
876 meta_search_candidate_t retcode = META_SEARCH_UNDEFINED;
877 metasingleconn_t *msc = &mc->mc_conns[ i ];
878 LDAPMessage *res = NULL, *msg;
880 /* if msgid is invalid, don't ldap_result() */
881 if ( candidates[ i ].sr_msgid == META_MSGID_IGNORE ) {
885 /* if target still needs bind, retry */
886 if ( candidates[ i ].sr_msgid == META_MSGID_NEED_BIND ) {
887 /* initiate dobind */
888 retcode = meta_search_dobind_init( op, rs, &mc, i, candidates );
890 Debug( LDAP_DEBUG_TRACE, "%s <<< meta_search_dobind_init[%ld]=%d\n",
891 op->o_log_prefix, i, retcode );
894 case META_SEARCH_NEED_BIND:
898 case META_SEARCH_BINDING:
901 case META_SEARCH_ERR:
902 candidates[ i ].sr_err = rs->sr_err;
903 if ( META_BACK_ONERR_STOP( mi ) ) {
904 savepriv = op->o_private;
905 op->o_private = (void *)i;
906 send_ldap_result( op, rs );
907 op->o_private = savepriv;
912 case META_SEARCH_NOT_CANDIDATE:
914 * When no candidates are left,
915 * the outer cycle finishes
917 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
918 assert( ncandidates > 0 );
922 case META_SEARCH_CANDIDATE:
923 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
924 switch ( meta_back_search_start( op, rs, &dc, &mc, i, candidates ) )
926 case META_SEARCH_CANDIDATE:
927 assert( candidates[ i ].sr_msgid >= 0 );
930 case META_SEARCH_ERR:
931 candidates[ i ].sr_err = rs->sr_err;
932 if ( META_BACK_ONERR_STOP( mi ) ) {
933 savepriv = op->o_private;
934 op->o_private = (void *)i;
935 send_ldap_result( op, rs );
936 op->o_private = savepriv;
941 case META_SEARCH_NOT_CANDIDATE:
942 /* means that meta_back_search_start()
943 * failed but onerr == continue */
944 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
945 assert( ncandidates > 0 );
964 /* check for abandon */
965 if ( op->o_abandon || LDAP_BACK_CONN_ABANDON( mc ) ) {
970 if ( msc->msc_ld == NULL ) {
971 char buf[ SLAP_TEXT_BUFLEN ];
973 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
974 snprintf( buf, sizeof( buf ),
975 "%s meta_back_search[%ld] mc=%p msgid=%d%s%s%s\n",
976 op->o_log_prefix, (long)i, (void *)mc,
977 candidates[ i ].sr_msgid,
978 META_IS_BINDING( &candidates[ i ] ) ? " binding" : "",
979 LDAP_BACK_CONN_BINDING( &mc->mc_conns[ i ] ) ? " connbinding" : "",
980 META_BACK_CONN_CREATING( &mc->mc_conns[ i ] ) ? " conncreating" : "" );
981 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
983 Debug( LDAP_DEBUG_ANY, "!!! %s\n", buf, 0, 0 );
985 #endif /* DEBUG_205 */
988 * FIXME: handle time limit as well?
989 * Note that target servers are likely
990 * to handle it, so at some time we'll
991 * get a LDAP_TIMELIMIT_EXCEEDED from
995 rc = ldap_result( msc->msc_ld, candidates[ i ].sr_msgid,
996 LDAP_MSG_RECEIVED, &tv, &res );
999 /* FIXME: res should not need to be freed */
1000 assert( res == NULL );
1005 /* something REALLY bad happened! */
1006 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
1007 candidates[ i ].sr_type = REP_RESULT;
1009 if ( meta_back_retry( op, rs, &mc, i, LDAP_BACK_DONTSEND ) ) {
1010 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1011 switch ( meta_back_search_start( op, rs, &dc, &mc, i, candidates ) )
1013 /* means that failed but onerr == continue */
1014 case META_SEARCH_NOT_CANDIDATE:
1015 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1017 assert( ncandidates > 0 );
1020 candidates[ i ].sr_err = rs->sr_err;
1021 if ( META_BACK_ONERR_STOP( mi ) ) {
1022 savepriv = op->o_private;
1023 op->o_private = (void *)i;
1024 send_ldap_result( op, rs );
1025 op->o_private = savepriv;
1030 case META_SEARCH_CANDIDATE:
1031 /* get back into business... */
1034 case META_SEARCH_BINDING:
1035 case META_SEARCH_NEED_BIND:
1036 case META_SEARCH_UNDEFINED:
1040 /* unrecoverable error */
1041 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1042 rc = rs->sr_err = LDAP_OTHER;
1047 candidates[ i ].sr_err = rs->sr_err;
1048 if ( META_BACK_ONERR_STOP( mi ) ) {
1049 savepriv = op->o_private;
1050 op->o_private = (void *)i;
1051 send_ldap_result( op, rs );
1052 op->o_private = savepriv;
1058 * When no candidates are left,
1059 * the outer cycle finishes
1061 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1062 assert( ncandidates > 0 );
1064 rs->sr_err = candidates[ i ].sr_err;
1068 /* only touch when activity actually took place... */
1069 if ( mi->mi_idle_timeout != 0 && msc->msc_time < op->o_time ) {
1070 msc->msc_time = op->o_time;
1075 for ( msg = ldap_first_message( msc->msc_ld, res );
1077 msg = ldap_next_message( msc->msc_ld, msg ) )
1079 rc = ldap_msgtype( msg );
1080 if ( rc == LDAP_RES_SEARCH_ENTRY ) {
1083 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
1084 /* don't retry any more... */
1085 candidates[ i ].sr_type = REP_RESULT;
1090 e = ldap_first_entry( msc->msc_ld, msg );
1091 savepriv = op->o_private;
1092 op->o_private = (void *)i;
1093 rs->sr_err = meta_send_entry( op, rs, mc, i, e );
1095 switch ( rs->sr_err ) {
1096 case LDAP_SIZELIMIT_EXCEEDED:
1097 savepriv = op->o_private;
1098 op->o_private = (void *)i;
1099 send_ldap_result( op, rs );
1100 op->o_private = savepriv;
1101 rs->sr_err = LDAP_SUCCESS;
1102 ldap_msgfree( res );
1106 case LDAP_UNAVAILABLE:
1107 rs->sr_err = LDAP_OTHER;
1108 ldap_msgfree( res );
1112 op->o_private = savepriv;
1114 /* don't wait any longer... */
1117 save_tv.tv_usec = 0;
1119 } else if ( rc == LDAP_RES_SEARCH_REFERENCE ) {
1120 char **references = NULL;
1123 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
1124 /* don't retry any more... */
1125 candidates[ i ].sr_type = REP_RESULT;
1130 rc = ldap_parse_reference( msc->msc_ld, msg,
1131 &references, &rs->sr_ctrls, 0 );
1133 if ( rc != LDAP_SUCCESS ) {
1137 if ( references == NULL ) {
1141 #ifdef ENABLE_REWRITE
1142 dc.ctx = "referralDN";
1143 #else /* ! ENABLE_REWRITE */
1146 #endif /* ! ENABLE_REWRITE */
1148 /* FIXME: merge all and return at the end */
1150 for ( cnt = 0; references[ cnt ]; cnt++ )
1153 rs->sr_ref = ch_calloc( sizeof( struct berval ), cnt + 1 );
1155 for ( cnt = 0; references[ cnt ]; cnt++ ) {
1156 ber_str2bv( references[ cnt ], 0, 1, &rs->sr_ref[ cnt ] );
1158 BER_BVZERO( &rs->sr_ref[ cnt ] );
1160 ( void )ldap_back_referral_result_rewrite( &dc, rs->sr_ref );
1162 if ( rs->sr_ref != NULL && !BER_BVISNULL( &rs->sr_ref[ 0 ] ) ) {
1163 /* ignore return value by now */
1164 savepriv = op->o_private;
1165 op->o_private = (void *)i;
1166 ( void )send_search_reference( op, rs );
1167 op->o_private = savepriv;
1169 ber_bvarray_free( rs->sr_ref );
1175 ber_memvfree( (void **)references );
1178 if ( rs->sr_ctrls ) {
1179 ldap_controls_free( rs->sr_ctrls );
1180 rs->sr_ctrls = NULL;
1183 } else if ( rc == LDAP_RES_SEARCH_RESULT ) {
1184 char buf[ SLAP_TEXT_BUFLEN ];
1185 char **references = NULL;
1187 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
1188 /* don't retry any more... */
1189 candidates[ i ].sr_type = REP_RESULT;
1192 /* NOTE: ignores response controls
1193 * (and intermediate response controls
1194 * as well, except for those with search
1195 * references); this may not be correct,
1196 * but if they're not ignored then
1197 * back-meta would need to merge them
1198 * consistently (think of pagedResults...)
1200 /* FIXME: response controls? */
1201 rs->sr_err = ldap_parse_result( msc->msc_ld,
1203 &candidates[ i ].sr_err,
1204 (char **)&candidates[ i ].sr_matched,
1205 NULL /* (char **)&candidates[ i ].sr_text */ ,
1207 NULL /* &candidates[ i ].sr_ctrls (unused) */ ,
1209 if ( rs->sr_err != LDAP_SUCCESS ) {
1210 ldap_get_option( msc->msc_ld,
1211 LDAP_OPT_ERROR_NUMBER,
1213 sres = slap_map_api2result( rs );
1214 candidates[ i ].sr_type = REP_RESULT;
1215 ldap_msgfree( res );
1220 /* massage matchedDN if need be */
1221 if ( candidates[ i ].sr_matched != NULL ) {
1222 struct berval match, mmatch;
1224 ber_str2bv( candidates[ i ].sr_matched,
1226 candidates[ i ].sr_matched = NULL;
1228 dc.ctx = "matchedDN";
1229 dc.target = mi->mi_targets[ i ];
1230 if ( !ldap_back_dn_massage( &dc, &match, &mmatch ) ) {
1231 if ( mmatch.bv_val == match.bv_val ) {
1232 candidates[ i ].sr_matched
1233 = ch_strdup( mmatch.bv_val );
1236 candidates[ i ].sr_matched = mmatch.bv_val;
1241 ldap_memfree( match.bv_val );
1244 /* add references to array */
1249 for ( cnt = 0; references[ cnt ]; cnt++ )
1252 sr_ref = ch_calloc( sizeof( struct berval ), cnt + 1 );
1254 for ( cnt = 0; references[ cnt ]; cnt++ ) {
1255 ber_str2bv( references[ cnt ], 0, 1, &sr_ref[ cnt ] );
1257 BER_BVZERO( &sr_ref[ cnt ] );
1259 ( void )ldap_back_referral_result_rewrite( &dc, sr_ref );
1262 ber_memvfree( (void **)references );
1264 if ( rs->sr_v2ref == NULL ) {
1265 rs->sr_v2ref = sr_ref;
1268 for ( cnt = 0; !BER_BVISNULL( &sr_ref[ cnt ] ); cnt++ ) {
1269 ber_bvarray_add( &rs->sr_v2ref, &sr_ref[ cnt ] );
1271 ber_memfree( sr_ref );
1275 rs->sr_err = candidates[ i ].sr_err;
1276 sres = slap_map_api2result( rs );
1278 if ( LogTest( LDAP_DEBUG_TRACE | LDAP_DEBUG_ANY ) ) {
1279 snprintf( buf, sizeof( buf ),
1280 "%s meta_back_search[%ld] "
1281 "match=\"%s\" err=%ld",
1282 op->o_log_prefix, i,
1283 candidates[ i ].sr_matched ? candidates[ i ].sr_matched : "",
1284 (long) candidates[ i ].sr_err );
1285 if ( candidates[ i ].sr_err == LDAP_SUCCESS ) {
1286 Debug( LDAP_DEBUG_TRACE, "%s.\n", buf, 0, 0 );
1289 Debug( LDAP_DEBUG_ANY, "%s (%s).\n",
1290 buf, ldap_err2string( candidates[ i ].sr_err ), 0 );
1295 case LDAP_NO_SUCH_OBJECT:
1296 /* is_ok is touched any time a valid
1297 * (even intermediate) result is
1298 * returned; as a consequence, if
1299 * a candidate returns noSuchObject
1300 * it is ignored and the candidate
1301 * is simply demoted. */
1303 sres = LDAP_SUCCESS;
1312 case LDAP_SIZELIMIT_EXCEEDED:
1313 /* if a target returned sizelimitExceeded
1314 * and the entry count is equal to the
1315 * proxy's limit, the target would have
1316 * returned more, and the error must be
1317 * propagated to the client; otherwise,
1318 * the target enforced a limit lower
1319 * than what requested by the proxy;
1321 candidates[ i ].sr_err = rs->sr_err;
1322 if ( rs->sr_nentries == op->ors_slimit
1323 || META_BACK_ONERR_STOP( mi ) )
1325 savepriv = op->o_private;
1326 op->o_private = (void *)i;
1327 send_ldap_result( op, rs );
1328 op->o_private = savepriv;
1329 ldap_msgfree( res );
1336 candidates[ i ].sr_err = rs->sr_err;
1337 if ( META_BACK_ONERR_STOP( mi ) ) {
1338 savepriv = op->o_private;
1339 op->o_private = (void *)i;
1340 send_ldap_result( op, rs );
1341 op->o_private = savepriv;
1342 ldap_msgfree( res );
1353 * When no candidates are left,
1354 * the outer cycle finishes
1356 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1357 assert( ncandidates > 0 );
1360 } else if ( rc == LDAP_RES_BIND ) {
1361 meta_search_candidate_t retcode;
1363 retcode = meta_search_dobind_result( op, rs, &mc, i, candidates, msg );
1364 if ( retcode == META_SEARCH_CANDIDATE ) {
1365 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1366 retcode = meta_back_search_start( op, rs, &dc, &mc, i, candidates );
1369 switch ( retcode ) {
1370 case META_SEARCH_CANDIDATE:
1373 /* means that failed but onerr == continue */
1374 case META_SEARCH_NOT_CANDIDATE:
1375 case META_SEARCH_ERR:
1376 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1377 assert( ncandidates > 0 );
1380 candidates[ i ].sr_err = rs->sr_err;
1381 if ( META_BACK_ONERR_STOP( mi ) ) {
1382 savepriv = op->o_private;
1383 op->o_private = (void *)i;
1384 send_ldap_result( op, rs );
1385 op->o_private = savepriv;
1386 ldap_msgfree( res );
1399 ldap_msgfree( res );
1406 ldap_msgfree( res );
1410 /* check for abandon */
1411 if ( op->o_abandon || LDAP_BACK_CONN_ABANDON( mc ) ) {
1412 for ( i = 0; i < mi->mi_ntargets; i++ ) {
1413 if ( candidates[ i ].sr_msgid >= 0 ) {
1414 if ( META_IS_BINDING( &candidates[ i ] ) ) {
1415 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
1416 if ( LDAP_BACK_CONN_BINDING( &mc->mc_conns[ i ] ) ) {
1417 /* if still binding, destroy */
1420 char buf[ SLAP_TEXT_BUFLEN ];
1422 snprintf( buf, sizeof( buf), "%s meta_back_search(abandon) "
1423 "ldap_unbind_ext[%ld] mc=%p ld=%p",
1424 op->o_log_prefix, i, (void *)mc,
1425 (void *)mc->mc_conns[i].msc_ld );
1427 Debug( LDAP_DEBUG_ANY, "### %s\n", buf, 0, 0 );
1428 #endif /* DEBUG_205 */
1430 meta_clear_one_candidate( op, mc, i );
1432 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
1433 META_BINDING_CLEAR( &candidates[ i ] );
1436 (void)meta_back_cancel( mc, op, rs,
1437 candidates[ i ].sr_msgid, i,
1438 LDAP_BACK_DONTSEND );
1441 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1442 assert( ncandidates > 0 );
1447 if ( op->o_abandon ) {
1451 /* let send_ldap_result play cleanup handlers (ITS#4645) */
1455 /* if no entry was found during this loop,
1456 * set a minimal timeout */
1457 if ( ncandidates > 0 && gotit == 0 ) {
1458 if ( save_tv.tv_sec == 0 && save_tv.tv_usec == 0 ) {
1459 save_tv.tv_usec = LDAP_BACK_RESULT_UTIMEOUT/initial_candidates;
1461 /* arbitrarily limit to something between 1 and 2 minutes */
1462 } else if ( ( stoptime == -1 && save_tv.tv_sec < 60 )
1463 || save_tv.tv_sec < ( stoptime - slap_get_time() ) / ( 2 * ncandidates ) )
1465 /* double the timeout */
1466 lutil_timermul( &save_tv, 2, &save_tv );
1469 if ( alreadybound == 0 ) {
1471 (void)select( 0, NULL, NULL, NULL, &tv );
1474 ldap_pvt_thread_yield();
1481 * FIXME: need a better strategy to handle errors
1484 rc = meta_back_op_result( mc, op, rs, META_TARGET_NONE,
1485 -1, stoptime != -1 ? (stoptime - slap_get_time()) : 0,
1486 LDAP_BACK_SENDERR );
1494 * Rewrite the matched portion of the search base, if required
1496 * FIXME: only the last one gets caught!
1498 savepriv = op->o_private;
1499 op->o_private = (void *)(long)mi->mi_ntargets;
1500 if ( candidate_match > 0 ) {
1501 struct berval pmatched = BER_BVNULL;
1503 /* we use the first one */
1504 for ( i = 0; i < mi->mi_ntargets; i++ ) {
1505 if ( META_IS_CANDIDATE( &candidates[ i ] )
1506 && candidates[ i ].sr_matched != NULL )
1508 struct berval bv, pbv;
1511 /* if we got success, and this target
1512 * returned noSuchObject, and its suffix
1513 * is a superior of the searchBase,
1514 * ignore the matchedDN */
1515 if ( sres == LDAP_SUCCESS
1516 && candidates[ i ].sr_err == LDAP_NO_SUCH_OBJECT
1517 && op->o_req_ndn.bv_len > mi->mi_targets[ i ]->mt_nsuffix.bv_len )
1519 free( (char *)candidates[ i ].sr_matched );
1520 candidates[ i ].sr_matched = NULL;
1524 ber_str2bv( candidates[ i ].sr_matched, 0, 0, &bv );
1525 rc = dnPretty( NULL, &bv, &pbv, op->o_tmpmemctx );
1527 if ( rc == LDAP_SUCCESS ) {
1529 /* NOTE: if they all are superiors
1530 * of the baseDN, the shorter is also
1531 * superior of the longer... */
1532 if ( pbv.bv_len > pmatched.bv_len ) {
1533 if ( !BER_BVISNULL( &pmatched ) ) {
1534 op->o_tmpfree( pmatched.bv_val, op->o_tmpmemctx );
1537 op->o_private = (void *)i;
1540 op->o_tmpfree( pbv.bv_val, op->o_tmpmemctx );
1544 if ( candidates[ i ].sr_matched != NULL ) {
1545 free( (char *)candidates[ i ].sr_matched );
1546 candidates[ i ].sr_matched = NULL;
1551 if ( !BER_BVISNULL( &pmatched ) ) {
1552 matched = pmatched.bv_val;
1555 } else if ( sres == LDAP_NO_SUCH_OBJECT ) {
1556 matched = op->o_bd->be_suffix[ 0 ].bv_val;
1560 * In case we returned at least one entry, we return LDAP_SUCCESS
1561 * otherwise, the latter error code we got
1564 if ( sres == LDAP_SUCCESS ) {
1565 if ( rs->sr_v2ref ) {
1566 sres = LDAP_REFERRAL;
1569 if ( META_BACK_ONERR_REPORT( mi ) ) {
1571 * Report errors, if any
1573 * FIXME: we should handle error codes and return the more
1574 * important/reasonable
1576 for ( i = 0; i < mi->mi_ntargets; i++ ) {
1577 if ( !META_IS_CANDIDATE( &candidates[ i ] ) ) {
1581 if ( candidates[ i ].sr_err != LDAP_SUCCESS
1582 && candidates[ i ].sr_err != LDAP_NO_SUCH_OBJECT )
1584 sres = candidates[ i ].sr_err;
1592 rs->sr_matched = matched;
1593 rs->sr_ref = ( sres == LDAP_REFERRAL ? rs->sr_v2ref : NULL );
1594 send_ldap_result( op, rs );
1595 op->o_private = savepriv;
1596 rs->sr_matched = NULL;
1600 if ( matched && matched != op->o_bd->be_suffix[ 0 ].bv_val ) {
1601 op->o_tmpfree( matched, op->o_tmpmemctx );
1604 if ( rs->sr_v2ref ) {
1605 ber_bvarray_free( rs->sr_v2ref );
1608 for ( i = 0; i < mi->mi_ntargets; i++ ) {
1609 if ( !META_IS_CANDIDATE( &candidates[ i ] ) ) {
1613 if ( mc && META_IS_BINDING( &candidates[ i ] ) ) {
1614 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
1615 if ( LDAP_BACK_CONN_BINDING( &mc->mc_conns[ i ] ) ) {
1616 assert( candidates[ i ].sr_msgid >= 0 );
1617 assert( mc->mc_conns[ i ].msc_ld != NULL );
1620 Debug( LDAP_DEBUG_ANY, "### %s meta_back_search(cleanup) "
1621 "ldap_unbind_ext[%ld] ld=%p\n",
1622 op->o_log_prefix, i, (void *)mc->mc_conns[i].msc_ld );
1623 #endif /* DEBUG_205 */
1625 /* if still binding, destroy */
1626 meta_clear_one_candidate( op, mc, i );
1628 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
1629 META_BINDING_CLEAR( &candidates[ i ] );
1632 if ( candidates[ i ].sr_matched ) {
1633 free( (char *)candidates[ i ].sr_matched );
1634 candidates[ i ].sr_matched = NULL;
1637 if ( candidates[ i ].sr_text ) {
1638 ldap_memfree( (char *)candidates[ i ].sr_text );
1639 candidates[ i ].sr_text = NULL;
1642 if ( candidates[ i ].sr_ref ) {
1643 ber_bvarray_free( candidates[ i ].sr_ref );
1644 candidates[ i ].sr_ref = NULL;
1647 if ( candidates[ i ].sr_ctrls ) {
1648 ldap_controls_free( candidates[ i ].sr_ctrls );
1649 candidates[ i ].sr_ctrls = NULL;
1652 if ( META_BACK_TGT_QUARANTINE( mi->mi_targets[ i ] ) ) {
1653 meta_back_quarantine( op, &candidates[ i ], i );
1656 /* only in case of timelimit exceeded, if the timelimit exceeded because
1657 * one contacted target never responded, invalidate the connection
1658 * NOTE: should we quarantine the target as well? right now, the connection
1659 * is invalidated; the next time it will be recreated and the target
1660 * will be quarantined if it cannot be contacted */
1661 if ( mi->mi_idle_timeout != 0
1662 && rs->sr_err == LDAP_TIMELIMIT_EXCEEDED
1663 && op->o_time > mc->mc_conns[ i ].msc_time )
1665 /* don't let anyone else use this expired connection */
1666 LDAP_BACK_CONN_TAINTED_SET( mc );
1671 meta_back_release_conn( mi, mc );
1685 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
1686 struct berval a, mapped;
1688 BerElement ber = *e->lm_ber;
1689 Attribute *attr, **attrp;
1696 if ( ber_scanf( &ber, "{m{", &bdn ) == LBER_ERROR ) {
1697 return LDAP_DECODING_ERROR;
1701 * Rewrite the dn of the result, if needed
1703 dc.target = mi->mi_targets[ target ];
1704 dc.conn = op->o_conn;
1706 dc.ctx = "searchResult";
1708 rs->sr_err = ldap_back_dn_massage( &dc, &bdn, &dn );
1709 if ( rs->sr_err != LDAP_SUCCESS) {
1714 * Note: this may fail if the target host(s) schema differs
1715 * from the one known to the meta, and a DN with unknown
1716 * attributes is returned.
1718 * FIXME: should we log anything, or delegate to dnNormalize?
1720 rc = dnPrettyNormal( NULL, &dn, &ent.e_name, &ent.e_nname,
1722 if ( dn.bv_val != bdn.bv_val ) {
1727 if ( rc != LDAP_SUCCESS ) {
1728 return LDAP_INVALID_DN_SYNTAX;
1734 if ( mi->mi_cache.ttl != META_DNCACHE_DISABLED ) {
1735 ( void )meta_dncache_update_entry( &mi->mi_cache,
1736 &ent.e_nname, target );
1739 attrp = &ent.e_attrs;
1741 dc.ctx = "searchAttrDN";
1742 while ( ber_scanf( &ber, "{m", &a ) != LBER_ERROR ) {
1744 slap_syntax_validate_func *validate;
1745 slap_syntax_transform_func *pretty;
1747 ldap_back_map( &mi->mi_targets[ target ]->mt_rwmap.rwm_at,
1748 &a, &mapped, BACKLDAP_REMAP );
1749 if ( BER_BVISNULL( &mapped ) || mapped.bv_val[0] == '\0' ) {
1750 ( void )ber_scanf( &ber, "x" /* [W] */ );
1753 attr = attr_alloc( NULL );
1754 if ( attr == NULL ) {
1757 if ( slap_bv2ad( &mapped, &attr->a_desc, &text )
1759 if ( slap_bv2undef_ad( &mapped, &attr->a_desc, &text,
1760 SLAP_AD_PROXIED ) != LDAP_SUCCESS )
1762 char buf[ SLAP_TEXT_BUFLEN ];
1764 snprintf( buf, sizeof( buf ),
1765 "%s meta_send_entry(\"%s\"): "
1766 "slap_bv2undef_ad(%s): %s\n",
1767 op->o_log_prefix, ent.e_name.bv_val,
1768 mapped.bv_val, text );
1770 Debug( LDAP_DEBUG_ANY, "%s", buf, 0, 0 );
1776 /* no subschemaSubentry */
1777 if ( attr->a_desc == slap_schema.si_ad_subschemaSubentry
1778 || attr->a_desc == slap_schema.si_ad_entryDN )
1782 * We eat target's subschemaSubentry because
1783 * a search for this value is likely not
1784 * to resolve to the appropriate backend;
1785 * later, the local subschemaSubentry is
1788 * We also eat entryDN because the frontend
1789 * will reattach it without checking if already
1792 ( void )ber_scanf( &ber, "x" /* [W] */ );
1798 if ( ber_scanf( &ber, "[W]", &attr->a_vals ) == LBER_ERROR
1799 || attr->a_vals == NULL )
1801 attr->a_vals = (struct berval *)&slap_dummy_bv;
1804 for ( last = 0; !BER_BVISNULL( &attr->a_vals[ last ] ); ++last )
1808 validate = attr->a_desc->ad_type->sat_syntax->ssyn_validate;
1809 pretty = attr->a_desc->ad_type->sat_syntax->ssyn_pretty;
1811 if ( !validate && !pretty ) {
1816 if ( attr->a_desc == slap_schema.si_ad_objectClass
1817 || attr->a_desc == slap_schema.si_ad_structuralObjectClass )
1821 for ( bv = attr->a_vals; !BER_BVISNULL( bv ); bv++ ) {
1822 ldap_back_map( &mi->mi_targets[ target ]->mt_rwmap.rwm_oc,
1823 bv, &mapped, BACKLDAP_REMAP );
1824 if ( BER_BVISNULL( &mapped ) || mapped.bv_val[0] == '\0') {
1830 *bv = attr->a_vals[ last ];
1831 BER_BVZERO( &attr->a_vals[ last ] );
1834 } else if ( mapped.bv_val != bv->bv_val ) {
1836 ber_dupbv( bv, &mapped );
1840 * It is necessary to try to rewrite attributes with
1841 * dn syntax because they might be used in ACLs as
1842 * members of groups; since ACLs are applied to the
1843 * rewritten stuff, no dn-based subecj clause could
1844 * be used at the ldap backend side (see
1845 * http://www.OpenLDAP.org/faq/data/cache/452.html)
1846 * The problem can be overcome by moving the dn-based
1847 * ACLs to the target directory server, and letting
1848 * everything pass thru the ldap backend.
1853 if ( attr->a_desc->ad_type->sat_syntax ==
1854 slap_schema.si_syn_distinguishedName )
1856 ldap_dnattr_result_rewrite( &dc, attr->a_vals );
1858 } else if ( attr->a_desc == slap_schema.si_ad_ref ) {
1859 ldap_back_referral_result_rewrite( &dc, attr->a_vals );
1863 for ( i = 0; i < last; i++ ) {
1868 rc = pretty( attr->a_desc->ad_type->sat_syntax,
1869 &attr->a_vals[i], &pval, NULL );
1872 rc = validate( attr->a_desc->ad_type->sat_syntax,
1877 LBER_FREE( attr->a_vals[i].bv_val );
1878 if ( --last == i ) {
1879 BER_BVZERO( &attr->a_vals[ i ] );
1882 attr->a_vals[i] = attr->a_vals[last];
1883 BER_BVZERO( &attr->a_vals[last] );
1889 LBER_FREE( attr->a_vals[i].bv_val );
1890 attr->a_vals[i] = pval;
1894 if ( last == 0 && attr->a_vals != &slap_dummy_bv ) {
1900 if ( last && attr->a_desc->ad_type->sat_equality &&
1901 attr->a_desc->ad_type->sat_equality->smr_normalize )
1905 attr->a_nvals = ch_malloc( ( last + 1 ) * sizeof( struct berval ) );
1906 for ( i = 0; i<last; i++ ) {
1907 attr->a_desc->ad_type->sat_equality->smr_normalize(
1908 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
1909 attr->a_desc->ad_type->sat_syntax,
1910 attr->a_desc->ad_type->sat_equality,
1911 &attr->a_vals[i], &attr->a_nvals[i],
1914 BER_BVZERO( &attr->a_nvals[i] );
1917 attr->a_nvals = attr->a_vals;
1921 attrp = &attr->a_next;
1924 rs->sr_entry = &ent;
1925 rs->sr_attrs = op->ors_attrs;
1927 rs->sr_err = LDAP_SUCCESS;
1928 rc = send_search_entry( op, rs );
1930 case LDAP_UNAVAILABLE:
1934 rs->sr_entry = NULL;
1935 rs->sr_attrs = NULL;
1937 if ( !BER_BVISNULL( &ent.e_name ) ) {
1938 free( ent.e_name.bv_val );
1939 BER_BVZERO( &ent.e_name );
1941 if ( !BER_BVISNULL( &ent.e_nname ) ) {
1942 free( ent.e_nname.bv_val );
1943 BER_BVZERO( &ent.e_nname );
1945 entry_clean( &ent );