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;
392 rc = slap_map_api2result( &candidates[ candidate ] );
395 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
396 LDAP_BACK_CONN_BINDING_CLEAR( msc );
397 if ( rc != LDAP_SUCCESS ) {
398 meta_clear_one_candidate( op, mc, candidate );
399 candidates[ candidate ].sr_err = rc;
400 if ( META_BACK_ONERR_STOP( mi ) ) {
401 LDAP_BACK_CONN_TAINTED_SET( mc );
402 meta_back_release_conn_lock( mi, mc, 0 );
404 retcode = META_SEARCH_ERR;
409 /* FIXME: check if bound as idassert authcDN! */
410 if ( BER_BVISNULL( &msc->msc_bound_ndn )
411 || BER_BVISEMPTY( &msc->msc_bound_ndn ) )
413 LDAP_BACK_CONN_ISANON_SET( msc );
416 LDAP_BACK_CONN_ISBOUND_SET( msc );
418 retcode = META_SEARCH_CANDIDATE;
420 /* connect must be async */
421 ldap_set_option( msc->msc_ld, LDAP_OPT_CONNECT_ASYNC, LDAP_OPT_OFF );
424 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
425 META_BINDING_CLEAR( &candidates[ candidate ] );
427 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
432 static meta_search_candidate_t
433 meta_back_search_start(
439 SlapReply *candidates )
441 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
442 metatarget_t *mt = mi->mi_targets[ candidate ];
443 metasingleconn_t *msc = &(*mcp)->mc_conns[ candidate ];
444 struct berval realbase = op->o_req_dn;
445 int realscope = op->ors_scope;
446 struct berval mbase = BER_BVNULL;
447 struct berval mfilter = BER_BVNULL;
448 char **mapped_attrs = NULL;
450 meta_search_candidate_t retcode;
451 struct timeval tv, *tvp = NULL;
453 LDAPControl **ctrls = NULL;
455 /* this should not happen; just in case... */
456 if ( msc->msc_ld == NULL ) {
457 Debug( LDAP_DEBUG_ANY,
458 "%s: meta_back_search_start candidate=%d ld=NULL%s.\n",
459 op->o_log_prefix, candidate,
460 META_BACK_ONERR_STOP( mi ) ? "" : " (ignored)" );
461 candidates[ candidate ].sr_err = LDAP_OTHER;
462 if ( META_BACK_ONERR_STOP( mi ) ) {
463 return META_SEARCH_ERR;
465 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
466 return META_SEARCH_NOT_CANDIDATE;
469 Debug( LDAP_DEBUG_TRACE, "%s >>> meta_back_search_start[%d]\n", op->o_log_prefix, candidate, 0 );
472 * modifies the base according to the scope, if required
474 if ( mt->mt_nsuffix.bv_len > op->o_req_ndn.bv_len ) {
475 switch ( op->ors_scope ) {
476 case LDAP_SCOPE_SUBTREE:
478 * make the target suffix the new base
479 * FIXME: this is very forgiving, because
480 * "illegal" searchBases may be turned
481 * into the suffix of the target; however,
482 * the requested searchBase already passed
483 * thru the candidate analyzer...
485 if ( dnIsSuffix( &mt->mt_nsuffix, &op->o_req_ndn ) ) {
486 realbase = mt->mt_nsuffix;
487 if ( mt->mt_scope == LDAP_SCOPE_SUBORDINATE ) {
488 realscope = LDAP_SCOPE_SUBORDINATE;
493 * this target is no longer candidate
495 retcode = META_SEARCH_NOT_CANDIDATE;
500 case LDAP_SCOPE_SUBORDINATE:
501 case LDAP_SCOPE_ONELEVEL:
503 struct berval rdn = mt->mt_nsuffix;
504 rdn.bv_len -= op->o_req_ndn.bv_len + STRLENOF( "," );
505 if ( dnIsOneLevelRDN( &rdn )
506 && dnIsSuffix( &mt->mt_nsuffix, &op->o_req_ndn ) )
509 * if there is exactly one level,
510 * make the target suffix the new
511 * base, and make scope "base"
513 realbase = mt->mt_nsuffix;
514 if ( op->ors_scope == LDAP_SCOPE_SUBORDINATE ) {
515 if ( mt->mt_scope == LDAP_SCOPE_SUBORDINATE ) {
516 realscope = LDAP_SCOPE_SUBORDINATE;
518 realscope = LDAP_SCOPE_SUBTREE;
521 realscope = LDAP_SCOPE_BASE;
524 } /* else continue with the next case */
527 case LDAP_SCOPE_BASE:
529 * this target is no longer candidate
531 retcode = META_SEARCH_NOT_CANDIDATE;
536 /* initiate dobind */
537 retcode = meta_search_dobind_init( op, rs, mcp, candidate, candidates );
539 Debug( LDAP_DEBUG_TRACE, "%s <<< meta_search_dobind_init[%d]=%d\n", op->o_log_prefix, candidate, retcode );
541 if ( retcode != META_SEARCH_CANDIDATE ) {
546 * Rewrite the search base, if required
549 dc->ctx = "searchBase";
550 switch ( ldap_back_dn_massage( dc, &realbase, &mbase ) ) {
554 case LDAP_UNWILLING_TO_PERFORM:
555 rs->sr_err = LDAP_UNWILLING_TO_PERFORM;
556 rs->sr_text = "Operation not allowed";
557 send_ldap_result( op, rs );
558 retcode = META_SEARCH_ERR;
564 * this target is no longer candidate
566 retcode = META_SEARCH_NOT_CANDIDATE;
573 rc = ldap_back_filter_map_rewrite( dc, op->ors_filter,
574 &mfilter, BACKLDAP_MAP, op->o_tmpmemctx );
579 case LDAP_COMPARE_FALSE:
582 * this target is no longer candidate
584 retcode = META_SEARCH_NOT_CANDIDATE;
589 * Maps required attributes
591 rc = ldap_back_map_attrs( op, &mt->mt_rwmap.rwm_at,
592 op->ors_attrs, BACKLDAP_MAP, &mapped_attrs );
593 if ( rc != LDAP_SUCCESS ) {
595 * this target is no longer candidate
597 retcode = META_SEARCH_NOT_CANDIDATE;
601 if ( op->ors_tlimit != SLAP_NO_LIMIT ) {
602 tv.tv_sec = op->ors_tlimit > 0 ? op->ors_tlimit : 1;
609 if ( meta_back_controls_add( op, rs, *mcp, candidate, &ctrls )
612 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
613 retcode = META_SEARCH_NOT_CANDIDATE;
620 assert( msc->msc_ld != NULL );
621 rc = ldap_pvt_search( msc->msc_ld,
622 mbase.bv_val, realscope, mfilter.bv_val,
623 mapped_attrs, op->ors_attrsonly,
624 ctrls, NULL, tvp, op->ors_slimit, op->ors_deref,
625 &candidates[ candidate ].sr_msgid );
628 retcode = META_SEARCH_CANDIDATE;
631 case LDAP_SERVER_DOWN:
632 if ( nretries && meta_back_retry( op, rs, mcp, candidate, LDAP_BACK_DONTSEND ) ) {
634 /* if the identity changed, there might be need to re-authz */
635 (void)mi->mi_ldap_extra->controls_free( op, rs, &ctrls );
639 if ( *mcp == NULL ) {
640 retcode = META_SEARCH_ERR;
641 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
647 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
648 retcode = META_SEARCH_NOT_CANDIDATE;
652 (void)mi->mi_ldap_extra->controls_free( op, rs, &ctrls );
654 if ( mapped_attrs ) {
655 ber_memfree_x( mapped_attrs, op->o_tmpmemctx );
657 if ( mfilter.bv_val != op->ors_filterstr.bv_val ) {
658 ber_memfree_x( mfilter.bv_val, op->o_tmpmemctx );
660 if ( mbase.bv_val != realbase.bv_val ) {
661 free( mbase.bv_val );
665 Debug( LDAP_DEBUG_TRACE, "%s <<< meta_back_search_start[%d]=%d\n", op->o_log_prefix, candidate, retcode );
671 meta_back_search( Operation *op, SlapReply *rs )
673 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
675 struct timeval save_tv = { 0, 0 },
677 time_t stoptime = (time_t)(-1),
678 lastres_time = slap_get_time(),
680 int rc = 0, sres = LDAP_SUCCESS;
681 char *matched = NULL;
682 int last = 0, ncandidates = 0,
683 initial_candidates = 0, candidate_match = 0,
685 ldap_back_send_t sendok = LDAP_BACK_SENDERR;
690 SlapReply *candidates = NULL;
693 * controls are set in ldap_back_dobind()
695 * FIXME: in case of values return filter, we might want
696 * to map attrs and maybe rewrite value
699 mc = meta_back_getconn( op, rs, NULL, sendok );
704 dc.conn = op->o_conn;
707 if ( candidates == NULL ) candidates = meta_back_candidates_get( op );
711 for ( i = 0; i < mi->mi_ntargets; i++ ) {
712 /* reset sr_msgid; it is used in most loops
713 * to check if that target is still to be considered */
714 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
716 /* a target is marked as candidate by meta_back_getconn();
717 * if for any reason (an error, it's over or so) it is
718 * no longer active, sr_msgid is set to META_MSGID_IGNORE
719 * but it remains candidate, which means it has been active
720 * at some point during the operation. This allows to
721 * use its response code and more to compute the final
723 if ( !META_IS_CANDIDATE( &candidates[ i ] ) ) {
727 candidates[ i ].sr_matched = NULL;
728 candidates[ i ].sr_text = NULL;
729 candidates[ i ].sr_ref = NULL;
730 candidates[ i ].sr_ctrls = NULL;
732 /* get largest timeout among candidates */
733 if ( mi->mi_targets[ i ]->mt_timeout[ SLAP_OP_SEARCH ]
734 && mi->mi_targets[ i ]->mt_timeout[ SLAP_OP_SEARCH ] > timeout )
736 timeout = mi->mi_targets[ i ]->mt_timeout[ SLAP_OP_SEARCH ];
740 for ( i = 0; i < mi->mi_ntargets; i++ ) {
741 if ( !META_IS_CANDIDATE( &candidates[ i ] )
742 || candidates[ i ].sr_err != LDAP_SUCCESS )
747 switch ( meta_back_search_start( op, rs, &dc, &mc, i, candidates ) )
749 case META_SEARCH_NOT_CANDIDATE:
750 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
753 case META_SEARCH_NEED_BIND:
757 case META_SEARCH_CONNECTING:
758 case META_SEARCH_CANDIDATE:
759 case META_SEARCH_BINDING:
760 candidates[ i ].sr_type = REP_INTERMEDIATE;
764 case META_SEARCH_ERR:
765 savepriv = op->o_private;
766 op->o_private = (void *)i;
767 send_ldap_result( op, rs );
768 op->o_private = savepriv;
778 if ( ncandidates > 0 && needbind == ncandidates ) {
780 * give up the second time...
782 * NOTE: this should not occur the second time, since a fresh
783 * connection has ben created; however, targets may also
784 * need bind because the bind timed out or so.
786 if ( sendok & LDAP_BACK_BINDING ) {
787 Debug( LDAP_DEBUG_ANY,
788 "%s meta_back_search: unable to initialize conn\n",
789 op->o_log_prefix, 0, 0 );
790 rs->sr_err = LDAP_UNAVAILABLE;
791 rs->sr_text = "unable to initialize connection to remote targets";
792 send_ldap_result( op, rs );
797 /* FIXME: better create a separate connection? */
798 sendok |= LDAP_BACK_BINDING;
801 Debug( LDAP_DEBUG_ANY, "*** %s drop mc=%p create new connection\n",
802 op->o_log_prefix, (void *)mc, 0 );
803 #endif /* DEBUG_205 */
805 meta_back_release_conn( mi, mc );
814 initial_candidates = ncandidates;
816 if ( LogTest( LDAP_DEBUG_TRACE ) ) {
817 char cnd[ SLAP_TEXT_BUFLEN ];
820 for ( c = 0; c < mi->mi_ntargets; c++ ) {
821 if ( META_IS_CANDIDATE( &candidates[ c ] ) ) {
829 Debug( LDAP_DEBUG_TRACE, "%s meta_back_search: ncandidates=%d "
830 "cnd=\"%s\"\n", op->o_log_prefix, ncandidates, cnd );
833 if ( initial_candidates == 0 ) {
834 /* NOTE: here we are not sending any matchedDN;
835 * this is intended, because if the back-meta
836 * is serving this search request, but no valid
837 * candidate could be looked up, it means that
838 * there is a hole in the mapping of the targets
839 * and thus no knowledge of any remote superior
841 Debug( LDAP_DEBUG_ANY, "%s meta_back_search: "
842 "base=\"%s\" scope=%d: "
843 "no candidate could be selected\n",
844 op->o_log_prefix, op->o_req_dn.bv_val,
847 /* FIXME: we're sending the first error we encounter;
848 * maybe we should pick the worst... */
849 rc = LDAP_NO_SUCH_OBJECT;
850 for ( i = 0; i < mi->mi_ntargets; i++ ) {
851 if ( META_IS_CANDIDATE( &candidates[ i ] )
852 && candidates[ i ].sr_err != LDAP_SUCCESS )
854 rc = candidates[ i ].sr_err;
859 send_ldap_error( op, rs, rc, NULL );
864 /* We pull apart the ber result, stuff it into a slapd entry, and
865 * let send_search_entry stuff it back into ber format. Slow & ugly,
866 * but this is necessary for version matching, and for ACL processing.
869 if ( op->ors_tlimit != SLAP_NO_LIMIT ) {
870 stoptime = op->o_time + op->ors_tlimit;
874 * In case there are no candidates, no cycle takes place...
876 * FIXME: we might use a queue, to better balance the load
877 * among the candidates
879 for ( rc = 0; ncandidates > 0; ) {
882 alreadybound = ncandidates;
885 if ( timeout && lastres_time > 0
886 && ( slap_get_time() - lastres_time ) > timeout )
889 rs->sr_text = "Operation timed out";
890 rc = rs->sr_err = op->o_protocol >= LDAP_VERSION3 ?
891 LDAP_ADMINLIMIT_EXCEEDED : LDAP_OTHER;
892 savepriv = op->o_private;
893 op->o_private = (void *)i;
894 send_ldap_result( op, rs );
895 op->o_private = savepriv;
899 /* check time limit */
900 if ( op->ors_tlimit != SLAP_NO_LIMIT
901 && slap_get_time() > stoptime )
904 rc = rs->sr_err = LDAP_TIMELIMIT_EXCEEDED;
905 savepriv = op->o_private;
906 op->o_private = (void *)i;
907 send_ldap_result( op, rs );
908 op->o_private = savepriv;
912 for ( i = 0; i < mi->mi_ntargets; i++ ) {
913 meta_search_candidate_t retcode = META_SEARCH_UNDEFINED;
914 metasingleconn_t *msc = &mc->mc_conns[ i ];
915 LDAPMessage *res = NULL, *msg;
917 /* if msgid is invalid, don't ldap_result() */
918 if ( candidates[ i ].sr_msgid == META_MSGID_IGNORE ) {
922 /* if target still needs bind, retry */
923 if ( candidates[ i ].sr_msgid == META_MSGID_NEED_BIND
924 || candidates[ i ].sr_msgid == META_MSGID_CONNECTING )
926 /* initiate dobind */
927 retcode = meta_search_dobind_init( op, rs, &mc, i, candidates );
929 Debug( LDAP_DEBUG_TRACE, "%s <<< meta_search_dobind_init[%ld]=%d\n",
930 op->o_log_prefix, i, retcode );
933 case META_SEARCH_NEED_BIND:
937 case META_SEARCH_CONNECTING:
938 case META_SEARCH_BINDING:
941 case META_SEARCH_ERR:
942 candidates[ i ].sr_err = rs->sr_err;
943 if ( META_BACK_ONERR_STOP( mi ) ) {
944 savepriv = op->o_private;
945 op->o_private = (void *)i;
946 send_ldap_result( op, rs );
947 op->o_private = savepriv;
952 case META_SEARCH_NOT_CANDIDATE:
954 * When no candidates are left,
955 * the outer cycle finishes
957 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
958 assert( ncandidates > 0 );
962 case META_SEARCH_CANDIDATE:
963 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
964 switch ( meta_back_search_start( op, rs, &dc, &mc, i, candidates ) )
966 case META_SEARCH_CANDIDATE:
967 assert( candidates[ i ].sr_msgid >= 0 );
970 case META_SEARCH_ERR:
971 candidates[ i ].sr_err = rs->sr_err;
972 if ( META_BACK_ONERR_STOP( mi ) ) {
973 savepriv = op->o_private;
974 op->o_private = (void *)i;
975 send_ldap_result( op, rs );
976 op->o_private = savepriv;
981 case META_SEARCH_NOT_CANDIDATE:
982 /* means that meta_back_search_start()
983 * failed but onerr == continue */
984 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
985 assert( ncandidates > 0 );
1004 /* check for abandon */
1005 if ( op->o_abandon || LDAP_BACK_CONN_ABANDON( mc ) ) {
1010 if ( msc->msc_ld == NULL ) {
1011 char buf[ SLAP_TEXT_BUFLEN ];
1013 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
1014 snprintf( buf, sizeof( buf ),
1015 "%s meta_back_search[%ld] mc=%p msgid=%d%s%s%s\n",
1016 op->o_log_prefix, (long)i, (void *)mc,
1017 candidates[ i ].sr_msgid,
1018 META_IS_BINDING( &candidates[ i ] ) ? " binding" : "",
1019 LDAP_BACK_CONN_BINDING( &mc->mc_conns[ i ] ) ? " connbinding" : "",
1020 META_BACK_CONN_CREATING( &mc->mc_conns[ i ] ) ? " conncreating" : "" );
1021 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
1023 Debug( LDAP_DEBUG_ANY, "!!! %s\n", buf, 0, 0 );
1025 #endif /* DEBUG_205 */
1028 * FIXME: handle time limit as well?
1029 * Note that target servers are likely
1030 * to handle it, so at some time we'll
1031 * get a LDAP_TIMELIMIT_EXCEEDED from
1035 rc = ldap_result( msc->msc_ld, candidates[ i ].sr_msgid,
1036 LDAP_MSG_RECEIVED, &tv, &res );
1039 /* FIXME: res should not need to be freed */
1040 assert( res == NULL );
1045 /* something REALLY bad happened! */
1046 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
1047 candidates[ i ].sr_type = REP_RESULT;
1049 if ( meta_back_retry( op, rs, &mc, i, LDAP_BACK_DONTSEND ) ) {
1050 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1051 switch ( meta_back_search_start( op, rs, &dc, &mc, i, candidates ) )
1053 /* means that failed but onerr == continue */
1054 case META_SEARCH_NOT_CANDIDATE:
1055 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1057 assert( ncandidates > 0 );
1060 candidates[ i ].sr_err = rs->sr_err;
1061 if ( META_BACK_ONERR_STOP( mi ) ) {
1062 savepriv = op->o_private;
1063 op->o_private = (void *)i;
1064 send_ldap_result( op, rs );
1065 op->o_private = savepriv;
1070 case META_SEARCH_CANDIDATE:
1071 /* get back into business... */
1074 case META_SEARCH_BINDING:
1075 case META_SEARCH_CONNECTING:
1076 case META_SEARCH_NEED_BIND:
1077 case META_SEARCH_UNDEFINED:
1081 /* unrecoverable error */
1082 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1083 rc = rs->sr_err = LDAP_OTHER;
1088 candidates[ i ].sr_err = rs->sr_err;
1089 if ( META_BACK_ONERR_STOP( mi ) ) {
1090 savepriv = op->o_private;
1091 op->o_private = (void *)i;
1092 send_ldap_result( op, rs );
1093 op->o_private = savepriv;
1099 * When no candidates are left,
1100 * the outer cycle finishes
1102 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1103 assert( ncandidates > 0 );
1105 rs->sr_err = candidates[ i ].sr_err;
1109 lastres_time = slap_get_time();
1111 /* only touch when activity actually took place... */
1112 if ( mi->mi_idle_timeout != 0 && msc->msc_time < lastres_time ) {
1113 msc->msc_time = lastres_time;
1118 for ( msg = ldap_first_message( msc->msc_ld, res );
1120 msg = ldap_next_message( msc->msc_ld, msg ) )
1122 rc = ldap_msgtype( msg );
1123 if ( rc == LDAP_RES_SEARCH_ENTRY ) {
1126 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
1127 /* don't retry any more... */
1128 candidates[ i ].sr_type = REP_RESULT;
1133 e = ldap_first_entry( msc->msc_ld, msg );
1134 savepriv = op->o_private;
1135 op->o_private = (void *)i;
1136 rs->sr_err = meta_send_entry( op, rs, mc, i, e );
1138 switch ( rs->sr_err ) {
1139 case LDAP_SIZELIMIT_EXCEEDED:
1140 savepriv = op->o_private;
1141 op->o_private = (void *)i;
1142 send_ldap_result( op, rs );
1143 op->o_private = savepriv;
1144 rs->sr_err = LDAP_SUCCESS;
1145 ldap_msgfree( res );
1149 case LDAP_UNAVAILABLE:
1150 rs->sr_err = LDAP_OTHER;
1151 ldap_msgfree( res );
1155 op->o_private = savepriv;
1157 /* don't wait any longer... */
1160 save_tv.tv_usec = 0;
1162 } else if ( rc == LDAP_RES_SEARCH_REFERENCE ) {
1163 char **references = NULL;
1166 if ( META_BACK_TGT_NOREFS( mi->mi_targets[ i ] ) ) {
1170 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
1171 /* don't retry any more... */
1172 candidates[ i ].sr_type = REP_RESULT;
1177 rc = ldap_parse_reference( msc->msc_ld, msg,
1178 &references, &rs->sr_ctrls, 0 );
1180 if ( rc != LDAP_SUCCESS ) {
1184 if ( references == NULL ) {
1188 #ifdef ENABLE_REWRITE
1189 dc.ctx = "referralDN";
1190 #else /* ! ENABLE_REWRITE */
1193 #endif /* ! ENABLE_REWRITE */
1195 /* FIXME: merge all and return at the end */
1197 for ( cnt = 0; references[ cnt ]; cnt++ )
1200 rs->sr_ref = ber_memalloc_x( sizeof( struct berval ) * ( cnt + 1 ),
1203 for ( cnt = 0; references[ cnt ]; cnt++ ) {
1204 ber_str2bv_x( references[ cnt ], 0, 1, &rs->sr_ref[ cnt ],
1207 BER_BVZERO( &rs->sr_ref[ cnt ] );
1209 ( void )ldap_back_referral_result_rewrite( &dc, rs->sr_ref,
1212 if ( rs->sr_ref != NULL && !BER_BVISNULL( &rs->sr_ref[ 0 ] ) ) {
1213 /* ignore return value by now */
1214 savepriv = op->o_private;
1215 op->o_private = (void *)i;
1216 ( void )send_search_reference( op, rs );
1217 op->o_private = savepriv;
1219 ber_bvarray_free_x( rs->sr_ref, op->o_tmpmemctx );
1225 ber_memvfree( (void **)references );
1228 if ( rs->sr_ctrls ) {
1229 ldap_controls_free( rs->sr_ctrls );
1230 rs->sr_ctrls = NULL;
1233 } else if ( rc == LDAP_RES_INTERMEDIATE ) {
1234 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
1235 /* don't retry any more... */
1236 candidates[ i ].sr_type = REP_RESULT;
1239 /* FIXME: response controls
1240 * are passed without checks */
1241 rs->sr_err = ldap_parse_intermediate( msc->msc_ld,
1243 (char **)&rs->sr_rspoid,
1247 if ( rs->sr_err != LDAP_SUCCESS ) {
1248 candidates[ i ].sr_type = REP_RESULT;
1249 ldap_msgfree( res );
1254 slap_send_ldap_intermediate( op, rs );
1256 if ( rs->sr_rspoid != NULL ) {
1257 ber_memfree( (char *)rs->sr_rspoid );
1258 rs->sr_rspoid = NULL;
1261 if ( rs->sr_rspdata != NULL ) {
1262 ber_bvfree( rs->sr_rspdata );
1263 rs->sr_rspdata = NULL;
1266 if ( rs->sr_ctrls != NULL ) {
1267 ldap_controls_free( rs->sr_ctrls );
1268 rs->sr_ctrls = NULL;
1271 } else if ( rc == LDAP_RES_SEARCH_RESULT ) {
1272 char buf[ SLAP_TEXT_BUFLEN ];
1273 char **references = NULL;
1275 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
1276 /* don't retry any more... */
1277 candidates[ i ].sr_type = REP_RESULT;
1280 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1282 /* NOTE: ignores response controls
1283 * (and intermediate response controls
1284 * as well, except for those with search
1285 * references); this may not be correct,
1286 * but if they're not ignored then
1287 * back-meta would need to merge them
1288 * consistently (think of pagedResults...)
1290 /* FIXME: response controls? */
1291 rs->sr_err = ldap_parse_result( msc->msc_ld,
1293 &candidates[ i ].sr_err,
1294 (char **)&candidates[ i ].sr_matched,
1295 NULL /* (char **)&candidates[ i ].sr_text */ ,
1297 NULL /* &candidates[ i ].sr_ctrls (unused) */ ,
1299 if ( rs->sr_err != LDAP_SUCCESS ) {
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 savepriv = op->o_private;
1442 op->o_private = (void *)i;
1443 send_ldap_result( op, rs );
1444 op->o_private = savepriv;
1445 ldap_msgfree( res );
1452 candidates[ i ].sr_err = rs->sr_err;
1453 if ( META_BACK_ONERR_STOP( mi ) ) {
1454 savepriv = op->o_private;
1455 op->o_private = (void *)i;
1456 send_ldap_result( op, rs );
1457 op->o_private = savepriv;
1458 ldap_msgfree( res );
1469 * When no candidates are left,
1470 * the outer cycle finishes
1472 assert( ncandidates > 0 );
1475 } else if ( rc == LDAP_RES_BIND ) {
1476 meta_search_candidate_t retcode;
1478 retcode = meta_search_dobind_result( op, rs, &mc, i, candidates, msg );
1479 if ( retcode == META_SEARCH_CANDIDATE ) {
1480 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1481 retcode = meta_back_search_start( op, rs, &dc, &mc, i, candidates );
1484 switch ( retcode ) {
1485 case META_SEARCH_CANDIDATE:
1488 /* means that failed but onerr == continue */
1489 case META_SEARCH_NOT_CANDIDATE:
1490 case META_SEARCH_ERR:
1491 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1492 assert( ncandidates > 0 );
1495 candidates[ i ].sr_err = rs->sr_err;
1496 if ( META_BACK_ONERR_STOP( mi ) ) {
1497 savepriv = op->o_private;
1498 op->o_private = (void *)i;
1499 send_ldap_result( op, rs );
1500 op->o_private = savepriv;
1501 ldap_msgfree( res );
1513 Debug( LDAP_DEBUG_ANY,
1514 "%s meta_back_search[%ld]: "
1515 "unrecognized response message tag=%d\n",
1519 ldap_msgfree( res );
1526 ldap_msgfree( res );
1530 /* check for abandon */
1531 if ( op->o_abandon || LDAP_BACK_CONN_ABANDON( mc ) ) {
1532 for ( i = 0; i < mi->mi_ntargets; i++ ) {
1533 if ( candidates[ i ].sr_msgid >= 0
1534 || candidates[ i ].sr_msgid == META_MSGID_CONNECTING )
1536 if ( META_IS_BINDING( &candidates[ i ] )
1537 || candidates[ i ].sr_msgid == META_MSGID_CONNECTING )
1539 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
1540 if ( LDAP_BACK_CONN_BINDING( &mc->mc_conns[ i ] )
1541 || candidates[ i ].sr_msgid == META_MSGID_CONNECTING )
1543 /* if still binding, destroy */
1546 char buf[ SLAP_TEXT_BUFLEN ];
1548 snprintf( buf, sizeof( buf), "%s meta_back_search(abandon) "
1549 "ldap_unbind_ext[%ld] mc=%p ld=%p",
1550 op->o_log_prefix, i, (void *)mc,
1551 (void *)mc->mc_conns[i].msc_ld );
1553 Debug( LDAP_DEBUG_ANY, "### %s\n", buf, 0, 0 );
1554 #endif /* DEBUG_205 */
1556 meta_clear_one_candidate( op, mc, i );
1558 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
1559 META_BINDING_CLEAR( &candidates[ i ] );
1562 (void)meta_back_cancel( mc, op, rs,
1563 candidates[ i ].sr_msgid, i,
1564 LDAP_BACK_DONTSEND );
1567 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1568 assert( ncandidates > 0 );
1573 if ( op->o_abandon ) {
1577 /* let send_ldap_result play cleanup handlers (ITS#4645) */
1581 /* if no entry was found during this loop,
1582 * set a minimal timeout */
1583 if ( ncandidates > 0 && gotit == 0 ) {
1584 if ( save_tv.tv_sec == 0 && save_tv.tv_usec == 0 ) {
1585 save_tv.tv_usec = LDAP_BACK_RESULT_UTIMEOUT/initial_candidates;
1587 /* arbitrarily limit to something between 1 and 2 minutes */
1588 } else if ( ( stoptime == -1 && save_tv.tv_sec < 60 )
1589 || save_tv.tv_sec < ( stoptime - slap_get_time() ) / ( 2 * ncandidates ) )
1591 /* double the timeout */
1592 lutil_timermul( &save_tv, 2, &save_tv );
1595 if ( alreadybound == 0 ) {
1597 (void)select( 0, NULL, NULL, NULL, &tv );
1600 ldap_pvt_thread_yield();
1607 * FIXME: need a better strategy to handle errors
1610 rc = meta_back_op_result( mc, op, rs, META_TARGET_NONE,
1611 -1, stoptime != -1 ? (stoptime - slap_get_time()) : 0,
1612 LDAP_BACK_SENDERR );
1620 * Rewrite the matched portion of the search base, if required
1622 * FIXME: only the last one gets caught!
1624 savepriv = op->o_private;
1625 op->o_private = (void *)(long)mi->mi_ntargets;
1626 if ( candidate_match > 0 ) {
1627 struct berval pmatched = BER_BVNULL;
1629 /* we use the first one */
1630 for ( i = 0; i < mi->mi_ntargets; i++ ) {
1631 if ( META_IS_CANDIDATE( &candidates[ i ] )
1632 && candidates[ i ].sr_matched != NULL )
1634 struct berval bv, pbv;
1637 /* if we got success, and this target
1638 * returned noSuchObject, and its suffix
1639 * is a superior of the searchBase,
1640 * ignore the matchedDN */
1641 if ( sres == LDAP_SUCCESS
1642 && candidates[ i ].sr_err == LDAP_NO_SUCH_OBJECT
1643 && op->o_req_ndn.bv_len > mi->mi_targets[ i ]->mt_nsuffix.bv_len )
1645 free( (char *)candidates[ i ].sr_matched );
1646 candidates[ i ].sr_matched = NULL;
1650 ber_str2bv( candidates[ i ].sr_matched, 0, 0, &bv );
1651 rc = dnPretty( NULL, &bv, &pbv, op->o_tmpmemctx );
1653 if ( rc == LDAP_SUCCESS ) {
1655 /* NOTE: if they all are superiors
1656 * of the baseDN, the shorter is also
1657 * superior of the longer... */
1658 if ( pbv.bv_len > pmatched.bv_len ) {
1659 if ( !BER_BVISNULL( &pmatched ) ) {
1660 op->o_tmpfree( pmatched.bv_val, op->o_tmpmemctx );
1663 op->o_private = (void *)i;
1666 op->o_tmpfree( pbv.bv_val, op->o_tmpmemctx );
1670 if ( candidates[ i ].sr_matched != NULL ) {
1671 free( (char *)candidates[ i ].sr_matched );
1672 candidates[ i ].sr_matched = NULL;
1677 if ( !BER_BVISNULL( &pmatched ) ) {
1678 matched = pmatched.bv_val;
1681 } else if ( sres == LDAP_NO_SUCH_OBJECT ) {
1682 matched = op->o_bd->be_suffix[ 0 ].bv_val;
1686 * In case we returned at least one entry, we return LDAP_SUCCESS
1687 * otherwise, the latter error code we got
1690 if ( sres == LDAP_SUCCESS ) {
1691 if ( rs->sr_v2ref ) {
1692 sres = LDAP_REFERRAL;
1695 if ( META_BACK_ONERR_REPORT( mi ) ) {
1697 * Report errors, if any
1699 * FIXME: we should handle error codes and return the more
1700 * important/reasonable
1702 for ( i = 0; i < mi->mi_ntargets; i++ ) {
1703 if ( !META_IS_CANDIDATE( &candidates[ i ] ) ) {
1707 if ( candidates[ i ].sr_err != LDAP_SUCCESS
1708 && candidates[ i ].sr_err != LDAP_NO_SUCH_OBJECT )
1710 sres = candidates[ i ].sr_err;
1718 rs->sr_matched = matched;
1719 rs->sr_ref = ( sres == LDAP_REFERRAL ? rs->sr_v2ref : NULL );
1720 send_ldap_result( op, rs );
1721 op->o_private = savepriv;
1722 rs->sr_matched = NULL;
1726 if ( matched && matched != op->o_bd->be_suffix[ 0 ].bv_val ) {
1727 op->o_tmpfree( matched, op->o_tmpmemctx );
1730 if ( rs->sr_v2ref ) {
1731 ber_bvarray_free_x( rs->sr_v2ref, op->o_tmpmemctx );
1734 for ( i = 0; i < mi->mi_ntargets; i++ ) {
1735 if ( !META_IS_CANDIDATE( &candidates[ i ] ) ) {
1740 if ( META_IS_BINDING( &candidates[ i ] )
1741 || candidates[ i ].sr_msgid == META_MSGID_CONNECTING )
1743 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
1744 if ( LDAP_BACK_CONN_BINDING( &mc->mc_conns[ i ] )
1745 || candidates[ i ].sr_msgid == META_MSGID_CONNECTING )
1747 assert( candidates[ i ].sr_msgid >= 0
1748 || candidates[ i ].sr_msgid == META_MSGID_CONNECTING );
1749 assert( mc->mc_conns[ i ].msc_ld != NULL );
1752 Debug( LDAP_DEBUG_ANY, "### %s meta_back_search(cleanup) "
1753 "ldap_unbind_ext[%ld] ld=%p\n",
1754 op->o_log_prefix, i, (void *)mc->mc_conns[i].msc_ld );
1755 #endif /* DEBUG_205 */
1757 /* if still binding, destroy */
1758 meta_clear_one_candidate( op, mc, i );
1760 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
1761 META_BINDING_CLEAR( &candidates[ i ] );
1763 } else if ( candidates[ i ].sr_msgid >= 0 ) {
1764 (void)meta_back_cancel( mc, op, rs,
1765 candidates[ i ].sr_msgid, i,
1766 LDAP_BACK_DONTSEND );
1770 if ( candidates[ i ].sr_matched ) {
1771 free( (char *)candidates[ i ].sr_matched );
1772 candidates[ i ].sr_matched = NULL;
1775 if ( candidates[ i ].sr_text ) {
1776 ldap_memfree( (char *)candidates[ i ].sr_text );
1777 candidates[ i ].sr_text = NULL;
1780 if ( candidates[ i ].sr_ref ) {
1781 ber_bvarray_free( candidates[ i ].sr_ref );
1782 candidates[ i ].sr_ref = NULL;
1785 if ( candidates[ i ].sr_ctrls ) {
1786 ldap_controls_free( candidates[ i ].sr_ctrls );
1787 candidates[ i ].sr_ctrls = NULL;
1790 if ( META_BACK_TGT_QUARANTINE( mi->mi_targets[ i ] ) ) {
1791 meta_back_quarantine( op, &candidates[ i ], i );
1794 /* only in case of timelimit exceeded, if the timelimit exceeded because
1795 * one contacted target never responded, invalidate the connection
1796 * NOTE: should we quarantine the target as well? right now, the connection
1797 * is invalidated; the next time it will be recreated and the target
1798 * will be quarantined if it cannot be contacted */
1799 if ( mi->mi_idle_timeout != 0
1800 && rs->sr_err == LDAP_TIMELIMIT_EXCEEDED
1801 && op->o_time > mc->mc_conns[ i ].msc_time )
1803 /* don't let anyone else use this expired connection */
1804 LDAP_BACK_CONN_TAINTED_SET( mc );
1809 meta_back_release_conn( mi, mc );
1823 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
1824 struct berval a, mapped;
1825 int check_duplicate_attrs = 0;
1826 int check_sorted_attrs = 0;
1828 BerElement ber = *e->lm_ber;
1829 Attribute *attr, **attrp;
1838 if ( ber_scanf( &ber, "l{", &len ) == LBER_ERROR ) {
1839 return LDAP_DECODING_ERROR;
1842 if ( ber_set_option( &ber, LBER_OPT_REMAINING_BYTES, &len ) != LBER_OPT_SUCCESS ) {
1846 if ( ber_scanf( &ber, "m{", &bdn ) == LBER_ERROR ) {
1847 return LDAP_DECODING_ERROR;
1851 * Rewrite the dn of the result, if needed
1853 dc.target = mi->mi_targets[ target ];
1854 dc.conn = op->o_conn;
1856 dc.ctx = "searchResult";
1858 rs->sr_err = ldap_back_dn_massage( &dc, &bdn, &dn );
1859 if ( rs->sr_err != LDAP_SUCCESS) {
1864 * Note: this may fail if the target host(s) schema differs
1865 * from the one known to the meta, and a DN with unknown
1866 * attributes is returned.
1868 * FIXME: should we log anything, or delegate to dnNormalize?
1870 rc = dnPrettyNormal( NULL, &dn, &ent.e_name, &ent.e_nname,
1872 if ( dn.bv_val != bdn.bv_val ) {
1877 if ( rc != LDAP_SUCCESS ) {
1878 Debug( LDAP_DEBUG_ANY,
1879 "%s meta_send_entry(\"%s\"): "
1880 "invalid DN syntax\n",
1881 op->o_log_prefix, ent.e_name.bv_val, 0 );
1882 rc = LDAP_INVALID_DN_SYNTAX;
1889 if ( mi->mi_cache.ttl != META_DNCACHE_DISABLED ) {
1890 ( void )meta_dncache_update_entry( &mi->mi_cache,
1891 &ent.e_nname, target );
1894 attrp = &ent.e_attrs;
1896 dc.ctx = "searchAttrDN";
1897 while ( ber_scanf( &ber, "{m", &a ) != LBER_ERROR ) {
1899 slap_syntax_validate_func *validate;
1900 slap_syntax_transform_func *pretty;
1902 if ( ber_pvt_ber_remaining( &ber ) < 0 ) {
1903 Debug( LDAP_DEBUG_ANY,
1904 "%s meta_send_entry(\"%s\"): "
1905 "unable to parse attr \"%s\".\n",
1906 op->o_log_prefix, ent.e_name.bv_val, a.bv_val );
1912 if ( ber_pvt_ber_remaining( &ber ) == 0 ) {
1916 ldap_back_map( &mi->mi_targets[ target ]->mt_rwmap.rwm_at,
1917 &a, &mapped, BACKLDAP_REMAP );
1918 if ( BER_BVISNULL( &mapped ) || mapped.bv_val[0] == '\0' ) {
1919 ( void )ber_scanf( &ber, "x" /* [W] */ );
1922 if ( mapped.bv_val != a.bv_val ) {
1923 /* will need to check for duplicate attrs */
1924 check_duplicate_attrs++;
1926 attr = attr_alloc( NULL );
1927 if ( attr == NULL ) {
1931 if ( slap_bv2ad( &mapped, &attr->a_desc, &text )
1933 if ( slap_bv2undef_ad( &mapped, &attr->a_desc, &text,
1934 SLAP_AD_PROXIED ) != LDAP_SUCCESS )
1936 char buf[ SLAP_TEXT_BUFLEN ];
1938 snprintf( buf, sizeof( buf ),
1939 "%s meta_send_entry(\"%s\"): "
1940 "slap_bv2undef_ad(%s): %s\n",
1941 op->o_log_prefix, ent.e_name.bv_val,
1942 mapped.bv_val, text );
1944 Debug( LDAP_DEBUG_ANY, "%s", buf, 0, 0 );
1945 ( void )ber_scanf( &ber, "x" /* [W] */ );
1951 if ( attr->a_desc->ad_type->sat_flags & SLAP_AT_SORTED_VAL )
1952 check_sorted_attrs = 1;
1954 /* no subschemaSubentry */
1955 if ( attr->a_desc == slap_schema.si_ad_subschemaSubentry
1956 || attr->a_desc == slap_schema.si_ad_entryDN )
1960 * We eat target's subschemaSubentry because
1961 * a search for this value is likely not
1962 * to resolve to the appropriate backend;
1963 * later, the local subschemaSubentry is
1966 * We also eat entryDN because the frontend
1967 * will reattach it without checking if already
1970 ( void )ber_scanf( &ber, "x" /* [W] */ );
1975 if ( ber_scanf( &ber, "[W]", &attr->a_vals ) == LBER_ERROR
1976 || attr->a_vals == NULL )
1978 attr->a_vals = (struct berval *)&slap_dummy_bv;
1981 for ( last = 0; !BER_BVISNULL( &attr->a_vals[ last ] ); ++last )
1984 attr->a_numvals = last;
1986 validate = attr->a_desc->ad_type->sat_syntax->ssyn_validate;
1987 pretty = attr->a_desc->ad_type->sat_syntax->ssyn_pretty;
1989 if ( !validate && !pretty ) {
1994 if ( attr->a_desc == slap_schema.si_ad_objectClass
1995 || attr->a_desc == slap_schema.si_ad_structuralObjectClass )
1999 for ( bv = attr->a_vals; !BER_BVISNULL( bv ); bv++ ) {
2002 ldap_back_map( &mi->mi_targets[ target ]->mt_rwmap.rwm_oc,
2003 bv, &mapped, BACKLDAP_REMAP );
2004 if ( BER_BVISNULL( &mapped ) || mapped.bv_val[0] == '\0') {
2011 *bv = attr->a_vals[ last ];
2012 BER_BVZERO( &attr->a_vals[ last ] );
2015 } else if ( mapped.bv_val != bv->bv_val ) {
2018 for ( i = 0; !BER_BVISNULL( &attr->a_vals[ i ] ); i++ ) {
2019 if ( &attr->a_vals[ i ] == bv ) {
2023 if ( ber_bvstrcasecmp( &mapped, &attr->a_vals[ i ] ) == 0 ) {
2028 if ( !BER_BVISNULL( &attr->a_vals[ i ] ) ) {
2032 ber_bvreplace( bv, &mapped );
2034 } else if ( ( oc = oc_bvfind_undef( bv ) ) == NULL ) {
2038 ber_bvreplace( bv, &oc->soc_cname );
2042 * It is necessary to try to rewrite attributes with
2043 * dn syntax because they might be used in ACLs as
2044 * members of groups; since ACLs are applied to the
2045 * rewritten stuff, no dn-based subecj clause could
2046 * be used at the ldap backend side (see
2047 * http://www.OpenLDAP.org/faq/data/cache/452.html)
2048 * The problem can be overcome by moving the dn-based
2049 * ACLs to the target directory server, and letting
2050 * everything pass thru the ldap backend.
2055 if ( attr->a_desc->ad_type->sat_syntax ==
2056 slap_schema.si_syn_distinguishedName )
2058 ldap_dnattr_result_rewrite( &dc, attr->a_vals );
2060 } else if ( attr->a_desc == slap_schema.si_ad_ref ) {
2061 ldap_back_referral_result_rewrite( &dc, attr->a_vals, NULL );
2065 for ( i = 0; i < last; i++ ) {
2070 rc = ordered_value_pretty( attr->a_desc,
2071 &attr->a_vals[i], &pval, NULL );
2074 rc = ordered_value_validate( attr->a_desc,
2075 &attr->a_vals[i], 0 );
2079 LBER_FREE( attr->a_vals[i].bv_val );
2080 if ( --last == i ) {
2081 BER_BVZERO( &attr->a_vals[ i ] );
2084 attr->a_vals[i] = attr->a_vals[last];
2085 BER_BVZERO( &attr->a_vals[last] );
2091 LBER_FREE( attr->a_vals[i].bv_val );
2092 attr->a_vals[i] = pval;
2096 if ( last == 0 && attr->a_vals != &slap_dummy_bv ) {
2102 if ( last && attr->a_desc->ad_type->sat_equality &&
2103 attr->a_desc->ad_type->sat_equality->smr_normalize )
2107 attr->a_nvals = ch_malloc( ( last + 1 ) * sizeof( struct berval ) );
2108 for ( i = 0; i<last; i++ ) {
2109 /* if normalizer fails, drop this value */
2110 if ( ordered_value_normalize(
2111 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
2113 attr->a_desc->ad_type->sat_equality,
2114 &attr->a_vals[i], &attr->a_nvals[i],
2116 LBER_FREE( attr->a_vals[i].bv_val );
2117 if ( --last == i ) {
2118 BER_BVZERO( &attr->a_vals[ i ] );
2121 attr->a_vals[i] = attr->a_vals[last];
2122 BER_BVZERO( &attr->a_vals[last] );
2126 BER_BVZERO( &attr->a_nvals[i] );
2133 attr->a_nvals = attr->a_vals;
2136 attr->a_numvals = last;
2138 attrp = &attr->a_next;
2142 /* only check if some mapping occurred */
2143 if ( check_duplicate_attrs ) {
2146 for ( ap = &ent.e_attrs; *ap != NULL; ap = &(*ap)->a_next ) {
2149 for ( tap = &(*ap)->a_next; *tap != NULL; ) {
2150 if ( (*tap)->a_desc == (*ap)->a_desc ) {
2152 Modification mod = { 0 };
2153 const char *text = NULL;
2154 char textbuf[ SLAP_TEXT_BUFLEN ];
2155 Attribute *next = (*tap)->a_next;
2157 BER_BVSTR( &e.e_name, "" );
2158 BER_BVSTR( &e.e_nname, "" );
2160 mod.sm_op = LDAP_MOD_ADD;
2161 mod.sm_desc = (*ap)->a_desc;
2162 mod.sm_type = mod.sm_desc->ad_cname;
2163 mod.sm_numvals = (*ap)->a_numvals;
2164 mod.sm_values = (*tap)->a_vals;
2165 if ( (*tap)->a_nvals != (*tap)->a_vals ) {
2166 mod.sm_nvalues = (*tap)->a_nvals;
2169 (void)modify_add_values( &e, &mod,
2171 &text, textbuf, sizeof( textbuf ) );
2173 /* should not insert new attrs! */
2174 assert( e.e_attrs == *ap );
2180 tap = &(*tap)->a_next;
2186 /* Check for sorted attributes */
2187 if ( check_sorted_attrs ) {
2188 for ( attr = ent.e_attrs; attr; attr = attr->a_next ) {
2189 if ( attr->a_desc->ad_type->sat_flags & SLAP_AT_SORTED_VAL ) {
2190 while ( attr->a_numvals > 1 ) {
2192 int rc = slap_sort_vals( (Modifications *)attr, &text, &i, op->o_tmpmemctx );
2193 if ( rc != LDAP_TYPE_OR_VALUE_EXISTS )
2196 /* Strip duplicate values */
2197 if ( attr->a_nvals != attr->a_vals )
2198 LBER_FREE( attr->a_nvals[i].bv_val );
2199 LBER_FREE( attr->a_vals[i].bv_val );
2201 if ( i < attr->a_numvals ) {
2202 attr->a_vals[i] = attr->a_vals[attr->a_numvals];
2203 if ( attr->a_nvals != attr->a_vals )
2204 attr->a_nvals[i] = attr->a_nvals[attr->a_numvals];
2206 BER_BVZERO(&attr->a_vals[attr->a_numvals]);
2207 if ( attr->a_nvals != attr->a_vals )
2208 BER_BVZERO(&attr->a_nvals[attr->a_numvals]);
2210 attr->a_flags |= SLAP_ATTR_SORTED_VALS;
2215 ldap_get_entry_controls( mc->mc_conns[target].msc_ld,
2217 rs->sr_entry = &ent;
2218 rs->sr_attrs = op->ors_attrs;
2219 rs->sr_operational_attrs = NULL;
2220 rs->sr_flags = mi->mi_targets[ target ]->mt_rep_flags;
2221 rs->sr_err = LDAP_SUCCESS;
2222 rc = send_search_entry( op, rs );
2224 case LDAP_UNAVAILABLE:
2230 rs->sr_entry = NULL;
2231 rs->sr_attrs = NULL;
2232 if ( rs->sr_ctrls != NULL ) {
2233 ldap_controls_free( rs->sr_ctrls );
2234 rs->sr_ctrls = NULL;
2236 if ( !BER_BVISNULL( &ent.e_name ) ) {
2237 free( ent.e_name.bv_val );
2238 BER_BVZERO( &ent.e_name );
2240 if ( !BER_BVISNULL( &ent.e_nname ) ) {
2241 free( ent.e_nname.bv_val );
2242 BER_BVZERO( &ent.e_nname );
2244 entry_clean( &ent );