2 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
4 * Copyright 1999-2010 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 );
197 case LDAP_UNAVAILABLE:
203 /* NOTE: we copy things here, even if bind didn't succeed yet,
204 * because the connection is not shared until bind is over */
205 if ( !BER_BVISNULL( &binddn ) ) {
206 ber_bvreplace( &msc->msc_bound_ndn, &binddn );
207 if ( META_BACK_TGT_SAVECRED( mt ) && !BER_BVISNULL( &cred ) ) {
208 if ( !BER_BVISNULL( &msc->msc_cred ) ) {
209 memset( msc->msc_cred.bv_val, 0,
210 msc->msc_cred.bv_len );
212 ber_bvreplace( &msc->msc_cred, &cred );
216 if ( LDAP_BACK_CONN_ISBOUND( msc ) ) {
217 /* apparently, idassert was configured with SASL bind,
218 * so bind occurred inside meta_back_proxy_authz_cred() */
219 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
220 LDAP_BACK_CONN_BINDING_CLEAR( msc );
221 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
222 return META_SEARCH_CANDIDATE;
228 case LDAP_AUTH_SIMPLE:
229 /* do a simple bind with binddn, cred */
238 assert( msc->msc_ld != NULL );
240 if ( !BER_BVISEMPTY( &binddn ) && BER_BVISEMPTY( &cred ) ) {
241 /* bind anonymously? */
242 Debug( LDAP_DEBUG_ANY, "%s meta_search_dobind_init[%d] mc=%p: "
243 "non-empty dn with empty cred; binding anonymously\n",
244 op->o_log_prefix, candidate, (void *)mc );
245 cred = slap_empty_bv;
247 } else if ( BER_BVISEMPTY( &binddn ) && !BER_BVISEMPTY( &cred ) ) {
249 Debug( LDAP_DEBUG_ANY, "%s meta_search_dobind_init[%d] mc=%p: "
250 "empty dn with non-empty cred: error\n",
251 op->o_log_prefix, candidate, (void *)mc );
255 /* connect must be async only the first time... */
256 ldap_set_option( msc->msc_ld, LDAP_OPT_CONNECT_ASYNC, LDAP_OPT_ON );
259 rc = ldap_sasl_bind( msc->msc_ld, binddn.bv_val, LDAP_SASL_SIMPLE, &cred,
260 NULL, NULL, &candidates[ candidate ].sr_msgid );
264 char buf[ SLAP_TEXT_BUFLEN ];
266 snprintf( buf, sizeof( buf ), "meta_search_dobind_init[%d] mc=%p ld=%p rc=%d",
267 candidate, (void *)mc, (void *)mc->mc_conns[ candidate ].msc_ld, rc );
268 Debug( LDAP_DEBUG_ANY, "### %s %s\n",
269 op->o_log_prefix, buf, 0 );
271 #endif /* DEBUG_205 */
275 assert( candidates[ candidate ].sr_msgid >= 0 );
276 META_BINDING_SET( &candidates[ candidate ] );
277 return META_SEARCH_BINDING;
279 case LDAP_X_CONNECTING:
280 /* must retry, same conn */
281 candidates[ candidate ].sr_msgid = META_MSGID_CONNECTING;
282 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
283 LDAP_BACK_CONN_BINDING_CLEAR( msc );
284 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
285 return META_SEARCH_CONNECTING;
287 case LDAP_SERVER_DOWN:
289 /* This is the worst thing that could happen:
290 * the search will wait until the retry is over. */
291 if ( !META_IS_RETRYING( &candidates[ candidate ] ) ) {
292 META_RETRYING_SET( &candidates[ candidate ] );
294 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
296 assert( mc->mc_refcnt > 0 );
297 if ( LogTest( LDAP_DEBUG_ANY ) ) {
298 char buf[ SLAP_TEXT_BUFLEN ];
300 /* this lock is required; however,
301 * it's invoked only when logging is on */
302 ldap_pvt_thread_mutex_lock( &mt->mt_uri_mutex );
303 snprintf( buf, sizeof( buf ),
304 "retrying URI=\"%s\" DN=\"%s\"",
306 BER_BVISNULL( &msc->msc_bound_ndn ) ?
307 "" : msc->msc_bound_ndn.bv_val );
308 ldap_pvt_thread_mutex_unlock( &mt->mt_uri_mutex );
310 Debug( LDAP_DEBUG_ANY,
311 "%s meta_search_dobind_init[%d]: %s.\n",
312 op->o_log_prefix, candidate, buf );
315 meta_clear_one_candidate( op, mc, candidate );
316 LDAP_BACK_CONN_ISBOUND_CLEAR( msc );
318 ( void )rewrite_session_delete( mt->mt_rwmap.rwm_rw, op->o_conn );
320 /* mc here must be the regular mc, reset and ready for init */
321 rc = meta_back_init_one_conn( op, rs, mc, candidate,
322 LDAP_BACK_CONN_ISPRIV( mc ), LDAP_BACK_DONTSEND, 0 );
324 if ( rc == LDAP_SUCCESS ) {
325 LDAP_BACK_CONN_BINDING_SET( msc );
328 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
330 if ( rc == LDAP_SUCCESS ) {
331 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
336 if ( *mcp == NULL ) {
337 retcode = META_SEARCH_ERR;
338 rs->sr_err = LDAP_UNAVAILABLE;
339 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
347 rc = slap_map_api2result( rs );
349 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
350 meta_clear_one_candidate( op, mc, candidate );
351 candidates[ candidate ].sr_err = rc;
352 if ( META_BACK_ONERR_STOP( mi ) ) {
353 LDAP_BACK_CONN_TAINTED_SET( mc );
354 meta_back_release_conn_lock( mi, mc, 0 );
358 retcode = META_SEARCH_ERR;
361 retcode = META_SEARCH_NOT_CANDIDATE;
363 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
364 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
371 static meta_search_candidate_t
372 meta_search_dobind_result(
377 SlapReply *candidates,
380 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
381 metaconn_t *mc = *mcp;
382 metasingleconn_t *msc = &mc->mc_conns[ candidate ];
384 meta_search_candidate_t retcode = META_SEARCH_NOT_CANDIDATE;
387 assert( msc->msc_ld != NULL );
389 /* FIXME: matched? referrals? response controls? */
390 rc = ldap_parse_result( msc->msc_ld, res,
391 &candidates[ candidate ].sr_err,
392 NULL, NULL, NULL, NULL, 0 );
393 if ( rc != LDAP_SUCCESS ) {
394 candidates[ candidate ].sr_err = rc;
396 rc = slap_map_api2result( &candidates[ candidate ] );
398 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
399 LDAP_BACK_CONN_BINDING_CLEAR( msc );
400 if ( rc != LDAP_SUCCESS ) {
401 meta_clear_one_candidate( op, mc, candidate );
402 candidates[ candidate ].sr_err = rc;
403 if ( META_BACK_ONERR_STOP( mi ) ) {
404 LDAP_BACK_CONN_TAINTED_SET( mc );
405 meta_back_release_conn_lock( mi, mc, 0 );
407 retcode = META_SEARCH_ERR;
412 /* FIXME: check if bound as idassert authcDN! */
413 if ( BER_BVISNULL( &msc->msc_bound_ndn )
414 || BER_BVISEMPTY( &msc->msc_bound_ndn ) )
416 LDAP_BACK_CONN_ISANON_SET( msc );
419 LDAP_BACK_CONN_ISBOUND_SET( msc );
421 retcode = META_SEARCH_CANDIDATE;
423 /* connect must be async */
424 ldap_set_option( msc->msc_ld, LDAP_OPT_CONNECT_ASYNC, LDAP_OPT_OFF );
427 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
428 META_BINDING_CLEAR( &candidates[ candidate ] );
430 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
435 static meta_search_candidate_t
436 meta_back_search_start(
442 SlapReply *candidates )
444 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
445 metatarget_t *mt = mi->mi_targets[ candidate ];
446 metasingleconn_t *msc = &(*mcp)->mc_conns[ candidate ];
447 struct berval realbase = op->o_req_dn;
448 int realscope = op->ors_scope;
449 struct berval mbase = BER_BVNULL;
450 struct berval mfilter = BER_BVNULL;
451 char **mapped_attrs = NULL;
453 meta_search_candidate_t retcode;
454 struct timeval tv, *tvp = NULL;
456 LDAPControl **ctrls = NULL;
458 /* this should not happen; just in case... */
459 if ( msc->msc_ld == NULL ) {
460 Debug( LDAP_DEBUG_ANY,
461 "%s: meta_back_search_start candidate=%d ld=NULL%s.\n",
462 op->o_log_prefix, candidate,
463 META_BACK_ONERR_STOP( mi ) ? "" : " (ignored)" );
464 candidates[ candidate ].sr_err = LDAP_OTHER;
465 if ( META_BACK_ONERR_STOP( mi ) ) {
466 return META_SEARCH_ERR;
468 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
469 return META_SEARCH_NOT_CANDIDATE;
472 Debug( LDAP_DEBUG_TRACE, "%s >>> meta_back_search_start[%d]\n", op->o_log_prefix, candidate, 0 );
475 * modifies the base according to the scope, if required
477 if ( mt->mt_nsuffix.bv_len > op->o_req_ndn.bv_len ) {
478 switch ( op->ors_scope ) {
479 case LDAP_SCOPE_SUBTREE:
481 * make the target suffix the new base
482 * FIXME: this is very forgiving, because
483 * "illegal" searchBases may be turned
484 * into the suffix of the target; however,
485 * the requested searchBase already passed
486 * thru the candidate analyzer...
488 if ( dnIsSuffix( &mt->mt_nsuffix, &op->o_req_ndn ) ) {
489 realbase = mt->mt_nsuffix;
490 if ( mt->mt_scope == LDAP_SCOPE_SUBORDINATE ) {
491 realscope = LDAP_SCOPE_SUBORDINATE;
496 * this target is no longer candidate
498 retcode = META_SEARCH_NOT_CANDIDATE;
503 case LDAP_SCOPE_SUBORDINATE:
504 case LDAP_SCOPE_ONELEVEL:
506 struct berval rdn = mt->mt_nsuffix;
507 rdn.bv_len -= op->o_req_ndn.bv_len + STRLENOF( "," );
508 if ( dnIsOneLevelRDN( &rdn )
509 && dnIsSuffix( &mt->mt_nsuffix, &op->o_req_ndn ) )
512 * if there is exactly one level,
513 * make the target suffix the new
514 * base, and make scope "base"
516 realbase = mt->mt_nsuffix;
517 if ( op->ors_scope == LDAP_SCOPE_SUBORDINATE ) {
518 if ( mt->mt_scope == LDAP_SCOPE_SUBORDINATE ) {
519 realscope = LDAP_SCOPE_SUBORDINATE;
521 realscope = LDAP_SCOPE_SUBTREE;
524 realscope = LDAP_SCOPE_BASE;
527 } /* else continue with the next case */
530 case LDAP_SCOPE_BASE:
532 * this target is no longer candidate
534 retcode = META_SEARCH_NOT_CANDIDATE;
539 /* initiate dobind */
540 retcode = meta_search_dobind_init( op, rs, mcp, candidate, candidates );
542 Debug( LDAP_DEBUG_TRACE, "%s <<< meta_search_dobind_init[%d]=%d\n", op->o_log_prefix, candidate, retcode );
544 if ( retcode != META_SEARCH_CANDIDATE ) {
549 * Rewrite the search base, if required
552 dc->ctx = "searchBase";
553 switch ( ldap_back_dn_massage( dc, &realbase, &mbase ) ) {
557 case LDAP_UNWILLING_TO_PERFORM:
558 rs->sr_err = LDAP_UNWILLING_TO_PERFORM;
559 rs->sr_text = "Operation not allowed";
560 send_ldap_result( op, rs );
561 retcode = META_SEARCH_ERR;
567 * this target is no longer candidate
569 retcode = META_SEARCH_NOT_CANDIDATE;
576 rc = ldap_back_filter_map_rewrite( dc, op->ors_filter,
577 &mfilter, BACKLDAP_MAP, op->o_tmpmemctx );
582 case LDAP_COMPARE_FALSE:
585 * this target is no longer candidate
587 retcode = META_SEARCH_NOT_CANDIDATE;
592 * Maps required attributes
594 rc = ldap_back_map_attrs( op, &mt->mt_rwmap.rwm_at,
595 op->ors_attrs, BACKLDAP_MAP, &mapped_attrs );
596 if ( rc != LDAP_SUCCESS ) {
598 * this target is no longer candidate
600 retcode = META_SEARCH_NOT_CANDIDATE;
604 if ( op->ors_tlimit != SLAP_NO_LIMIT ) {
605 tv.tv_sec = op->ors_tlimit > 0 ? op->ors_tlimit : 1;
612 if ( meta_back_controls_add( op, rs, *mcp, candidate, &ctrls )
615 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
616 retcode = META_SEARCH_NOT_CANDIDATE;
623 assert( msc->msc_ld != NULL );
624 rc = ldap_pvt_search( msc->msc_ld,
625 mbase.bv_val, realscope, mfilter.bv_val,
626 mapped_attrs, op->ors_attrsonly,
627 ctrls, NULL, tvp, op->ors_slimit, op->ors_deref,
628 &candidates[ candidate ].sr_msgid );
631 retcode = META_SEARCH_CANDIDATE;
634 case LDAP_SERVER_DOWN:
635 if ( nretries && meta_back_retry( op, rs, mcp, candidate, LDAP_BACK_DONTSEND ) ) {
637 /* if the identity changed, there might be need to re-authz */
638 (void)mi->mi_ldap_extra->controls_free( op, rs, &ctrls );
642 if ( *mcp == NULL ) {
643 retcode = META_SEARCH_ERR;
644 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
650 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
651 retcode = META_SEARCH_NOT_CANDIDATE;
655 (void)mi->mi_ldap_extra->controls_free( op, rs, &ctrls );
657 if ( mapped_attrs ) {
658 ber_memfree_x( mapped_attrs, op->o_tmpmemctx );
660 if ( mfilter.bv_val != op->ors_filterstr.bv_val ) {
661 ber_memfree_x( mfilter.bv_val, op->o_tmpmemctx );
663 if ( mbase.bv_val != realbase.bv_val ) {
664 free( mbase.bv_val );
668 Debug( LDAP_DEBUG_TRACE, "%s <<< meta_back_search_start[%d]=%d\n", op->o_log_prefix, candidate, retcode );
674 meta_back_search( Operation *op, SlapReply *rs )
676 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
678 struct timeval save_tv = { 0, 0 },
680 time_t stoptime = (time_t)(-1),
681 lastres_time = slap_get_time(),
683 int rc = 0, sres = LDAP_SUCCESS;
684 char *matched = NULL;
685 int last = 0, ncandidates = 0,
686 initial_candidates = 0, candidate_match = 0,
688 ldap_back_send_t sendok = LDAP_BACK_SENDERR;
693 SlapReply *candidates = NULL;
697 * controls are set in ldap_back_dobind()
699 * FIXME: in case of values return filter, we might want
700 * to map attrs and maybe rewrite value
703 mc = meta_back_getconn( op, rs, NULL, sendok );
708 dc.conn = op->o_conn;
711 if ( candidates == NULL ) candidates = meta_back_candidates_get( op );
715 for ( i = 0; i < mi->mi_ntargets; i++ ) {
716 /* reset sr_msgid; it is used in most loops
717 * to check if that target is still to be considered */
718 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
720 /* a target is marked as candidate by meta_back_getconn();
721 * if for any reason (an error, it's over or so) it is
722 * no longer active, sr_msgid is set to META_MSGID_IGNORE
723 * but it remains candidate, which means it has been active
724 * at some point during the operation. This allows to
725 * use its response code and more to compute the final
727 if ( !META_IS_CANDIDATE( &candidates[ i ] ) ) {
731 candidates[ i ].sr_matched = NULL;
732 candidates[ i ].sr_text = NULL;
733 candidates[ i ].sr_ref = NULL;
734 candidates[ i ].sr_ctrls = NULL;
736 /* get largest timeout among candidates */
737 if ( mi->mi_targets[ i ]->mt_timeout[ SLAP_OP_SEARCH ]
738 && mi->mi_targets[ i ]->mt_timeout[ SLAP_OP_SEARCH ] > timeout )
740 timeout = mi->mi_targets[ i ]->mt_timeout[ SLAP_OP_SEARCH ];
744 for ( i = 0; i < mi->mi_ntargets; i++ ) {
745 if ( !META_IS_CANDIDATE( &candidates[ i ] )
746 || candidates[ i ].sr_err != LDAP_SUCCESS )
751 switch ( meta_back_search_start( op, rs, &dc, &mc, i, candidates ) )
753 case META_SEARCH_NOT_CANDIDATE:
754 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
757 case META_SEARCH_NEED_BIND:
761 case META_SEARCH_CONNECTING:
762 case META_SEARCH_CANDIDATE:
763 case META_SEARCH_BINDING:
764 candidates[ i ].sr_type = REP_INTERMEDIATE;
768 case META_SEARCH_ERR:
769 savepriv = op->o_private;
770 op->o_private = (void *)i;
771 send_ldap_result( op, rs );
772 op->o_private = savepriv;
782 if ( ncandidates > 0 && needbind == ncandidates ) {
784 * give up the second time...
786 * NOTE: this should not occur the second time, since a fresh
787 * connection has ben created; however, targets may also
788 * need bind because the bind timed out or so.
790 if ( sendok & LDAP_BACK_BINDING ) {
791 Debug( LDAP_DEBUG_ANY,
792 "%s meta_back_search: unable to initialize conn\n",
793 op->o_log_prefix, 0, 0 );
794 rs->sr_err = LDAP_UNAVAILABLE;
795 rs->sr_text = "unable to initialize connection to remote targets";
796 send_ldap_result( op, rs );
801 /* FIXME: better create a separate connection? */
802 sendok |= LDAP_BACK_BINDING;
805 Debug( LDAP_DEBUG_ANY, "*** %s drop mc=%p create new connection\n",
806 op->o_log_prefix, (void *)mc, 0 );
807 #endif /* DEBUG_205 */
809 meta_back_release_conn( mi, mc );
818 initial_candidates = ncandidates;
820 if ( LogTest( LDAP_DEBUG_TRACE ) ) {
821 char cnd[ SLAP_TEXT_BUFLEN ];
824 for ( c = 0; c < mi->mi_ntargets; c++ ) {
825 if ( META_IS_CANDIDATE( &candidates[ c ] ) ) {
833 Debug( LDAP_DEBUG_TRACE, "%s meta_back_search: ncandidates=%d "
834 "cnd=\"%s\"\n", op->o_log_prefix, ncandidates, cnd );
837 if ( initial_candidates == 0 ) {
838 /* NOTE: here we are not sending any matchedDN;
839 * this is intended, because if the back-meta
840 * is serving this search request, but no valid
841 * candidate could be looked up, it means that
842 * there is a hole in the mapping of the targets
843 * and thus no knowledge of any remote superior
845 Debug( LDAP_DEBUG_ANY, "%s meta_back_search: "
846 "base=\"%s\" scope=%d: "
847 "no candidate could be selected\n",
848 op->o_log_prefix, op->o_req_dn.bv_val,
851 /* FIXME: we're sending the first error we encounter;
852 * maybe we should pick the worst... */
853 rc = LDAP_NO_SUCH_OBJECT;
854 for ( i = 0; i < mi->mi_ntargets; i++ ) {
855 if ( META_IS_CANDIDATE( &candidates[ i ] )
856 && candidates[ i ].sr_err != LDAP_SUCCESS )
858 rc = candidates[ i ].sr_err;
863 send_ldap_error( op, rs, rc, NULL );
868 /* We pull apart the ber result, stuff it into a slapd entry, and
869 * let send_search_entry stuff it back into ber format. Slow & ugly,
870 * but this is necessary for version matching, and for ACL processing.
873 if ( op->ors_tlimit != SLAP_NO_LIMIT ) {
874 stoptime = op->o_time + op->ors_tlimit;
878 * In case there are no candidates, no cycle takes place...
880 * FIXME: we might use a queue, to better balance the load
881 * among the candidates
883 for ( rc = 0; ncandidates > 0; ) {
886 alreadybound = ncandidates;
889 if ( timeout && lastres_time > 0
890 && ( slap_get_time() - lastres_time ) > timeout )
893 rs->sr_text = "Operation timed out";
894 rc = rs->sr_err = op->o_protocol >= LDAP_VERSION3 ?
895 LDAP_ADMINLIMIT_EXCEEDED : LDAP_OTHER;
896 savepriv = op->o_private;
897 op->o_private = (void *)i;
898 send_ldap_result( op, rs );
899 op->o_private = savepriv;
903 /* check time limit */
904 if ( op->ors_tlimit != SLAP_NO_LIMIT
905 && slap_get_time() > stoptime )
908 rc = rs->sr_err = LDAP_TIMELIMIT_EXCEEDED;
909 savepriv = op->o_private;
910 op->o_private = (void *)i;
911 send_ldap_result( op, rs );
912 op->o_private = savepriv;
916 for ( i = 0; i < mi->mi_ntargets; i++ ) {
917 meta_search_candidate_t retcode = META_SEARCH_UNDEFINED;
918 metasingleconn_t *msc = &mc->mc_conns[ i ];
919 LDAPMessage *res = NULL, *msg;
921 /* if msgid is invalid, don't ldap_result() */
922 if ( candidates[ i ].sr_msgid == META_MSGID_IGNORE ) {
926 /* if target still needs bind, retry */
927 if ( candidates[ i ].sr_msgid == META_MSGID_NEED_BIND
928 || candidates[ i ].sr_msgid == META_MSGID_CONNECTING )
930 /* initiate dobind */
931 retcode = meta_search_dobind_init( op, rs, &mc, i, candidates );
933 Debug( LDAP_DEBUG_TRACE, "%s <<< meta_search_dobind_init[%ld]=%d\n",
934 op->o_log_prefix, i, retcode );
937 case META_SEARCH_NEED_BIND:
941 case META_SEARCH_CONNECTING:
942 case META_SEARCH_BINDING:
945 case META_SEARCH_ERR:
946 candidates[ i ].sr_err = rs->sr_err;
947 if ( META_BACK_ONERR_STOP( mi ) ) {
948 savepriv = op->o_private;
949 op->o_private = (void *)i;
950 send_ldap_result( op, rs );
951 op->o_private = savepriv;
956 case META_SEARCH_NOT_CANDIDATE:
958 * When no candidates are left,
959 * the outer cycle finishes
961 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
962 assert( ncandidates > 0 );
966 case META_SEARCH_CANDIDATE:
967 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
968 switch ( meta_back_search_start( op, rs, &dc, &mc, i, candidates ) )
970 case META_SEARCH_CANDIDATE:
971 assert( candidates[ i ].sr_msgid >= 0 );
974 case META_SEARCH_ERR:
975 candidates[ i ].sr_err = rs->sr_err;
976 if ( META_BACK_ONERR_STOP( mi ) ) {
977 savepriv = op->o_private;
978 op->o_private = (void *)i;
979 send_ldap_result( op, rs );
980 op->o_private = savepriv;
985 case META_SEARCH_NOT_CANDIDATE:
986 /* means that meta_back_search_start()
987 * failed but onerr == continue */
988 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
989 assert( ncandidates > 0 );
1008 /* check for abandon */
1009 if ( op->o_abandon || LDAP_BACK_CONN_ABANDON( mc ) ) {
1014 if ( msc->msc_ld == NULL ) {
1015 char buf[ SLAP_TEXT_BUFLEN ];
1017 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
1018 snprintf( buf, sizeof( buf ),
1019 "%s meta_back_search[%ld] mc=%p msgid=%d%s%s%s\n",
1020 op->o_log_prefix, (long)i, (void *)mc,
1021 candidates[ i ].sr_msgid,
1022 META_IS_BINDING( &candidates[ i ] ) ? " binding" : "",
1023 LDAP_BACK_CONN_BINDING( &mc->mc_conns[ i ] ) ? " connbinding" : "",
1024 META_BACK_CONN_CREATING( &mc->mc_conns[ i ] ) ? " conncreating" : "" );
1025 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
1027 Debug( LDAP_DEBUG_ANY, "!!! %s\n", buf, 0, 0 );
1029 #endif /* DEBUG_205 */
1032 * FIXME: handle time limit as well?
1033 * Note that target servers are likely
1034 * to handle it, so at some time we'll
1035 * get a LDAP_TIMELIMIT_EXCEEDED from
1039 rc = ldap_result( msc->msc_ld, candidates[ i ].sr_msgid,
1040 LDAP_MSG_RECEIVED, &tv, &res );
1043 /* FIXME: res should not need to be freed */
1044 assert( res == NULL );
1049 /* something REALLY bad happened! */
1050 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
1051 candidates[ i ].sr_type = REP_RESULT;
1053 if ( meta_back_retry( op, rs, &mc, i, LDAP_BACK_DONTSEND ) ) {
1054 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1055 switch ( meta_back_search_start( op, rs, &dc, &mc, i, candidates ) )
1057 /* means that failed but onerr == continue */
1058 case META_SEARCH_NOT_CANDIDATE:
1059 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1061 assert( ncandidates > 0 );
1064 candidates[ i ].sr_err = rs->sr_err;
1065 if ( META_BACK_ONERR_STOP( mi ) ) {
1066 savepriv = op->o_private;
1067 op->o_private = (void *)i;
1068 send_ldap_result( op, rs );
1069 op->o_private = savepriv;
1074 case META_SEARCH_CANDIDATE:
1075 /* get back into business... */
1078 case META_SEARCH_BINDING:
1079 case META_SEARCH_CONNECTING:
1080 case META_SEARCH_NEED_BIND:
1081 case META_SEARCH_UNDEFINED:
1085 /* unrecoverable error */
1086 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1087 rc = rs->sr_err = LDAP_OTHER;
1092 candidates[ i ].sr_err = rs->sr_err;
1093 if ( META_BACK_ONERR_STOP( mi ) ) {
1094 savepriv = op->o_private;
1095 op->o_private = (void *)i;
1096 send_ldap_result( op, rs );
1097 op->o_private = savepriv;
1103 * When no candidates are left,
1104 * the outer cycle finishes
1106 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1107 assert( ncandidates > 0 );
1109 rs->sr_err = candidates[ i ].sr_err;
1113 lastres_time = slap_get_time();
1115 /* only touch when activity actually took place... */
1116 if ( mi->mi_idle_timeout != 0 && msc->msc_time < lastres_time ) {
1117 msc->msc_time = lastres_time;
1122 for ( msg = ldap_first_message( msc->msc_ld, res );
1124 msg = ldap_next_message( msc->msc_ld, msg ) )
1126 rc = ldap_msgtype( msg );
1127 if ( rc == LDAP_RES_SEARCH_ENTRY ) {
1130 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
1131 /* don't retry any more... */
1132 candidates[ i ].sr_type = REP_RESULT;
1137 e = ldap_first_entry( msc->msc_ld, msg );
1138 savepriv = op->o_private;
1139 op->o_private = (void *)i;
1140 rs->sr_err = meta_send_entry( op, rs, mc, i, e );
1142 switch ( rs->sr_err ) {
1143 case LDAP_SIZELIMIT_EXCEEDED:
1144 savepriv = op->o_private;
1145 op->o_private = (void *)i;
1146 send_ldap_result( op, rs );
1147 op->o_private = savepriv;
1148 rs->sr_err = LDAP_SUCCESS;
1149 ldap_msgfree( res );
1153 case LDAP_UNAVAILABLE:
1154 rs->sr_err = LDAP_OTHER;
1155 ldap_msgfree( res );
1159 op->o_private = savepriv;
1161 /* don't wait any longer... */
1164 save_tv.tv_usec = 0;
1166 } else if ( rc == LDAP_RES_SEARCH_REFERENCE ) {
1167 char **references = NULL;
1170 if ( META_BACK_TGT_NOREFS( mi->mi_targets[ i ] ) ) {
1174 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
1175 /* don't retry any more... */
1176 candidates[ i ].sr_type = REP_RESULT;
1181 rc = ldap_parse_reference( msc->msc_ld, msg,
1182 &references, &rs->sr_ctrls, 0 );
1184 if ( rc != LDAP_SUCCESS ) {
1188 if ( references == NULL ) {
1192 #ifdef ENABLE_REWRITE
1193 dc.ctx = "referralDN";
1194 #else /* ! ENABLE_REWRITE */
1197 #endif /* ! ENABLE_REWRITE */
1199 /* FIXME: merge all and return at the end */
1201 for ( cnt = 0; references[ cnt ]; cnt++ )
1204 rs->sr_ref = ber_memalloc_x( sizeof( struct berval ) * ( cnt + 1 ),
1207 for ( cnt = 0; references[ cnt ]; cnt++ ) {
1208 ber_str2bv_x( references[ cnt ], 0, 1, &rs->sr_ref[ cnt ],
1211 BER_BVZERO( &rs->sr_ref[ cnt ] );
1213 ( void )ldap_back_referral_result_rewrite( &dc, rs->sr_ref,
1216 if ( rs->sr_ref != NULL && !BER_BVISNULL( &rs->sr_ref[ 0 ] ) ) {
1217 /* ignore return value by now */
1218 savepriv = op->o_private;
1219 op->o_private = (void *)i;
1220 ( void )send_search_reference( op, rs );
1221 op->o_private = savepriv;
1223 ber_bvarray_free_x( rs->sr_ref, op->o_tmpmemctx );
1229 ber_memvfree( (void **)references );
1232 if ( rs->sr_ctrls ) {
1233 ldap_controls_free( rs->sr_ctrls );
1234 rs->sr_ctrls = NULL;
1237 } else if ( rc == LDAP_RES_INTERMEDIATE ) {
1238 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
1239 /* don't retry any more... */
1240 candidates[ i ].sr_type = REP_RESULT;
1243 /* FIXME: response controls
1244 * are passed without checks */
1245 rs->sr_err = ldap_parse_intermediate( msc->msc_ld,
1247 (char **)&rs->sr_rspoid,
1251 if ( rs->sr_err != LDAP_SUCCESS ) {
1252 candidates[ i ].sr_type = REP_RESULT;
1253 ldap_msgfree( res );
1258 slap_send_ldap_intermediate( op, rs );
1260 if ( rs->sr_rspoid != NULL ) {
1261 ber_memfree( (char *)rs->sr_rspoid );
1262 rs->sr_rspoid = NULL;
1265 if ( rs->sr_rspdata != NULL ) {
1266 ber_bvfree( rs->sr_rspdata );
1267 rs->sr_rspdata = NULL;
1270 if ( rs->sr_ctrls != NULL ) {
1271 ldap_controls_free( rs->sr_ctrls );
1272 rs->sr_ctrls = NULL;
1275 } else if ( rc == LDAP_RES_SEARCH_RESULT ) {
1276 char buf[ SLAP_TEXT_BUFLEN ];
1277 char **references = NULL;
1279 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
1280 /* don't retry any more... */
1281 candidates[ i ].sr_type = REP_RESULT;
1284 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1286 /* NOTE: ignores response controls
1287 * (and intermediate response controls
1288 * as well, except for those with search
1289 * references); this may not be correct,
1290 * but if they're not ignored then
1291 * back-meta would need to merge them
1292 * consistently (think of pagedResults...)
1294 /* FIXME: response controls? */
1295 rs->sr_err = ldap_parse_result( msc->msc_ld,
1297 &candidates[ i ].sr_err,
1298 (char **)&candidates[ i ].sr_matched,
1299 (char **)&candidates[ i ].sr_text,
1301 NULL /* &candidates[ i ].sr_ctrls (unused) */ ,
1303 if ( rs->sr_err != LDAP_SUCCESS ) {
1304 candidates[ i ].sr_err = rs->sr_err;
1305 sres = slap_map_api2result( &candidates[ i ] );
1306 candidates[ i ].sr_type = REP_RESULT;
1307 ldap_msgfree( res );
1312 rs->sr_err = candidates[ i ].sr_err;
1314 /* massage matchedDN if need be */
1315 if ( candidates[ i ].sr_matched != NULL ) {
1316 struct berval match, mmatch;
1318 ber_str2bv( candidates[ i ].sr_matched,
1320 candidates[ i ].sr_matched = NULL;
1322 dc.ctx = "matchedDN";
1323 dc.target = mi->mi_targets[ i ];
1324 if ( !ldap_back_dn_massage( &dc, &match, &mmatch ) ) {
1325 if ( mmatch.bv_val == match.bv_val ) {
1326 candidates[ i ].sr_matched
1327 = ch_strdup( mmatch.bv_val );
1330 candidates[ i ].sr_matched = mmatch.bv_val;
1335 ldap_memfree( match.bv_val );
1338 /* add references to array */
1339 /* RFC 4511: referrals can only appear
1340 * if result code is LDAP_REFERRAL */
1341 if ( references != NULL
1342 && references[ 0 ] != NULL
1343 && references[ 0 ][ 0 ] != '\0' )
1345 if ( rs->sr_err != LDAP_REFERRAL ) {
1346 Debug( LDAP_DEBUG_ANY,
1347 "%s meta_back_search[%ld]: "
1348 "got referrals with err=%d\n",
1356 for ( cnt = 0; references[ cnt ]; cnt++ )
1359 sr_ref = ber_memalloc_x( sizeof( struct berval ) * ( cnt + 1 ),
1362 for ( cnt = 0; references[ cnt ]; cnt++ ) {
1363 ber_str2bv_x( references[ cnt ], 0, 1, &sr_ref[ cnt ],
1366 BER_BVZERO( &sr_ref[ cnt ] );
1368 ( void )ldap_back_referral_result_rewrite( &dc, sr_ref,
1371 if ( rs->sr_v2ref == NULL ) {
1372 rs->sr_v2ref = sr_ref;
1375 for ( cnt = 0; !BER_BVISNULL( &sr_ref[ cnt ] ); cnt++ ) {
1376 ber_bvarray_add_x( &rs->sr_v2ref, &sr_ref[ cnt ],
1379 ber_memfree_x( sr_ref, op->o_tmpmemctx );
1383 } else if ( rs->sr_err == LDAP_REFERRAL ) {
1384 Debug( LDAP_DEBUG_ANY,
1385 "%s meta_back_search[%ld]: "
1386 "got err=%d with null "
1387 "or empty referrals\n",
1391 rs->sr_err = LDAP_NO_SUCH_OBJECT;
1395 ber_memvfree( (void **)references );
1397 sres = slap_map_api2result( rs );
1399 if ( LogTest( LDAP_DEBUG_TRACE | LDAP_DEBUG_ANY ) ) {
1400 snprintf( buf, sizeof( buf ),
1401 "%s meta_back_search[%ld] "
1402 "match=\"%s\" err=%ld",
1403 op->o_log_prefix, i,
1404 candidates[ i ].sr_matched ? candidates[ i ].sr_matched : "",
1405 (long) candidates[ i ].sr_err );
1406 if ( candidates[ i ].sr_err == LDAP_SUCCESS ) {
1407 Debug( LDAP_DEBUG_TRACE, "%s.\n", buf, 0, 0 );
1410 Debug( LDAP_DEBUG_ANY, "%s (%s).\n",
1411 buf, ldap_err2string( candidates[ i ].sr_err ), 0 );
1416 case LDAP_NO_SUCH_OBJECT:
1417 /* is_ok is touched any time a valid
1418 * (even intermediate) result is
1419 * returned; as a consequence, if
1420 * a candidate returns noSuchObject
1421 * it is ignored and the candidate
1422 * is simply demoted. */
1424 sres = LDAP_SUCCESS;
1433 case LDAP_SIZELIMIT_EXCEEDED:
1434 /* if a target returned sizelimitExceeded
1435 * and the entry count is equal to the
1436 * proxy's limit, the target would have
1437 * returned more, and the error must be
1438 * propagated to the client; otherwise,
1439 * the target enforced a limit lower
1440 * than what requested by the proxy;
1442 candidates[ i ].sr_err = rs->sr_err;
1443 if ( rs->sr_nentries == op->ors_slimit
1444 || META_BACK_ONERR_STOP( mi ) )
1446 const char *save_text = rs->sr_text;
1447 savepriv = op->o_private;
1448 op->o_private = (void *)i;
1449 rs->sr_text = candidates[ i ].sr_text;
1450 send_ldap_result( op, rs );
1451 rs->sr_text = save_text;
1452 op->o_private = savepriv;
1453 ldap_msgfree( res );
1460 candidates[ i ].sr_err = rs->sr_err;
1461 if ( META_BACK_ONERR_STOP( mi ) ) {
1462 const char *save_text = rs->sr_text;
1463 savepriv = op->o_private;
1464 op->o_private = (void *)i;
1465 rs->sr_text = candidates[ i ].sr_text;
1466 send_ldap_result( op, rs );
1467 rs->sr_text = save_text;
1468 op->o_private = savepriv;
1469 ldap_msgfree( res );
1480 * When no candidates are left,
1481 * the outer cycle finishes
1483 assert( ncandidates > 0 );
1486 } else if ( rc == LDAP_RES_BIND ) {
1487 meta_search_candidate_t retcode;
1489 retcode = meta_search_dobind_result( op, rs, &mc, i, candidates, msg );
1490 if ( retcode == META_SEARCH_CANDIDATE ) {
1491 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1492 retcode = meta_back_search_start( op, rs, &dc, &mc, i, candidates );
1495 switch ( retcode ) {
1496 case META_SEARCH_CANDIDATE:
1499 /* means that failed but onerr == continue */
1500 case META_SEARCH_NOT_CANDIDATE:
1501 case META_SEARCH_ERR:
1502 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1503 assert( ncandidates > 0 );
1506 candidates[ i ].sr_err = rs->sr_err;
1507 if ( META_BACK_ONERR_STOP( mi ) ) {
1508 savepriv = op->o_private;
1509 op->o_private = (void *)i;
1510 send_ldap_result( op, rs );
1511 op->o_private = savepriv;
1512 ldap_msgfree( res );
1524 Debug( LDAP_DEBUG_ANY,
1525 "%s meta_back_search[%ld]: "
1526 "unrecognized response message tag=%d\n",
1530 ldap_msgfree( res );
1537 ldap_msgfree( res );
1541 /* check for abandon */
1542 if ( op->o_abandon || LDAP_BACK_CONN_ABANDON( mc ) ) {
1543 for ( i = 0; i < mi->mi_ntargets; i++ ) {
1544 if ( candidates[ i ].sr_msgid >= 0
1545 || candidates[ i ].sr_msgid == META_MSGID_CONNECTING )
1547 if ( META_IS_BINDING( &candidates[ i ] )
1548 || candidates[ i ].sr_msgid == META_MSGID_CONNECTING )
1550 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
1551 if ( LDAP_BACK_CONN_BINDING( &mc->mc_conns[ i ] )
1552 || candidates[ i ].sr_msgid == META_MSGID_CONNECTING )
1554 /* if still binding, destroy */
1557 char buf[ SLAP_TEXT_BUFLEN ];
1559 snprintf( buf, sizeof( buf), "%s meta_back_search(abandon) "
1560 "ldap_unbind_ext[%ld] mc=%p ld=%p",
1561 op->o_log_prefix, i, (void *)mc,
1562 (void *)mc->mc_conns[i].msc_ld );
1564 Debug( LDAP_DEBUG_ANY, "### %s\n", buf, 0, 0 );
1565 #endif /* DEBUG_205 */
1567 meta_clear_one_candidate( op, mc, i );
1569 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
1570 META_BINDING_CLEAR( &candidates[ i ] );
1573 (void)meta_back_cancel( mc, op, rs,
1574 candidates[ i ].sr_msgid, i,
1575 LDAP_BACK_DONTSEND );
1578 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1579 assert( ncandidates > 0 );
1584 if ( op->o_abandon ) {
1588 /* let send_ldap_result play cleanup handlers (ITS#4645) */
1592 /* if no entry was found during this loop,
1593 * set a minimal timeout */
1594 if ( ncandidates > 0 && gotit == 0 ) {
1595 if ( save_tv.tv_sec == 0 && save_tv.tv_usec == 0 ) {
1596 save_tv.tv_usec = LDAP_BACK_RESULT_UTIMEOUT/initial_candidates;
1598 /* arbitrarily limit to something between 1 and 2 minutes */
1599 } else if ( ( stoptime == -1 && save_tv.tv_sec < 60 )
1600 || save_tv.tv_sec < ( stoptime - slap_get_time() ) / ( 2 * ncandidates ) )
1602 /* double the timeout */
1603 lutil_timermul( &save_tv, 2, &save_tv );
1606 if ( alreadybound == 0 ) {
1608 (void)select( 0, NULL, NULL, NULL, &tv );
1611 ldap_pvt_thread_yield();
1618 * FIXME: need a better strategy to handle errors
1621 rc = meta_back_op_result( mc, op, rs, META_TARGET_NONE,
1622 -1, stoptime != -1 ? (stoptime - slap_get_time()) : 0,
1623 LDAP_BACK_SENDERR );
1631 * Rewrite the matched portion of the search base, if required
1633 * FIXME: only the last one gets caught!
1635 savepriv = op->o_private;
1636 op->o_private = (void *)(long)mi->mi_ntargets;
1637 if ( candidate_match > 0 ) {
1638 struct berval pmatched = BER_BVNULL;
1640 /* we use the first one */
1641 for ( i = 0; i < mi->mi_ntargets; i++ ) {
1642 if ( META_IS_CANDIDATE( &candidates[ i ] )
1643 && candidates[ i ].sr_matched != NULL )
1645 struct berval bv, pbv;
1648 /* if we got success, and this target
1649 * returned noSuchObject, and its suffix
1650 * is a superior of the searchBase,
1651 * ignore the matchedDN */
1652 if ( sres == LDAP_SUCCESS
1653 && candidates[ i ].sr_err == LDAP_NO_SUCH_OBJECT
1654 && op->o_req_ndn.bv_len > mi->mi_targets[ i ]->mt_nsuffix.bv_len )
1656 free( (char *)candidates[ i ].sr_matched );
1657 candidates[ i ].sr_matched = NULL;
1661 ber_str2bv( candidates[ i ].sr_matched, 0, 0, &bv );
1662 rc = dnPretty( NULL, &bv, &pbv, op->o_tmpmemctx );
1664 if ( rc == LDAP_SUCCESS ) {
1666 /* NOTE: if they all are superiors
1667 * of the baseDN, the shorter is also
1668 * superior of the longer... */
1669 if ( pbv.bv_len > pmatched.bv_len ) {
1670 if ( !BER_BVISNULL( &pmatched ) ) {
1671 op->o_tmpfree( pmatched.bv_val, op->o_tmpmemctx );
1674 op->o_private = (void *)i;
1677 op->o_tmpfree( pbv.bv_val, op->o_tmpmemctx );
1681 if ( candidates[ i ].sr_matched != NULL ) {
1682 free( (char *)candidates[ i ].sr_matched );
1683 candidates[ i ].sr_matched = NULL;
1688 if ( !BER_BVISNULL( &pmatched ) ) {
1689 matched = pmatched.bv_val;
1692 } else if ( sres == LDAP_NO_SUCH_OBJECT ) {
1693 matched = op->o_bd->be_suffix[ 0 ].bv_val;
1697 * In case we returned at least one entry, we return LDAP_SUCCESS
1698 * otherwise, the latter error code we got
1701 if ( sres == LDAP_SUCCESS ) {
1702 if ( rs->sr_v2ref ) {
1703 sres = LDAP_REFERRAL;
1706 if ( META_BACK_ONERR_REPORT( mi ) ) {
1708 * Report errors, if any
1710 * FIXME: we should handle error codes and return the more
1711 * important/reasonable
1713 for ( i = 0; i < mi->mi_ntargets; i++ ) {
1714 if ( !META_IS_CANDIDATE( &candidates[ i ] ) ) {
1718 if ( candidates[ i ].sr_err != LDAP_SUCCESS
1719 && candidates[ i ].sr_err != LDAP_NO_SUCH_OBJECT )
1721 sres = candidates[ i ].sr_err;
1729 rs->sr_matched = matched;
1730 rs->sr_ref = ( sres == LDAP_REFERRAL ? rs->sr_v2ref : NULL );
1731 send_ldap_result( op, rs );
1732 op->o_private = savepriv;
1733 rs->sr_matched = NULL;
1737 if ( matched && matched != op->o_bd->be_suffix[ 0 ].bv_val ) {
1738 op->o_tmpfree( matched, op->o_tmpmemctx );
1741 if ( rs->sr_v2ref ) {
1742 ber_bvarray_free_x( rs->sr_v2ref, op->o_tmpmemctx );
1745 for ( i = 0; i < mi->mi_ntargets; i++ ) {
1746 if ( !META_IS_CANDIDATE( &candidates[ i ] ) ) {
1751 if ( META_IS_BINDING( &candidates[ i ] )
1752 || candidates[ i ].sr_msgid == META_MSGID_CONNECTING )
1754 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
1755 if ( LDAP_BACK_CONN_BINDING( &mc->mc_conns[ i ] )
1756 || candidates[ i ].sr_msgid == META_MSGID_CONNECTING )
1758 assert( candidates[ i ].sr_msgid >= 0
1759 || candidates[ i ].sr_msgid == META_MSGID_CONNECTING );
1760 assert( mc->mc_conns[ i ].msc_ld != NULL );
1763 Debug( LDAP_DEBUG_ANY, "### %s meta_back_search(cleanup) "
1764 "ldap_unbind_ext[%ld] ld=%p\n",
1765 op->o_log_prefix, i, (void *)mc->mc_conns[i].msc_ld );
1766 #endif /* DEBUG_205 */
1768 /* if still binding, destroy */
1769 meta_clear_one_candidate( op, mc, i );
1771 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
1772 META_BINDING_CLEAR( &candidates[ i ] );
1774 } else if ( candidates[ i ].sr_msgid >= 0 ) {
1775 (void)meta_back_cancel( mc, op, rs,
1776 candidates[ i ].sr_msgid, i,
1777 LDAP_BACK_DONTSEND );
1781 if ( candidates[ i ].sr_matched ) {
1782 free( (char *)candidates[ i ].sr_matched );
1783 candidates[ i ].sr_matched = NULL;
1786 if ( candidates[ i ].sr_text ) {
1787 ldap_memfree( (char *)candidates[ i ].sr_text );
1788 candidates[ i ].sr_text = NULL;
1791 if ( candidates[ i ].sr_ref ) {
1792 ber_bvarray_free( candidates[ i ].sr_ref );
1793 candidates[ i ].sr_ref = NULL;
1796 if ( candidates[ i ].sr_ctrls ) {
1797 ldap_controls_free( candidates[ i ].sr_ctrls );
1798 candidates[ i ].sr_ctrls = NULL;
1801 if ( META_BACK_TGT_QUARANTINE( mi->mi_targets[ i ] ) ) {
1802 meta_back_quarantine( op, &candidates[ i ], i );
1805 /* only in case of timelimit exceeded, if the timelimit exceeded because
1806 * one contacted target never responded, invalidate the connection
1807 * NOTE: should we quarantine the target as well? right now, the connection
1808 * is invalidated; the next time it will be recreated and the target
1809 * will be quarantined if it cannot be contacted */
1810 if ( mi->mi_idle_timeout != 0
1811 && rs->sr_err == LDAP_TIMELIMIT_EXCEEDED
1812 && op->o_time > mc->mc_conns[ i ].msc_time )
1814 /* don't let anyone else use this expired connection */
1820 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
1822 LDAP_BACK_CONN_TAINTED_SET( mc );
1824 meta_back_release_conn_lock( mi, mc, 0 );
1825 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
1839 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
1840 struct berval a, mapped;
1841 int check_duplicate_attrs = 0;
1842 int check_sorted_attrs = 0;
1844 BerElement ber = *e->lm_ber;
1845 Attribute *attr, **attrp;
1854 if ( ber_scanf( &ber, "l{", &len ) == LBER_ERROR ) {
1855 return LDAP_DECODING_ERROR;
1858 if ( ber_set_option( &ber, LBER_OPT_REMAINING_BYTES, &len ) != LBER_OPT_SUCCESS ) {
1862 if ( ber_scanf( &ber, "m{", &bdn ) == LBER_ERROR ) {
1863 return LDAP_DECODING_ERROR;
1867 * Rewrite the dn of the result, if needed
1869 dc.target = mi->mi_targets[ target ];
1870 dc.conn = op->o_conn;
1872 dc.ctx = "searchResult";
1874 rs->sr_err = ldap_back_dn_massage( &dc, &bdn, &dn );
1875 if ( rs->sr_err != LDAP_SUCCESS) {
1880 * Note: this may fail if the target host(s) schema differs
1881 * from the one known to the meta, and a DN with unknown
1882 * attributes is returned.
1884 * FIXME: should we log anything, or delegate to dnNormalize?
1886 rc = dnPrettyNormal( NULL, &dn, &ent.e_name, &ent.e_nname,
1888 if ( dn.bv_val != bdn.bv_val ) {
1893 if ( rc != LDAP_SUCCESS ) {
1894 Debug( LDAP_DEBUG_ANY,
1895 "%s meta_send_entry(\"%s\"): "
1896 "invalid DN syntax\n",
1897 op->o_log_prefix, ent.e_name.bv_val, 0 );
1898 rc = LDAP_INVALID_DN_SYNTAX;
1905 if ( mi->mi_cache.ttl != META_DNCACHE_DISABLED ) {
1906 ( void )meta_dncache_update_entry( &mi->mi_cache,
1907 &ent.e_nname, target );
1910 attrp = &ent.e_attrs;
1912 dc.ctx = "searchAttrDN";
1913 while ( ber_scanf( &ber, "{m", &a ) != LBER_ERROR ) {
1915 slap_syntax_validate_func *validate;
1916 slap_syntax_transform_func *pretty;
1918 if ( ber_pvt_ber_remaining( &ber ) < 0 ) {
1919 Debug( LDAP_DEBUG_ANY,
1920 "%s meta_send_entry(\"%s\"): "
1921 "unable to parse attr \"%s\".\n",
1922 op->o_log_prefix, ent.e_name.bv_val, a.bv_val );
1928 if ( ber_pvt_ber_remaining( &ber ) == 0 ) {
1932 ldap_back_map( &mi->mi_targets[ target ]->mt_rwmap.rwm_at,
1933 &a, &mapped, BACKLDAP_REMAP );
1934 if ( BER_BVISNULL( &mapped ) || mapped.bv_val[0] == '\0' ) {
1935 ( void )ber_scanf( &ber, "x" /* [W] */ );
1938 if ( mapped.bv_val != a.bv_val ) {
1939 /* will need to check for duplicate attrs */
1940 check_duplicate_attrs++;
1942 attr = attr_alloc( NULL );
1943 if ( attr == NULL ) {
1947 if ( slap_bv2ad( &mapped, &attr->a_desc, &text )
1949 if ( slap_bv2undef_ad( &mapped, &attr->a_desc, &text,
1950 SLAP_AD_PROXIED ) != LDAP_SUCCESS )
1952 char buf[ SLAP_TEXT_BUFLEN ];
1954 snprintf( buf, sizeof( buf ),
1955 "%s meta_send_entry(\"%s\"): "
1956 "slap_bv2undef_ad(%s): %s\n",
1957 op->o_log_prefix, ent.e_name.bv_val,
1958 mapped.bv_val, text );
1960 Debug( LDAP_DEBUG_ANY, "%s", buf, 0, 0 );
1961 ( void )ber_scanf( &ber, "x" /* [W] */ );
1967 if ( attr->a_desc->ad_type->sat_flags & SLAP_AT_SORTED_VAL )
1968 check_sorted_attrs = 1;
1970 /* no subschemaSubentry */
1971 if ( attr->a_desc == slap_schema.si_ad_subschemaSubentry
1972 || attr->a_desc == slap_schema.si_ad_entryDN )
1976 * We eat target's subschemaSubentry because
1977 * a search for this value is likely not
1978 * to resolve to the appropriate backend;
1979 * later, the local subschemaSubentry is
1982 * We also eat entryDN because the frontend
1983 * will reattach it without checking if already
1986 ( void )ber_scanf( &ber, "x" /* [W] */ );
1991 if ( ber_scanf( &ber, "[W]", &attr->a_vals ) == LBER_ERROR
1992 || attr->a_vals == NULL )
1994 attr->a_vals = (struct berval *)&slap_dummy_bv;
1997 for ( last = 0; !BER_BVISNULL( &attr->a_vals[ last ] ); ++last )
2000 attr->a_numvals = last;
2002 validate = attr->a_desc->ad_type->sat_syntax->ssyn_validate;
2003 pretty = attr->a_desc->ad_type->sat_syntax->ssyn_pretty;
2005 if ( !validate && !pretty ) {
2010 if ( attr->a_desc == slap_schema.si_ad_objectClass
2011 || attr->a_desc == slap_schema.si_ad_structuralObjectClass )
2015 for ( bv = attr->a_vals; !BER_BVISNULL( bv ); bv++ ) {
2018 ldap_back_map( &mi->mi_targets[ target ]->mt_rwmap.rwm_oc,
2019 bv, &mapped, BACKLDAP_REMAP );
2020 if ( BER_BVISNULL( &mapped ) || mapped.bv_val[0] == '\0') {
2027 *bv = attr->a_vals[ last ];
2028 BER_BVZERO( &attr->a_vals[ last ] );
2031 } else if ( mapped.bv_val != bv->bv_val ) {
2034 for ( i = 0; !BER_BVISNULL( &attr->a_vals[ i ] ); i++ ) {
2035 if ( &attr->a_vals[ i ] == bv ) {
2039 if ( ber_bvstrcasecmp( &mapped, &attr->a_vals[ i ] ) == 0 ) {
2044 if ( !BER_BVISNULL( &attr->a_vals[ i ] ) ) {
2048 ber_bvreplace( bv, &mapped );
2050 } else if ( ( oc = oc_bvfind_undef( bv ) ) == NULL ) {
2054 ber_bvreplace( bv, &oc->soc_cname );
2058 * It is necessary to try to rewrite attributes with
2059 * dn syntax because they might be used in ACLs as
2060 * members of groups; since ACLs are applied to the
2061 * rewritten stuff, no dn-based subecj clause could
2062 * be used at the ldap backend side (see
2063 * http://www.OpenLDAP.org/faq/data/cache/452.html)
2064 * The problem can be overcome by moving the dn-based
2065 * ACLs to the target directory server, and letting
2066 * everything pass thru the ldap backend.
2071 if ( attr->a_desc->ad_type->sat_syntax ==
2072 slap_schema.si_syn_distinguishedName )
2074 ldap_dnattr_result_rewrite( &dc, attr->a_vals );
2076 } else if ( attr->a_desc == slap_schema.si_ad_ref ) {
2077 ldap_back_referral_result_rewrite( &dc, attr->a_vals, NULL );
2081 for ( i = 0; i < last; i++ ) {
2086 rc = ordered_value_pretty( attr->a_desc,
2087 &attr->a_vals[i], &pval, NULL );
2090 rc = ordered_value_validate( attr->a_desc,
2091 &attr->a_vals[i], 0 );
2095 LBER_FREE( attr->a_vals[i].bv_val );
2096 if ( --last == i ) {
2097 BER_BVZERO( &attr->a_vals[ i ] );
2100 attr->a_vals[i] = attr->a_vals[last];
2101 BER_BVZERO( &attr->a_vals[last] );
2107 LBER_FREE( attr->a_vals[i].bv_val );
2108 attr->a_vals[i] = pval;
2112 if ( last == 0 && attr->a_vals != &slap_dummy_bv ) {
2118 if ( last && attr->a_desc->ad_type->sat_equality &&
2119 attr->a_desc->ad_type->sat_equality->smr_normalize )
2123 attr->a_nvals = ch_malloc( ( last + 1 ) * sizeof( struct berval ) );
2124 for ( i = 0; i<last; i++ ) {
2125 /* if normalizer fails, drop this value */
2126 if ( ordered_value_normalize(
2127 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
2129 attr->a_desc->ad_type->sat_equality,
2130 &attr->a_vals[i], &attr->a_nvals[i],
2132 LBER_FREE( attr->a_vals[i].bv_val );
2133 if ( --last == i ) {
2134 BER_BVZERO( &attr->a_vals[ i ] );
2137 attr->a_vals[i] = attr->a_vals[last];
2138 BER_BVZERO( &attr->a_vals[last] );
2142 BER_BVZERO( &attr->a_nvals[i] );
2149 attr->a_nvals = attr->a_vals;
2152 attr->a_numvals = last;
2154 attrp = &attr->a_next;
2158 /* only check if some mapping occurred */
2159 if ( check_duplicate_attrs ) {
2162 for ( ap = &ent.e_attrs; *ap != NULL; ap = &(*ap)->a_next ) {
2165 for ( tap = &(*ap)->a_next; *tap != NULL; ) {
2166 if ( (*tap)->a_desc == (*ap)->a_desc ) {
2168 Modification mod = { 0 };
2169 const char *text = NULL;
2170 char textbuf[ SLAP_TEXT_BUFLEN ];
2171 Attribute *next = (*tap)->a_next;
2173 BER_BVSTR( &e.e_name, "" );
2174 BER_BVSTR( &e.e_nname, "" );
2176 mod.sm_op = LDAP_MOD_ADD;
2177 mod.sm_desc = (*ap)->a_desc;
2178 mod.sm_type = mod.sm_desc->ad_cname;
2179 mod.sm_numvals = (*ap)->a_numvals;
2180 mod.sm_values = (*tap)->a_vals;
2181 if ( (*tap)->a_nvals != (*tap)->a_vals ) {
2182 mod.sm_nvalues = (*tap)->a_nvals;
2185 (void)modify_add_values( &e, &mod,
2187 &text, textbuf, sizeof( textbuf ) );
2189 /* should not insert new attrs! */
2190 assert( e.e_attrs == *ap );
2196 tap = &(*tap)->a_next;
2202 /* Check for sorted attributes */
2203 if ( check_sorted_attrs ) {
2204 for ( attr = ent.e_attrs; attr; attr = attr->a_next ) {
2205 if ( attr->a_desc->ad_type->sat_flags & SLAP_AT_SORTED_VAL ) {
2206 while ( attr->a_numvals > 1 ) {
2208 int rc = slap_sort_vals( (Modifications *)attr, &text, &i, op->o_tmpmemctx );
2209 if ( rc != LDAP_TYPE_OR_VALUE_EXISTS )
2212 /* Strip duplicate values */
2213 if ( attr->a_nvals != attr->a_vals )
2214 LBER_FREE( attr->a_nvals[i].bv_val );
2215 LBER_FREE( attr->a_vals[i].bv_val );
2217 if ( i < attr->a_numvals ) {
2218 attr->a_vals[i] = attr->a_vals[attr->a_numvals];
2219 if ( attr->a_nvals != attr->a_vals )
2220 attr->a_nvals[i] = attr->a_nvals[attr->a_numvals];
2222 BER_BVZERO(&attr->a_vals[attr->a_numvals]);
2223 if ( attr->a_nvals != attr->a_vals )
2224 BER_BVZERO(&attr->a_nvals[attr->a_numvals]);
2226 attr->a_flags |= SLAP_ATTR_SORTED_VALS;
2231 ldap_get_entry_controls( mc->mc_conns[target].msc_ld,
2233 rs->sr_entry = &ent;
2234 rs->sr_attrs = op->ors_attrs;
2235 rs->sr_operational_attrs = NULL;
2236 rs->sr_flags = mi->mi_targets[ target ]->mt_rep_flags;
2237 rs->sr_err = LDAP_SUCCESS;
2238 rc = send_search_entry( op, rs );
2240 case LDAP_UNAVAILABLE:
2246 rs->sr_entry = NULL;
2247 rs->sr_attrs = NULL;
2248 if ( rs->sr_ctrls != NULL ) {
2249 ldap_controls_free( rs->sr_ctrls );
2250 rs->sr_ctrls = NULL;
2252 if ( !BER_BVISNULL( &ent.e_name ) ) {
2253 free( ent.e_name.bv_val );
2254 BER_BVZERO( &ent.e_name );
2256 if ( !BER_BVISNULL( &ent.e_nname ) ) {
2257 free( ent.e_nname.bv_val );
2258 BER_BVZERO( &ent.e_nname );
2260 entry_clean( &ent );