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 );
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 ( META_BACK_TGT_SAVECRED( mt ) && !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 if ( !BER_BVISEMPTY( &binddn ) && BER_BVISEMPTY( &cred ) ) {
236 /* bind anonymously? */
237 Debug( LDAP_DEBUG_ANY, "%s meta_search_dobind_init[%d] mc=%p: "
238 "non-empty dn with empty cred; binding anonymously\n",
239 op->o_log_prefix, candidate, (void *)mc );
240 cred = slap_empty_bv;
242 } else if ( BER_BVISEMPTY( &binddn ) && !BER_BVISEMPTY( &cred ) ) {
244 Debug( LDAP_DEBUG_ANY, "%s meta_search_dobind_init[%d] mc=%p: "
245 "empty dn with non-empty cred: error\n",
246 op->o_log_prefix, candidate, (void *)mc );
250 /* connect must be async only the first time... */
251 ldap_set_option( msc->msc_ld, LDAP_OPT_CONNECT_ASYNC, LDAP_OPT_ON );
254 rc = ldap_sasl_bind( msc->msc_ld, binddn.bv_val, LDAP_SASL_SIMPLE, &cred,
255 NULL, NULL, &candidates[ candidate ].sr_msgid );
259 char buf[ SLAP_TEXT_BUFLEN ];
261 snprintf( buf, sizeof( buf ), "meta_search_dobind_init[%d] mc=%p ld=%p rc=%d",
262 candidate, (void *)mc, (void *)mc->mc_conns[ candidate ].msc_ld, rc );
263 Debug( LDAP_DEBUG_ANY, "### %s %s\n",
264 op->o_log_prefix, buf, 0 );
266 #endif /* DEBUG_205 */
270 assert( candidates[ candidate ].sr_msgid >= 0 );
271 META_BINDING_SET( &candidates[ candidate ] );
272 return META_SEARCH_BINDING;
274 case LDAP_X_CONNECTING:
275 /* must retry, same conn */
276 candidates[ candidate ].sr_msgid = META_MSGID_CONNECTING;
277 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
278 LDAP_BACK_CONN_BINDING_CLEAR( msc );
279 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
280 return META_SEARCH_CONNECTING;
282 case LDAP_SERVER_DOWN:
284 /* This is the worst thing that could happen:
285 * the search will wait until the retry is over. */
286 if ( !META_IS_RETRYING( &candidates[ candidate ] ) ) {
287 META_RETRYING_SET( &candidates[ candidate ] );
289 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
291 assert( mc->mc_refcnt > 0 );
292 if ( LogTest( LDAP_DEBUG_ANY ) ) {
293 char buf[ SLAP_TEXT_BUFLEN ];
295 /* this lock is required; however,
296 * it's invoked only when logging is on */
297 ldap_pvt_thread_mutex_lock( &mt->mt_uri_mutex );
298 snprintf( buf, sizeof( buf ),
299 "retrying URI=\"%s\" DN=\"%s\"",
301 BER_BVISNULL( &msc->msc_bound_ndn ) ?
302 "" : msc->msc_bound_ndn.bv_val );
303 ldap_pvt_thread_mutex_unlock( &mt->mt_uri_mutex );
305 Debug( LDAP_DEBUG_ANY,
306 "%s meta_search_dobind_init[%d]: %s.\n",
307 op->o_log_prefix, candidate, buf );
310 meta_clear_one_candidate( op, mc, candidate );
311 LDAP_BACK_CONN_ISBOUND_CLEAR( msc );
313 ( void )rewrite_session_delete( mt->mt_rwmap.rwm_rw, op->o_conn );
315 /* mc here must be the regular mc, reset and ready for init */
316 rc = meta_back_init_one_conn( op, rs, mc, candidate,
317 LDAP_BACK_CONN_ISPRIV( mc ), LDAP_BACK_DONTSEND, 0 );
319 if ( rc == LDAP_SUCCESS ) {
320 LDAP_BACK_CONN_BINDING_SET( msc );
323 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
325 if ( rc == LDAP_SUCCESS ) {
326 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
331 if ( *mcp == NULL ) {
332 retcode = META_SEARCH_ERR;
333 rs->sr_err = LDAP_UNAVAILABLE;
334 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
342 rc = slap_map_api2result( rs );
344 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
345 meta_clear_one_candidate( op, mc, candidate );
346 candidates[ candidate ].sr_err = rc;
347 if ( META_BACK_ONERR_STOP( mi ) ) {
348 LDAP_BACK_CONN_TAINTED_SET( mc );
349 meta_back_release_conn_lock( mi, mc, 0 );
353 retcode = META_SEARCH_ERR;
356 retcode = META_SEARCH_NOT_CANDIDATE;
358 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
359 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
366 static meta_search_candidate_t
367 meta_search_dobind_result(
372 SlapReply *candidates,
375 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
376 metaconn_t *mc = *mcp;
377 metasingleconn_t *msc = &mc->mc_conns[ candidate ];
379 meta_search_candidate_t retcode = META_SEARCH_NOT_CANDIDATE;
382 assert( msc->msc_ld != NULL );
384 /* FIXME: matched? referrals? response controls? */
385 rc = ldap_parse_result( msc->msc_ld, res,
386 &candidates[ candidate ].sr_err,
387 NULL, NULL, NULL, NULL, 0 );
388 if ( rc != LDAP_SUCCESS ) {
389 candidates[ candidate ].sr_err = rc;
391 rc = slap_map_api2result( &candidates[ candidate ] );
393 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
394 LDAP_BACK_CONN_BINDING_CLEAR( msc );
395 if ( rc != LDAP_SUCCESS ) {
396 meta_clear_one_candidate( op, mc, candidate );
397 candidates[ candidate ].sr_err = rc;
398 if ( META_BACK_ONERR_STOP( mi ) ) {
399 LDAP_BACK_CONN_TAINTED_SET( mc );
400 meta_back_release_conn_lock( mi, mc, 0 );
402 retcode = META_SEARCH_ERR;
407 /* FIXME: check if bound as idassert authcDN! */
408 if ( BER_BVISNULL( &msc->msc_bound_ndn )
409 || BER_BVISEMPTY( &msc->msc_bound_ndn ) )
411 LDAP_BACK_CONN_ISANON_SET( msc );
414 LDAP_BACK_CONN_ISBOUND_SET( msc );
416 retcode = META_SEARCH_CANDIDATE;
418 /* connect must be async */
419 ldap_set_option( msc->msc_ld, LDAP_OPT_CONNECT_ASYNC, LDAP_OPT_OFF );
422 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
423 META_BINDING_CLEAR( &candidates[ candidate ] );
425 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
430 static meta_search_candidate_t
431 meta_back_search_start(
437 SlapReply *candidates )
439 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
440 metatarget_t *mt = mi->mi_targets[ candidate ];
441 metasingleconn_t *msc = &(*mcp)->mc_conns[ candidate ];
442 struct berval realbase = op->o_req_dn;
443 int realscope = op->ors_scope;
444 struct berval mbase = BER_BVNULL;
445 struct berval mfilter = BER_BVNULL;
446 char **mapped_attrs = NULL;
448 meta_search_candidate_t retcode;
449 struct timeval tv, *tvp = NULL;
451 LDAPControl **ctrls = NULL;
453 /* this should not happen; just in case... */
454 if ( msc->msc_ld == NULL ) {
455 Debug( LDAP_DEBUG_ANY,
456 "%s: meta_back_search_start candidate=%d ld=NULL%s.\n",
457 op->o_log_prefix, candidate,
458 META_BACK_ONERR_STOP( mi ) ? "" : " (ignored)" );
459 candidates[ candidate ].sr_err = LDAP_OTHER;
460 if ( META_BACK_ONERR_STOP( mi ) ) {
461 return META_SEARCH_ERR;
463 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
464 return META_SEARCH_NOT_CANDIDATE;
467 Debug( LDAP_DEBUG_TRACE, "%s >>> meta_back_search_start[%d]\n", op->o_log_prefix, candidate, 0 );
470 * modifies the base according to the scope, if required
472 if ( mt->mt_nsuffix.bv_len > op->o_req_ndn.bv_len ) {
473 switch ( op->ors_scope ) {
474 case LDAP_SCOPE_SUBTREE:
476 * make the target suffix the new base
477 * FIXME: this is very forgiving, because
478 * "illegal" searchBases may be turned
479 * into the suffix of the target; however,
480 * the requested searchBase already passed
481 * thru the candidate analyzer...
483 if ( dnIsSuffix( &mt->mt_nsuffix, &op->o_req_ndn ) ) {
484 realbase = mt->mt_nsuffix;
485 if ( mt->mt_scope == LDAP_SCOPE_SUBORDINATE ) {
486 realscope = LDAP_SCOPE_SUBORDINATE;
491 * this target is no longer candidate
493 retcode = META_SEARCH_NOT_CANDIDATE;
498 case LDAP_SCOPE_SUBORDINATE:
499 case LDAP_SCOPE_ONELEVEL:
501 struct berval rdn = mt->mt_nsuffix;
502 rdn.bv_len -= op->o_req_ndn.bv_len + STRLENOF( "," );
503 if ( dnIsOneLevelRDN( &rdn )
504 && dnIsSuffix( &mt->mt_nsuffix, &op->o_req_ndn ) )
507 * if there is exactly one level,
508 * make the target suffix the new
509 * base, and make scope "base"
511 realbase = mt->mt_nsuffix;
512 if ( op->ors_scope == LDAP_SCOPE_SUBORDINATE ) {
513 if ( mt->mt_scope == LDAP_SCOPE_SUBORDINATE ) {
514 realscope = LDAP_SCOPE_SUBORDINATE;
516 realscope = LDAP_SCOPE_SUBTREE;
519 realscope = LDAP_SCOPE_BASE;
522 } /* else continue with the next case */
525 case LDAP_SCOPE_BASE:
527 * this target is no longer candidate
529 retcode = META_SEARCH_NOT_CANDIDATE;
534 /* initiate dobind */
535 retcode = meta_search_dobind_init( op, rs, mcp, candidate, candidates );
537 Debug( LDAP_DEBUG_TRACE, "%s <<< meta_search_dobind_init[%d]=%d\n", op->o_log_prefix, candidate, retcode );
539 if ( retcode != META_SEARCH_CANDIDATE ) {
544 * Rewrite the search base, if required
547 dc->ctx = "searchBase";
548 switch ( ldap_back_dn_massage( dc, &realbase, &mbase ) ) {
552 case LDAP_UNWILLING_TO_PERFORM:
553 rs->sr_err = LDAP_UNWILLING_TO_PERFORM;
554 rs->sr_text = "Operation not allowed";
555 send_ldap_result( op, rs );
556 retcode = META_SEARCH_ERR;
562 * this target is no longer candidate
564 retcode = META_SEARCH_NOT_CANDIDATE;
571 rc = ldap_back_filter_map_rewrite( dc, op->ors_filter,
572 &mfilter, BACKLDAP_MAP, op->o_tmpmemctx );
577 case LDAP_COMPARE_FALSE:
580 * this target is no longer candidate
582 retcode = META_SEARCH_NOT_CANDIDATE;
587 * Maps required attributes
589 rc = ldap_back_map_attrs( op, &mt->mt_rwmap.rwm_at,
590 op->ors_attrs, BACKLDAP_MAP, &mapped_attrs );
591 if ( rc != LDAP_SUCCESS ) {
593 * this target is no longer candidate
595 retcode = META_SEARCH_NOT_CANDIDATE;
599 if ( op->ors_tlimit != SLAP_NO_LIMIT ) {
600 tv.tv_sec = op->ors_tlimit > 0 ? op->ors_tlimit : 1;
607 if ( meta_back_controls_add( op, rs, *mcp, candidate, &ctrls )
610 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
611 retcode = META_SEARCH_NOT_CANDIDATE;
618 assert( msc->msc_ld != NULL );
619 rc = ldap_pvt_search( msc->msc_ld,
620 mbase.bv_val, realscope, mfilter.bv_val,
621 mapped_attrs, op->ors_attrsonly,
622 ctrls, NULL, tvp, op->ors_slimit, op->ors_deref,
623 &candidates[ candidate ].sr_msgid );
626 retcode = META_SEARCH_CANDIDATE;
629 case LDAP_SERVER_DOWN:
630 if ( nretries && meta_back_retry( op, rs, mcp, candidate, LDAP_BACK_DONTSEND ) ) {
632 /* if the identity changed, there might be need to re-authz */
633 (void)mi->mi_ldap_extra->controls_free( op, rs, &ctrls );
637 if ( *mcp == NULL ) {
638 retcode = META_SEARCH_ERR;
639 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
645 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
646 retcode = META_SEARCH_NOT_CANDIDATE;
650 (void)mi->mi_ldap_extra->controls_free( op, rs, &ctrls );
652 if ( mapped_attrs ) {
653 ber_memfree_x( mapped_attrs, op->o_tmpmemctx );
655 if ( mfilter.bv_val != op->ors_filterstr.bv_val ) {
656 ber_memfree_x( mfilter.bv_val, op->o_tmpmemctx );
658 if ( mbase.bv_val != realbase.bv_val ) {
659 free( mbase.bv_val );
663 Debug( LDAP_DEBUG_TRACE, "%s <<< meta_back_search_start[%d]=%d\n", op->o_log_prefix, candidate, retcode );
669 meta_back_search( Operation *op, SlapReply *rs )
671 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
673 struct timeval save_tv = { 0, 0 },
675 time_t stoptime = (time_t)(-1),
676 lastres_time = slap_get_time(),
678 int rc = 0, sres = LDAP_SUCCESS;
679 char *matched = NULL;
680 int last = 0, ncandidates = 0,
681 initial_candidates = 0, candidate_match = 0,
683 ldap_back_send_t sendok = LDAP_BACK_SENDERR;
688 SlapReply *candidates = NULL;
692 * controls are set in ldap_back_dobind()
694 * FIXME: in case of values return filter, we might want
695 * to map attrs and maybe rewrite value
698 mc = meta_back_getconn( op, rs, NULL, sendok );
703 dc.conn = op->o_conn;
706 if ( candidates == NULL ) candidates = meta_back_candidates_get( op );
710 for ( i = 0; i < mi->mi_ntargets; i++ ) {
711 /* reset sr_msgid; it is used in most loops
712 * to check if that target is still to be considered */
713 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
715 /* a target is marked as candidate by meta_back_getconn();
716 * if for any reason (an error, it's over or so) it is
717 * no longer active, sr_msgid is set to META_MSGID_IGNORE
718 * but it remains candidate, which means it has been active
719 * at some point during the operation. This allows to
720 * use its response code and more to compute the final
722 if ( !META_IS_CANDIDATE( &candidates[ i ] ) ) {
726 candidates[ i ].sr_matched = NULL;
727 candidates[ i ].sr_text = NULL;
728 candidates[ i ].sr_ref = NULL;
729 candidates[ i ].sr_ctrls = NULL;
731 /* get largest timeout among candidates */
732 if ( mi->mi_targets[ i ]->mt_timeout[ SLAP_OP_SEARCH ]
733 && mi->mi_targets[ i ]->mt_timeout[ SLAP_OP_SEARCH ] > timeout )
735 timeout = mi->mi_targets[ i ]->mt_timeout[ SLAP_OP_SEARCH ];
739 for ( i = 0; i < mi->mi_ntargets; i++ ) {
740 if ( !META_IS_CANDIDATE( &candidates[ i ] )
741 || candidates[ i ].sr_err != LDAP_SUCCESS )
746 switch ( meta_back_search_start( op, rs, &dc, &mc, i, candidates ) )
748 case META_SEARCH_NOT_CANDIDATE:
749 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
752 case META_SEARCH_NEED_BIND:
756 case META_SEARCH_CONNECTING:
757 case META_SEARCH_CANDIDATE:
758 case META_SEARCH_BINDING:
759 candidates[ i ].sr_type = REP_INTERMEDIATE;
763 case META_SEARCH_ERR:
764 savepriv = op->o_private;
765 op->o_private = (void *)i;
766 send_ldap_result( op, rs );
767 op->o_private = savepriv;
777 if ( ncandidates > 0 && needbind == ncandidates ) {
779 * give up the second time...
781 * NOTE: this should not occur the second time, since a fresh
782 * connection has ben created; however, targets may also
783 * need bind because the bind timed out or so.
785 if ( sendok & LDAP_BACK_BINDING ) {
786 Debug( LDAP_DEBUG_ANY,
787 "%s meta_back_search: unable to initialize conn\n",
788 op->o_log_prefix, 0, 0 );
789 rs->sr_err = LDAP_UNAVAILABLE;
790 rs->sr_text = "unable to initialize connection to remote targets";
791 send_ldap_result( op, rs );
796 /* FIXME: better create a separate connection? */
797 sendok |= LDAP_BACK_BINDING;
800 Debug( LDAP_DEBUG_ANY, "*** %s drop mc=%p create new connection\n",
801 op->o_log_prefix, (void *)mc, 0 );
802 #endif /* DEBUG_205 */
804 meta_back_release_conn( mi, mc );
813 initial_candidates = ncandidates;
815 if ( LogTest( LDAP_DEBUG_TRACE ) ) {
816 char cnd[ SLAP_TEXT_BUFLEN ];
819 for ( c = 0; c < mi->mi_ntargets; c++ ) {
820 if ( META_IS_CANDIDATE( &candidates[ c ] ) ) {
828 Debug( LDAP_DEBUG_TRACE, "%s meta_back_search: ncandidates=%d "
829 "cnd=\"%s\"\n", op->o_log_prefix, ncandidates, cnd );
832 if ( initial_candidates == 0 ) {
833 /* NOTE: here we are not sending any matchedDN;
834 * this is intended, because if the back-meta
835 * is serving this search request, but no valid
836 * candidate could be looked up, it means that
837 * there is a hole in the mapping of the targets
838 * and thus no knowledge of any remote superior
840 Debug( LDAP_DEBUG_ANY, "%s meta_back_search: "
841 "base=\"%s\" scope=%d: "
842 "no candidate could be selected\n",
843 op->o_log_prefix, op->o_req_dn.bv_val,
846 /* FIXME: we're sending the first error we encounter;
847 * maybe we should pick the worst... */
848 rc = LDAP_NO_SUCH_OBJECT;
849 for ( i = 0; i < mi->mi_ntargets; i++ ) {
850 if ( META_IS_CANDIDATE( &candidates[ i ] )
851 && candidates[ i ].sr_err != LDAP_SUCCESS )
853 rc = candidates[ i ].sr_err;
858 send_ldap_error( op, rs, rc, NULL );
863 /* We pull apart the ber result, stuff it into a slapd entry, and
864 * let send_search_entry stuff it back into ber format. Slow & ugly,
865 * but this is necessary for version matching, and for ACL processing.
868 if ( op->ors_tlimit != SLAP_NO_LIMIT ) {
869 stoptime = op->o_time + op->ors_tlimit;
873 * In case there are no candidates, no cycle takes place...
875 * FIXME: we might use a queue, to better balance the load
876 * among the candidates
878 for ( rc = 0; ncandidates > 0; ) {
881 alreadybound = ncandidates;
884 if ( timeout && lastres_time > 0
885 && ( slap_get_time() - lastres_time ) > timeout )
888 rs->sr_text = "Operation timed out";
889 rc = rs->sr_err = op->o_protocol >= LDAP_VERSION3 ?
890 LDAP_ADMINLIMIT_EXCEEDED : LDAP_OTHER;
891 savepriv = op->o_private;
892 op->o_private = (void *)i;
893 send_ldap_result( op, rs );
894 op->o_private = savepriv;
898 /* check time limit */
899 if ( op->ors_tlimit != SLAP_NO_LIMIT
900 && slap_get_time() > stoptime )
903 rc = rs->sr_err = LDAP_TIMELIMIT_EXCEEDED;
904 savepriv = op->o_private;
905 op->o_private = (void *)i;
906 send_ldap_result( op, rs );
907 op->o_private = savepriv;
911 for ( i = 0; i < mi->mi_ntargets; i++ ) {
912 meta_search_candidate_t retcode = META_SEARCH_UNDEFINED;
913 metasingleconn_t *msc = &mc->mc_conns[ i ];
914 LDAPMessage *res = NULL, *msg;
916 /* if msgid is invalid, don't ldap_result() */
917 if ( candidates[ i ].sr_msgid == META_MSGID_IGNORE ) {
921 /* if target still needs bind, retry */
922 if ( candidates[ i ].sr_msgid == META_MSGID_NEED_BIND
923 || candidates[ i ].sr_msgid == META_MSGID_CONNECTING )
925 /* initiate dobind */
926 retcode = meta_search_dobind_init( op, rs, &mc, i, candidates );
928 Debug( LDAP_DEBUG_TRACE, "%s <<< meta_search_dobind_init[%ld]=%d\n",
929 op->o_log_prefix, i, retcode );
932 case META_SEARCH_NEED_BIND:
936 case META_SEARCH_CONNECTING:
937 case META_SEARCH_BINDING:
940 case META_SEARCH_ERR:
941 candidates[ i ].sr_err = rs->sr_err;
942 if ( META_BACK_ONERR_STOP( mi ) ) {
943 savepriv = op->o_private;
944 op->o_private = (void *)i;
945 send_ldap_result( op, rs );
946 op->o_private = savepriv;
951 case META_SEARCH_NOT_CANDIDATE:
953 * When no candidates are left,
954 * the outer cycle finishes
956 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
957 assert( ncandidates > 0 );
961 case META_SEARCH_CANDIDATE:
962 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
963 switch ( meta_back_search_start( op, rs, &dc, &mc, i, candidates ) )
965 case META_SEARCH_CANDIDATE:
966 assert( candidates[ i ].sr_msgid >= 0 );
969 case META_SEARCH_ERR:
970 candidates[ i ].sr_err = rs->sr_err;
971 if ( META_BACK_ONERR_STOP( mi ) ) {
972 savepriv = op->o_private;
973 op->o_private = (void *)i;
974 send_ldap_result( op, rs );
975 op->o_private = savepriv;
980 case META_SEARCH_NOT_CANDIDATE:
981 /* means that meta_back_search_start()
982 * failed but onerr == continue */
983 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
984 assert( ncandidates > 0 );
1003 /* check for abandon */
1004 if ( op->o_abandon || LDAP_BACK_CONN_ABANDON( mc ) ) {
1009 if ( msc->msc_ld == NULL ) {
1010 char buf[ SLAP_TEXT_BUFLEN ];
1012 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
1013 snprintf( buf, sizeof( buf ),
1014 "%s meta_back_search[%ld] mc=%p msgid=%d%s%s%s\n",
1015 op->o_log_prefix, (long)i, (void *)mc,
1016 candidates[ i ].sr_msgid,
1017 META_IS_BINDING( &candidates[ i ] ) ? " binding" : "",
1018 LDAP_BACK_CONN_BINDING( &mc->mc_conns[ i ] ) ? " connbinding" : "",
1019 META_BACK_CONN_CREATING( &mc->mc_conns[ i ] ) ? " conncreating" : "" );
1020 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
1022 Debug( LDAP_DEBUG_ANY, "!!! %s\n", buf, 0, 0 );
1024 #endif /* DEBUG_205 */
1027 * FIXME: handle time limit as well?
1028 * Note that target servers are likely
1029 * to handle it, so at some time we'll
1030 * get a LDAP_TIMELIMIT_EXCEEDED from
1034 rc = ldap_result( msc->msc_ld, candidates[ i ].sr_msgid,
1035 LDAP_MSG_RECEIVED, &tv, &res );
1038 /* FIXME: res should not need to be freed */
1039 assert( res == NULL );
1044 /* something REALLY bad happened! */
1045 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
1046 candidates[ i ].sr_type = REP_RESULT;
1048 if ( meta_back_retry( op, rs, &mc, i, LDAP_BACK_DONTSEND ) ) {
1049 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1050 switch ( meta_back_search_start( op, rs, &dc, &mc, i, candidates ) )
1052 /* means that failed but onerr == continue */
1053 case META_SEARCH_NOT_CANDIDATE:
1054 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1056 assert( ncandidates > 0 );
1059 candidates[ i ].sr_err = rs->sr_err;
1060 if ( META_BACK_ONERR_STOP( mi ) ) {
1061 savepriv = op->o_private;
1062 op->o_private = (void *)i;
1063 send_ldap_result( op, rs );
1064 op->o_private = savepriv;
1069 case META_SEARCH_CANDIDATE:
1070 /* get back into business... */
1073 case META_SEARCH_BINDING:
1074 case META_SEARCH_CONNECTING:
1075 case META_SEARCH_NEED_BIND:
1076 case META_SEARCH_UNDEFINED:
1080 /* unrecoverable error */
1081 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1082 rc = rs->sr_err = LDAP_OTHER;
1087 candidates[ i ].sr_err = rs->sr_err;
1088 if ( META_BACK_ONERR_STOP( mi ) ) {
1089 savepriv = op->o_private;
1090 op->o_private = (void *)i;
1091 send_ldap_result( op, rs );
1092 op->o_private = savepriv;
1098 * When no candidates are left,
1099 * the outer cycle finishes
1101 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1102 assert( ncandidates > 0 );
1104 rs->sr_err = candidates[ i ].sr_err;
1108 lastres_time = slap_get_time();
1110 /* only touch when activity actually took place... */
1111 if ( mi->mi_idle_timeout != 0 && msc->msc_time < lastres_time ) {
1112 msc->msc_time = lastres_time;
1117 for ( msg = ldap_first_message( msc->msc_ld, res );
1119 msg = ldap_next_message( msc->msc_ld, msg ) )
1121 rc = ldap_msgtype( msg );
1122 if ( rc == LDAP_RES_SEARCH_ENTRY ) {
1125 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
1126 /* don't retry any more... */
1127 candidates[ i ].sr_type = REP_RESULT;
1132 e = ldap_first_entry( msc->msc_ld, msg );
1133 savepriv = op->o_private;
1134 op->o_private = (void *)i;
1135 rs->sr_err = meta_send_entry( op, rs, mc, i, e );
1137 switch ( rs->sr_err ) {
1138 case LDAP_SIZELIMIT_EXCEEDED:
1139 savepriv = op->o_private;
1140 op->o_private = (void *)i;
1141 send_ldap_result( op, rs );
1142 op->o_private = savepriv;
1143 rs->sr_err = LDAP_SUCCESS;
1144 ldap_msgfree( res );
1148 case LDAP_UNAVAILABLE:
1149 rs->sr_err = LDAP_OTHER;
1150 ldap_msgfree( res );
1154 op->o_private = savepriv;
1156 /* don't wait any longer... */
1159 save_tv.tv_usec = 0;
1161 } else if ( rc == LDAP_RES_SEARCH_REFERENCE ) {
1162 char **references = NULL;
1165 if ( META_BACK_TGT_NOREFS( mi->mi_targets[ i ] ) ) {
1169 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
1170 /* don't retry any more... */
1171 candidates[ i ].sr_type = REP_RESULT;
1176 rc = ldap_parse_reference( msc->msc_ld, msg,
1177 &references, &rs->sr_ctrls, 0 );
1179 if ( rc != LDAP_SUCCESS ) {
1183 if ( references == NULL ) {
1187 #ifdef ENABLE_REWRITE
1188 dc.ctx = "referralDN";
1189 #else /* ! ENABLE_REWRITE */
1192 #endif /* ! ENABLE_REWRITE */
1194 /* FIXME: merge all and return at the end */
1196 for ( cnt = 0; references[ cnt ]; cnt++ )
1199 rs->sr_ref = ber_memalloc_x( sizeof( struct berval ) * ( cnt + 1 ),
1202 for ( cnt = 0; references[ cnt ]; cnt++ ) {
1203 ber_str2bv_x( references[ cnt ], 0, 1, &rs->sr_ref[ cnt ],
1206 BER_BVZERO( &rs->sr_ref[ cnt ] );
1208 ( void )ldap_back_referral_result_rewrite( &dc, rs->sr_ref,
1211 if ( rs->sr_ref != NULL && !BER_BVISNULL( &rs->sr_ref[ 0 ] ) ) {
1212 /* ignore return value by now */
1213 savepriv = op->o_private;
1214 op->o_private = (void *)i;
1215 ( void )send_search_reference( op, rs );
1216 op->o_private = savepriv;
1218 ber_bvarray_free_x( rs->sr_ref, op->o_tmpmemctx );
1224 ber_memvfree( (void **)references );
1227 if ( rs->sr_ctrls ) {
1228 ldap_controls_free( rs->sr_ctrls );
1229 rs->sr_ctrls = NULL;
1232 } else if ( rc == LDAP_RES_INTERMEDIATE ) {
1233 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
1234 /* don't retry any more... */
1235 candidates[ i ].sr_type = REP_RESULT;
1238 /* FIXME: response controls
1239 * are passed without checks */
1240 rs->sr_err = ldap_parse_intermediate( msc->msc_ld,
1242 (char **)&rs->sr_rspoid,
1246 if ( rs->sr_err != LDAP_SUCCESS ) {
1247 candidates[ i ].sr_type = REP_RESULT;
1248 ldap_msgfree( res );
1253 slap_send_ldap_intermediate( op, rs );
1255 if ( rs->sr_rspoid != NULL ) {
1256 ber_memfree( (char *)rs->sr_rspoid );
1257 rs->sr_rspoid = NULL;
1260 if ( rs->sr_rspdata != NULL ) {
1261 ber_bvfree( rs->sr_rspdata );
1262 rs->sr_rspdata = NULL;
1265 if ( rs->sr_ctrls != NULL ) {
1266 ldap_controls_free( rs->sr_ctrls );
1267 rs->sr_ctrls = NULL;
1270 } else if ( rc == LDAP_RES_SEARCH_RESULT ) {
1271 char buf[ SLAP_TEXT_BUFLEN ];
1272 char **references = NULL;
1274 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
1275 /* don't retry any more... */
1276 candidates[ i ].sr_type = REP_RESULT;
1279 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1281 /* NOTE: ignores response controls
1282 * (and intermediate response controls
1283 * as well, except for those with search
1284 * references); this may not be correct,
1285 * but if they're not ignored then
1286 * back-meta would need to merge them
1287 * consistently (think of pagedResults...)
1289 /* FIXME: response controls? */
1290 rs->sr_err = ldap_parse_result( msc->msc_ld,
1292 &candidates[ i ].sr_err,
1293 (char **)&candidates[ i ].sr_matched,
1294 (char **)&candidates[ i ].sr_text,
1296 NULL /* &candidates[ i ].sr_ctrls (unused) */ ,
1298 if ( rs->sr_err != LDAP_SUCCESS ) {
1299 candidates[ i ].sr_err = rs->sr_err;
1300 sres = slap_map_api2result( &candidates[ i ] );
1301 candidates[ i ].sr_type = REP_RESULT;
1302 ldap_msgfree( res );
1307 rs->sr_err = candidates[ i ].sr_err;
1309 /* massage matchedDN if need be */
1310 if ( candidates[ i ].sr_matched != NULL ) {
1311 struct berval match, mmatch;
1313 ber_str2bv( candidates[ i ].sr_matched,
1315 candidates[ i ].sr_matched = NULL;
1317 dc.ctx = "matchedDN";
1318 dc.target = mi->mi_targets[ i ];
1319 if ( !ldap_back_dn_massage( &dc, &match, &mmatch ) ) {
1320 if ( mmatch.bv_val == match.bv_val ) {
1321 candidates[ i ].sr_matched
1322 = ch_strdup( mmatch.bv_val );
1325 candidates[ i ].sr_matched = mmatch.bv_val;
1330 ldap_memfree( match.bv_val );
1333 /* add references to array */
1334 /* RFC 4511: referrals can only appear
1335 * if result code is LDAP_REFERRAL */
1336 if ( references != NULL
1337 && references[ 0 ] != NULL
1338 && references[ 0 ][ 0 ] != '\0' )
1340 if ( rs->sr_err != LDAP_REFERRAL ) {
1341 Debug( LDAP_DEBUG_ANY,
1342 "%s meta_back_search[%ld]: "
1343 "got referrals with err=%d\n",
1351 for ( cnt = 0; references[ cnt ]; cnt++ )
1354 sr_ref = ber_memalloc_x( sizeof( struct berval ) * ( cnt + 1 ),
1357 for ( cnt = 0; references[ cnt ]; cnt++ ) {
1358 ber_str2bv_x( references[ cnt ], 0, 1, &sr_ref[ cnt ],
1361 BER_BVZERO( &sr_ref[ cnt ] );
1363 ( void )ldap_back_referral_result_rewrite( &dc, sr_ref,
1366 if ( rs->sr_v2ref == NULL ) {
1367 rs->sr_v2ref = sr_ref;
1370 for ( cnt = 0; !BER_BVISNULL( &sr_ref[ cnt ] ); cnt++ ) {
1371 ber_bvarray_add_x( &rs->sr_v2ref, &sr_ref[ cnt ],
1374 ber_memfree_x( sr_ref, op->o_tmpmemctx );
1378 } else if ( rs->sr_err == LDAP_REFERRAL ) {
1379 Debug( LDAP_DEBUG_ANY,
1380 "%s meta_back_search[%ld]: "
1381 "got err=%d with null "
1382 "or empty referrals\n",
1386 rs->sr_err = LDAP_NO_SUCH_OBJECT;
1390 ber_memvfree( (void **)references );
1392 sres = slap_map_api2result( rs );
1394 if ( LogTest( LDAP_DEBUG_TRACE | LDAP_DEBUG_ANY ) ) {
1395 snprintf( buf, sizeof( buf ),
1396 "%s meta_back_search[%ld] "
1397 "match=\"%s\" err=%ld",
1398 op->o_log_prefix, i,
1399 candidates[ i ].sr_matched ? candidates[ i ].sr_matched : "",
1400 (long) candidates[ i ].sr_err );
1401 if ( candidates[ i ].sr_err == LDAP_SUCCESS ) {
1402 Debug( LDAP_DEBUG_TRACE, "%s.\n", buf, 0, 0 );
1405 Debug( LDAP_DEBUG_ANY, "%s (%s).\n",
1406 buf, ldap_err2string( candidates[ i ].sr_err ), 0 );
1411 case LDAP_NO_SUCH_OBJECT:
1412 /* is_ok is touched any time a valid
1413 * (even intermediate) result is
1414 * returned; as a consequence, if
1415 * a candidate returns noSuchObject
1416 * it is ignored and the candidate
1417 * is simply demoted. */
1419 sres = LDAP_SUCCESS;
1428 case LDAP_SIZELIMIT_EXCEEDED:
1429 /* if a target returned sizelimitExceeded
1430 * and the entry count is equal to the
1431 * proxy's limit, the target would have
1432 * returned more, and the error must be
1433 * propagated to the client; otherwise,
1434 * the target enforced a limit lower
1435 * than what requested by the proxy;
1437 candidates[ i ].sr_err = rs->sr_err;
1438 if ( rs->sr_nentries == op->ors_slimit
1439 || META_BACK_ONERR_STOP( mi ) )
1441 const char *save_text = rs->sr_text;
1442 savepriv = op->o_private;
1443 op->o_private = (void *)i;
1444 rs->sr_text = candidates[ i ].sr_text;
1445 send_ldap_result( op, rs );
1446 rs->sr_text = save_text;
1447 op->o_private = savepriv;
1448 ldap_msgfree( res );
1455 candidates[ i ].sr_err = rs->sr_err;
1456 if ( META_BACK_ONERR_STOP( mi ) ) {
1457 const char *save_text = rs->sr_text;
1458 savepriv = op->o_private;
1459 op->o_private = (void *)i;
1460 rs->sr_text = candidates[ i ].sr_text;
1461 send_ldap_result( op, rs );
1462 rs->sr_text = save_text;
1463 op->o_private = savepriv;
1464 ldap_msgfree( res );
1475 * When no candidates are left,
1476 * the outer cycle finishes
1478 assert( ncandidates > 0 );
1481 } else if ( rc == LDAP_RES_BIND ) {
1482 meta_search_candidate_t retcode;
1484 retcode = meta_search_dobind_result( op, rs, &mc, i, candidates, msg );
1485 if ( retcode == META_SEARCH_CANDIDATE ) {
1486 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1487 retcode = meta_back_search_start( op, rs, &dc, &mc, i, candidates );
1490 switch ( retcode ) {
1491 case META_SEARCH_CANDIDATE:
1494 /* means that failed but onerr == continue */
1495 case META_SEARCH_NOT_CANDIDATE:
1496 case META_SEARCH_ERR:
1497 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1498 assert( ncandidates > 0 );
1501 candidates[ i ].sr_err = rs->sr_err;
1502 if ( META_BACK_ONERR_STOP( mi ) ) {
1503 savepriv = op->o_private;
1504 op->o_private = (void *)i;
1505 send_ldap_result( op, rs );
1506 op->o_private = savepriv;
1507 ldap_msgfree( res );
1519 Debug( LDAP_DEBUG_ANY,
1520 "%s meta_back_search[%ld]: "
1521 "unrecognized response message tag=%d\n",
1525 ldap_msgfree( res );
1532 ldap_msgfree( res );
1536 /* check for abandon */
1537 if ( op->o_abandon || LDAP_BACK_CONN_ABANDON( mc ) ) {
1538 for ( i = 0; i < mi->mi_ntargets; i++ ) {
1539 if ( candidates[ i ].sr_msgid >= 0
1540 || candidates[ i ].sr_msgid == META_MSGID_CONNECTING )
1542 if ( META_IS_BINDING( &candidates[ i ] )
1543 || candidates[ i ].sr_msgid == META_MSGID_CONNECTING )
1545 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
1546 if ( LDAP_BACK_CONN_BINDING( &mc->mc_conns[ i ] )
1547 || candidates[ i ].sr_msgid == META_MSGID_CONNECTING )
1549 /* if still binding, destroy */
1552 char buf[ SLAP_TEXT_BUFLEN ];
1554 snprintf( buf, sizeof( buf), "%s meta_back_search(abandon) "
1555 "ldap_unbind_ext[%ld] mc=%p ld=%p",
1556 op->o_log_prefix, i, (void *)mc,
1557 (void *)mc->mc_conns[i].msc_ld );
1559 Debug( LDAP_DEBUG_ANY, "### %s\n", buf, 0, 0 );
1560 #endif /* DEBUG_205 */
1562 meta_clear_one_candidate( op, mc, i );
1564 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
1565 META_BINDING_CLEAR( &candidates[ i ] );
1568 (void)meta_back_cancel( mc, op, rs,
1569 candidates[ i ].sr_msgid, i,
1570 LDAP_BACK_DONTSEND );
1573 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1574 assert( ncandidates > 0 );
1579 if ( op->o_abandon ) {
1583 /* let send_ldap_result play cleanup handlers (ITS#4645) */
1587 /* if no entry was found during this loop,
1588 * set a minimal timeout */
1589 if ( ncandidates > 0 && gotit == 0 ) {
1590 if ( save_tv.tv_sec == 0 && save_tv.tv_usec == 0 ) {
1591 save_tv.tv_usec = LDAP_BACK_RESULT_UTIMEOUT/initial_candidates;
1593 /* arbitrarily limit to something between 1 and 2 minutes */
1594 } else if ( ( stoptime == -1 && save_tv.tv_sec < 60 )
1595 || save_tv.tv_sec < ( stoptime - slap_get_time() ) / ( 2 * ncandidates ) )
1597 /* double the timeout */
1598 lutil_timermul( &save_tv, 2, &save_tv );
1601 if ( alreadybound == 0 ) {
1603 (void)select( 0, NULL, NULL, NULL, &tv );
1606 ldap_pvt_thread_yield();
1613 * FIXME: need a better strategy to handle errors
1616 rc = meta_back_op_result( mc, op, rs, META_TARGET_NONE,
1617 -1, stoptime != -1 ? (stoptime - slap_get_time()) : 0,
1618 LDAP_BACK_SENDERR );
1626 * Rewrite the matched portion of the search base, if required
1628 * FIXME: only the last one gets caught!
1630 savepriv = op->o_private;
1631 op->o_private = (void *)(long)mi->mi_ntargets;
1632 if ( candidate_match > 0 ) {
1633 struct berval pmatched = BER_BVNULL;
1635 /* we use the first one */
1636 for ( i = 0; i < mi->mi_ntargets; i++ ) {
1637 if ( META_IS_CANDIDATE( &candidates[ i ] )
1638 && candidates[ i ].sr_matched != NULL )
1640 struct berval bv, pbv;
1643 /* if we got success, and this target
1644 * returned noSuchObject, and its suffix
1645 * is a superior of the searchBase,
1646 * ignore the matchedDN */
1647 if ( sres == LDAP_SUCCESS
1648 && candidates[ i ].sr_err == LDAP_NO_SUCH_OBJECT
1649 && op->o_req_ndn.bv_len > mi->mi_targets[ i ]->mt_nsuffix.bv_len )
1651 free( (char *)candidates[ i ].sr_matched );
1652 candidates[ i ].sr_matched = NULL;
1656 ber_str2bv( candidates[ i ].sr_matched, 0, 0, &bv );
1657 rc = dnPretty( NULL, &bv, &pbv, op->o_tmpmemctx );
1659 if ( rc == LDAP_SUCCESS ) {
1661 /* NOTE: if they all are superiors
1662 * of the baseDN, the shorter is also
1663 * superior of the longer... */
1664 if ( pbv.bv_len > pmatched.bv_len ) {
1665 if ( !BER_BVISNULL( &pmatched ) ) {
1666 op->o_tmpfree( pmatched.bv_val, op->o_tmpmemctx );
1669 op->o_private = (void *)i;
1672 op->o_tmpfree( pbv.bv_val, op->o_tmpmemctx );
1676 if ( candidates[ i ].sr_matched != NULL ) {
1677 free( (char *)candidates[ i ].sr_matched );
1678 candidates[ i ].sr_matched = NULL;
1683 if ( !BER_BVISNULL( &pmatched ) ) {
1684 matched = pmatched.bv_val;
1687 } else if ( sres == LDAP_NO_SUCH_OBJECT ) {
1688 matched = op->o_bd->be_suffix[ 0 ].bv_val;
1692 * In case we returned at least one entry, we return LDAP_SUCCESS
1693 * otherwise, the latter error code we got
1696 if ( sres == LDAP_SUCCESS ) {
1697 if ( rs->sr_v2ref ) {
1698 sres = LDAP_REFERRAL;
1701 if ( META_BACK_ONERR_REPORT( mi ) ) {
1703 * Report errors, if any
1705 * FIXME: we should handle error codes and return the more
1706 * important/reasonable
1708 for ( i = 0; i < mi->mi_ntargets; i++ ) {
1709 if ( !META_IS_CANDIDATE( &candidates[ i ] ) ) {
1713 if ( candidates[ i ].sr_err != LDAP_SUCCESS
1714 && candidates[ i ].sr_err != LDAP_NO_SUCH_OBJECT )
1716 sres = candidates[ i ].sr_err;
1724 rs->sr_matched = matched;
1725 rs->sr_ref = ( sres == LDAP_REFERRAL ? rs->sr_v2ref : NULL );
1726 send_ldap_result( op, rs );
1727 op->o_private = savepriv;
1728 rs->sr_matched = NULL;
1732 if ( matched && matched != op->o_bd->be_suffix[ 0 ].bv_val ) {
1733 op->o_tmpfree( matched, op->o_tmpmemctx );
1736 if ( rs->sr_v2ref ) {
1737 ber_bvarray_free_x( rs->sr_v2ref, op->o_tmpmemctx );
1740 for ( i = 0; i < mi->mi_ntargets; i++ ) {
1741 if ( !META_IS_CANDIDATE( &candidates[ i ] ) ) {
1746 if ( META_IS_BINDING( &candidates[ i ] )
1747 || candidates[ i ].sr_msgid == META_MSGID_CONNECTING )
1749 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
1750 if ( LDAP_BACK_CONN_BINDING( &mc->mc_conns[ i ] )
1751 || candidates[ i ].sr_msgid == META_MSGID_CONNECTING )
1753 assert( candidates[ i ].sr_msgid >= 0
1754 || candidates[ i ].sr_msgid == META_MSGID_CONNECTING );
1755 assert( mc->mc_conns[ i ].msc_ld != NULL );
1758 Debug( LDAP_DEBUG_ANY, "### %s meta_back_search(cleanup) "
1759 "ldap_unbind_ext[%ld] ld=%p\n",
1760 op->o_log_prefix, i, (void *)mc->mc_conns[i].msc_ld );
1761 #endif /* DEBUG_205 */
1763 /* if still binding, destroy */
1764 meta_clear_one_candidate( op, mc, i );
1766 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
1767 META_BINDING_CLEAR( &candidates[ i ] );
1769 } else if ( candidates[ i ].sr_msgid >= 0 ) {
1770 (void)meta_back_cancel( mc, op, rs,
1771 candidates[ i ].sr_msgid, i,
1772 LDAP_BACK_DONTSEND );
1776 if ( candidates[ i ].sr_matched ) {
1777 free( (char *)candidates[ i ].sr_matched );
1778 candidates[ i ].sr_matched = NULL;
1781 if ( candidates[ i ].sr_text ) {
1782 ldap_memfree( (char *)candidates[ i ].sr_text );
1783 candidates[ i ].sr_text = NULL;
1786 if ( candidates[ i ].sr_ref ) {
1787 ber_bvarray_free( candidates[ i ].sr_ref );
1788 candidates[ i ].sr_ref = NULL;
1791 if ( candidates[ i ].sr_ctrls ) {
1792 ldap_controls_free( candidates[ i ].sr_ctrls );
1793 candidates[ i ].sr_ctrls = NULL;
1796 if ( META_BACK_TGT_QUARANTINE( mi->mi_targets[ i ] ) ) {
1797 meta_back_quarantine( op, &candidates[ i ], i );
1800 /* only in case of timelimit exceeded, if the timelimit exceeded because
1801 * one contacted target never responded, invalidate the connection
1802 * NOTE: should we quarantine the target as well? right now, the connection
1803 * is invalidated; the next time it will be recreated and the target
1804 * will be quarantined if it cannot be contacted */
1805 if ( mi->mi_idle_timeout != 0
1806 && rs->sr_err == LDAP_TIMELIMIT_EXCEEDED
1807 && op->o_time > mc->mc_conns[ i ].msc_time )
1809 /* don't let anyone else use this expired connection */
1815 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
1817 LDAP_BACK_CONN_TAINTED_SET( mc );
1819 meta_back_release_conn_lock( mi, mc, 0 );
1820 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
1834 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
1835 struct berval a, mapped;
1836 int check_duplicate_attrs = 0;
1837 int check_sorted_attrs = 0;
1839 BerElement ber = *e->lm_ber;
1840 Attribute *attr, **attrp;
1849 if ( ber_scanf( &ber, "l{", &len ) == LBER_ERROR ) {
1850 return LDAP_DECODING_ERROR;
1853 if ( ber_set_option( &ber, LBER_OPT_REMAINING_BYTES, &len ) != LBER_OPT_SUCCESS ) {
1857 if ( ber_scanf( &ber, "m{", &bdn ) == LBER_ERROR ) {
1858 return LDAP_DECODING_ERROR;
1862 * Rewrite the dn of the result, if needed
1864 dc.target = mi->mi_targets[ target ];
1865 dc.conn = op->o_conn;
1867 dc.ctx = "searchResult";
1869 rs->sr_err = ldap_back_dn_massage( &dc, &bdn, &dn );
1870 if ( rs->sr_err != LDAP_SUCCESS) {
1875 * Note: this may fail if the target host(s) schema differs
1876 * from the one known to the meta, and a DN with unknown
1877 * attributes is returned.
1879 * FIXME: should we log anything, or delegate to dnNormalize?
1881 rc = dnPrettyNormal( NULL, &dn, &ent.e_name, &ent.e_nname,
1883 if ( dn.bv_val != bdn.bv_val ) {
1888 if ( rc != LDAP_SUCCESS ) {
1889 Debug( LDAP_DEBUG_ANY,
1890 "%s meta_send_entry(\"%s\"): "
1891 "invalid DN syntax\n",
1892 op->o_log_prefix, ent.e_name.bv_val, 0 );
1893 rc = LDAP_INVALID_DN_SYNTAX;
1900 if ( mi->mi_cache.ttl != META_DNCACHE_DISABLED ) {
1901 ( void )meta_dncache_update_entry( &mi->mi_cache,
1902 &ent.e_nname, target );
1905 attrp = &ent.e_attrs;
1907 dc.ctx = "searchAttrDN";
1908 while ( ber_scanf( &ber, "{m", &a ) != LBER_ERROR ) {
1910 slap_syntax_validate_func *validate;
1911 slap_syntax_transform_func *pretty;
1913 if ( ber_pvt_ber_remaining( &ber ) < 0 ) {
1914 Debug( LDAP_DEBUG_ANY,
1915 "%s meta_send_entry(\"%s\"): "
1916 "unable to parse attr \"%s\".\n",
1917 op->o_log_prefix, ent.e_name.bv_val, a.bv_val );
1923 if ( ber_pvt_ber_remaining( &ber ) == 0 ) {
1927 ldap_back_map( &mi->mi_targets[ target ]->mt_rwmap.rwm_at,
1928 &a, &mapped, BACKLDAP_REMAP );
1929 if ( BER_BVISNULL( &mapped ) || mapped.bv_val[0] == '\0' ) {
1930 ( void )ber_scanf( &ber, "x" /* [W] */ );
1933 if ( mapped.bv_val != a.bv_val ) {
1934 /* will need to check for duplicate attrs */
1935 check_duplicate_attrs++;
1937 attr = attr_alloc( NULL );
1938 if ( attr == NULL ) {
1942 if ( slap_bv2ad( &mapped, &attr->a_desc, &text )
1944 if ( slap_bv2undef_ad( &mapped, &attr->a_desc, &text,
1945 SLAP_AD_PROXIED ) != LDAP_SUCCESS )
1947 char buf[ SLAP_TEXT_BUFLEN ];
1949 snprintf( buf, sizeof( buf ),
1950 "%s meta_send_entry(\"%s\"): "
1951 "slap_bv2undef_ad(%s): %s\n",
1952 op->o_log_prefix, ent.e_name.bv_val,
1953 mapped.bv_val, text );
1955 Debug( LDAP_DEBUG_ANY, "%s", buf, 0, 0 );
1956 ( void )ber_scanf( &ber, "x" /* [W] */ );
1962 if ( attr->a_desc->ad_type->sat_flags & SLAP_AT_SORTED_VAL )
1963 check_sorted_attrs = 1;
1965 /* no subschemaSubentry */
1966 if ( attr->a_desc == slap_schema.si_ad_subschemaSubentry
1967 || attr->a_desc == slap_schema.si_ad_entryDN )
1971 * We eat target's subschemaSubentry because
1972 * a search for this value is likely not
1973 * to resolve to the appropriate backend;
1974 * later, the local subschemaSubentry is
1977 * We also eat entryDN because the frontend
1978 * will reattach it without checking if already
1981 ( void )ber_scanf( &ber, "x" /* [W] */ );
1986 if ( ber_scanf( &ber, "[W]", &attr->a_vals ) == LBER_ERROR
1987 || attr->a_vals == NULL )
1989 attr->a_vals = (struct berval *)&slap_dummy_bv;
1992 for ( last = 0; !BER_BVISNULL( &attr->a_vals[ last ] ); ++last )
1995 attr->a_numvals = last;
1997 validate = attr->a_desc->ad_type->sat_syntax->ssyn_validate;
1998 pretty = attr->a_desc->ad_type->sat_syntax->ssyn_pretty;
2000 if ( !validate && !pretty ) {
2005 if ( attr->a_desc == slap_schema.si_ad_objectClass
2006 || attr->a_desc == slap_schema.si_ad_structuralObjectClass )
2010 for ( bv = attr->a_vals; !BER_BVISNULL( bv ); bv++ ) {
2013 ldap_back_map( &mi->mi_targets[ target ]->mt_rwmap.rwm_oc,
2014 bv, &mapped, BACKLDAP_REMAP );
2015 if ( BER_BVISNULL( &mapped ) || mapped.bv_val[0] == '\0') {
2022 *bv = attr->a_vals[ last ];
2023 BER_BVZERO( &attr->a_vals[ last ] );
2026 } else if ( mapped.bv_val != bv->bv_val ) {
2029 for ( i = 0; !BER_BVISNULL( &attr->a_vals[ i ] ); i++ ) {
2030 if ( &attr->a_vals[ i ] == bv ) {
2034 if ( ber_bvstrcasecmp( &mapped, &attr->a_vals[ i ] ) == 0 ) {
2039 if ( !BER_BVISNULL( &attr->a_vals[ i ] ) ) {
2043 ber_bvreplace( bv, &mapped );
2045 } else if ( ( oc = oc_bvfind_undef( bv ) ) == NULL ) {
2049 ber_bvreplace( bv, &oc->soc_cname );
2053 * It is necessary to try to rewrite attributes with
2054 * dn syntax because they might be used in ACLs as
2055 * members of groups; since ACLs are applied to the
2056 * rewritten stuff, no dn-based subecj clause could
2057 * be used at the ldap backend side (see
2058 * http://www.OpenLDAP.org/faq/data/cache/452.html)
2059 * The problem can be overcome by moving the dn-based
2060 * ACLs to the target directory server, and letting
2061 * everything pass thru the ldap backend.
2066 if ( attr->a_desc->ad_type->sat_syntax ==
2067 slap_schema.si_syn_distinguishedName )
2069 ldap_dnattr_result_rewrite( &dc, attr->a_vals );
2071 } else if ( attr->a_desc == slap_schema.si_ad_ref ) {
2072 ldap_back_referral_result_rewrite( &dc, attr->a_vals, NULL );
2076 for ( i = 0; i < last; i++ ) {
2081 rc = ordered_value_pretty( attr->a_desc,
2082 &attr->a_vals[i], &pval, NULL );
2085 rc = ordered_value_validate( attr->a_desc,
2086 &attr->a_vals[i], 0 );
2090 LBER_FREE( attr->a_vals[i].bv_val );
2091 if ( --last == i ) {
2092 BER_BVZERO( &attr->a_vals[ i ] );
2095 attr->a_vals[i] = attr->a_vals[last];
2096 BER_BVZERO( &attr->a_vals[last] );
2102 LBER_FREE( attr->a_vals[i].bv_val );
2103 attr->a_vals[i] = pval;
2107 if ( last == 0 && attr->a_vals != &slap_dummy_bv ) {
2113 if ( last && attr->a_desc->ad_type->sat_equality &&
2114 attr->a_desc->ad_type->sat_equality->smr_normalize )
2118 attr->a_nvals = ch_malloc( ( last + 1 ) * sizeof( struct berval ) );
2119 for ( i = 0; i<last; i++ ) {
2120 /* if normalizer fails, drop this value */
2121 if ( ordered_value_normalize(
2122 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
2124 attr->a_desc->ad_type->sat_equality,
2125 &attr->a_vals[i], &attr->a_nvals[i],
2127 LBER_FREE( attr->a_vals[i].bv_val );
2128 if ( --last == i ) {
2129 BER_BVZERO( &attr->a_vals[ i ] );
2132 attr->a_vals[i] = attr->a_vals[last];
2133 BER_BVZERO( &attr->a_vals[last] );
2137 BER_BVZERO( &attr->a_nvals[i] );
2144 attr->a_nvals = attr->a_vals;
2147 attr->a_numvals = last;
2149 attrp = &attr->a_next;
2153 /* only check if some mapping occurred */
2154 if ( check_duplicate_attrs ) {
2157 for ( ap = &ent.e_attrs; *ap != NULL; ap = &(*ap)->a_next ) {
2160 for ( tap = &(*ap)->a_next; *tap != NULL; ) {
2161 if ( (*tap)->a_desc == (*ap)->a_desc ) {
2163 Modification mod = { 0 };
2164 const char *text = NULL;
2165 char textbuf[ SLAP_TEXT_BUFLEN ];
2166 Attribute *next = (*tap)->a_next;
2168 BER_BVSTR( &e.e_name, "" );
2169 BER_BVSTR( &e.e_nname, "" );
2171 mod.sm_op = LDAP_MOD_ADD;
2172 mod.sm_desc = (*ap)->a_desc;
2173 mod.sm_type = mod.sm_desc->ad_cname;
2174 mod.sm_numvals = (*ap)->a_numvals;
2175 mod.sm_values = (*tap)->a_vals;
2176 if ( (*tap)->a_nvals != (*tap)->a_vals ) {
2177 mod.sm_nvalues = (*tap)->a_nvals;
2180 (void)modify_add_values( &e, &mod,
2182 &text, textbuf, sizeof( textbuf ) );
2184 /* should not insert new attrs! */
2185 assert( e.e_attrs == *ap );
2191 tap = &(*tap)->a_next;
2197 /* Check for sorted attributes */
2198 if ( check_sorted_attrs ) {
2199 for ( attr = ent.e_attrs; attr; attr = attr->a_next ) {
2200 if ( attr->a_desc->ad_type->sat_flags & SLAP_AT_SORTED_VAL ) {
2201 while ( attr->a_numvals > 1 ) {
2203 int rc = slap_sort_vals( (Modifications *)attr, &text, &i, op->o_tmpmemctx );
2204 if ( rc != LDAP_TYPE_OR_VALUE_EXISTS )
2207 /* Strip duplicate values */
2208 if ( attr->a_nvals != attr->a_vals )
2209 LBER_FREE( attr->a_nvals[i].bv_val );
2210 LBER_FREE( attr->a_vals[i].bv_val );
2212 if ( i < attr->a_numvals ) {
2213 attr->a_vals[i] = attr->a_vals[attr->a_numvals];
2214 if ( attr->a_nvals != attr->a_vals )
2215 attr->a_nvals[i] = attr->a_nvals[attr->a_numvals];
2217 BER_BVZERO(&attr->a_vals[attr->a_numvals]);
2218 if ( attr->a_nvals != attr->a_vals )
2219 BER_BVZERO(&attr->a_nvals[attr->a_numvals]);
2221 attr->a_flags |= SLAP_ATTR_SORTED_VALS;
2226 ldap_get_entry_controls( mc->mc_conns[target].msc_ld,
2228 rs->sr_entry = &ent;
2229 rs->sr_attrs = op->ors_attrs;
2230 rs->sr_operational_attrs = NULL;
2231 rs->sr_flags = mi->mi_targets[ target ]->mt_rep_flags;
2232 rs->sr_err = LDAP_SUCCESS;
2233 rc = send_search_entry( op, rs );
2235 case LDAP_UNAVAILABLE:
2241 rs->sr_entry = NULL;
2242 rs->sr_attrs = NULL;
2243 if ( rs->sr_ctrls != NULL ) {
2244 ldap_controls_free( rs->sr_ctrls );
2245 rs->sr_ctrls = NULL;
2247 if ( !BER_BVISNULL( &ent.e_name ) ) {
2248 free( ent.e_name.bv_val );
2249 BER_BVZERO( &ent.e_name );
2251 if ( !BER_BVISNULL( &ent.e_nname ) ) {
2252 free( ent.e_nname.bv_val );
2253 BER_BVZERO( &ent.e_nname );
2255 entry_clean( &ent );