2 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
4 * Copyright 1999-2010 The OpenLDAP Foundation.
5 * Portions Copyright 2001-2003 Pierangelo Masarati.
6 * Portions Copyright 1999-2003 Howard Chu.
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted only as authorized by the OpenLDAP
13 * A copy of this license is available in the file LICENSE in the
14 * top-level directory of the distribution or, alternatively, at
15 * <http://www.OpenLDAP.org/license.html>.
18 * This work was initially developed by the Howard Chu for inclusion
19 * in OpenLDAP Software and subsequently enhanced by Pierangelo
27 #include <ac/socket.h>
28 #include <ac/string.h>
33 #include "../back-ldap/back-ldap.h"
34 #include "back-meta.h"
35 #undef ldap_debug /* silence a warning in ldap-int.h */
37 #include "../../../libraries/libldap/ldap-int.h"
39 /* IGNORE means that target does not (no longer) participate
41 * NOTREADY means the search on that target has not been initialized yet
43 #define META_MSGID_IGNORE (-1)
44 #define META_MSGID_NEED_BIND (-2)
45 #define META_MSGID_CONNECTING (-3)
55 typedef enum meta_search_candidate_t {
56 META_SEARCH_UNDEFINED = -2,
58 META_SEARCH_NOT_CANDIDATE,
59 META_SEARCH_CANDIDATE,
61 META_SEARCH_NEED_BIND,
62 META_SEARCH_CONNECTING
63 } meta_search_candidate_t;
66 * meta_search_dobind_init()
68 * initiates bind for a candidate target of a search.
70 static meta_search_candidate_t
71 meta_search_dobind_init(
76 SlapReply *candidates )
78 metaconn_t *mc = *mcp;
79 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
80 metatarget_t *mt = mi->mi_targets[ candidate ];
81 metasingleconn_t *msc = &mc->mc_conns[ candidate ];
83 struct berval binddn = msc->msc_bound_ndn,
89 meta_search_candidate_t retcode;
91 Debug( LDAP_DEBUG_TRACE, "%s >>> meta_search_dobind_init[%d]\n",
92 op->o_log_prefix, candidate, 0 );
95 * all the targets are already bound as pseudoroot
97 if ( mc->mc_authz_target == META_BOUND_ALL ) {
98 return META_SEARCH_CANDIDATE;
101 retcode = META_SEARCH_BINDING;
102 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
103 if ( LDAP_BACK_CONN_ISBOUND( msc ) || LDAP_BACK_CONN_ISANON( msc ) ) {
104 /* already bound (or anonymous) */
107 char buf[ SLAP_TEXT_BUFLEN ] = { '\0' };
110 if ( LDAP_BACK_CONN_ISBOUND( msc ) ) {
114 snprintf( buf, sizeof( buf ), " mc=%p ld=%p%s DN=\"%s\"",
115 (void *)mc, (void *)msc->msc_ld,
116 bound ? " bound" : " anonymous",
117 bound == 0 ? "" : msc->msc_bound_ndn.bv_val );
118 Debug( LDAP_DEBUG_ANY, "### %s meta_search_dobind_init[%d]%s\n",
119 op->o_log_prefix, candidate, buf );
120 #endif /* DEBUG_205 */
122 retcode = META_SEARCH_CANDIDATE;
124 } else if ( META_BACK_CONN_CREATING( msc ) || LDAP_BACK_CONN_BINDING( msc ) ) {
125 /* another thread is binding the target for this conn; wait */
128 char buf[ SLAP_TEXT_BUFLEN ] = { '\0' };
130 snprintf( buf, sizeof( buf ), " mc=%p ld=%p needbind",
131 (void *)mc, (void *)msc->msc_ld );
132 Debug( LDAP_DEBUG_ANY, "### %s meta_search_dobind_init[%d]%s\n",
133 op->o_log_prefix, candidate, buf );
134 #endif /* DEBUG_205 */
136 candidates[ candidate ].sr_msgid = META_MSGID_NEED_BIND;
137 retcode = META_SEARCH_NEED_BIND;
140 /* we'll need to bind the target for this conn */
143 char buf[ SLAP_TEXT_BUFLEN ];
145 snprintf( buf, sizeof( buf ), " mc=%p ld=%p binding",
146 (void *)mc, (void *)msc->msc_ld );
147 Debug( LDAP_DEBUG_ANY, "### %s meta_search_dobind_init[%d]%s\n",
148 op->o_log_prefix, candidate, buf );
149 #endif /* DEBUG_205 */
151 if ( msc->msc_ld == NULL ) {
152 /* for some reason (e.g. because formerly in "binding"
153 * state, with eventual connection expiration or invalidation)
154 * it was not initialized as expected */
156 Debug( LDAP_DEBUG_ANY, "%s meta_search_dobind_init[%d] mc=%p ld=NULL\n",
157 op->o_log_prefix, candidate, (void *)mc );
159 rc = meta_back_init_one_conn( op, rs, *mcp, candidate,
160 LDAP_BACK_CONN_ISPRIV( *mcp ), LDAP_BACK_DONTSEND, 0 );
163 assert( msc->msc_ld != NULL );
166 case LDAP_SERVER_DOWN:
167 case LDAP_UNAVAILABLE:
168 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
172 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
177 LDAP_BACK_CONN_BINDING_SET( msc );
180 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
182 if ( retcode != META_SEARCH_BINDING ) {
186 /* NOTE: this obsoletes pseudorootdn */
187 if ( op->o_conn != NULL &&
188 !op->o_do_not_cache &&
189 ( BER_BVISNULL( &msc->msc_bound_ndn ) ||
190 BER_BVISEMPTY( &msc->msc_bound_ndn ) ||
191 ( mt->mt_idassert_flags & LDAP_BACK_AUTH_OVERRIDE ) ) )
193 rc = meta_back_proxy_authz_cred( mc, candidate, op, rs, LDAP_BACK_DONTSEND, &binddn, &cred, &method );
197 case LDAP_UNAVAILABLE:
203 /* NOTE: we copy things here, even if bind didn't succeed yet,
204 * because the connection is not shared until bind is over */
205 if ( !BER_BVISNULL( &binddn ) ) {
206 ber_bvreplace( &msc->msc_bound_ndn, &binddn );
207 if ( META_BACK_TGT_SAVECRED( mt ) && !BER_BVISNULL( &cred ) ) {
208 if ( !BER_BVISNULL( &msc->msc_cred ) ) {
209 memset( msc->msc_cred.bv_val, 0,
210 msc->msc_cred.bv_len );
212 ber_bvreplace( &msc->msc_cred, &cred );
216 if ( LDAP_BACK_CONN_ISBOUND( msc ) ) {
217 /* apparently, idassert was configured with SASL bind,
218 * so bind occurred inside meta_back_proxy_authz_cred() */
219 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
220 LDAP_BACK_CONN_BINDING_CLEAR( msc );
221 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
222 return META_SEARCH_CANDIDATE;
228 case LDAP_AUTH_SIMPLE:
229 /* do a simple bind with binddn, cred */
238 assert( msc->msc_ld != NULL );
240 if ( !BER_BVISEMPTY( &binddn ) && BER_BVISEMPTY( &cred ) ) {
241 /* bind anonymously? */
242 Debug( LDAP_DEBUG_ANY, "%s meta_search_dobind_init[%d] mc=%p: "
243 "non-empty dn with empty cred; binding anonymously\n",
244 op->o_log_prefix, candidate, (void *)mc );
245 cred = slap_empty_bv;
247 } else if ( BER_BVISEMPTY( &binddn ) && !BER_BVISEMPTY( &cred ) ) {
249 Debug( LDAP_DEBUG_ANY, "%s meta_search_dobind_init[%d] mc=%p: "
250 "empty dn with non-empty cred: error\n",
251 op->o_log_prefix, candidate, (void *)mc );
255 /* connect must be async only the first time... */
256 ldap_set_option( msc->msc_ld, LDAP_OPT_CONNECT_ASYNC, LDAP_OPT_ON );
259 rc = ldap_sasl_bind( msc->msc_ld, binddn.bv_val, LDAP_SASL_SIMPLE, &cred,
260 NULL, NULL, &candidates[ candidate ].sr_msgid );
264 char buf[ SLAP_TEXT_BUFLEN ];
266 snprintf( buf, sizeof( buf ), "meta_search_dobind_init[%d] mc=%p ld=%p rc=%d",
267 candidate, (void *)mc, (void *)mc->mc_conns[ candidate ].msc_ld, rc );
268 Debug( LDAP_DEBUG_ANY, "### %s %s\n",
269 op->o_log_prefix, buf, 0 );
271 #endif /* DEBUG_205 */
275 assert( candidates[ candidate ].sr_msgid >= 0 );
276 META_BINDING_SET( &candidates[ candidate ] );
277 return META_SEARCH_BINDING;
279 case LDAP_X_CONNECTING:
280 /* must retry, same conn */
281 candidates[ candidate ].sr_msgid = META_MSGID_CONNECTING;
282 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
283 LDAP_BACK_CONN_BINDING_CLEAR( msc );
284 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
285 return META_SEARCH_CONNECTING;
287 case LDAP_SERVER_DOWN:
289 /* This is the worst thing that could happen:
290 * the search will wait until the retry is over. */
291 if ( !META_IS_RETRYING( &candidates[ candidate ] ) ) {
292 META_RETRYING_SET( &candidates[ candidate ] );
294 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
296 assert( mc->mc_refcnt > 0 );
297 if ( LogTest( LDAP_DEBUG_ANY ) ) {
298 char buf[ SLAP_TEXT_BUFLEN ];
300 /* this lock is required; however,
301 * it's invoked only when logging is on */
302 ldap_pvt_thread_mutex_lock( &mt->mt_uri_mutex );
303 snprintf( buf, sizeof( buf ),
304 "retrying URI=\"%s\" DN=\"%s\"",
306 BER_BVISNULL( &msc->msc_bound_ndn ) ?
307 "" : msc->msc_bound_ndn.bv_val );
308 ldap_pvt_thread_mutex_unlock( &mt->mt_uri_mutex );
310 Debug( LDAP_DEBUG_ANY,
311 "%s meta_search_dobind_init[%d]: %s.\n",
312 op->o_log_prefix, candidate, buf );
315 meta_clear_one_candidate( op, mc, candidate );
316 LDAP_BACK_CONN_ISBOUND_CLEAR( msc );
318 ( void )rewrite_session_delete( mt->mt_rwmap.rwm_rw, op->o_conn );
320 /* mc here must be the regular mc, reset and ready for init */
321 rc = meta_back_init_one_conn( op, rs, mc, candidate,
322 LDAP_BACK_CONN_ISPRIV( mc ), LDAP_BACK_DONTSEND, 0 );
324 if ( rc == LDAP_SUCCESS ) {
325 LDAP_BACK_CONN_BINDING_SET( msc );
328 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
330 if ( rc == LDAP_SUCCESS ) {
331 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
336 if ( *mcp == NULL ) {
337 retcode = META_SEARCH_ERR;
338 rs->sr_err = LDAP_UNAVAILABLE;
339 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
347 rc = slap_map_api2result( rs );
349 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
350 meta_clear_one_candidate( op, mc, candidate );
351 candidates[ candidate ].sr_err = rc;
352 if ( META_BACK_ONERR_STOP( mi ) ) {
353 LDAP_BACK_CONN_TAINTED_SET( mc );
354 meta_back_release_conn_lock( mi, mc, 0 );
358 retcode = META_SEARCH_ERR;
361 retcode = META_SEARCH_NOT_CANDIDATE;
363 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
364 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
371 static meta_search_candidate_t
372 meta_search_dobind_result(
377 SlapReply *candidates,
380 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
381 metaconn_t *mc = *mcp;
382 metasingleconn_t *msc = &mc->mc_conns[ candidate ];
384 meta_search_candidate_t retcode = META_SEARCH_NOT_CANDIDATE;
387 assert( msc->msc_ld != NULL );
389 /* FIXME: matched? referrals? response controls? */
390 rc = ldap_parse_result( msc->msc_ld, res,
391 &candidates[ candidate ].sr_err,
392 NULL, NULL, NULL, NULL, 0 );
393 if ( rc != LDAP_SUCCESS ) {
394 candidates[ candidate ].sr_err = rc;
397 rc = slap_map_api2result( &candidates[ candidate ] );
400 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
401 LDAP_BACK_CONN_BINDING_CLEAR( msc );
402 if ( rc != LDAP_SUCCESS ) {
403 meta_clear_one_candidate( op, mc, candidate );
404 candidates[ candidate ].sr_err = rc;
405 if ( META_BACK_ONERR_STOP( mi ) ) {
406 LDAP_BACK_CONN_TAINTED_SET( mc );
407 meta_back_release_conn_lock( mi, mc, 0 );
409 retcode = META_SEARCH_ERR;
414 /* FIXME: check if bound as idassert authcDN! */
415 if ( BER_BVISNULL( &msc->msc_bound_ndn )
416 || BER_BVISEMPTY( &msc->msc_bound_ndn ) )
418 LDAP_BACK_CONN_ISANON_SET( msc );
421 LDAP_BACK_CONN_ISBOUND_SET( msc );
423 retcode = META_SEARCH_CANDIDATE;
425 /* connect must be async */
426 ldap_set_option( msc->msc_ld, LDAP_OPT_CONNECT_ASYNC, LDAP_OPT_OFF );
429 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
430 META_BINDING_CLEAR( &candidates[ candidate ] );
432 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
437 static meta_search_candidate_t
438 meta_back_search_start(
444 SlapReply *candidates )
446 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
447 metatarget_t *mt = mi->mi_targets[ candidate ];
448 metasingleconn_t *msc = &(*mcp)->mc_conns[ candidate ];
449 struct berval realbase = op->o_req_dn;
450 int realscope = op->ors_scope;
451 struct berval mbase = BER_BVNULL;
452 struct berval mfilter = BER_BVNULL;
453 char **mapped_attrs = NULL;
455 meta_search_candidate_t retcode;
456 struct timeval tv, *tvp = NULL;
458 LDAPControl **ctrls = NULL;
460 /* this should not happen; just in case... */
461 if ( msc->msc_ld == NULL ) {
462 Debug( LDAP_DEBUG_ANY,
463 "%s: meta_back_search_start candidate=%d ld=NULL%s.\n",
464 op->o_log_prefix, candidate,
465 META_BACK_ONERR_STOP( mi ) ? "" : " (ignored)" );
466 candidates[ candidate ].sr_err = LDAP_OTHER;
467 if ( META_BACK_ONERR_STOP( mi ) ) {
468 return META_SEARCH_ERR;
470 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
471 return META_SEARCH_NOT_CANDIDATE;
474 Debug( LDAP_DEBUG_TRACE, "%s >>> meta_back_search_start[%d]\n", op->o_log_prefix, candidate, 0 );
477 * modifies the base according to the scope, if required
479 if ( mt->mt_nsuffix.bv_len > op->o_req_ndn.bv_len ) {
480 switch ( op->ors_scope ) {
481 case LDAP_SCOPE_SUBTREE:
483 * make the target suffix the new base
484 * FIXME: this is very forgiving, because
485 * "illegal" searchBases may be turned
486 * into the suffix of the target; however,
487 * the requested searchBase already passed
488 * thru the candidate analyzer...
490 if ( dnIsSuffix( &mt->mt_nsuffix, &op->o_req_ndn ) ) {
491 realbase = mt->mt_nsuffix;
492 if ( mt->mt_scope == LDAP_SCOPE_SUBORDINATE ) {
493 realscope = LDAP_SCOPE_SUBORDINATE;
498 * this target is no longer candidate
500 retcode = META_SEARCH_NOT_CANDIDATE;
505 case LDAP_SCOPE_SUBORDINATE:
506 case LDAP_SCOPE_ONELEVEL:
508 struct berval rdn = mt->mt_nsuffix;
509 rdn.bv_len -= op->o_req_ndn.bv_len + STRLENOF( "," );
510 if ( dnIsOneLevelRDN( &rdn )
511 && dnIsSuffix( &mt->mt_nsuffix, &op->o_req_ndn ) )
514 * if there is exactly one level,
515 * make the target suffix the new
516 * base, and make scope "base"
518 realbase = mt->mt_nsuffix;
519 if ( op->ors_scope == LDAP_SCOPE_SUBORDINATE ) {
520 if ( mt->mt_scope == LDAP_SCOPE_SUBORDINATE ) {
521 realscope = LDAP_SCOPE_SUBORDINATE;
523 realscope = LDAP_SCOPE_SUBTREE;
526 realscope = LDAP_SCOPE_BASE;
529 } /* else continue with the next case */
532 case LDAP_SCOPE_BASE:
534 * this target is no longer candidate
536 retcode = META_SEARCH_NOT_CANDIDATE;
541 /* initiate dobind */
542 retcode = meta_search_dobind_init( op, rs, mcp, candidate, candidates );
544 Debug( LDAP_DEBUG_TRACE, "%s <<< meta_search_dobind_init[%d]=%d\n", op->o_log_prefix, candidate, retcode );
546 if ( retcode != META_SEARCH_CANDIDATE ) {
551 * Rewrite the search base, if required
554 dc->ctx = "searchBase";
555 switch ( ldap_back_dn_massage( dc, &realbase, &mbase ) ) {
559 case LDAP_UNWILLING_TO_PERFORM:
560 rs->sr_err = LDAP_UNWILLING_TO_PERFORM;
561 rs->sr_text = "Operation not allowed";
562 send_ldap_result( op, rs );
563 retcode = META_SEARCH_ERR;
569 * this target is no longer candidate
571 retcode = META_SEARCH_NOT_CANDIDATE;
578 rc = ldap_back_filter_map_rewrite( dc, op->ors_filter,
579 &mfilter, BACKLDAP_MAP, op->o_tmpmemctx );
584 case LDAP_COMPARE_FALSE:
587 * this target is no longer candidate
589 retcode = META_SEARCH_NOT_CANDIDATE;
594 * Maps required attributes
596 rc = ldap_back_map_attrs( &mt->mt_rwmap.rwm_at,
597 op->ors_attrs, BACKLDAP_MAP, &mapped_attrs,
599 if ( rc != LDAP_SUCCESS ) {
601 * this target is no longer candidate
603 retcode = META_SEARCH_NOT_CANDIDATE;
607 if ( op->ors_tlimit != SLAP_NO_LIMIT ) {
608 tv.tv_sec = op->ors_tlimit > 0 ? op->ors_tlimit : 1;
615 if ( meta_back_controls_add( op, rs, *mcp, candidate, &ctrls )
618 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
619 retcode = META_SEARCH_NOT_CANDIDATE;
626 assert( msc->msc_ld != NULL );
627 rc = ldap_pvt_search( msc->msc_ld,
628 mbase.bv_val, realscope, mfilter.bv_val,
629 mapped_attrs, op->ors_attrsonly,
630 ctrls, NULL, tvp, op->ors_slimit, op->ors_deref,
631 &candidates[ candidate ].sr_msgid );
634 retcode = META_SEARCH_CANDIDATE;
637 case LDAP_SERVER_DOWN:
638 if ( nretries && meta_back_retry( op, rs, mcp, candidate, LDAP_BACK_DONTSEND ) ) {
640 /* if the identity changed, there might be need to re-authz */
641 (void)mi->mi_ldap_extra->controls_free( op, rs, &ctrls );
645 if ( *mcp == NULL ) {
646 retcode = META_SEARCH_ERR;
647 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
653 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
654 retcode = META_SEARCH_NOT_CANDIDATE;
658 (void)mi->mi_ldap_extra->controls_free( op, rs, &ctrls );
660 if ( mapped_attrs ) {
661 ber_memfree_x( mapped_attrs, op->o_tmpmemctx );
663 if ( mfilter.bv_val != op->ors_filterstr.bv_val ) {
664 ber_memfree_x( mfilter.bv_val, op->o_tmpmemctx );
666 if ( mbase.bv_val != realbase.bv_val ) {
667 free( mbase.bv_val );
671 Debug( LDAP_DEBUG_TRACE, "%s <<< meta_back_search_start[%d]=%d\n", op->o_log_prefix, candidate, retcode );
677 meta_back_search( Operation *op, SlapReply *rs )
679 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
681 struct timeval save_tv = { 0, 0 },
683 time_t stoptime = (time_t)(-1),
684 lastres_time = slap_get_time(),
686 int rc = 0, sres = LDAP_SUCCESS;
687 char *matched = NULL;
688 int last = 0, ncandidates = 0,
689 initial_candidates = 0, candidate_match = 0,
691 ldap_back_send_t sendok = LDAP_BACK_SENDERR;
696 SlapReply *candidates = NULL;
699 * controls are set in ldap_back_dobind()
701 * FIXME: in case of values return filter, we might want
702 * to map attrs and maybe rewrite value
705 mc = meta_back_getconn( op, rs, NULL, sendok );
710 dc.conn = op->o_conn;
713 if ( candidates == NULL ) candidates = meta_back_candidates_get( op );
717 for ( i = 0; i < mi->mi_ntargets; i++ ) {
718 /* reset sr_msgid; it is used in most loops
719 * to check if that target is still to be considered */
720 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
722 /* a target is marked as candidate by meta_back_getconn();
723 * if for any reason (an error, it's over or so) it is
724 * no longer active, sr_msgid is set to META_MSGID_IGNORE
725 * but it remains candidate, which means it has been active
726 * at some point during the operation. This allows to
727 * use its response code and more to compute the final
729 if ( !META_IS_CANDIDATE( &candidates[ i ] ) ) {
733 candidates[ i ].sr_matched = NULL;
734 candidates[ i ].sr_text = NULL;
735 candidates[ i ].sr_ref = NULL;
736 candidates[ i ].sr_ctrls = NULL;
738 /* get largest timeout among candidates */
739 if ( mi->mi_targets[ i ]->mt_timeout[ SLAP_OP_SEARCH ]
740 && mi->mi_targets[ i ]->mt_timeout[ SLAP_OP_SEARCH ] > timeout )
742 timeout = mi->mi_targets[ i ]->mt_timeout[ SLAP_OP_SEARCH ];
746 for ( i = 0; i < mi->mi_ntargets; i++ ) {
747 if ( !META_IS_CANDIDATE( &candidates[ i ] )
748 || candidates[ i ].sr_err != LDAP_SUCCESS )
753 switch ( meta_back_search_start( op, rs, &dc, &mc, i, candidates ) )
755 case META_SEARCH_NOT_CANDIDATE:
756 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
759 case META_SEARCH_NEED_BIND:
763 case META_SEARCH_CONNECTING:
764 case META_SEARCH_CANDIDATE:
765 case META_SEARCH_BINDING:
766 candidates[ i ].sr_type = REP_INTERMEDIATE;
770 case META_SEARCH_ERR:
771 savepriv = op->o_private;
772 op->o_private = (void *)i;
773 send_ldap_result( op, rs );
774 op->o_private = savepriv;
784 if ( ncandidates > 0 && needbind == ncandidates ) {
786 * give up the second time...
788 * NOTE: this should not occur the second time, since a fresh
789 * connection has ben created; however, targets may also
790 * need bind because the bind timed out or so.
792 if ( sendok & LDAP_BACK_BINDING ) {
793 Debug( LDAP_DEBUG_ANY,
794 "%s meta_back_search: unable to initialize conn\n",
795 op->o_log_prefix, 0, 0 );
796 rs->sr_err = LDAP_UNAVAILABLE;
797 rs->sr_text = "unable to initialize connection to remote targets";
798 send_ldap_result( op, rs );
803 /* FIXME: better create a separate connection? */
804 sendok |= LDAP_BACK_BINDING;
807 Debug( LDAP_DEBUG_ANY, "*** %s drop mc=%p create new connection\n",
808 op->o_log_prefix, (void *)mc, 0 );
809 #endif /* DEBUG_205 */
811 meta_back_release_conn( mi, mc );
820 initial_candidates = ncandidates;
822 if ( LogTest( LDAP_DEBUG_TRACE ) ) {
823 char cnd[ SLAP_TEXT_BUFLEN ];
826 for ( c = 0; c < mi->mi_ntargets; c++ ) {
827 if ( META_IS_CANDIDATE( &candidates[ c ] ) ) {
835 Debug( LDAP_DEBUG_TRACE, "%s meta_back_search: ncandidates=%d "
836 "cnd=\"%s\"\n", op->o_log_prefix, ncandidates, cnd );
839 if ( initial_candidates == 0 ) {
840 /* NOTE: here we are not sending any matchedDN;
841 * this is intended, because if the back-meta
842 * is serving this search request, but no valid
843 * candidate could be looked up, it means that
844 * there is a hole in the mapping of the targets
845 * and thus no knowledge of any remote superior
847 Debug( LDAP_DEBUG_ANY, "%s meta_back_search: "
848 "base=\"%s\" scope=%d: "
849 "no candidate could be selected\n",
850 op->o_log_prefix, op->o_req_dn.bv_val,
853 /* FIXME: we're sending the first error we encounter;
854 * maybe we should pick the worst... */
855 rc = LDAP_NO_SUCH_OBJECT;
856 for ( i = 0; i < mi->mi_ntargets; i++ ) {
857 if ( META_IS_CANDIDATE( &candidates[ i ] )
858 && candidates[ i ].sr_err != LDAP_SUCCESS )
860 rc = candidates[ i ].sr_err;
865 send_ldap_error( op, rs, rc, NULL );
870 /* We pull apart the ber result, stuff it into a slapd entry, and
871 * let send_search_entry stuff it back into ber format. Slow & ugly,
872 * but this is necessary for version matching, and for ACL processing.
875 if ( op->ors_tlimit != SLAP_NO_LIMIT ) {
876 stoptime = op->o_time + op->ors_tlimit;
880 * In case there are no candidates, no cycle takes place...
882 * FIXME: we might use a queue, to better balance the load
883 * among the candidates
885 for ( rc = 0; ncandidates > 0; ) {
888 alreadybound = ncandidates;
891 if ( timeout && lastres_time > 0
892 && ( slap_get_time() - lastres_time ) > timeout )
895 rs->sr_text = "Operation timed out";
896 rc = rs->sr_err = op->o_protocol >= LDAP_VERSION3 ?
897 LDAP_ADMINLIMIT_EXCEEDED : LDAP_OTHER;
898 savepriv = op->o_private;
899 op->o_private = (void *)i;
900 send_ldap_result( op, rs );
901 op->o_private = savepriv;
905 /* check time limit */
906 if ( op->ors_tlimit != SLAP_NO_LIMIT
907 && slap_get_time() > stoptime )
910 rc = rs->sr_err = LDAP_TIMELIMIT_EXCEEDED;
911 savepriv = op->o_private;
912 op->o_private = (void *)i;
913 send_ldap_result( op, rs );
914 op->o_private = savepriv;
918 for ( i = 0; i < mi->mi_ntargets; i++ ) {
919 meta_search_candidate_t retcode = META_SEARCH_UNDEFINED;
920 metasingleconn_t *msc = &mc->mc_conns[ i ];
921 LDAPMessage *res = NULL, *msg;
923 /* if msgid is invalid, don't ldap_result() */
924 if ( candidates[ i ].sr_msgid == META_MSGID_IGNORE ) {
928 /* if target still needs bind, retry */
929 if ( candidates[ i ].sr_msgid == META_MSGID_NEED_BIND
930 || candidates[ i ].sr_msgid == META_MSGID_CONNECTING )
932 /* initiate dobind */
933 retcode = meta_search_dobind_init( op, rs, &mc, i, candidates );
935 Debug( LDAP_DEBUG_TRACE, "%s <<< meta_search_dobind_init[%ld]=%d\n",
936 op->o_log_prefix, i, retcode );
939 case META_SEARCH_NEED_BIND:
943 case META_SEARCH_CONNECTING:
944 case META_SEARCH_BINDING:
947 case META_SEARCH_ERR:
948 candidates[ i ].sr_err = rs->sr_err;
949 if ( META_BACK_ONERR_STOP( mi ) ) {
950 savepriv = op->o_private;
951 op->o_private = (void *)i;
952 send_ldap_result( op, rs );
953 op->o_private = savepriv;
958 case META_SEARCH_NOT_CANDIDATE:
960 * When no candidates are left,
961 * the outer cycle finishes
963 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
964 assert( ncandidates > 0 );
968 case META_SEARCH_CANDIDATE:
969 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
970 switch ( meta_back_search_start( op, rs, &dc, &mc, i, candidates ) )
972 case META_SEARCH_CANDIDATE:
973 assert( candidates[ i ].sr_msgid >= 0 );
976 case META_SEARCH_ERR:
977 candidates[ i ].sr_err = rs->sr_err;
978 if ( META_BACK_ONERR_STOP( mi ) ) {
979 savepriv = op->o_private;
980 op->o_private = (void *)i;
981 send_ldap_result( op, rs );
982 op->o_private = savepriv;
987 case META_SEARCH_NOT_CANDIDATE:
988 /* means that meta_back_search_start()
989 * failed but onerr == continue */
990 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
991 assert( ncandidates > 0 );
1010 /* check for abandon */
1011 if ( op->o_abandon || LDAP_BACK_CONN_ABANDON( mc ) ) {
1016 if ( msc->msc_ld == NULL ) {
1017 char buf[ SLAP_TEXT_BUFLEN ];
1019 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
1020 snprintf( buf, sizeof( buf ),
1021 "%s meta_back_search[%ld] mc=%p msgid=%d%s%s%s\n",
1022 op->o_log_prefix, (long)i, (void *)mc,
1023 candidates[ i ].sr_msgid,
1024 META_IS_BINDING( &candidates[ i ] ) ? " binding" : "",
1025 LDAP_BACK_CONN_BINDING( &mc->mc_conns[ i ] ) ? " connbinding" : "",
1026 META_BACK_CONN_CREATING( &mc->mc_conns[ i ] ) ? " conncreating" : "" );
1027 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
1029 Debug( LDAP_DEBUG_ANY, "!!! %s\n", buf, 0, 0 );
1031 #endif /* DEBUG_205 */
1034 * FIXME: handle time limit as well?
1035 * Note that target servers are likely
1036 * to handle it, so at some time we'll
1037 * get a LDAP_TIMELIMIT_EXCEEDED from
1041 rc = ldap_result( msc->msc_ld, candidates[ i ].sr_msgid,
1042 LDAP_MSG_RECEIVED, &tv, &res );
1045 /* FIXME: res should not need to be freed */
1046 assert( res == NULL );
1051 /* something REALLY bad happened! */
1052 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
1053 candidates[ i ].sr_type = REP_RESULT;
1055 if ( meta_back_retry( op, rs, &mc, i, LDAP_BACK_DONTSEND ) ) {
1056 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1057 switch ( meta_back_search_start( op, rs, &dc, &mc, i, candidates ) )
1059 /* means that failed but onerr == continue */
1060 case META_SEARCH_NOT_CANDIDATE:
1061 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1063 assert( ncandidates > 0 );
1066 candidates[ i ].sr_err = rs->sr_err;
1067 if ( META_BACK_ONERR_STOP( mi ) ) {
1068 savepriv = op->o_private;
1069 op->o_private = (void *)i;
1070 send_ldap_result( op, rs );
1071 op->o_private = savepriv;
1076 case META_SEARCH_CANDIDATE:
1077 /* get back into business... */
1080 case META_SEARCH_BINDING:
1081 case META_SEARCH_CONNECTING:
1082 case META_SEARCH_NEED_BIND:
1083 case META_SEARCH_UNDEFINED:
1087 /* unrecoverable error */
1088 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1089 rc = rs->sr_err = LDAP_OTHER;
1094 candidates[ i ].sr_err = rs->sr_err;
1095 if ( META_BACK_ONERR_STOP( mi ) ) {
1096 savepriv = op->o_private;
1097 op->o_private = (void *)i;
1098 send_ldap_result( op, rs );
1099 op->o_private = savepriv;
1105 * When no candidates are left,
1106 * the outer cycle finishes
1108 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1109 assert( ncandidates > 0 );
1111 rs->sr_err = candidates[ i ].sr_err;
1115 lastres_time = slap_get_time();
1117 /* only touch when activity actually took place... */
1118 if ( mi->mi_idle_timeout != 0 && msc->msc_time < lastres_time ) {
1119 msc->msc_time = lastres_time;
1124 for ( msg = ldap_first_message( msc->msc_ld, res );
1126 msg = ldap_next_message( msc->msc_ld, msg ) )
1128 rc = ldap_msgtype( msg );
1129 if ( rc == LDAP_RES_SEARCH_ENTRY ) {
1132 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
1133 /* don't retry any more... */
1134 candidates[ i ].sr_type = REP_RESULT;
1139 e = ldap_first_entry( msc->msc_ld, msg );
1140 savepriv = op->o_private;
1141 op->o_private = (void *)i;
1142 rs->sr_err = meta_send_entry( op, rs, mc, i, e );
1144 switch ( rs->sr_err ) {
1145 case LDAP_SIZELIMIT_EXCEEDED:
1146 savepriv = op->o_private;
1147 op->o_private = (void *)i;
1148 send_ldap_result( op, rs );
1149 op->o_private = savepriv;
1150 rs->sr_err = LDAP_SUCCESS;
1151 ldap_msgfree( res );
1155 case LDAP_UNAVAILABLE:
1156 rs->sr_err = LDAP_OTHER;
1157 ldap_msgfree( res );
1161 op->o_private = savepriv;
1163 /* don't wait any longer... */
1166 save_tv.tv_usec = 0;
1168 } else if ( rc == LDAP_RES_SEARCH_REFERENCE ) {
1169 char **references = NULL;
1172 if ( META_BACK_TGT_NOREFS( mi->mi_targets[ i ] ) ) {
1176 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
1177 /* don't retry any more... */
1178 candidates[ i ].sr_type = REP_RESULT;
1183 rc = ldap_parse_reference( msc->msc_ld, msg,
1184 &references, &rs->sr_ctrls, 0 );
1186 if ( rc != LDAP_SUCCESS ) {
1190 if ( references == NULL ) {
1194 #ifdef ENABLE_REWRITE
1195 dc.ctx = "referralDN";
1196 #else /* ! ENABLE_REWRITE */
1199 #endif /* ! ENABLE_REWRITE */
1201 /* FIXME: merge all and return at the end */
1203 for ( cnt = 0; references[ cnt ]; cnt++ )
1206 rs->sr_ref = ber_memalloc_x( sizeof( struct berval ) * ( cnt + 1 ),
1209 for ( cnt = 0; references[ cnt ]; cnt++ ) {
1210 ber_str2bv_x( references[ cnt ], 0, 1, &rs->sr_ref[ cnt ],
1213 BER_BVZERO( &rs->sr_ref[ cnt ] );
1215 ( void )ldap_back_referral_result_rewrite( &dc, rs->sr_ref,
1218 if ( rs->sr_ref != NULL && !BER_BVISNULL( &rs->sr_ref[ 0 ] ) ) {
1219 /* ignore return value by now */
1220 savepriv = op->o_private;
1221 op->o_private = (void *)i;
1222 ( void )send_search_reference( op, rs );
1223 op->o_private = savepriv;
1225 ber_bvarray_free_x( rs->sr_ref, op->o_tmpmemctx );
1231 ber_memvfree( (void **)references );
1234 if ( rs->sr_ctrls ) {
1235 ldap_controls_free( rs->sr_ctrls );
1236 rs->sr_ctrls = NULL;
1239 } else if ( rc == LDAP_RES_INTERMEDIATE ) {
1240 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
1241 /* don't retry any more... */
1242 candidates[ i ].sr_type = REP_RESULT;
1245 /* FIXME: response controls
1246 * are passed without checks */
1247 rs->sr_err = ldap_parse_intermediate( msc->msc_ld,
1249 (char **)&rs->sr_rspoid,
1253 if ( rs->sr_err != LDAP_SUCCESS ) {
1254 candidates[ i ].sr_type = REP_RESULT;
1255 ldap_msgfree( res );
1260 slap_send_ldap_intermediate( op, rs );
1262 if ( rs->sr_rspoid != NULL ) {
1263 ber_memfree( (char *)rs->sr_rspoid );
1264 rs->sr_rspoid = NULL;
1267 if ( rs->sr_rspdata != NULL ) {
1268 ber_bvfree( rs->sr_rspdata );
1269 rs->sr_rspdata = NULL;
1272 if ( rs->sr_ctrls != NULL ) {
1273 ldap_controls_free( rs->sr_ctrls );
1274 rs->sr_ctrls = NULL;
1277 } else if ( rc == LDAP_RES_SEARCH_RESULT ) {
1278 char buf[ SLAP_TEXT_BUFLEN ];
1279 char **references = NULL;
1281 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
1282 /* don't retry any more... */
1283 candidates[ i ].sr_type = REP_RESULT;
1286 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1288 /* NOTE: ignores response controls
1289 * (and intermediate response controls
1290 * as well, except for those with search
1291 * references); this may not be correct,
1292 * but if they're not ignored then
1293 * back-meta would need to merge them
1294 * consistently (think of pagedResults...)
1296 /* FIXME: response controls? */
1297 rs->sr_err = ldap_parse_result( msc->msc_ld,
1299 &candidates[ i ].sr_err,
1300 (char **)&candidates[ i ].sr_matched,
1301 NULL /* (char **)&candidates[ i ].sr_text */ ,
1303 NULL /* &candidates[ i ].sr_ctrls (unused) */ ,
1305 if ( rs->sr_err != LDAP_SUCCESS ) {
1306 sres = slap_map_api2result( &candidates[ i ] );
1307 candidates[ i ].sr_type = REP_RESULT;
1308 ldap_msgfree( res );
1313 rs->sr_err = candidates[ i ].sr_err;
1315 /* massage matchedDN if need be */
1316 if ( candidates[ i ].sr_matched != NULL ) {
1317 struct berval match, mmatch;
1319 ber_str2bv( candidates[ i ].sr_matched,
1321 candidates[ i ].sr_matched = NULL;
1323 dc.ctx = "matchedDN";
1324 dc.target = mi->mi_targets[ i ];
1325 if ( !ldap_back_dn_massage( &dc, &match, &mmatch ) ) {
1326 if ( mmatch.bv_val == match.bv_val ) {
1327 candidates[ i ].sr_matched
1328 = ch_strdup( mmatch.bv_val );
1331 candidates[ i ].sr_matched = mmatch.bv_val;
1336 ldap_memfree( match.bv_val );
1339 /* add references to array */
1340 /* RFC 4511: referrals can only appear
1341 * if result code is LDAP_REFERRAL */
1342 if ( references != NULL
1343 && references[ 0 ] != NULL
1344 && references[ 0 ][ 0 ] != '\0' )
1346 if ( rs->sr_err != LDAP_REFERRAL ) {
1347 Debug( LDAP_DEBUG_ANY,
1348 "%s meta_back_search[%ld]: "
1349 "got referrals with err=%d\n",
1357 for ( cnt = 0; references[ cnt ]; cnt++ )
1360 sr_ref = ber_memalloc_x( sizeof( struct berval ) * ( cnt + 1 ),
1363 for ( cnt = 0; references[ cnt ]; cnt++ ) {
1364 ber_str2bv_x( references[ cnt ], 0, 1, &sr_ref[ cnt ],
1367 BER_BVZERO( &sr_ref[ cnt ] );
1369 ( void )ldap_back_referral_result_rewrite( &dc, sr_ref,
1372 if ( rs->sr_v2ref == NULL ) {
1373 rs->sr_v2ref = sr_ref;
1376 for ( cnt = 0; !BER_BVISNULL( &sr_ref[ cnt ] ); cnt++ ) {
1377 ber_bvarray_add_x( &rs->sr_v2ref, &sr_ref[ cnt ],
1380 ber_memfree_x( sr_ref, op->o_tmpmemctx );
1384 } else if ( rs->sr_err == LDAP_REFERRAL ) {
1385 Debug( LDAP_DEBUG_ANY,
1386 "%s meta_back_search[%ld]: "
1387 "got err=%d with null "
1388 "or empty referrals\n",
1392 rs->sr_err = LDAP_NO_SUCH_OBJECT;
1396 ber_memvfree( (void **)references );
1398 sres = slap_map_api2result( rs );
1400 if ( LogTest( LDAP_DEBUG_TRACE | LDAP_DEBUG_ANY ) ) {
1401 snprintf( buf, sizeof( buf ),
1402 "%s meta_back_search[%ld] "
1403 "match=\"%s\" err=%ld",
1404 op->o_log_prefix, i,
1405 candidates[ i ].sr_matched ? candidates[ i ].sr_matched : "",
1406 (long) candidates[ i ].sr_err );
1407 if ( candidates[ i ].sr_err == LDAP_SUCCESS ) {
1408 Debug( LDAP_DEBUG_TRACE, "%s.\n", buf, 0, 0 );
1411 Debug( LDAP_DEBUG_ANY, "%s (%s).\n",
1412 buf, ldap_err2string( candidates[ i ].sr_err ), 0 );
1417 case LDAP_NO_SUCH_OBJECT:
1418 /* is_ok is touched any time a valid
1419 * (even intermediate) result is
1420 * returned; as a consequence, if
1421 * a candidate returns noSuchObject
1422 * it is ignored and the candidate
1423 * is simply demoted. */
1425 sres = LDAP_SUCCESS;
1434 case LDAP_SIZELIMIT_EXCEEDED:
1435 /* if a target returned sizelimitExceeded
1436 * and the entry count is equal to the
1437 * proxy's limit, the target would have
1438 * returned more, and the error must be
1439 * propagated to the client; otherwise,
1440 * the target enforced a limit lower
1441 * than what requested by the proxy;
1443 candidates[ i ].sr_err = rs->sr_err;
1444 if ( rs->sr_nentries == op->ors_slimit
1445 || META_BACK_ONERR_STOP( mi ) )
1447 savepriv = op->o_private;
1448 op->o_private = (void *)i;
1449 send_ldap_result( op, rs );
1450 op->o_private = savepriv;
1451 ldap_msgfree( res );
1458 candidates[ i ].sr_err = rs->sr_err;
1459 if ( META_BACK_ONERR_STOP( mi ) ) {
1460 savepriv = op->o_private;
1461 op->o_private = (void *)i;
1462 send_ldap_result( op, rs );
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 */
1810 LDAP_BACK_CONN_TAINTED_SET( mc );
1815 meta_back_release_conn( mi, mc );
1829 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
1830 struct berval a, mapped;
1831 int check_duplicate_attrs = 0;
1832 int check_sorted_attrs = 0;
1834 BerElement ber = *e->lm_ber;
1835 Attribute *attr, **attrp;
1844 if ( ber_scanf( &ber, "l{", &len ) == LBER_ERROR ) {
1845 return LDAP_DECODING_ERROR;
1848 if ( ber_set_option( &ber, LBER_OPT_REMAINING_BYTES, &len ) != LBER_OPT_SUCCESS ) {
1852 if ( ber_scanf( &ber, "m{", &bdn ) == LBER_ERROR ) {
1853 return LDAP_DECODING_ERROR;
1857 * Rewrite the dn of the result, if needed
1859 dc.target = mi->mi_targets[ target ];
1860 dc.conn = op->o_conn;
1862 dc.ctx = "searchResult";
1864 rs->sr_err = ldap_back_dn_massage( &dc, &bdn, &dn );
1865 if ( rs->sr_err != LDAP_SUCCESS) {
1870 * Note: this may fail if the target host(s) schema differs
1871 * from the one known to the meta, and a DN with unknown
1872 * attributes is returned.
1874 * FIXME: should we log anything, or delegate to dnNormalize?
1876 rc = dnPrettyNormal( NULL, &dn, &ent.e_name, &ent.e_nname,
1878 if ( dn.bv_val != bdn.bv_val ) {
1883 if ( rc != LDAP_SUCCESS ) {
1884 Debug( LDAP_DEBUG_ANY,
1885 "%s meta_send_entry(\"%s\"): "
1886 "invalid DN syntax\n",
1887 op->o_log_prefix, ent.e_name.bv_val, 0 );
1888 rc = LDAP_INVALID_DN_SYNTAX;
1895 if ( mi->mi_cache.ttl != META_DNCACHE_DISABLED ) {
1896 ( void )meta_dncache_update_entry( &mi->mi_cache,
1897 &ent.e_nname, target );
1900 attrp = &ent.e_attrs;
1902 dc.ctx = "searchAttrDN";
1903 while ( ber_scanf( &ber, "{m", &a ) != LBER_ERROR ) {
1905 slap_syntax_validate_func *validate;
1906 slap_syntax_transform_func *pretty;
1908 if ( ber_pvt_ber_remaining( &ber ) < 0 ) {
1909 Debug( LDAP_DEBUG_ANY,
1910 "%s meta_send_entry(\"%s\"): "
1911 "unable to parse attr \"%s\".\n",
1912 op->o_log_prefix, ent.e_name.bv_val, a.bv_val );
1918 if ( ber_pvt_ber_remaining( &ber ) == 0 ) {
1922 ldap_back_map( &mi->mi_targets[ target ]->mt_rwmap.rwm_at,
1923 &a, &mapped, BACKLDAP_REMAP );
1924 if ( BER_BVISNULL( &mapped ) || mapped.bv_val[0] == '\0' ) {
1925 ( void )ber_scanf( &ber, "x" /* [W] */ );
1928 if ( mapped.bv_val != a.bv_val ) {
1929 /* will need to check for duplicate attrs */
1930 check_duplicate_attrs++;
1932 attr = attr_alloc( NULL );
1933 if ( attr == NULL ) {
1937 if ( slap_bv2ad( &mapped, &attr->a_desc, &text )
1939 if ( slap_bv2undef_ad( &mapped, &attr->a_desc, &text,
1940 SLAP_AD_PROXIED ) != LDAP_SUCCESS )
1942 char buf[ SLAP_TEXT_BUFLEN ];
1944 snprintf( buf, sizeof( buf ),
1945 "%s meta_send_entry(\"%s\"): "
1946 "slap_bv2undef_ad(%s): %s\n",
1947 op->o_log_prefix, ent.e_name.bv_val,
1948 mapped.bv_val, text );
1950 Debug( LDAP_DEBUG_ANY, "%s", buf, 0, 0 );
1951 ( void )ber_scanf( &ber, "x" /* [W] */ );
1957 if ( attr->a_desc->ad_type->sat_flags & SLAP_AT_SORTED_VAL )
1958 check_sorted_attrs = 1;
1960 /* no subschemaSubentry */
1961 if ( attr->a_desc == slap_schema.si_ad_subschemaSubentry
1962 || attr->a_desc == slap_schema.si_ad_entryDN )
1966 * We eat target's subschemaSubentry because
1967 * a search for this value is likely not
1968 * to resolve to the appropriate backend;
1969 * later, the local subschemaSubentry is
1972 * We also eat entryDN because the frontend
1973 * will reattach it without checking if already
1976 ( void )ber_scanf( &ber, "x" /* [W] */ );
1981 if ( ber_scanf( &ber, "[W]", &attr->a_vals ) == LBER_ERROR
1982 || attr->a_vals == NULL )
1984 attr->a_vals = (struct berval *)&slap_dummy_bv;
1987 for ( last = 0; !BER_BVISNULL( &attr->a_vals[ last ] ); ++last )
1990 attr->a_numvals = last;
1992 validate = attr->a_desc->ad_type->sat_syntax->ssyn_validate;
1993 pretty = attr->a_desc->ad_type->sat_syntax->ssyn_pretty;
1995 if ( !validate && !pretty ) {
2000 if ( attr->a_desc == slap_schema.si_ad_objectClass
2001 || attr->a_desc == slap_schema.si_ad_structuralObjectClass )
2005 for ( bv = attr->a_vals; !BER_BVISNULL( bv ); bv++ ) {
2008 ldap_back_map( &mi->mi_targets[ target ]->mt_rwmap.rwm_oc,
2009 bv, &mapped, BACKLDAP_REMAP );
2010 if ( BER_BVISNULL( &mapped ) || mapped.bv_val[0] == '\0') {
2017 *bv = attr->a_vals[ last ];
2018 BER_BVZERO( &attr->a_vals[ last ] );
2021 } else if ( mapped.bv_val != bv->bv_val ) {
2024 for ( i = 0; !BER_BVISNULL( &attr->a_vals[ i ] ); i++ ) {
2025 if ( &attr->a_vals[ i ] == bv ) {
2029 if ( ber_bvstrcasecmp( &mapped, &attr->a_vals[ i ] ) == 0 ) {
2034 if ( !BER_BVISNULL( &attr->a_vals[ i ] ) ) {
2038 ber_bvreplace( bv, &mapped );
2040 } else if ( ( oc = oc_bvfind_undef( bv ) ) == NULL ) {
2044 ber_bvreplace( bv, &oc->soc_cname );
2048 * It is necessary to try to rewrite attributes with
2049 * dn syntax because they might be used in ACLs as
2050 * members of groups; since ACLs are applied to the
2051 * rewritten stuff, no dn-based subecj clause could
2052 * be used at the ldap backend side (see
2053 * http://www.OpenLDAP.org/faq/data/cache/452.html)
2054 * The problem can be overcome by moving the dn-based
2055 * ACLs to the target directory server, and letting
2056 * everything pass thru the ldap backend.
2061 if ( attr->a_desc->ad_type->sat_syntax ==
2062 slap_schema.si_syn_distinguishedName )
2064 ldap_dnattr_result_rewrite( &dc, attr->a_vals );
2066 } else if ( attr->a_desc == slap_schema.si_ad_ref ) {
2067 ldap_back_referral_result_rewrite( &dc, attr->a_vals, NULL );
2071 for ( i = 0; i < last; i++ ) {
2076 rc = ordered_value_pretty( attr->a_desc,
2077 &attr->a_vals[i], &pval, NULL );
2080 rc = ordered_value_validate( attr->a_desc,
2081 &attr->a_vals[i], 0 );
2085 LBER_FREE( attr->a_vals[i].bv_val );
2086 if ( --last == i ) {
2087 BER_BVZERO( &attr->a_vals[ i ] );
2090 attr->a_vals[i] = attr->a_vals[last];
2091 BER_BVZERO( &attr->a_vals[last] );
2097 LBER_FREE( attr->a_vals[i].bv_val );
2098 attr->a_vals[i] = pval;
2102 if ( last == 0 && attr->a_vals != &slap_dummy_bv ) {
2108 if ( last && attr->a_desc->ad_type->sat_equality &&
2109 attr->a_desc->ad_type->sat_equality->smr_normalize )
2113 attr->a_nvals = ch_malloc( ( last + 1 ) * sizeof( struct berval ) );
2114 for ( i = 0; i<last; i++ ) {
2115 /* if normalizer fails, drop this value */
2116 if ( ordered_value_normalize(
2117 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
2119 attr->a_desc->ad_type->sat_equality,
2120 &attr->a_vals[i], &attr->a_nvals[i],
2122 LBER_FREE( attr->a_vals[i].bv_val );
2123 if ( --last == i ) {
2124 BER_BVZERO( &attr->a_vals[ i ] );
2127 attr->a_vals[i] = attr->a_vals[last];
2128 BER_BVZERO( &attr->a_vals[last] );
2132 BER_BVZERO( &attr->a_nvals[i] );
2139 attr->a_nvals = attr->a_vals;
2142 attr->a_numvals = last;
2144 attrp = &attr->a_next;
2148 /* only check if some mapping occurred */
2149 if ( check_duplicate_attrs ) {
2152 for ( ap = &ent.e_attrs; *ap != NULL; ap = &(*ap)->a_next ) {
2155 for ( tap = &(*ap)->a_next; *tap != NULL; ) {
2156 if ( (*tap)->a_desc == (*ap)->a_desc ) {
2158 Modification mod = { 0 };
2159 const char *text = NULL;
2160 char textbuf[ SLAP_TEXT_BUFLEN ];
2161 Attribute *next = (*tap)->a_next;
2163 BER_BVSTR( &e.e_name, "" );
2164 BER_BVSTR( &e.e_nname, "" );
2166 mod.sm_op = LDAP_MOD_ADD;
2167 mod.sm_desc = (*ap)->a_desc;
2168 mod.sm_type = mod.sm_desc->ad_cname;
2169 mod.sm_numvals = (*ap)->a_numvals;
2170 mod.sm_values = (*tap)->a_vals;
2171 if ( (*tap)->a_nvals != (*tap)->a_vals ) {
2172 mod.sm_nvalues = (*tap)->a_nvals;
2175 (void)modify_add_values( &e, &mod,
2177 &text, textbuf, sizeof( textbuf ) );
2179 /* should not insert new attrs! */
2180 assert( e.e_attrs == *ap );
2186 tap = &(*tap)->a_next;
2192 /* Check for sorted attributes */
2193 if ( check_sorted_attrs ) {
2194 for ( attr = ent.e_attrs; attr; attr = attr->a_next ) {
2195 if ( attr->a_desc->ad_type->sat_flags & SLAP_AT_SORTED_VAL ) {
2196 while ( attr->a_numvals > 1 ) {
2198 int rc = slap_sort_vals( (Modifications *)attr, &text, &i, op->o_tmpmemctx );
2199 if ( rc != LDAP_TYPE_OR_VALUE_EXISTS )
2202 /* Strip duplicate values */
2203 if ( attr->a_nvals != attr->a_vals )
2204 LBER_FREE( attr->a_nvals[i].bv_val );
2205 LBER_FREE( attr->a_vals[i].bv_val );
2207 if ( i < attr->a_numvals ) {
2208 attr->a_vals[i] = attr->a_vals[attr->a_numvals];
2209 if ( attr->a_nvals != attr->a_vals )
2210 attr->a_nvals[i] = attr->a_nvals[attr->a_numvals];
2212 BER_BVZERO(&attr->a_vals[attr->a_numvals]);
2213 if ( attr->a_nvals != attr->a_vals )
2214 BER_BVZERO(&attr->a_nvals[attr->a_numvals]);
2216 attr->a_flags |= SLAP_ATTR_SORTED_VALS;
2221 ldap_get_entry_controls( mc->mc_conns[target].msc_ld,
2223 rs->sr_entry = &ent;
2224 rs->sr_attrs = op->ors_attrs;
2225 rs->sr_operational_attrs = NULL;
2226 rs->sr_flags = mi->mi_targets[ target ]->mt_rep_flags;
2227 rs->sr_err = LDAP_SUCCESS;
2228 rc = send_search_entry( op, rs );
2230 case LDAP_UNAVAILABLE:
2236 rs->sr_entry = NULL;
2237 rs->sr_attrs = NULL;
2238 if ( rs->sr_ctrls != NULL ) {
2239 ldap_controls_free( rs->sr_ctrls );
2240 rs->sr_ctrls = NULL;
2242 if ( !BER_BVISNULL( &ent.e_name ) ) {
2243 free( ent.e_name.bv_val );
2244 BER_BVZERO( &ent.e_name );
2246 if ( !BER_BVISNULL( &ent.e_nname ) ) {
2247 free( ent.e_nname.bv_val );
2248 BER_BVZERO( &ent.e_nname );
2250 entry_clean( &ent );