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)
45 #define META_MSGID_CONNECTING (-3)
55 typedef enum meta_search_candidate_t {
56 META_SEARCH_UNDEFINED = -2,
58 META_SEARCH_NOT_CANDIDATE,
59 META_SEARCH_CANDIDATE,
61 META_SEARCH_NEED_BIND,
62 META_SEARCH_CONNECTING
63 } meta_search_candidate_t;
66 * meta_search_dobind_init()
68 * initiates bind for a candidate target of a search.
70 static meta_search_candidate_t
71 meta_search_dobind_init(
76 SlapReply *candidates )
78 metaconn_t *mc = *mcp;
79 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
80 metatarget_t *mt = mi->mi_targets[ candidate ];
81 metasingleconn_t *msc = &mc->mc_conns[ candidate ];
83 struct berval binddn = msc->msc_bound_ndn,
89 meta_search_candidate_t retcode;
91 Debug( LDAP_DEBUG_TRACE, "%s >>> meta_search_dobind_init[%d]\n",
92 op->o_log_prefix, candidate, 0 );
95 * all the targets are already bound as pseudoroot
97 if ( mc->mc_authz_target == META_BOUND_ALL ) {
98 return META_SEARCH_CANDIDATE;
101 retcode = META_SEARCH_BINDING;
102 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
103 if ( LDAP_BACK_CONN_ISBOUND( msc ) || LDAP_BACK_CONN_ISANON( msc ) ) {
104 /* already bound (or anonymous) */
107 char buf[ SLAP_TEXT_BUFLEN ] = { '\0' };
110 if ( LDAP_BACK_CONN_ISBOUND( msc ) ) {
114 snprintf( buf, sizeof( buf ), " mc=%p ld=%p%s DN=\"%s\"",
115 (void *)mc, (void *)msc->msc_ld,
116 bound ? " bound" : " anonymous",
117 bound == 0 ? "" : msc->msc_bound_ndn.bv_val );
118 Debug( LDAP_DEBUG_ANY, "### %s meta_search_dobind_init[%d]%s\n",
119 op->o_log_prefix, candidate, buf );
120 #endif /* DEBUG_205 */
122 retcode = META_SEARCH_CANDIDATE;
124 } else if ( META_BACK_CONN_CREATING( msc ) || LDAP_BACK_CONN_BINDING( msc ) ) {
125 /* another thread is binding the target for this conn; wait */
128 char buf[ SLAP_TEXT_BUFLEN ] = { '\0' };
130 snprintf( buf, sizeof( buf ), " mc=%p ld=%p needbind",
131 (void *)mc, (void *)msc->msc_ld );
132 Debug( LDAP_DEBUG_ANY, "### %s meta_search_dobind_init[%d]%s\n",
133 op->o_log_prefix, candidate, buf );
134 #endif /* DEBUG_205 */
136 candidates[ candidate ].sr_msgid = META_MSGID_NEED_BIND;
137 retcode = META_SEARCH_NEED_BIND;
140 /* we'll need to bind the target for this conn */
143 char buf[ SLAP_TEXT_BUFLEN ];
145 snprintf( buf, sizeof( buf ), " mc=%p ld=%p binding",
146 (void *)mc, (void *)msc->msc_ld );
147 Debug( LDAP_DEBUG_ANY, "### %s meta_search_dobind_init[%d]%s\n",
148 op->o_log_prefix, candidate, buf );
149 #endif /* DEBUG_205 */
151 if ( msc->msc_ld == NULL ) {
152 /* for some reason (e.g. because formerly in "binding"
153 * state, with eventual connection expiration or invalidation)
154 * it was not initialized as expected */
156 Debug( LDAP_DEBUG_ANY, "%s meta_search_dobind_init[%d] mc=%p ld=NULL\n",
157 op->o_log_prefix, candidate, (void *)mc );
159 rc = meta_back_init_one_conn( op, rs, *mcp, candidate,
160 LDAP_BACK_CONN_ISPRIV( *mcp ), LDAP_BACK_DONTSEND, 0 );
163 assert( msc->msc_ld != NULL );
166 case LDAP_SERVER_DOWN:
167 case LDAP_UNAVAILABLE:
168 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
172 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
177 LDAP_BACK_CONN_BINDING_SET( msc );
180 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
182 if ( retcode != META_SEARCH_BINDING ) {
186 /* NOTE: this obsoletes pseudorootdn */
187 if ( op->o_conn != NULL &&
188 !op->o_do_not_cache &&
189 ( BER_BVISNULL( &msc->msc_bound_ndn ) ||
190 BER_BVISEMPTY( &msc->msc_bound_ndn ) ||
191 ( mt->mt_idassert_flags & LDAP_BACK_AUTH_OVERRIDE ) ) )
193 rc = meta_back_proxy_authz_cred( mc, candidate, op, rs, LDAP_BACK_DONTSEND, &binddn, &cred, &method );
194 if ( rc != LDAP_SUCCESS ) {
198 /* NOTE: we copy things here, even if bind didn't succeed yet,
199 * because the connection is not shared until bind is over */
200 if ( !BER_BVISNULL( &binddn ) ) {
201 ber_bvreplace( &msc->msc_bound_ndn, &binddn );
202 if ( LDAP_BACK_SAVECRED( mi ) && !BER_BVISNULL( &cred ) ) {
203 if ( !BER_BVISNULL( &msc->msc_cred ) ) {
204 memset( msc->msc_cred.bv_val, 0,
205 msc->msc_cred.bv_len );
207 ber_bvreplace( &msc->msc_cred, &cred );
211 if ( LDAP_BACK_CONN_ISBOUND( msc ) ) {
212 /* apparently, idassert was configured with SASL bind,
213 * so bind occurred inside meta_back_proxy_authz_cred() */
214 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
215 LDAP_BACK_CONN_BINDING_CLEAR( msc );
216 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
217 return META_SEARCH_CANDIDATE;
223 case LDAP_AUTH_SIMPLE:
224 /* do a simple bind with binddn, cred */
233 assert( msc->msc_ld != NULL );
235 /* connect must be async */
237 ldap_set_option( msc->msc_ld, LDAP_OPT_CONNECT_ASYNC, LDAP_OPT_ON );
239 rc = ldap_sasl_bind( msc->msc_ld, binddn.bv_val, LDAP_SASL_SIMPLE, &cred,
240 NULL, NULL, &candidates[ candidate ].sr_msgid );
244 char buf[ SLAP_TEXT_BUFLEN ];
246 snprintf( buf, sizeof( buf ), "meta_search_dobind_init[%d] mc=%p ld=%p rc=%d",
247 candidate, (void *)mc, (void *)mc->mc_conns[ candidate ].msc_ld, rc );
248 Debug( LDAP_DEBUG_ANY, "### %s %s\n",
249 op->o_log_prefix, buf, 0 );
251 #endif /* DEBUG_205 */
255 assert( candidates[ candidate ].sr_msgid >= 0 );
256 META_BINDING_SET( &candidates[ candidate ] );
257 return META_SEARCH_BINDING;
259 case LDAP_X_CONNECTING:
260 /* must retry, same conn */
261 candidates[ candidate ].sr_msgid = META_MSGID_CONNECTING;
262 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
263 LDAP_BACK_CONN_BINDING_CLEAR( msc );
264 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
265 return META_SEARCH_CONNECTING;
267 case LDAP_SERVER_DOWN:
269 /* This is the worst thing that could happen:
270 * the search will wait until the retry is over. */
271 if ( !META_IS_RETRYING( &candidates[ candidate ] ) ) {
272 META_RETRYING_SET( &candidates[ candidate ] );
274 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
276 assert( mc->mc_refcnt > 0 );
277 if ( LogTest( LDAP_DEBUG_ANY ) ) {
278 char buf[ SLAP_TEXT_BUFLEN ];
280 /* this lock is required; however,
281 * it's invoked only when logging is on */
282 ldap_pvt_thread_mutex_lock( &mt->mt_uri_mutex );
283 snprintf( buf, sizeof( buf ),
284 "retrying URI=\"%s\" DN=\"%s\"",
286 BER_BVISNULL( &msc->msc_bound_ndn ) ?
287 "" : msc->msc_bound_ndn.bv_val );
288 ldap_pvt_thread_mutex_unlock( &mt->mt_uri_mutex );
290 Debug( LDAP_DEBUG_ANY,
291 "%s meta_search_dobind_init[%d]: %s.\n",
292 op->o_log_prefix, candidate, buf );
295 meta_clear_one_candidate( op, mc, candidate );
296 LDAP_BACK_CONN_ISBOUND_CLEAR( msc );
298 ( void )rewrite_session_delete( mt->mt_rwmap.rwm_rw, op->o_conn );
300 /* mc here must be the regular mc, reset and ready for init */
301 rc = meta_back_init_one_conn( op, rs, mc, candidate,
302 LDAP_BACK_CONN_ISPRIV( mc ), LDAP_BACK_DONTSEND, 0 );
304 if ( rc == LDAP_SUCCESS ) {
305 LDAP_BACK_CONN_BINDING_SET( msc );
308 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
310 if ( rc == LDAP_SUCCESS ) {
311 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
316 if ( *mcp == NULL ) {
317 retcode = META_SEARCH_ERR;
318 rs->sr_err = LDAP_UNAVAILABLE;
326 rc = slap_map_api2result( rs );
328 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
329 meta_clear_one_candidate( op, mc, candidate );
330 candidates[ candidate ].sr_err = rc;
331 if ( META_BACK_ONERR_STOP( mi ) ) {
332 LDAP_BACK_CONN_TAINTED_SET( mc );
333 meta_back_release_conn_lock( mi, mc, 0 );
337 retcode = META_SEARCH_ERR;
340 retcode = META_SEARCH_NOT_CANDIDATE;
342 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
343 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
350 static meta_search_candidate_t
351 meta_search_dobind_result(
356 SlapReply *candidates,
359 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
360 metaconn_t *mc = *mcp;
361 metasingleconn_t *msc = &mc->mc_conns[ candidate ];
363 meta_search_candidate_t retcode = META_SEARCH_NOT_CANDIDATE;
366 assert( msc->msc_ld != NULL );
368 /* FIXME: matched? referrals? response controls? */
369 rc = ldap_parse_result( msc->msc_ld, res,
370 &candidates[ candidate ].sr_err,
371 NULL, NULL, NULL, NULL, 0 );
372 if ( rc != LDAP_SUCCESS ) {
373 candidates[ candidate ].sr_err = rc;
376 rc = slap_map_api2result( &candidates[ candidate ] );
379 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
380 LDAP_BACK_CONN_BINDING_CLEAR( msc );
381 if ( rc != LDAP_SUCCESS ) {
382 meta_clear_one_candidate( op, mc, candidate );
383 candidates[ candidate ].sr_err = rc;
384 if ( META_BACK_ONERR_STOP( mi ) ) {
385 LDAP_BACK_CONN_TAINTED_SET( mc );
386 meta_back_release_conn_lock( mi, mc, 0 );
388 retcode = META_SEARCH_ERR;
393 /* FIXME: check if bound as idassert authcDN! */
394 if ( BER_BVISNULL( &msc->msc_bound_ndn )
395 || BER_BVISEMPTY( &msc->msc_bound_ndn ) )
397 LDAP_BACK_CONN_ISANON_SET( msc );
400 LDAP_BACK_CONN_ISBOUND_SET( msc );
402 retcode = META_SEARCH_CANDIDATE;
404 /* connect must be async */
405 ldap_set_option( msc->msc_ld, LDAP_OPT_CONNECT_ASYNC, LDAP_OPT_OFF );
408 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
409 META_BINDING_CLEAR( &candidates[ candidate ] );
411 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
416 static meta_search_candidate_t
417 meta_back_search_start(
423 SlapReply *candidates )
425 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
426 metatarget_t *mt = mi->mi_targets[ candidate ];
427 metasingleconn_t *msc = &(*mcp)->mc_conns[ candidate ];
428 struct berval realbase = op->o_req_dn;
429 int realscope = op->ors_scope;
430 struct berval mbase = BER_BVNULL;
431 struct berval mfilter = BER_BVNULL;
432 char **mapped_attrs = NULL;
434 meta_search_candidate_t retcode;
435 struct timeval tv, *tvp = NULL;
437 LDAPControl **ctrls = NULL;
439 /* this should not happen; just in case... */
440 if ( msc->msc_ld == NULL ) {
441 Debug( LDAP_DEBUG_ANY,
442 "%s: meta_back_search_start candidate=%d ld=NULL%s.\n",
443 op->o_log_prefix, candidate,
444 META_BACK_ONERR_STOP( mi ) ? "" : " (ignored)" );
445 candidates[ candidate ].sr_err = LDAP_OTHER;
446 if ( META_BACK_ONERR_STOP( mi ) ) {
447 return META_SEARCH_ERR;
449 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
450 return META_SEARCH_NOT_CANDIDATE;
453 Debug( LDAP_DEBUG_TRACE, "%s >>> meta_back_search_start[%d]\n", op->o_log_prefix, candidate, 0 );
456 * modifies the base according to the scope, if required
458 if ( mt->mt_nsuffix.bv_len > op->o_req_ndn.bv_len ) {
459 switch ( op->ors_scope ) {
460 case LDAP_SCOPE_SUBTREE:
462 * make the target suffix the new base
463 * FIXME: this is very forgiving, because
464 * "illegal" searchBases may be turned
465 * into the suffix of the target; however,
466 * the requested searchBase already passed
467 * thru the candidate analyzer...
469 if ( dnIsSuffix( &mt->mt_nsuffix, &op->o_req_ndn ) ) {
470 realbase = mt->mt_nsuffix;
471 if ( mt->mt_scope == LDAP_SCOPE_SUBORDINATE ) {
472 realscope = LDAP_SCOPE_SUBORDINATE;
477 * this target is no longer candidate
479 retcode = META_SEARCH_NOT_CANDIDATE;
484 case LDAP_SCOPE_SUBORDINATE:
485 case LDAP_SCOPE_ONELEVEL:
487 struct berval rdn = mt->mt_nsuffix;
488 rdn.bv_len -= op->o_req_ndn.bv_len + STRLENOF( "," );
489 if ( dnIsOneLevelRDN( &rdn )
490 && dnIsSuffix( &mt->mt_nsuffix, &op->o_req_ndn ) )
493 * if there is exactly one level,
494 * make the target suffix the new
495 * base, and make scope "base"
497 realbase = mt->mt_nsuffix;
498 if ( op->ors_scope == LDAP_SCOPE_SUBORDINATE ) {
499 if ( mt->mt_scope == LDAP_SCOPE_SUBORDINATE ) {
500 realscope = LDAP_SCOPE_SUBORDINATE;
502 realscope = LDAP_SCOPE_SUBTREE;
505 realscope = LDAP_SCOPE_BASE;
508 } /* else continue with the next case */
511 case LDAP_SCOPE_BASE:
513 * this target is no longer candidate
515 retcode = META_SEARCH_NOT_CANDIDATE;
520 /* initiate dobind */
521 retcode = meta_search_dobind_init( op, rs, mcp, candidate, candidates );
523 Debug( LDAP_DEBUG_TRACE, "%s <<< meta_search_dobind_init[%d]=%d\n", op->o_log_prefix, candidate, retcode );
525 if ( retcode != META_SEARCH_CANDIDATE ) {
530 * Rewrite the search base, if required
533 dc->ctx = "searchBase";
534 switch ( ldap_back_dn_massage( dc, &realbase, &mbase ) ) {
538 case LDAP_UNWILLING_TO_PERFORM:
539 rs->sr_err = LDAP_UNWILLING_TO_PERFORM;
540 rs->sr_text = "Operation not allowed";
541 send_ldap_result( op, rs );
542 retcode = META_SEARCH_ERR;
548 * this target is no longer candidate
550 retcode = META_SEARCH_NOT_CANDIDATE;
557 rc = ldap_back_filter_map_rewrite( dc, op->ors_filter,
558 &mfilter, BACKLDAP_MAP );
563 case LDAP_COMPARE_FALSE:
566 * this target is no longer candidate
568 retcode = META_SEARCH_NOT_CANDIDATE;
573 * Maps required attributes
575 rc = ldap_back_map_attrs( &mt->mt_rwmap.rwm_at,
576 op->ors_attrs, BACKLDAP_MAP, &mapped_attrs );
577 if ( rc != LDAP_SUCCESS ) {
579 * this target is no longer candidate
581 retcode = META_SEARCH_NOT_CANDIDATE;
585 /* should we check return values? */
586 if ( op->ors_deref != -1 ) {
587 assert( msc->msc_ld != NULL );
588 (void)ldap_set_option( msc->msc_ld, LDAP_OPT_DEREF,
589 ( void * )&op->ors_deref );
592 if ( op->ors_tlimit != SLAP_NO_LIMIT ) {
593 tv.tv_sec = op->ors_tlimit > 0 ? op->ors_tlimit : 1;
600 if ( ldap_back_proxy_authz_ctrl( &msc->msc_bound_ndn,
601 mt->mt_version, &mt->mt_idassert, op, rs, &ctrls )
604 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
605 retcode = META_SEARCH_NOT_CANDIDATE;
612 assert( msc->msc_ld != NULL );
613 rc = ldap_search_ext( msc->msc_ld,
614 mbase.bv_val, realscope, mfilter.bv_val,
615 mapped_attrs, op->ors_attrsonly,
616 ctrls, NULL, tvp, op->ors_slimit,
617 &candidates[ candidate ].sr_msgid );
620 retcode = META_SEARCH_CANDIDATE;
623 case LDAP_SERVER_DOWN:
624 if ( nretries && meta_back_retry( op, rs, mcp, candidate, LDAP_BACK_DONTSEND ) ) {
626 /* if the identity changed, there might be need to re-authz */
627 (void)ldap_back_proxy_authz_ctrl_free( op, &ctrls );
631 if ( *mcp == NULL ) {
632 retcode = META_SEARCH_ERR;
638 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
639 retcode = META_SEARCH_NOT_CANDIDATE;
643 (void)ldap_back_proxy_authz_ctrl_free( op, &ctrls );
645 if ( mapped_attrs ) {
646 free( mapped_attrs );
648 if ( mfilter.bv_val != op->ors_filterstr.bv_val ) {
649 free( mfilter.bv_val );
651 if ( mbase.bv_val != realbase.bv_val ) {
652 free( mbase.bv_val );
656 Debug( LDAP_DEBUG_TRACE, "%s <<< meta_back_search_start[%d]=%d\n", op->o_log_prefix, candidate, retcode );
662 meta_back_search( Operation *op, SlapReply *rs )
664 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
666 struct timeval save_tv = { 0, 0 },
668 time_t stoptime = (time_t)(-1),
669 lastres_time = slap_get_time();
670 int rc = 0, sres = LDAP_SUCCESS;
671 char *matched = NULL;
672 int last = 0, ncandidates = 0,
673 initial_candidates = 0, candidate_match = 0,
675 ldap_back_send_t sendok = LDAP_BACK_SENDERR;
680 SlapReply *candidates = meta_back_candidates_get( op );
683 * controls are set in ldap_back_dobind()
685 * FIXME: in case of values return filter, we might want
686 * to map attrs and maybe rewrite value
689 mc = meta_back_getconn( op, rs, NULL, sendok );
694 dc.conn = op->o_conn;
700 for ( i = 0; i < mi->mi_ntargets; i++ ) {
701 /* reset sr_msgid; it is used in most loops
702 * to check if that target is still to be considered */
703 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
705 /* a target is marked as candidate by meta_back_getconn();
706 * if for any reason (an error, it's over or so) it is
707 * no longer active, sr_msgid is set to META_MSGID_IGNORE
708 * but it remains candidate, which means it has been active
709 * at some point during the operation. This allows to
710 * use its response code and more to compute the final
712 if ( !META_IS_CANDIDATE( &candidates[ i ] ) ) {
716 candidates[ i ].sr_matched = NULL;
717 candidates[ i ].sr_text = NULL;
718 candidates[ i ].sr_ref = NULL;
719 candidates[ i ].sr_ctrls = NULL;
722 for ( i = 0; i < mi->mi_ntargets; i++ ) {
723 if ( !META_IS_CANDIDATE( &candidates[ i ] )
724 || candidates[ i ].sr_err != LDAP_SUCCESS )
729 switch ( meta_back_search_start( op, rs, &dc, &mc, i, candidates ) )
731 case META_SEARCH_NOT_CANDIDATE:
732 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
735 case META_SEARCH_NEED_BIND:
739 case META_SEARCH_CONNECTING:
740 case META_SEARCH_CANDIDATE:
741 case META_SEARCH_BINDING:
742 candidates[ i ].sr_type = REP_INTERMEDIATE;
746 case META_SEARCH_ERR:
747 savepriv = op->o_private;
748 op->o_private = (void *)i;
749 send_ldap_result( op, rs );
750 op->o_private = savepriv;
760 if ( ncandidates > 0 && needbind == ncandidates ) {
762 * give up the second time...
764 * NOTE: this should not occur the second time, since a fresh
765 * connection has ben created; however, targets may also
766 * need bind because the bind timed out or so.
768 if ( sendok & LDAP_BACK_BINDING ) {
769 Debug( LDAP_DEBUG_ANY,
770 "%s meta_back_search: unable to initialize conn\n",
771 op->o_log_prefix, 0, 0 );
772 rs->sr_err = LDAP_UNAVAILABLE;
773 rs->sr_text = "unable to initialize connection to remote targets";
774 send_ldap_result( op, rs );
779 /* FIXME: better create a separate connection? */
780 sendok |= LDAP_BACK_BINDING;
783 Debug( LDAP_DEBUG_ANY, "*** %s drop mc=%p create new connection\n",
784 op->o_log_prefix, (void *)mc, 0 );
785 #endif /* DEBUG_205 */
787 meta_back_release_conn( mi, mc );
796 initial_candidates = ncandidates;
798 if ( LogTest( LDAP_DEBUG_TRACE ) ) {
799 char cnd[ SLAP_TEXT_BUFLEN ];
802 for ( c = 0; c < mi->mi_ntargets; c++ ) {
803 if ( META_IS_CANDIDATE( &candidates[ c ] ) ) {
811 Debug( LDAP_DEBUG_TRACE, "%s meta_back_search: ncandidates=%d "
812 "cnd=\"%s\"\n", op->o_log_prefix, ncandidates, cnd );
815 if ( initial_candidates == 0 ) {
816 /* NOTE: here we are not sending any matchedDN;
817 * this is intended, because if the back-meta
818 * is serving this search request, but no valid
819 * candidate could be looked up, it means that
820 * there is a hole in the mapping of the targets
821 * and thus no knowledge of any remote superior
823 Debug( LDAP_DEBUG_ANY, "%s meta_back_search: "
824 "base=\"%s\" scope=%d: "
825 "no candidate could be selected\n",
826 op->o_log_prefix, op->o_req_dn.bv_val,
829 /* FIXME: we're sending the first error we encounter;
830 * maybe we should pick the worst... */
831 rc = LDAP_NO_SUCH_OBJECT;
832 for ( i = 0; i < mi->mi_ntargets; i++ ) {
833 if ( META_IS_CANDIDATE( &candidates[ i ] )
834 && candidates[ i ].sr_err != LDAP_SUCCESS )
836 rc = candidates[ i ].sr_err;
841 send_ldap_error( op, rs, rc, NULL );
846 /* We pull apart the ber result, stuff it into a slapd entry, and
847 * let send_search_entry stuff it back into ber format. Slow & ugly,
848 * but this is necessary for version matching, and for ACL processing.
851 if ( op->ors_tlimit != SLAP_NO_LIMIT ) {
852 stoptime = op->o_time + op->ors_tlimit;
856 * In case there are no candidates, no cycle takes place...
858 * FIXME: we might use a queue, to better balance the load
859 * among the candidates
861 for ( rc = 0; ncandidates > 0; ) {
864 alreadybound = ncandidates;
865 time_t curr_time = 0;
868 if ( mi->mi_timeout[ SLAP_OP_SEARCH ]
870 && ( slap_get_time() - lastres_time ) > mi->mi_timeout[ SLAP_OP_SEARCH ] )
873 rs->sr_text = "Operation timed out";
874 rc = rs->sr_err = LDAP_ADMINLIMIT_EXCEEDED;
875 savepriv = op->o_private;
876 op->o_private = (void *)i;
877 send_ldap_result( op, rs );
878 op->o_private = savepriv;
882 /* check time limit */
883 if ( op->ors_tlimit != SLAP_NO_LIMIT
884 && slap_get_time() > stoptime )
887 rc = rs->sr_err = LDAP_TIMELIMIT_EXCEEDED;
888 savepriv = op->o_private;
889 op->o_private = (void *)i;
890 send_ldap_result( op, rs );
891 op->o_private = savepriv;
895 for ( i = 0; i < mi->mi_ntargets; i++ ) {
896 meta_search_candidate_t retcode = META_SEARCH_UNDEFINED;
897 metasingleconn_t *msc = &mc->mc_conns[ i ];
898 LDAPMessage *res = NULL, *msg;
900 /* if msgid is invalid, don't ldap_result() */
901 if ( candidates[ i ].sr_msgid == META_MSGID_IGNORE ) {
905 /* if target still needs bind, retry */
906 if ( candidates[ i ].sr_msgid == META_MSGID_NEED_BIND
907 || candidates[ i ].sr_msgid == META_MSGID_CONNECTING )
909 /* initiate dobind */
910 retcode = meta_search_dobind_init( op, rs, &mc, i, candidates );
912 Debug( LDAP_DEBUG_TRACE, "%s <<< meta_search_dobind_init[%ld]=%d\n",
913 op->o_log_prefix, i, retcode );
916 case META_SEARCH_NEED_BIND:
920 case META_SEARCH_CONNECTING:
921 case META_SEARCH_BINDING:
924 case META_SEARCH_ERR:
925 candidates[ i ].sr_err = rs->sr_err;
926 if ( META_BACK_ONERR_STOP( mi ) ) {
927 savepriv = op->o_private;
928 op->o_private = (void *)i;
929 send_ldap_result( op, rs );
930 op->o_private = savepriv;
935 case META_SEARCH_NOT_CANDIDATE:
937 * When no candidates are left,
938 * the outer cycle finishes
940 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
941 assert( ncandidates > 0 );
945 case META_SEARCH_CANDIDATE:
946 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
947 switch ( meta_back_search_start( op, rs, &dc, &mc, i, candidates ) )
949 case META_SEARCH_CANDIDATE:
950 assert( candidates[ i ].sr_msgid >= 0 );
953 case META_SEARCH_ERR:
954 candidates[ i ].sr_err = rs->sr_err;
955 if ( META_BACK_ONERR_STOP( mi ) ) {
956 savepriv = op->o_private;
957 op->o_private = (void *)i;
958 send_ldap_result( op, rs );
959 op->o_private = savepriv;
964 case META_SEARCH_NOT_CANDIDATE:
965 /* means that meta_back_search_start()
966 * failed but onerr == continue */
967 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
968 assert( ncandidates > 0 );
987 /* check for abandon */
988 if ( op->o_abandon || LDAP_BACK_CONN_ABANDON( mc ) ) {
993 if ( msc->msc_ld == NULL ) {
994 char buf[ SLAP_TEXT_BUFLEN ];
996 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
997 snprintf( buf, sizeof( buf ),
998 "%s meta_back_search[%ld] mc=%p msgid=%d%s%s%s\n",
999 op->o_log_prefix, (long)i, (void *)mc,
1000 candidates[ i ].sr_msgid,
1001 META_IS_BINDING( &candidates[ i ] ) ? " binding" : "",
1002 LDAP_BACK_CONN_BINDING( &mc->mc_conns[ i ] ) ? " connbinding" : "",
1003 META_BACK_CONN_CREATING( &mc->mc_conns[ i ] ) ? " conncreating" : "" );
1004 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
1006 Debug( LDAP_DEBUG_ANY, "!!! %s\n", buf, 0, 0 );
1008 #endif /* DEBUG_205 */
1011 * FIXME: handle time limit as well?
1012 * Note that target servers are likely
1013 * to handle it, so at some time we'll
1014 * get a LDAP_TIMELIMIT_EXCEEDED from
1018 rc = ldap_result( msc->msc_ld, candidates[ i ].sr_msgid,
1019 LDAP_MSG_RECEIVED, &tv, &res );
1022 /* FIXME: res should not need to be freed */
1023 assert( res == NULL );
1028 /* something REALLY bad happened! */
1029 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
1030 candidates[ i ].sr_type = REP_RESULT;
1032 if ( meta_back_retry( op, rs, &mc, i, LDAP_BACK_DONTSEND ) ) {
1033 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1034 switch ( meta_back_search_start( op, rs, &dc, &mc, i, candidates ) )
1036 /* means that failed but onerr == continue */
1037 case META_SEARCH_NOT_CANDIDATE:
1038 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1040 assert( ncandidates > 0 );
1043 candidates[ i ].sr_err = rs->sr_err;
1044 if ( META_BACK_ONERR_STOP( mi ) ) {
1045 savepriv = op->o_private;
1046 op->o_private = (void *)i;
1047 send_ldap_result( op, rs );
1048 op->o_private = savepriv;
1053 case META_SEARCH_CANDIDATE:
1054 /* get back into business... */
1057 case META_SEARCH_BINDING:
1058 case META_SEARCH_CONNECTING:
1059 case META_SEARCH_NEED_BIND:
1060 case META_SEARCH_UNDEFINED:
1064 /* unrecoverable error */
1065 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1066 rc = rs->sr_err = LDAP_OTHER;
1071 candidates[ i ].sr_err = rs->sr_err;
1072 if ( META_BACK_ONERR_STOP( mi ) ) {
1073 savepriv = op->o_private;
1074 op->o_private = (void *)i;
1075 send_ldap_result( op, rs );
1076 op->o_private = savepriv;
1082 * When no candidates are left,
1083 * the outer cycle finishes
1085 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1086 assert( ncandidates > 0 );
1088 rs->sr_err = candidates[ i ].sr_err;
1092 lastres_time = slap_get_time();
1094 /* only touch when activity actually took place... */
1095 if ( mi->mi_idle_timeout != 0 && msc->msc_time < lastres_time ) {
1096 msc->msc_time = lastres_time;
1101 for ( msg = ldap_first_message( msc->msc_ld, res );
1103 msg = ldap_next_message( msc->msc_ld, msg ) )
1105 rc = ldap_msgtype( msg );
1106 if ( rc == LDAP_RES_SEARCH_ENTRY ) {
1109 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
1110 /* don't retry any more... */
1111 candidates[ i ].sr_type = REP_RESULT;
1116 e = ldap_first_entry( msc->msc_ld, msg );
1117 savepriv = op->o_private;
1118 op->o_private = (void *)i;
1119 rs->sr_err = meta_send_entry( op, rs, mc, i, e );
1121 switch ( rs->sr_err ) {
1122 case LDAP_SIZELIMIT_EXCEEDED:
1123 savepriv = op->o_private;
1124 op->o_private = (void *)i;
1125 send_ldap_result( op, rs );
1126 op->o_private = savepriv;
1127 rs->sr_err = LDAP_SUCCESS;
1128 ldap_msgfree( res );
1132 case LDAP_UNAVAILABLE:
1133 rs->sr_err = LDAP_OTHER;
1134 ldap_msgfree( res );
1138 op->o_private = savepriv;
1140 /* don't wait any longer... */
1143 save_tv.tv_usec = 0;
1145 } else if ( rc == LDAP_RES_SEARCH_REFERENCE ) {
1146 char **references = NULL;
1149 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
1150 /* don't retry any more... */
1151 candidates[ i ].sr_type = REP_RESULT;
1156 rc = ldap_parse_reference( msc->msc_ld, msg,
1157 &references, &rs->sr_ctrls, 0 );
1159 if ( rc != LDAP_SUCCESS ) {
1163 if ( references == NULL ) {
1167 #ifdef ENABLE_REWRITE
1168 dc.ctx = "referralDN";
1169 #else /* ! ENABLE_REWRITE */
1172 #endif /* ! ENABLE_REWRITE */
1174 /* FIXME: merge all and return at the end */
1176 for ( cnt = 0; references[ cnt ]; cnt++ )
1179 rs->sr_ref = ch_calloc( sizeof( struct berval ), cnt + 1 );
1181 for ( cnt = 0; references[ cnt ]; cnt++ ) {
1182 ber_str2bv( references[ cnt ], 0, 1, &rs->sr_ref[ cnt ] );
1184 BER_BVZERO( &rs->sr_ref[ cnt ] );
1186 ( void )ldap_back_referral_result_rewrite( &dc, rs->sr_ref );
1188 if ( rs->sr_ref != NULL && !BER_BVISNULL( &rs->sr_ref[ 0 ] ) ) {
1189 /* ignore return value by now */
1190 savepriv = op->o_private;
1191 op->o_private = (void *)i;
1192 ( void )send_search_reference( op, rs );
1193 op->o_private = savepriv;
1195 ber_bvarray_free( rs->sr_ref );
1201 ber_memvfree( (void **)references );
1204 if ( rs->sr_ctrls ) {
1205 ldap_controls_free( rs->sr_ctrls );
1206 rs->sr_ctrls = NULL;
1209 } else if ( rc == LDAP_RES_SEARCH_RESULT ) {
1210 char buf[ SLAP_TEXT_BUFLEN ];
1211 char **references = NULL;
1213 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
1214 /* don't retry any more... */
1215 candidates[ i ].sr_type = REP_RESULT;
1218 /* NOTE: ignores response controls
1219 * (and intermediate response controls
1220 * as well, except for those with search
1221 * references); this may not be correct,
1222 * but if they're not ignored then
1223 * back-meta would need to merge them
1224 * consistently (think of pagedResults...)
1226 /* FIXME: response controls? */
1227 rs->sr_err = ldap_parse_result( msc->msc_ld,
1229 &candidates[ i ].sr_err,
1230 (char **)&candidates[ i ].sr_matched,
1231 NULL /* (char **)&candidates[ i ].sr_text */ ,
1233 NULL /* &candidates[ i ].sr_ctrls (unused) */ ,
1235 if ( rs->sr_err != LDAP_SUCCESS ) {
1236 ldap_get_option( msc->msc_ld,
1237 LDAP_OPT_ERROR_NUMBER,
1239 sres = slap_map_api2result( rs );
1240 candidates[ i ].sr_type = REP_RESULT;
1241 ldap_msgfree( res );
1246 /* massage matchedDN if need be */
1247 if ( candidates[ i ].sr_matched != NULL ) {
1248 struct berval match, mmatch;
1250 ber_str2bv( candidates[ i ].sr_matched,
1252 candidates[ i ].sr_matched = NULL;
1254 dc.ctx = "matchedDN";
1255 dc.target = mi->mi_targets[ i ];
1256 if ( !ldap_back_dn_massage( &dc, &match, &mmatch ) ) {
1257 if ( mmatch.bv_val == match.bv_val ) {
1258 candidates[ i ].sr_matched
1259 = ch_strdup( mmatch.bv_val );
1262 candidates[ i ].sr_matched = mmatch.bv_val;
1267 ldap_memfree( match.bv_val );
1270 /* add references to array */
1275 for ( cnt = 0; references[ cnt ]; cnt++ )
1278 sr_ref = ch_calloc( sizeof( struct berval ), cnt + 1 );
1280 for ( cnt = 0; references[ cnt ]; cnt++ ) {
1281 ber_str2bv( references[ cnt ], 0, 1, &sr_ref[ cnt ] );
1283 BER_BVZERO( &sr_ref[ cnt ] );
1285 ( void )ldap_back_referral_result_rewrite( &dc, sr_ref );
1288 ber_memvfree( (void **)references );
1290 if ( rs->sr_v2ref == NULL ) {
1291 rs->sr_v2ref = sr_ref;
1294 for ( cnt = 0; !BER_BVISNULL( &sr_ref[ cnt ] ); cnt++ ) {
1295 ber_bvarray_add( &rs->sr_v2ref, &sr_ref[ cnt ] );
1297 ber_memfree( sr_ref );
1301 rs->sr_err = candidates[ i ].sr_err;
1302 sres = slap_map_api2result( rs );
1304 if ( LogTest( LDAP_DEBUG_TRACE | LDAP_DEBUG_ANY ) ) {
1305 snprintf( buf, sizeof( buf ),
1306 "%s meta_back_search[%ld] "
1307 "match=\"%s\" err=%ld",
1308 op->o_log_prefix, i,
1309 candidates[ i ].sr_matched ? candidates[ i ].sr_matched : "",
1310 (long) candidates[ i ].sr_err );
1311 if ( candidates[ i ].sr_err == LDAP_SUCCESS ) {
1312 Debug( LDAP_DEBUG_TRACE, "%s.\n", buf, 0, 0 );
1315 Debug( LDAP_DEBUG_ANY, "%s (%s).\n",
1316 buf, ldap_err2string( candidates[ i ].sr_err ), 0 );
1321 case LDAP_NO_SUCH_OBJECT:
1322 /* is_ok is touched any time a valid
1323 * (even intermediate) result is
1324 * returned; as a consequence, if
1325 * a candidate returns noSuchObject
1326 * it is ignored and the candidate
1327 * is simply demoted. */
1329 sres = LDAP_SUCCESS;
1338 case LDAP_SIZELIMIT_EXCEEDED:
1339 /* if a target returned sizelimitExceeded
1340 * and the entry count is equal to the
1341 * proxy's limit, the target would have
1342 * returned more, and the error must be
1343 * propagated to the client; otherwise,
1344 * the target enforced a limit lower
1345 * than what requested by the proxy;
1347 candidates[ i ].sr_err = rs->sr_err;
1348 if ( rs->sr_nentries == op->ors_slimit
1349 || META_BACK_ONERR_STOP( mi ) )
1351 savepriv = op->o_private;
1352 op->o_private = (void *)i;
1353 send_ldap_result( op, rs );
1354 op->o_private = savepriv;
1355 ldap_msgfree( res );
1362 candidates[ i ].sr_err = rs->sr_err;
1363 if ( META_BACK_ONERR_STOP( mi ) ) {
1364 savepriv = op->o_private;
1365 op->o_private = (void *)i;
1366 send_ldap_result( op, rs );
1367 op->o_private = savepriv;
1368 ldap_msgfree( res );
1379 * When no candidates are left,
1380 * the outer cycle finishes
1382 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1383 assert( ncandidates > 0 );
1386 } else if ( rc == LDAP_RES_BIND ) {
1387 meta_search_candidate_t retcode;
1389 retcode = meta_search_dobind_result( op, rs, &mc, i, candidates, msg );
1390 if ( retcode == META_SEARCH_CANDIDATE ) {
1391 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1392 retcode = meta_back_search_start( op, rs, &dc, &mc, i, candidates );
1395 switch ( retcode ) {
1396 case META_SEARCH_CANDIDATE:
1399 /* means that failed but onerr == continue */
1400 case META_SEARCH_NOT_CANDIDATE:
1401 case META_SEARCH_ERR:
1402 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1403 assert( ncandidates > 0 );
1406 candidates[ i ].sr_err = rs->sr_err;
1407 if ( META_BACK_ONERR_STOP( mi ) ) {
1408 savepriv = op->o_private;
1409 op->o_private = (void *)i;
1410 send_ldap_result( op, rs );
1411 op->o_private = savepriv;
1412 ldap_msgfree( res );
1425 ldap_msgfree( res );
1432 ldap_msgfree( res );
1436 /* check for abandon */
1437 if ( op->o_abandon || LDAP_BACK_CONN_ABANDON( mc ) ) {
1438 for ( i = 0; i < mi->mi_ntargets; i++ ) {
1439 if ( candidates[ i ].sr_msgid >= 0 ) {
1440 if ( META_IS_BINDING( &candidates[ i ] ) ) {
1441 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
1442 if ( LDAP_BACK_CONN_BINDING( &mc->mc_conns[ i ] ) ) {
1443 /* if still binding, destroy */
1446 char buf[ SLAP_TEXT_BUFLEN ];
1448 snprintf( buf, sizeof( buf), "%s meta_back_search(abandon) "
1449 "ldap_unbind_ext[%ld] mc=%p ld=%p",
1450 op->o_log_prefix, i, (void *)mc,
1451 (void *)mc->mc_conns[i].msc_ld );
1453 Debug( LDAP_DEBUG_ANY, "### %s\n", buf, 0, 0 );
1454 #endif /* DEBUG_205 */
1456 meta_clear_one_candidate( op, mc, i );
1458 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
1459 META_BINDING_CLEAR( &candidates[ i ] );
1462 (void)meta_back_cancel( mc, op, rs,
1463 candidates[ i ].sr_msgid, i,
1464 LDAP_BACK_DONTSEND );
1467 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1468 assert( ncandidates > 0 );
1473 if ( op->o_abandon ) {
1477 /* let send_ldap_result play cleanup handlers (ITS#4645) */
1481 /* if no entry was found during this loop,
1482 * set a minimal timeout */
1483 if ( ncandidates > 0 && gotit == 0 ) {
1484 if ( save_tv.tv_sec == 0 && save_tv.tv_usec == 0 ) {
1485 save_tv.tv_usec = LDAP_BACK_RESULT_UTIMEOUT/initial_candidates;
1487 /* arbitrarily limit to something between 1 and 2 minutes */
1488 } else if ( ( stoptime == -1 && save_tv.tv_sec < 60 )
1489 || save_tv.tv_sec < ( stoptime - slap_get_time() ) / ( 2 * ncandidates ) )
1491 /* double the timeout */
1492 lutil_timermul( &save_tv, 2, &save_tv );
1495 if ( alreadybound == 0 ) {
1497 (void)select( 0, NULL, NULL, NULL, &tv );
1500 ldap_pvt_thread_yield();
1507 * FIXME: need a better strategy to handle errors
1510 rc = meta_back_op_result( mc, op, rs, META_TARGET_NONE,
1511 -1, stoptime != -1 ? (stoptime - slap_get_time()) : 0,
1512 LDAP_BACK_SENDERR );
1520 * Rewrite the matched portion of the search base, if required
1522 * FIXME: only the last one gets caught!
1524 savepriv = op->o_private;
1525 op->o_private = (void *)(long)mi->mi_ntargets;
1526 if ( candidate_match > 0 ) {
1527 struct berval pmatched = BER_BVNULL;
1529 /* we use the first one */
1530 for ( i = 0; i < mi->mi_ntargets; i++ ) {
1531 if ( META_IS_CANDIDATE( &candidates[ i ] )
1532 && candidates[ i ].sr_matched != NULL )
1534 struct berval bv, pbv;
1537 /* if we got success, and this target
1538 * returned noSuchObject, and its suffix
1539 * is a superior of the searchBase,
1540 * ignore the matchedDN */
1541 if ( sres == LDAP_SUCCESS
1542 && candidates[ i ].sr_err == LDAP_NO_SUCH_OBJECT
1543 && op->o_req_ndn.bv_len > mi->mi_targets[ i ]->mt_nsuffix.bv_len )
1545 free( (char *)candidates[ i ].sr_matched );
1546 candidates[ i ].sr_matched = NULL;
1550 ber_str2bv( candidates[ i ].sr_matched, 0, 0, &bv );
1551 rc = dnPretty( NULL, &bv, &pbv, op->o_tmpmemctx );
1553 if ( rc == LDAP_SUCCESS ) {
1555 /* NOTE: if they all are superiors
1556 * of the baseDN, the shorter is also
1557 * superior of the longer... */
1558 if ( pbv.bv_len > pmatched.bv_len ) {
1559 if ( !BER_BVISNULL( &pmatched ) ) {
1560 op->o_tmpfree( pmatched.bv_val, op->o_tmpmemctx );
1563 op->o_private = (void *)i;
1566 op->o_tmpfree( pbv.bv_val, op->o_tmpmemctx );
1570 if ( candidates[ i ].sr_matched != NULL ) {
1571 free( (char *)candidates[ i ].sr_matched );
1572 candidates[ i ].sr_matched = NULL;
1577 if ( !BER_BVISNULL( &pmatched ) ) {
1578 matched = pmatched.bv_val;
1581 } else if ( sres == LDAP_NO_SUCH_OBJECT ) {
1582 matched = op->o_bd->be_suffix[ 0 ].bv_val;
1586 * In case we returned at least one entry, we return LDAP_SUCCESS
1587 * otherwise, the latter error code we got
1590 if ( sres == LDAP_SUCCESS ) {
1591 if ( rs->sr_v2ref ) {
1592 sres = LDAP_REFERRAL;
1595 if ( META_BACK_ONERR_REPORT( mi ) ) {
1597 * Report errors, if any
1599 * FIXME: we should handle error codes and return the more
1600 * important/reasonable
1602 for ( i = 0; i < mi->mi_ntargets; i++ ) {
1603 if ( !META_IS_CANDIDATE( &candidates[ i ] ) ) {
1607 if ( candidates[ i ].sr_err != LDAP_SUCCESS
1608 && candidates[ i ].sr_err != LDAP_NO_SUCH_OBJECT )
1610 sres = candidates[ i ].sr_err;
1618 rs->sr_matched = matched;
1619 rs->sr_ref = ( sres == LDAP_REFERRAL ? rs->sr_v2ref : NULL );
1620 send_ldap_result( op, rs );
1621 op->o_private = savepriv;
1622 rs->sr_matched = NULL;
1626 if ( matched && matched != op->o_bd->be_suffix[ 0 ].bv_val ) {
1627 op->o_tmpfree( matched, op->o_tmpmemctx );
1630 if ( rs->sr_v2ref ) {
1631 ber_bvarray_free( rs->sr_v2ref );
1634 for ( i = 0; i < mi->mi_ntargets; i++ ) {
1635 if ( !META_IS_CANDIDATE( &candidates[ i ] ) ) {
1639 if ( mc && META_IS_BINDING( &candidates[ i ] ) ) {
1640 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
1641 if ( LDAP_BACK_CONN_BINDING( &mc->mc_conns[ i ] ) ) {
1642 assert( candidates[ i ].sr_msgid >= 0 );
1643 assert( mc->mc_conns[ i ].msc_ld != NULL );
1646 Debug( LDAP_DEBUG_ANY, "### %s meta_back_search(cleanup) "
1647 "ldap_unbind_ext[%ld] ld=%p\n",
1648 op->o_log_prefix, i, (void *)mc->mc_conns[i].msc_ld );
1649 #endif /* DEBUG_205 */
1651 /* if still binding, destroy */
1652 meta_clear_one_candidate( op, mc, i );
1654 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
1655 META_BINDING_CLEAR( &candidates[ i ] );
1658 if ( candidates[ i ].sr_matched ) {
1659 free( (char *)candidates[ i ].sr_matched );
1660 candidates[ i ].sr_matched = NULL;
1663 if ( candidates[ i ].sr_text ) {
1664 ldap_memfree( (char *)candidates[ i ].sr_text );
1665 candidates[ i ].sr_text = NULL;
1668 if ( candidates[ i ].sr_ref ) {
1669 ber_bvarray_free( candidates[ i ].sr_ref );
1670 candidates[ i ].sr_ref = NULL;
1673 if ( candidates[ i ].sr_ctrls ) {
1674 ldap_controls_free( candidates[ i ].sr_ctrls );
1675 candidates[ i ].sr_ctrls = NULL;
1678 if ( META_BACK_TGT_QUARANTINE( mi->mi_targets[ i ] ) ) {
1679 meta_back_quarantine( op, &candidates[ i ], i );
1682 /* only in case of timelimit exceeded, if the timelimit exceeded because
1683 * one contacted target never responded, invalidate the connection
1684 * NOTE: should we quarantine the target as well? right now, the connection
1685 * is invalidated; the next time it will be recreated and the target
1686 * will be quarantined if it cannot be contacted */
1687 if ( mi->mi_idle_timeout != 0
1688 && rs->sr_err == LDAP_TIMELIMIT_EXCEEDED
1689 && op->o_time > mc->mc_conns[ i ].msc_time )
1691 /* don't let anyone else use this expired connection */
1692 LDAP_BACK_CONN_TAINTED_SET( mc );
1697 meta_back_release_conn( mi, mc );
1711 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
1712 struct berval a, mapped;
1714 BerElement ber = *e->lm_ber;
1715 Attribute *attr, **attrp;
1722 if ( ber_scanf( &ber, "{m{", &bdn ) == LBER_ERROR ) {
1723 return LDAP_DECODING_ERROR;
1727 * Rewrite the dn of the result, if needed
1729 dc.target = mi->mi_targets[ target ];
1730 dc.conn = op->o_conn;
1732 dc.ctx = "searchResult";
1734 rs->sr_err = ldap_back_dn_massage( &dc, &bdn, &dn );
1735 if ( rs->sr_err != LDAP_SUCCESS) {
1740 * Note: this may fail if the target host(s) schema differs
1741 * from the one known to the meta, and a DN with unknown
1742 * attributes is returned.
1744 * FIXME: should we log anything, or delegate to dnNormalize?
1746 rc = dnPrettyNormal( NULL, &dn, &ent.e_name, &ent.e_nname,
1748 if ( dn.bv_val != bdn.bv_val ) {
1753 if ( rc != LDAP_SUCCESS ) {
1754 return LDAP_INVALID_DN_SYNTAX;
1760 if ( mi->mi_cache.ttl != META_DNCACHE_DISABLED ) {
1761 ( void )meta_dncache_update_entry( &mi->mi_cache,
1762 &ent.e_nname, target );
1765 attrp = &ent.e_attrs;
1767 dc.ctx = "searchAttrDN";
1768 while ( ber_scanf( &ber, "{m", &a ) != LBER_ERROR ) {
1770 slap_syntax_validate_func *validate;
1771 slap_syntax_transform_func *pretty;
1773 ldap_back_map( &mi->mi_targets[ target ]->mt_rwmap.rwm_at,
1774 &a, &mapped, BACKLDAP_REMAP );
1775 if ( BER_BVISNULL( &mapped ) || mapped.bv_val[0] == '\0' ) {
1776 ( void )ber_scanf( &ber, "x" /* [W] */ );
1779 attr = attr_alloc( NULL );
1780 if ( attr == NULL ) {
1783 if ( slap_bv2ad( &mapped, &attr->a_desc, &text )
1785 if ( slap_bv2undef_ad( &mapped, &attr->a_desc, &text,
1786 SLAP_AD_PROXIED ) != LDAP_SUCCESS )
1788 char buf[ SLAP_TEXT_BUFLEN ];
1790 snprintf( buf, sizeof( buf ),
1791 "%s meta_send_entry(\"%s\"): "
1792 "slap_bv2undef_ad(%s): %s\n",
1793 op->o_log_prefix, ent.e_name.bv_val,
1794 mapped.bv_val, text );
1796 Debug( LDAP_DEBUG_ANY, "%s", buf, 0, 0 );
1802 /* no subschemaSubentry */
1803 if ( attr->a_desc == slap_schema.si_ad_subschemaSubentry
1804 || attr->a_desc == slap_schema.si_ad_entryDN )
1808 * We eat target's subschemaSubentry because
1809 * a search for this value is likely not
1810 * to resolve to the appropriate backend;
1811 * later, the local subschemaSubentry is
1814 * We also eat entryDN because the frontend
1815 * will reattach it without checking if already
1818 ( void )ber_scanf( &ber, "x" /* [W] */ );
1824 if ( ber_scanf( &ber, "[W]", &attr->a_vals ) == LBER_ERROR
1825 || attr->a_vals == NULL )
1827 attr->a_vals = (struct berval *)&slap_dummy_bv;
1830 for ( last = 0; !BER_BVISNULL( &attr->a_vals[ last ] ); ++last )
1834 validate = attr->a_desc->ad_type->sat_syntax->ssyn_validate;
1835 pretty = attr->a_desc->ad_type->sat_syntax->ssyn_pretty;
1837 if ( !validate && !pretty ) {
1842 if ( attr->a_desc == slap_schema.si_ad_objectClass
1843 || attr->a_desc == slap_schema.si_ad_structuralObjectClass )
1847 for ( bv = attr->a_vals; !BER_BVISNULL( bv ); bv++ ) {
1848 ldap_back_map( &mi->mi_targets[ target ]->mt_rwmap.rwm_oc,
1849 bv, &mapped, BACKLDAP_REMAP );
1850 if ( BER_BVISNULL( &mapped ) || mapped.bv_val[0] == '\0') {
1856 *bv = attr->a_vals[ last ];
1857 BER_BVZERO( &attr->a_vals[ last ] );
1860 } else if ( mapped.bv_val != bv->bv_val ) {
1862 ber_dupbv( bv, &mapped );
1866 * It is necessary to try to rewrite attributes with
1867 * dn syntax because they might be used in ACLs as
1868 * members of groups; since ACLs are applied to the
1869 * rewritten stuff, no dn-based subecj clause could
1870 * be used at the ldap backend side (see
1871 * http://www.OpenLDAP.org/faq/data/cache/452.html)
1872 * The problem can be overcome by moving the dn-based
1873 * ACLs to the target directory server, and letting
1874 * everything pass thru the ldap backend.
1879 if ( attr->a_desc->ad_type->sat_syntax ==
1880 slap_schema.si_syn_distinguishedName )
1882 ldap_dnattr_result_rewrite( &dc, attr->a_vals );
1884 } else if ( attr->a_desc == slap_schema.si_ad_ref ) {
1885 ldap_back_referral_result_rewrite( &dc, attr->a_vals );
1889 for ( i = 0; i < last; i++ ) {
1894 rc = pretty( attr->a_desc->ad_type->sat_syntax,
1895 &attr->a_vals[i], &pval, NULL );
1898 rc = validate( attr->a_desc->ad_type->sat_syntax,
1903 LBER_FREE( attr->a_vals[i].bv_val );
1904 if ( --last == i ) {
1905 BER_BVZERO( &attr->a_vals[ i ] );
1908 attr->a_vals[i] = attr->a_vals[last];
1909 BER_BVZERO( &attr->a_vals[last] );
1915 LBER_FREE( attr->a_vals[i].bv_val );
1916 attr->a_vals[i] = pval;
1920 if ( last == 0 && attr->a_vals != &slap_dummy_bv ) {
1926 if ( last && attr->a_desc->ad_type->sat_equality &&
1927 attr->a_desc->ad_type->sat_equality->smr_normalize )
1931 attr->a_nvals = ch_malloc( ( last + 1 ) * sizeof( struct berval ) );
1932 for ( i = 0; i<last; i++ ) {
1933 attr->a_desc->ad_type->sat_equality->smr_normalize(
1934 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
1935 attr->a_desc->ad_type->sat_syntax,
1936 attr->a_desc->ad_type->sat_equality,
1937 &attr->a_vals[i], &attr->a_nvals[i],
1940 BER_BVZERO( &attr->a_nvals[i] );
1943 attr->a_nvals = attr->a_vals;
1947 attrp = &attr->a_next;
1950 rs->sr_entry = &ent;
1951 rs->sr_attrs = op->ors_attrs;
1953 rs->sr_err = LDAP_SUCCESS;
1954 rc = send_search_entry( op, rs );
1956 case LDAP_UNAVAILABLE:
1960 rs->sr_entry = NULL;
1961 rs->sr_attrs = NULL;
1963 if ( !BER_BVISNULL( &ent.e_name ) ) {
1964 free( ent.e_name.bv_val );
1965 BER_BVZERO( &ent.e_name );
1967 if ( !BER_BVISNULL( &ent.e_nname ) ) {
1968 free( ent.e_nname.bv_val );
1969 BER_BVZERO( &ent.e_nname );
1971 entry_clean( &ent );