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 metatarget_t *mt = mi->mi_targets[ candidate ];
382 metaconn_t *mc = *mcp;
383 metasingleconn_t *msc = &mc->mc_conns[ candidate ];
385 meta_search_candidate_t retcode = META_SEARCH_NOT_CANDIDATE;
388 assert( msc->msc_ld != NULL );
390 /* FIXME: matched? referrals? response controls? */
391 rc = ldap_parse_result( msc->msc_ld, res,
392 &candidates[ candidate ].sr_err,
393 NULL, NULL, NULL, NULL, 0 );
394 if ( rc != LDAP_SUCCESS ) {
395 candidates[ candidate ].sr_err = rc;
397 rc = slap_map_api2result( &candidates[ candidate ] );
399 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
400 LDAP_BACK_CONN_BINDING_CLEAR( msc );
401 if ( rc != LDAP_SUCCESS ) {
402 meta_clear_one_candidate( op, mc, candidate );
403 candidates[ candidate ].sr_err = rc;
404 if ( META_BACK_ONERR_STOP( mi ) ) {
405 LDAP_BACK_CONN_TAINTED_SET( mc );
406 meta_back_release_conn_lock( mi, mc, 0 );
408 retcode = META_SEARCH_ERR;
413 /* FIXME: check if bound as idassert authcDN! */
414 if ( BER_BVISNULL( &msc->msc_bound_ndn )
415 || BER_BVISEMPTY( &msc->msc_bound_ndn ) )
417 LDAP_BACK_CONN_ISANON_SET( msc );
420 if ( META_BACK_TGT_SAVECRED( mt ) &&
421 !BER_BVISNULL( &msc->msc_cred ) &&
422 !BER_BVISEMPTY( &msc->msc_cred ) )
424 ldap_set_rebind_proc( msc->msc_ld, mt->mt_rebind_f, msc );
426 LDAP_BACK_CONN_ISBOUND_SET( msc );
428 retcode = META_SEARCH_CANDIDATE;
430 /* connect must be async */
431 ldap_set_option( msc->msc_ld, LDAP_OPT_CONNECT_ASYNC, LDAP_OPT_OFF );
434 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
435 META_BINDING_CLEAR( &candidates[ candidate ] );
437 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
442 static meta_search_candidate_t
443 meta_back_search_start(
449 SlapReply *candidates )
451 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
452 metatarget_t *mt = mi->mi_targets[ candidate ];
453 metasingleconn_t *msc = &(*mcp)->mc_conns[ candidate ];
454 struct berval realbase = op->o_req_dn;
455 int realscope = op->ors_scope;
456 struct berval mbase = BER_BVNULL;
457 struct berval mfilter = BER_BVNULL;
458 char **mapped_attrs = NULL;
460 meta_search_candidate_t retcode;
461 struct timeval tv, *tvp = NULL;
463 LDAPControl **ctrls = NULL;
465 /* this should not happen; just in case... */
466 if ( msc->msc_ld == NULL ) {
467 Debug( LDAP_DEBUG_ANY,
468 "%s: meta_back_search_start candidate=%d ld=NULL%s.\n",
469 op->o_log_prefix, candidate,
470 META_BACK_ONERR_STOP( mi ) ? "" : " (ignored)" );
471 candidates[ candidate ].sr_err = LDAP_OTHER;
472 if ( META_BACK_ONERR_STOP( mi ) ) {
473 return META_SEARCH_ERR;
475 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
476 return META_SEARCH_NOT_CANDIDATE;
479 Debug( LDAP_DEBUG_TRACE, "%s >>> meta_back_search_start[%d]\n", op->o_log_prefix, candidate, 0 );
482 * modifies the base according to the scope, if required
484 if ( mt->mt_nsuffix.bv_len > op->o_req_ndn.bv_len ) {
485 switch ( op->ors_scope ) {
486 case LDAP_SCOPE_SUBTREE:
488 * make the target suffix the new base
489 * FIXME: this is very forgiving, because
490 * "illegal" searchBases may be turned
491 * into the suffix of the target; however,
492 * the requested searchBase already passed
493 * thru the candidate analyzer...
495 if ( dnIsSuffix( &mt->mt_nsuffix, &op->o_req_ndn ) ) {
496 realbase = mt->mt_nsuffix;
497 if ( mt->mt_scope == LDAP_SCOPE_SUBORDINATE ) {
498 realscope = LDAP_SCOPE_SUBORDINATE;
503 * this target is no longer candidate
505 retcode = META_SEARCH_NOT_CANDIDATE;
510 case LDAP_SCOPE_SUBORDINATE:
511 case LDAP_SCOPE_ONELEVEL:
513 struct berval rdn = mt->mt_nsuffix;
514 rdn.bv_len -= op->o_req_ndn.bv_len + STRLENOF( "," );
515 if ( dnIsOneLevelRDN( &rdn )
516 && dnIsSuffix( &mt->mt_nsuffix, &op->o_req_ndn ) )
519 * if there is exactly one level,
520 * make the target suffix the new
521 * base, and make scope "base"
523 realbase = mt->mt_nsuffix;
524 if ( op->ors_scope == LDAP_SCOPE_SUBORDINATE ) {
525 if ( mt->mt_scope == LDAP_SCOPE_SUBORDINATE ) {
526 realscope = LDAP_SCOPE_SUBORDINATE;
528 realscope = LDAP_SCOPE_SUBTREE;
531 realscope = LDAP_SCOPE_BASE;
534 } /* else continue with the next case */
537 case LDAP_SCOPE_BASE:
539 * this target is no longer candidate
541 retcode = META_SEARCH_NOT_CANDIDATE;
546 /* initiate dobind */
547 retcode = meta_search_dobind_init( op, rs, mcp, candidate, candidates );
549 Debug( LDAP_DEBUG_TRACE, "%s <<< meta_search_dobind_init[%d]=%d\n", op->o_log_prefix, candidate, retcode );
551 if ( retcode != META_SEARCH_CANDIDATE ) {
556 * Rewrite the search base, if required
559 dc->ctx = "searchBase";
560 switch ( ldap_back_dn_massage( dc, &realbase, &mbase ) ) {
564 case LDAP_UNWILLING_TO_PERFORM:
565 rs->sr_err = LDAP_UNWILLING_TO_PERFORM;
566 rs->sr_text = "Operation not allowed";
567 send_ldap_result( op, rs );
568 retcode = META_SEARCH_ERR;
574 * this target is no longer candidate
576 retcode = META_SEARCH_NOT_CANDIDATE;
583 rc = ldap_back_filter_map_rewrite( dc, op->ors_filter,
584 &mfilter, BACKLDAP_MAP, op->o_tmpmemctx );
589 case LDAP_COMPARE_FALSE:
592 * this target is no longer candidate
594 retcode = META_SEARCH_NOT_CANDIDATE;
599 * Maps required attributes
601 rc = ldap_back_map_attrs( &mt->mt_rwmap.rwm_at,
602 op->ors_attrs, BACKLDAP_MAP, &mapped_attrs,
604 if ( rc != LDAP_SUCCESS ) {
606 * this target is no longer candidate
608 retcode = META_SEARCH_NOT_CANDIDATE;
612 if ( op->ors_tlimit != SLAP_NO_LIMIT ) {
613 tv.tv_sec = op->ors_tlimit > 0 ? op->ors_tlimit : 1;
620 if ( meta_back_controls_add( op, rs, *mcp, candidate, &ctrls )
623 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
624 retcode = META_SEARCH_NOT_CANDIDATE;
631 assert( msc->msc_ld != NULL );
632 rc = ldap_pvt_search( msc->msc_ld,
633 mbase.bv_val, realscope, mfilter.bv_val,
634 mapped_attrs, op->ors_attrsonly,
635 ctrls, NULL, tvp, op->ors_slimit, op->ors_deref,
636 &candidates[ candidate ].sr_msgid );
639 retcode = META_SEARCH_CANDIDATE;
642 case LDAP_SERVER_DOWN:
643 if ( nretries && meta_back_retry( op, rs, mcp, candidate, LDAP_BACK_DONTSEND ) ) {
645 /* if the identity changed, there might be need to re-authz */
646 (void)mi->mi_ldap_extra->controls_free( op, rs, &ctrls );
650 if ( *mcp == NULL ) {
651 retcode = META_SEARCH_ERR;
652 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
658 candidates[ candidate ].sr_msgid = META_MSGID_IGNORE;
659 retcode = META_SEARCH_NOT_CANDIDATE;
663 (void)mi->mi_ldap_extra->controls_free( op, rs, &ctrls );
665 if ( mapped_attrs ) {
666 ber_memfree_x( mapped_attrs, op->o_tmpmemctx );
668 if ( mfilter.bv_val != op->ors_filterstr.bv_val ) {
669 ber_memfree_x( mfilter.bv_val, op->o_tmpmemctx );
671 if ( mbase.bv_val != realbase.bv_val ) {
672 free( mbase.bv_val );
676 Debug( LDAP_DEBUG_TRACE, "%s <<< meta_back_search_start[%d]=%d\n", op->o_log_prefix, candidate, retcode );
682 meta_back_search( Operation *op, SlapReply *rs )
684 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
686 struct timeval save_tv = { 0, 0 },
688 time_t stoptime = (time_t)(-1),
689 lastres_time = slap_get_time(),
691 int rc = 0, sres = LDAP_SUCCESS;
692 char *matched = NULL;
693 int last = 0, ncandidates = 0,
694 initial_candidates = 0, candidate_match = 0,
696 ldap_back_send_t sendok = LDAP_BACK_SENDERR;
701 SlapReply *candidates = NULL;
705 * controls are set in ldap_back_dobind()
707 * FIXME: in case of values return filter, we might want
708 * to map attrs and maybe rewrite value
711 mc = meta_back_getconn( op, rs, NULL, sendok );
716 dc.conn = op->o_conn;
719 if ( candidates == NULL ) candidates = meta_back_candidates_get( op );
723 for ( i = 0; i < mi->mi_ntargets; i++ ) {
724 /* reset sr_msgid; it is used in most loops
725 * to check if that target is still to be considered */
726 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
728 /* a target is marked as candidate by meta_back_getconn();
729 * if for any reason (an error, it's over or so) it is
730 * no longer active, sr_msgid is set to META_MSGID_IGNORE
731 * but it remains candidate, which means it has been active
732 * at some point during the operation. This allows to
733 * use its response code and more to compute the final
735 if ( !META_IS_CANDIDATE( &candidates[ i ] ) ) {
739 candidates[ i ].sr_matched = NULL;
740 candidates[ i ].sr_text = NULL;
741 candidates[ i ].sr_ref = NULL;
742 candidates[ i ].sr_ctrls = NULL;
744 /* get largest timeout among candidates */
745 if ( mi->mi_targets[ i ]->mt_timeout[ SLAP_OP_SEARCH ]
746 && mi->mi_targets[ i ]->mt_timeout[ SLAP_OP_SEARCH ] > timeout )
748 timeout = mi->mi_targets[ i ]->mt_timeout[ SLAP_OP_SEARCH ];
752 for ( i = 0; i < mi->mi_ntargets; i++ ) {
753 if ( !META_IS_CANDIDATE( &candidates[ i ] )
754 || candidates[ i ].sr_err != LDAP_SUCCESS )
759 switch ( meta_back_search_start( op, rs, &dc, &mc, i, candidates ) )
761 case META_SEARCH_NOT_CANDIDATE:
762 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
765 case META_SEARCH_NEED_BIND:
769 case META_SEARCH_CONNECTING:
770 case META_SEARCH_CANDIDATE:
771 case META_SEARCH_BINDING:
772 candidates[ i ].sr_type = REP_INTERMEDIATE;
776 case META_SEARCH_ERR:
777 savepriv = op->o_private;
778 op->o_private = (void *)i;
779 send_ldap_result( op, rs );
780 op->o_private = savepriv;
790 if ( ncandidates > 0 && needbind == ncandidates ) {
792 * give up the second time...
794 * NOTE: this should not occur the second time, since a fresh
795 * connection has ben created; however, targets may also
796 * need bind because the bind timed out or so.
798 if ( sendok & LDAP_BACK_BINDING ) {
799 Debug( LDAP_DEBUG_ANY,
800 "%s meta_back_search: unable to initialize conn\n",
801 op->o_log_prefix, 0, 0 );
802 rs->sr_err = LDAP_UNAVAILABLE;
803 rs->sr_text = "unable to initialize connection to remote targets";
804 send_ldap_result( op, rs );
809 /* FIXME: better create a separate connection? */
810 sendok |= LDAP_BACK_BINDING;
813 Debug( LDAP_DEBUG_ANY, "*** %s drop mc=%p create new connection\n",
814 op->o_log_prefix, (void *)mc, 0 );
815 #endif /* DEBUG_205 */
817 meta_back_release_conn( mi, mc );
826 initial_candidates = ncandidates;
828 if ( LogTest( LDAP_DEBUG_TRACE ) ) {
829 char cnd[ SLAP_TEXT_BUFLEN ];
832 for ( c = 0; c < mi->mi_ntargets; c++ ) {
833 if ( META_IS_CANDIDATE( &candidates[ c ] ) ) {
841 Debug( LDAP_DEBUG_TRACE, "%s meta_back_search: ncandidates=%d "
842 "cnd=\"%s\"\n", op->o_log_prefix, ncandidates, cnd );
845 if ( initial_candidates == 0 ) {
846 /* NOTE: here we are not sending any matchedDN;
847 * this is intended, because if the back-meta
848 * is serving this search request, but no valid
849 * candidate could be looked up, it means that
850 * there is a hole in the mapping of the targets
851 * and thus no knowledge of any remote superior
853 Debug( LDAP_DEBUG_ANY, "%s meta_back_search: "
854 "base=\"%s\" scope=%d: "
855 "no candidate could be selected\n",
856 op->o_log_prefix, op->o_req_dn.bv_val,
859 /* FIXME: we're sending the first error we encounter;
860 * maybe we should pick the worst... */
861 rc = LDAP_NO_SUCH_OBJECT;
862 for ( i = 0; i < mi->mi_ntargets; i++ ) {
863 if ( META_IS_CANDIDATE( &candidates[ i ] )
864 && candidates[ i ].sr_err != LDAP_SUCCESS )
866 rc = candidates[ i ].sr_err;
871 send_ldap_error( op, rs, rc, NULL );
876 /* We pull apart the ber result, stuff it into a slapd entry, and
877 * let send_search_entry stuff it back into ber format. Slow & ugly,
878 * but this is necessary for version matching, and for ACL processing.
881 if ( op->ors_tlimit != SLAP_NO_LIMIT ) {
882 stoptime = op->o_time + op->ors_tlimit;
886 * In case there are no candidates, no cycle takes place...
888 * FIXME: we might use a queue, to better balance the load
889 * among the candidates
891 for ( rc = 0; ncandidates > 0; ) {
894 alreadybound = ncandidates;
897 if ( timeout && lastres_time > 0
898 && ( slap_get_time() - lastres_time ) > timeout )
901 rs->sr_text = "Operation timed out";
902 rc = rs->sr_err = op->o_protocol >= LDAP_VERSION3 ?
903 LDAP_ADMINLIMIT_EXCEEDED : LDAP_OTHER;
904 savepriv = op->o_private;
905 op->o_private = (void *)i;
906 send_ldap_result( op, rs );
907 op->o_private = savepriv;
911 /* check time limit */
912 if ( op->ors_tlimit != SLAP_NO_LIMIT
913 && slap_get_time() > stoptime )
916 rc = rs->sr_err = LDAP_TIMELIMIT_EXCEEDED;
917 savepriv = op->o_private;
918 op->o_private = (void *)i;
919 send_ldap_result( op, rs );
920 op->o_private = savepriv;
924 for ( i = 0; i < mi->mi_ntargets; i++ ) {
925 meta_search_candidate_t retcode = META_SEARCH_UNDEFINED;
926 metasingleconn_t *msc = &mc->mc_conns[ i ];
927 LDAPMessage *res = NULL, *msg;
929 /* if msgid is invalid, don't ldap_result() */
930 if ( candidates[ i ].sr_msgid == META_MSGID_IGNORE ) {
934 /* if target still needs bind, retry */
935 if ( candidates[ i ].sr_msgid == META_MSGID_NEED_BIND
936 || candidates[ i ].sr_msgid == META_MSGID_CONNECTING )
938 /* initiate dobind */
939 retcode = meta_search_dobind_init( op, rs, &mc, i, candidates );
941 Debug( LDAP_DEBUG_TRACE, "%s <<< meta_search_dobind_init[%ld]=%d\n",
942 op->o_log_prefix, i, retcode );
945 case META_SEARCH_NEED_BIND:
949 case META_SEARCH_CONNECTING:
950 case META_SEARCH_BINDING:
953 case META_SEARCH_ERR:
954 candidates[ i ].sr_err = rs->sr_err;
955 if ( META_BACK_ONERR_STOP( mi ) ) {
956 savepriv = op->o_private;
957 op->o_private = (void *)i;
958 send_ldap_result( op, rs );
959 op->o_private = savepriv;
964 case META_SEARCH_NOT_CANDIDATE:
966 * When no candidates are left,
967 * the outer cycle finishes
969 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
970 assert( ncandidates > 0 );
974 case META_SEARCH_CANDIDATE:
975 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
976 switch ( meta_back_search_start( op, rs, &dc, &mc, i, candidates ) )
978 case META_SEARCH_CANDIDATE:
979 assert( candidates[ i ].sr_msgid >= 0 );
982 case META_SEARCH_ERR:
983 candidates[ i ].sr_err = rs->sr_err;
984 if ( META_BACK_ONERR_STOP( mi ) ) {
985 savepriv = op->o_private;
986 op->o_private = (void *)i;
987 send_ldap_result( op, rs );
988 op->o_private = savepriv;
993 case META_SEARCH_NOT_CANDIDATE:
994 /* means that meta_back_search_start()
995 * failed but onerr == continue */
996 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
997 assert( ncandidates > 0 );
1016 /* check for abandon */
1017 if ( op->o_abandon || LDAP_BACK_CONN_ABANDON( mc ) ) {
1022 if ( msc->msc_ld == NULL ) {
1023 char buf[ SLAP_TEXT_BUFLEN ];
1025 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
1026 snprintf( buf, sizeof( buf ),
1027 "%s meta_back_search[%ld] mc=%p msgid=%d%s%s%s\n",
1028 op->o_log_prefix, (long)i, (void *)mc,
1029 candidates[ i ].sr_msgid,
1030 META_IS_BINDING( &candidates[ i ] ) ? " binding" : "",
1031 LDAP_BACK_CONN_BINDING( &mc->mc_conns[ i ] ) ? " connbinding" : "",
1032 META_BACK_CONN_CREATING( &mc->mc_conns[ i ] ) ? " conncreating" : "" );
1033 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
1035 Debug( LDAP_DEBUG_ANY, "!!! %s\n", buf, 0, 0 );
1037 #endif /* DEBUG_205 */
1040 * FIXME: handle time limit as well?
1041 * Note that target servers are likely
1042 * to handle it, so at some time we'll
1043 * get a LDAP_TIMELIMIT_EXCEEDED from
1047 rc = ldap_result( msc->msc_ld, candidates[ i ].sr_msgid,
1048 LDAP_MSG_RECEIVED, &tv, &res );
1051 /* FIXME: res should not need to be freed */
1052 assert( res == NULL );
1057 /* something REALLY bad happened! */
1058 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
1059 candidates[ i ].sr_type = REP_RESULT;
1061 if ( meta_back_retry( op, rs, &mc, i, LDAP_BACK_DONTSEND ) ) {
1062 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1063 switch ( meta_back_search_start( op, rs, &dc, &mc, i, candidates ) )
1065 /* means that failed but onerr == continue */
1066 case META_SEARCH_NOT_CANDIDATE:
1067 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1069 assert( ncandidates > 0 );
1072 candidates[ i ].sr_err = rs->sr_err;
1073 if ( META_BACK_ONERR_STOP( mi ) ) {
1074 savepriv = op->o_private;
1075 op->o_private = (void *)i;
1076 send_ldap_result( op, rs );
1077 op->o_private = savepriv;
1082 case META_SEARCH_CANDIDATE:
1083 /* get back into business... */
1086 case META_SEARCH_BINDING:
1087 case META_SEARCH_CONNECTING:
1088 case META_SEARCH_NEED_BIND:
1089 case META_SEARCH_UNDEFINED:
1093 /* unrecoverable error */
1094 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1095 rc = rs->sr_err = LDAP_OTHER;
1100 candidates[ i ].sr_err = rs->sr_err;
1101 if ( META_BACK_ONERR_STOP( mi ) ) {
1102 savepriv = op->o_private;
1103 op->o_private = (void *)i;
1104 send_ldap_result( op, rs );
1105 op->o_private = savepriv;
1111 * When no candidates are left,
1112 * the outer cycle finishes
1114 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1115 assert( ncandidates > 0 );
1117 rs->sr_err = candidates[ i ].sr_err;
1121 lastres_time = slap_get_time();
1123 /* only touch when activity actually took place... */
1124 if ( mi->mi_idle_timeout != 0 && msc->msc_time < lastres_time ) {
1125 msc->msc_time = lastres_time;
1130 for ( msg = ldap_first_message( msc->msc_ld, res );
1132 msg = ldap_next_message( msc->msc_ld, msg ) )
1134 rc = ldap_msgtype( msg );
1135 if ( rc == LDAP_RES_SEARCH_ENTRY ) {
1138 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
1139 /* don't retry any more... */
1140 candidates[ i ].sr_type = REP_RESULT;
1145 e = ldap_first_entry( msc->msc_ld, msg );
1146 savepriv = op->o_private;
1147 op->o_private = (void *)i;
1148 rs->sr_err = meta_send_entry( op, rs, mc, i, e );
1150 switch ( rs->sr_err ) {
1151 case LDAP_SIZELIMIT_EXCEEDED:
1152 savepriv = op->o_private;
1153 op->o_private = (void *)i;
1154 send_ldap_result( op, rs );
1155 op->o_private = savepriv;
1156 rs->sr_err = LDAP_SUCCESS;
1157 ldap_msgfree( res );
1161 case LDAP_UNAVAILABLE:
1162 rs->sr_err = LDAP_OTHER;
1163 ldap_msgfree( res );
1167 op->o_private = savepriv;
1169 /* don't wait any longer... */
1172 save_tv.tv_usec = 0;
1174 } else if ( rc == LDAP_RES_SEARCH_REFERENCE ) {
1175 char **references = NULL;
1178 if ( META_BACK_TGT_NOREFS( mi->mi_targets[ i ] ) ) {
1182 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
1183 /* don't retry any more... */
1184 candidates[ i ].sr_type = REP_RESULT;
1189 rc = ldap_parse_reference( msc->msc_ld, msg,
1190 &references, &rs->sr_ctrls, 0 );
1192 if ( rc != LDAP_SUCCESS ) {
1196 if ( references == NULL ) {
1200 #ifdef ENABLE_REWRITE
1201 dc.ctx = "referralDN";
1202 #else /* ! ENABLE_REWRITE */
1205 #endif /* ! ENABLE_REWRITE */
1207 /* FIXME: merge all and return at the end */
1209 for ( cnt = 0; references[ cnt ]; cnt++ )
1212 rs->sr_ref = ber_memalloc_x( sizeof( struct berval ) * ( cnt + 1 ),
1215 for ( cnt = 0; references[ cnt ]; cnt++ ) {
1216 ber_str2bv_x( references[ cnt ], 0, 1, &rs->sr_ref[ cnt ],
1219 BER_BVZERO( &rs->sr_ref[ cnt ] );
1221 ( void )ldap_back_referral_result_rewrite( &dc, rs->sr_ref,
1224 if ( rs->sr_ref != NULL && !BER_BVISNULL( &rs->sr_ref[ 0 ] ) ) {
1225 /* ignore return value by now */
1226 savepriv = op->o_private;
1227 op->o_private = (void *)i;
1228 ( void )send_search_reference( op, rs );
1229 op->o_private = savepriv;
1231 ber_bvarray_free_x( rs->sr_ref, op->o_tmpmemctx );
1237 ber_memvfree( (void **)references );
1240 if ( rs->sr_ctrls ) {
1241 ldap_controls_free( rs->sr_ctrls );
1242 rs->sr_ctrls = NULL;
1245 } else if ( rc == LDAP_RES_INTERMEDIATE ) {
1246 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
1247 /* don't retry any more... */
1248 candidates[ i ].sr_type = REP_RESULT;
1251 /* FIXME: response controls
1252 * are passed without checks */
1253 rs->sr_err = ldap_parse_intermediate( msc->msc_ld,
1255 (char **)&rs->sr_rspoid,
1259 if ( rs->sr_err != LDAP_SUCCESS ) {
1260 candidates[ i ].sr_type = REP_RESULT;
1261 ldap_msgfree( res );
1266 slap_send_ldap_intermediate( op, rs );
1268 if ( rs->sr_rspoid != NULL ) {
1269 ber_memfree( (char *)rs->sr_rspoid );
1270 rs->sr_rspoid = NULL;
1273 if ( rs->sr_rspdata != NULL ) {
1274 ber_bvfree( rs->sr_rspdata );
1275 rs->sr_rspdata = NULL;
1278 if ( rs->sr_ctrls != NULL ) {
1279 ldap_controls_free( rs->sr_ctrls );
1280 rs->sr_ctrls = NULL;
1283 } else if ( rc == LDAP_RES_SEARCH_RESULT ) {
1284 char buf[ SLAP_TEXT_BUFLEN ];
1285 char **references = NULL;
1287 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
1288 /* don't retry any more... */
1289 candidates[ i ].sr_type = REP_RESULT;
1292 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1294 /* NOTE: ignores response controls
1295 * (and intermediate response controls
1296 * as well, except for those with search
1297 * references); this may not be correct,
1298 * but if they're not ignored then
1299 * back-meta would need to merge them
1300 * consistently (think of pagedResults...)
1302 /* FIXME: response controls? */
1303 rs->sr_err = ldap_parse_result( msc->msc_ld,
1305 &candidates[ i ].sr_err,
1306 (char **)&candidates[ i ].sr_matched,
1307 (char **)&candidates[ i ].sr_text,
1309 NULL /* &candidates[ i ].sr_ctrls (unused) */ ,
1311 if ( rs->sr_err != LDAP_SUCCESS ) {
1312 candidates[ i ].sr_err = rs->sr_err;
1313 sres = slap_map_api2result( &candidates[ i ] );
1314 candidates[ i ].sr_type = REP_RESULT;
1315 ldap_msgfree( res );
1320 rs->sr_err = candidates[ i ].sr_err;
1322 /* massage matchedDN if need be */
1323 if ( candidates[ i ].sr_matched != NULL ) {
1324 struct berval match, mmatch;
1326 ber_str2bv( candidates[ i ].sr_matched,
1328 candidates[ i ].sr_matched = NULL;
1330 dc.ctx = "matchedDN";
1331 dc.target = mi->mi_targets[ i ];
1332 if ( !ldap_back_dn_massage( &dc, &match, &mmatch ) ) {
1333 if ( mmatch.bv_val == match.bv_val ) {
1334 candidates[ i ].sr_matched
1335 = ch_strdup( mmatch.bv_val );
1338 candidates[ i ].sr_matched = mmatch.bv_val;
1343 ldap_memfree( match.bv_val );
1346 /* add references to array */
1347 /* RFC 4511: referrals can only appear
1348 * if result code is LDAP_REFERRAL */
1349 if ( references != NULL
1350 && references[ 0 ] != NULL
1351 && references[ 0 ][ 0 ] != '\0' )
1353 if ( rs->sr_err != LDAP_REFERRAL ) {
1354 Debug( LDAP_DEBUG_ANY,
1355 "%s meta_back_search[%ld]: "
1356 "got referrals with err=%d\n",
1364 for ( cnt = 0; references[ cnt ]; cnt++ )
1367 sr_ref = ber_memalloc_x( sizeof( struct berval ) * ( cnt + 1 ),
1370 for ( cnt = 0; references[ cnt ]; cnt++ ) {
1371 ber_str2bv_x( references[ cnt ], 0, 1, &sr_ref[ cnt ],
1374 BER_BVZERO( &sr_ref[ cnt ] );
1376 ( void )ldap_back_referral_result_rewrite( &dc, sr_ref,
1379 if ( rs->sr_v2ref == NULL ) {
1380 rs->sr_v2ref = sr_ref;
1383 for ( cnt = 0; !BER_BVISNULL( &sr_ref[ cnt ] ); cnt++ ) {
1384 ber_bvarray_add_x( &rs->sr_v2ref, &sr_ref[ cnt ],
1387 ber_memfree_x( sr_ref, op->o_tmpmemctx );
1391 } else if ( rs->sr_err == LDAP_REFERRAL ) {
1392 Debug( LDAP_DEBUG_ANY,
1393 "%s meta_back_search[%ld]: "
1394 "got err=%d with null "
1395 "or empty referrals\n",
1399 rs->sr_err = LDAP_NO_SUCH_OBJECT;
1403 ber_memvfree( (void **)references );
1405 sres = slap_map_api2result( rs );
1407 if ( LogTest( LDAP_DEBUG_TRACE | LDAP_DEBUG_ANY ) ) {
1408 snprintf( buf, sizeof( buf ),
1409 "%s meta_back_search[%ld] "
1410 "match=\"%s\" err=%ld",
1411 op->o_log_prefix, i,
1412 candidates[ i ].sr_matched ? candidates[ i ].sr_matched : "",
1413 (long) candidates[ i ].sr_err );
1414 if ( candidates[ i ].sr_err == LDAP_SUCCESS ) {
1415 Debug( LDAP_DEBUG_TRACE, "%s.\n", buf, 0, 0 );
1418 Debug( LDAP_DEBUG_ANY, "%s (%s).\n",
1419 buf, ldap_err2string( candidates[ i ].sr_err ), 0 );
1424 case LDAP_NO_SUCH_OBJECT:
1425 /* is_ok is touched any time a valid
1426 * (even intermediate) result is
1427 * returned; as a consequence, if
1428 * a candidate returns noSuchObject
1429 * it is ignored and the candidate
1430 * is simply demoted. */
1432 sres = LDAP_SUCCESS;
1441 case LDAP_SIZELIMIT_EXCEEDED:
1442 /* if a target returned sizelimitExceeded
1443 * and the entry count is equal to the
1444 * proxy's limit, the target would have
1445 * returned more, and the error must be
1446 * propagated to the client; otherwise,
1447 * the target enforced a limit lower
1448 * than what requested by the proxy;
1450 candidates[ i ].sr_err = rs->sr_err;
1451 if ( rs->sr_nentries == op->ors_slimit
1452 || META_BACK_ONERR_STOP( mi ) )
1454 char *save_text = rs->sr_text;
1455 savepriv = op->o_private;
1456 op->o_private = (void *)i;
1457 rs->sr_text = candidates[ i ].sr_text;
1458 send_ldap_result( op, rs );
1459 rs->sr_text = save_text;
1460 op->o_private = savepriv;
1461 ldap_msgfree( res );
1468 candidates[ i ].sr_err = rs->sr_err;
1469 if ( META_BACK_ONERR_STOP( mi ) ) {
1470 char *save_text = rs->sr_text;
1471 savepriv = op->o_private;
1472 op->o_private = (void *)i;
1473 rs->sr_text = candidates[ i ].sr_text;
1474 send_ldap_result( op, rs );
1475 rs->sr_text = save_text;
1476 op->o_private = savepriv;
1477 ldap_msgfree( res );
1488 * When no candidates are left,
1489 * the outer cycle finishes
1491 assert( ncandidates > 0 );
1494 } else if ( rc == LDAP_RES_BIND ) {
1495 meta_search_candidate_t retcode;
1497 retcode = meta_search_dobind_result( op, rs, &mc, i, candidates, msg );
1498 if ( retcode == META_SEARCH_CANDIDATE ) {
1499 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1500 retcode = meta_back_search_start( op, rs, &dc, &mc, i, candidates );
1503 switch ( retcode ) {
1504 case META_SEARCH_CANDIDATE:
1507 /* means that failed but onerr == continue */
1508 case META_SEARCH_NOT_CANDIDATE:
1509 case META_SEARCH_ERR:
1510 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1511 assert( ncandidates > 0 );
1514 candidates[ i ].sr_err = rs->sr_err;
1515 if ( META_BACK_ONERR_STOP( mi ) ) {
1516 savepriv = op->o_private;
1517 op->o_private = (void *)i;
1518 send_ldap_result( op, rs );
1519 op->o_private = savepriv;
1520 ldap_msgfree( res );
1532 Debug( LDAP_DEBUG_ANY,
1533 "%s meta_back_search[%ld]: "
1534 "unrecognized response message tag=%d\n",
1538 ldap_msgfree( res );
1545 ldap_msgfree( res );
1549 /* check for abandon */
1550 if ( op->o_abandon || LDAP_BACK_CONN_ABANDON( mc ) ) {
1551 for ( i = 0; i < mi->mi_ntargets; i++ ) {
1552 if ( candidates[ i ].sr_msgid >= 0
1553 || candidates[ i ].sr_msgid == META_MSGID_CONNECTING )
1555 if ( META_IS_BINDING( &candidates[ i ] )
1556 || candidates[ i ].sr_msgid == META_MSGID_CONNECTING )
1558 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
1559 if ( LDAP_BACK_CONN_BINDING( &mc->mc_conns[ i ] )
1560 || candidates[ i ].sr_msgid == META_MSGID_CONNECTING )
1562 /* if still binding, destroy */
1565 char buf[ SLAP_TEXT_BUFLEN ];
1567 snprintf( buf, sizeof( buf), "%s meta_back_search(abandon) "
1568 "ldap_unbind_ext[%ld] mc=%p ld=%p",
1569 op->o_log_prefix, i, (void *)mc,
1570 (void *)mc->mc_conns[i].msc_ld );
1572 Debug( LDAP_DEBUG_ANY, "### %s\n", buf, 0, 0 );
1573 #endif /* DEBUG_205 */
1575 meta_clear_one_candidate( op, mc, i );
1577 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
1578 META_BINDING_CLEAR( &candidates[ i ] );
1581 (void)meta_back_cancel( mc, op, rs,
1582 candidates[ i ].sr_msgid, i,
1583 LDAP_BACK_DONTSEND );
1586 candidates[ i ].sr_msgid = META_MSGID_IGNORE;
1587 assert( ncandidates > 0 );
1592 if ( op->o_abandon ) {
1596 /* let send_ldap_result play cleanup handlers (ITS#4645) */
1600 /* if no entry was found during this loop,
1601 * set a minimal timeout */
1602 if ( ncandidates > 0 && gotit == 0 ) {
1603 if ( save_tv.tv_sec == 0 && save_tv.tv_usec == 0 ) {
1604 save_tv.tv_usec = LDAP_BACK_RESULT_UTIMEOUT/initial_candidates;
1606 /* arbitrarily limit to something between 1 and 2 minutes */
1607 } else if ( ( stoptime == -1 && save_tv.tv_sec < 60 )
1608 || save_tv.tv_sec < ( stoptime - slap_get_time() ) / ( 2 * ncandidates ) )
1610 /* double the timeout */
1611 lutil_timermul( &save_tv, 2, &save_tv );
1614 if ( alreadybound == 0 ) {
1616 (void)select( 0, NULL, NULL, NULL, &tv );
1619 ldap_pvt_thread_yield();
1626 * FIXME: need a better strategy to handle errors
1629 rc = meta_back_op_result( mc, op, rs, META_TARGET_NONE,
1630 -1, stoptime != -1 ? (stoptime - slap_get_time()) : 0,
1631 LDAP_BACK_SENDERR );
1639 * Rewrite the matched portion of the search base, if required
1641 * FIXME: only the last one gets caught!
1643 savepriv = op->o_private;
1644 op->o_private = (void *)(long)mi->mi_ntargets;
1645 if ( candidate_match > 0 ) {
1646 struct berval pmatched = BER_BVNULL;
1648 /* we use the first one */
1649 for ( i = 0; i < mi->mi_ntargets; i++ ) {
1650 if ( META_IS_CANDIDATE( &candidates[ i ] )
1651 && candidates[ i ].sr_matched != NULL )
1653 struct berval bv, pbv;
1656 /* if we got success, and this target
1657 * returned noSuchObject, and its suffix
1658 * is a superior of the searchBase,
1659 * ignore the matchedDN */
1660 if ( sres == LDAP_SUCCESS
1661 && candidates[ i ].sr_err == LDAP_NO_SUCH_OBJECT
1662 && op->o_req_ndn.bv_len > mi->mi_targets[ i ]->mt_nsuffix.bv_len )
1664 free( (char *)candidates[ i ].sr_matched );
1665 candidates[ i ].sr_matched = NULL;
1669 ber_str2bv( candidates[ i ].sr_matched, 0, 0, &bv );
1670 rc = dnPretty( NULL, &bv, &pbv, op->o_tmpmemctx );
1672 if ( rc == LDAP_SUCCESS ) {
1674 /* NOTE: if they all are superiors
1675 * of the baseDN, the shorter is also
1676 * superior of the longer... */
1677 if ( pbv.bv_len > pmatched.bv_len ) {
1678 if ( !BER_BVISNULL( &pmatched ) ) {
1679 op->o_tmpfree( pmatched.bv_val, op->o_tmpmemctx );
1682 op->o_private = (void *)i;
1685 op->o_tmpfree( pbv.bv_val, op->o_tmpmemctx );
1689 if ( candidates[ i ].sr_matched != NULL ) {
1690 free( (char *)candidates[ i ].sr_matched );
1691 candidates[ i ].sr_matched = NULL;
1696 if ( !BER_BVISNULL( &pmatched ) ) {
1697 matched = pmatched.bv_val;
1700 } else if ( sres == LDAP_NO_SUCH_OBJECT ) {
1701 matched = op->o_bd->be_suffix[ 0 ].bv_val;
1705 * In case we returned at least one entry, we return LDAP_SUCCESS
1706 * otherwise, the latter error code we got
1709 if ( sres == LDAP_SUCCESS ) {
1710 if ( rs->sr_v2ref ) {
1711 sres = LDAP_REFERRAL;
1714 if ( META_BACK_ONERR_REPORT( mi ) ) {
1716 * Report errors, if any
1718 * FIXME: we should handle error codes and return the more
1719 * important/reasonable
1721 for ( i = 0; i < mi->mi_ntargets; i++ ) {
1722 if ( !META_IS_CANDIDATE( &candidates[ i ] ) ) {
1726 if ( candidates[ i ].sr_err != LDAP_SUCCESS
1727 && candidates[ i ].sr_err != LDAP_NO_SUCH_OBJECT )
1729 sres = candidates[ i ].sr_err;
1737 rs->sr_matched = matched;
1738 rs->sr_ref = ( sres == LDAP_REFERRAL ? rs->sr_v2ref : NULL );
1739 send_ldap_result( op, rs );
1740 op->o_private = savepriv;
1741 rs->sr_matched = NULL;
1745 if ( matched && matched != op->o_bd->be_suffix[ 0 ].bv_val ) {
1746 op->o_tmpfree( matched, op->o_tmpmemctx );
1749 if ( rs->sr_v2ref ) {
1750 ber_bvarray_free_x( rs->sr_v2ref, op->o_tmpmemctx );
1753 for ( i = 0; i < mi->mi_ntargets; i++ ) {
1754 if ( !META_IS_CANDIDATE( &candidates[ i ] ) ) {
1759 if ( META_IS_BINDING( &candidates[ i ] )
1760 || candidates[ i ].sr_msgid == META_MSGID_CONNECTING )
1762 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
1763 if ( LDAP_BACK_CONN_BINDING( &mc->mc_conns[ i ] )
1764 || candidates[ i ].sr_msgid == META_MSGID_CONNECTING )
1766 assert( candidates[ i ].sr_msgid >= 0
1767 || candidates[ i ].sr_msgid == META_MSGID_CONNECTING );
1768 assert( mc->mc_conns[ i ].msc_ld != NULL );
1771 Debug( LDAP_DEBUG_ANY, "### %s meta_back_search(cleanup) "
1772 "ldap_unbind_ext[%ld] ld=%p\n",
1773 op->o_log_prefix, i, (void *)mc->mc_conns[i].msc_ld );
1774 #endif /* DEBUG_205 */
1776 /* if still binding, destroy */
1777 meta_clear_one_candidate( op, mc, i );
1779 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
1780 META_BINDING_CLEAR( &candidates[ i ] );
1782 } else if ( candidates[ i ].sr_msgid >= 0 ) {
1783 (void)meta_back_cancel( mc, op, rs,
1784 candidates[ i ].sr_msgid, i,
1785 LDAP_BACK_DONTSEND );
1789 if ( candidates[ i ].sr_matched ) {
1790 free( (char *)candidates[ i ].sr_matched );
1791 candidates[ i ].sr_matched = NULL;
1794 if ( candidates[ i ].sr_text ) {
1795 ldap_memfree( (char *)candidates[ i ].sr_text );
1796 candidates[ i ].sr_text = NULL;
1799 if ( candidates[ i ].sr_ref ) {
1800 ber_bvarray_free( candidates[ i ].sr_ref );
1801 candidates[ i ].sr_ref = NULL;
1804 if ( candidates[ i ].sr_ctrls ) {
1805 ldap_controls_free( candidates[ i ].sr_ctrls );
1806 candidates[ i ].sr_ctrls = NULL;
1809 if ( META_BACK_TGT_QUARANTINE( mi->mi_targets[ i ] ) ) {
1810 meta_back_quarantine( op, &candidates[ i ], i );
1813 /* only in case of timelimit exceeded, if the timelimit exceeded because
1814 * one contacted target never responded, invalidate the connection
1815 * NOTE: should we quarantine the target as well? right now, the connection
1816 * is invalidated; the next time it will be recreated and the target
1817 * will be quarantined if it cannot be contacted */
1818 if ( mi->mi_idle_timeout != 0
1819 && rs->sr_err == LDAP_TIMELIMIT_EXCEEDED
1820 && op->o_time > mc->mc_conns[ i ].msc_time )
1822 /* don't let anyone else use this expired connection */
1828 ldap_pvt_thread_mutex_lock( &mi->mi_conninfo.lai_mutex );
1830 LDAP_BACK_CONN_TAINTED_SET( mc );
1832 meta_back_release_conn_lock( mi, mc, 0 );
1833 ldap_pvt_thread_mutex_unlock( &mi->mi_conninfo.lai_mutex );
1847 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
1848 struct berval a, mapped;
1849 int check_duplicate_attrs = 0;
1850 int check_sorted_attrs = 0;
1852 BerElement ber = *e->lm_ber;
1853 Attribute *attr, **attrp;
1861 if ( ber_scanf( &ber, "l{", &len ) == LBER_ERROR ) {
1862 return LDAP_DECODING_ERROR;
1865 if ( ber_set_option( &ber, LBER_OPT_REMAINING_BYTES, &len ) != LBER_OPT_SUCCESS ) {
1869 if ( ber_scanf( &ber, "m{", &bdn ) == LBER_ERROR ) {
1870 return LDAP_DECODING_ERROR;
1874 * Rewrite the dn of the result, if needed
1876 dc.target = mi->mi_targets[ target ];
1877 dc.conn = op->o_conn;
1879 dc.ctx = "searchResult";
1881 rs->sr_err = ldap_back_dn_massage( &dc, &bdn, &dn );
1882 if ( rs->sr_err != LDAP_SUCCESS) {
1887 * Note: this may fail if the target host(s) schema differs
1888 * from the one known to the meta, and a DN with unknown
1889 * attributes is returned.
1891 * FIXME: should we log anything, or delegate to dnNormalize?
1893 rc = dnPrettyNormal( NULL, &dn, &ent.e_name, &ent.e_nname,
1895 if ( dn.bv_val != bdn.bv_val ) {
1900 if ( rc != LDAP_SUCCESS ) {
1901 Debug( LDAP_DEBUG_ANY,
1902 "%s meta_send_entry(\"%s\"): "
1903 "invalid DN syntax\n",
1904 op->o_log_prefix, ent.e_name.bv_val, 0 );
1905 rc = LDAP_INVALID_DN_SYNTAX;
1912 if ( mi->mi_cache.ttl != META_DNCACHE_DISABLED ) {
1913 ( void )meta_dncache_update_entry( &mi->mi_cache,
1914 &ent.e_nname, target );
1917 attrp = &ent.e_attrs;
1919 dc.ctx = "searchAttrDN";
1920 while ( ber_scanf( &ber, "{m", &a ) != LBER_ERROR ) {
1922 slap_syntax_validate_func *validate;
1923 slap_syntax_transform_func *pretty;
1925 if ( ber_pvt_ber_remaining( &ber ) < 0 ) {
1926 Debug( LDAP_DEBUG_ANY,
1927 "%s meta_send_entry(\"%s\"): "
1928 "unable to parse attr \"%s\".\n",
1929 op->o_log_prefix, ent.e_name.bv_val, a.bv_val );
1935 if ( ber_pvt_ber_remaining( &ber ) == 0 ) {
1939 ldap_back_map( &mi->mi_targets[ target ]->mt_rwmap.rwm_at,
1940 &a, &mapped, BACKLDAP_REMAP );
1941 if ( BER_BVISNULL( &mapped ) || mapped.bv_val[0] == '\0' ) {
1942 ( void )ber_scanf( &ber, "x" /* [W] */ );
1945 if ( mapped.bv_val != a.bv_val ) {
1946 /* will need to check for duplicate attrs */
1947 check_duplicate_attrs++;
1949 attr = attr_alloc( NULL );
1950 if ( attr == NULL ) {
1954 if ( slap_bv2ad( &mapped, &attr->a_desc, &text )
1956 if ( slap_bv2undef_ad( &mapped, &attr->a_desc, &text,
1957 SLAP_AD_PROXIED ) != LDAP_SUCCESS )
1959 char buf[ SLAP_TEXT_BUFLEN ];
1961 snprintf( buf, sizeof( buf ),
1962 "%s meta_send_entry(\"%s\"): "
1963 "slap_bv2undef_ad(%s): %s\n",
1964 op->o_log_prefix, ent.e_name.bv_val,
1965 mapped.bv_val, text );
1967 Debug( LDAP_DEBUG_ANY, "%s", buf, 0, 0 );
1968 ( void )ber_scanf( &ber, "x" /* [W] */ );
1974 if ( attr->a_desc->ad_type->sat_flags & SLAP_AT_SORTED_VAL )
1975 check_sorted_attrs = 1;
1977 /* no subschemaSubentry */
1978 if ( attr->a_desc == slap_schema.si_ad_subschemaSubentry
1979 || attr->a_desc == slap_schema.si_ad_entryDN )
1983 * We eat target's subschemaSubentry because
1984 * a search for this value is likely not
1985 * to resolve to the appropriate backend;
1986 * later, the local subschemaSubentry is
1989 * We also eat entryDN because the frontend
1990 * will reattach it without checking if already
1993 ( void )ber_scanf( &ber, "x" /* [W] */ );
1998 if ( ber_scanf( &ber, "[W]", &attr->a_vals ) == LBER_ERROR
1999 || attr->a_vals == NULL )
2001 attr->a_vals = (struct berval *)&slap_dummy_bv;
2004 for ( last = 0; !BER_BVISNULL( &attr->a_vals[ last ] ); ++last )
2007 attr->a_numvals = last;
2009 validate = attr->a_desc->ad_type->sat_syntax->ssyn_validate;
2010 pretty = attr->a_desc->ad_type->sat_syntax->ssyn_pretty;
2012 if ( !validate && !pretty ) {
2017 if ( attr->a_desc == slap_schema.si_ad_objectClass
2018 || attr->a_desc == slap_schema.si_ad_structuralObjectClass )
2022 for ( bv = attr->a_vals; !BER_BVISNULL( bv ); bv++ ) {
2025 ldap_back_map( &mi->mi_targets[ target ]->mt_rwmap.rwm_oc,
2026 bv, &mapped, BACKLDAP_REMAP );
2027 if ( BER_BVISNULL( &mapped ) || mapped.bv_val[0] == '\0') {
2034 *bv = attr->a_vals[ last ];
2035 BER_BVZERO( &attr->a_vals[ last ] );
2038 } else if ( mapped.bv_val != bv->bv_val ) {
2041 for ( i = 0; !BER_BVISNULL( &attr->a_vals[ i ] ); i++ ) {
2042 if ( &attr->a_vals[ i ] == bv ) {
2046 if ( ber_bvstrcasecmp( &mapped, &attr->a_vals[ i ] ) == 0 ) {
2051 if ( !BER_BVISNULL( &attr->a_vals[ i ] ) ) {
2055 ber_bvreplace( bv, &mapped );
2057 } else if ( ( oc = oc_bvfind_undef( bv ) ) == NULL ) {
2061 ber_bvreplace( bv, &oc->soc_cname );
2065 * It is necessary to try to rewrite attributes with
2066 * dn syntax because they might be used in ACLs as
2067 * members of groups; since ACLs are applied to the
2068 * rewritten stuff, no dn-based subecj clause could
2069 * be used at the ldap backend side (see
2070 * http://www.OpenLDAP.org/faq/data/cache/452.html)
2071 * The problem can be overcome by moving the dn-based
2072 * ACLs to the target directory server, and letting
2073 * everything pass thru the ldap backend.
2078 if ( attr->a_desc->ad_type->sat_syntax ==
2079 slap_schema.si_syn_distinguishedName )
2081 ldap_dnattr_result_rewrite( &dc, attr->a_vals );
2083 } else if ( attr->a_desc == slap_schema.si_ad_ref ) {
2084 ldap_back_referral_result_rewrite( &dc, attr->a_vals, NULL );
2088 for ( i = 0; i < last; i++ ) {
2093 rc = ordered_value_pretty( attr->a_desc,
2094 &attr->a_vals[i], &pval, NULL );
2097 rc = ordered_value_validate( attr->a_desc,
2098 &attr->a_vals[i], 0 );
2102 LBER_FREE( attr->a_vals[i].bv_val );
2103 if ( --last == i ) {
2104 BER_BVZERO( &attr->a_vals[ i ] );
2107 attr->a_vals[i] = attr->a_vals[last];
2108 BER_BVZERO( &attr->a_vals[last] );
2114 LBER_FREE( attr->a_vals[i].bv_val );
2115 attr->a_vals[i] = pval;
2119 if ( last == 0 && attr->a_vals != &slap_dummy_bv ) {
2125 if ( last && attr->a_desc->ad_type->sat_equality &&
2126 attr->a_desc->ad_type->sat_equality->smr_normalize )
2130 attr->a_nvals = ch_malloc( ( last + 1 ) * sizeof( struct berval ) );
2131 for ( i = 0; i<last; i++ ) {
2132 /* if normalizer fails, drop this value */
2133 if ( ordered_value_normalize(
2134 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
2136 attr->a_desc->ad_type->sat_equality,
2137 &attr->a_vals[i], &attr->a_nvals[i],
2139 LBER_FREE( attr->a_vals[i].bv_val );
2140 if ( --last == i ) {
2141 BER_BVZERO( &attr->a_vals[ i ] );
2144 attr->a_vals[i] = attr->a_vals[last];
2145 BER_BVZERO( &attr->a_vals[last] );
2149 BER_BVZERO( &attr->a_nvals[i] );
2156 attr->a_nvals = attr->a_vals;
2159 attr->a_numvals = last;
2161 attrp = &attr->a_next;
2165 /* only check if some mapping occurred */
2166 if ( check_duplicate_attrs ) {
2169 for ( ap = &ent.e_attrs; *ap != NULL; ap = &(*ap)->a_next ) {
2172 for ( tap = &(*ap)->a_next; *tap != NULL; ) {
2173 if ( (*tap)->a_desc == (*ap)->a_desc ) {
2175 Modification mod = { 0 };
2176 const char *text = NULL;
2177 char textbuf[ SLAP_TEXT_BUFLEN ];
2178 Attribute *next = (*tap)->a_next;
2180 BER_BVSTR( &e.e_name, "" );
2181 BER_BVSTR( &e.e_nname, "" );
2183 mod.sm_op = LDAP_MOD_ADD;
2184 mod.sm_desc = (*ap)->a_desc;
2185 mod.sm_type = mod.sm_desc->ad_cname;
2186 mod.sm_numvals = (*ap)->a_numvals;
2187 mod.sm_values = (*tap)->a_vals;
2188 if ( (*tap)->a_nvals != (*tap)->a_vals ) {
2189 mod.sm_nvalues = (*tap)->a_nvals;
2192 (void)modify_add_values( &e, &mod,
2194 &text, textbuf, sizeof( textbuf ) );
2196 /* should not insert new attrs! */
2197 assert( e.e_attrs == *ap );
2203 tap = &(*tap)->a_next;
2209 /* Check for sorted attributes */
2210 if ( check_sorted_attrs ) {
2211 for ( attr = ent.e_attrs; attr; attr = attr->a_next ) {
2212 if ( attr->a_desc->ad_type->sat_flags & SLAP_AT_SORTED_VAL ) {
2213 while ( attr->a_numvals > 1 ) {
2215 int rc = slap_sort_vals( (Modifications *)attr, &text, &i, op->o_tmpmemctx );
2216 if ( rc != LDAP_TYPE_OR_VALUE_EXISTS )
2219 /* Strip duplicate values */
2220 if ( attr->a_nvals != attr->a_vals )
2221 LBER_FREE( attr->a_nvals[i].bv_val );
2222 LBER_FREE( attr->a_vals[i].bv_val );
2224 if ( (unsigned)i < attr->a_numvals ) {
2225 attr->a_vals[i] = attr->a_vals[attr->a_numvals];
2226 if ( attr->a_nvals != attr->a_vals )
2227 attr->a_nvals[i] = attr->a_nvals[attr->a_numvals];
2229 BER_BVZERO(&attr->a_vals[attr->a_numvals]);
2230 if ( attr->a_nvals != attr->a_vals )
2231 BER_BVZERO(&attr->a_nvals[attr->a_numvals]);
2233 attr->a_flags |= SLAP_ATTR_SORTED_VALS;
2238 ldap_get_entry_controls( mc->mc_conns[target].msc_ld,
2240 rs->sr_entry = &ent;
2241 rs->sr_attrs = op->ors_attrs;
2242 rs->sr_operational_attrs = NULL;
2243 rs->sr_flags = mi->mi_targets[ target ]->mt_rep_flags;
2244 rs->sr_err = LDAP_SUCCESS;
2245 rc = send_search_entry( op, rs );
2247 case LDAP_UNAVAILABLE:
2253 rs->sr_entry = NULL;
2254 rs->sr_attrs = NULL;
2255 if ( rs->sr_ctrls != NULL ) {
2256 ldap_controls_free( rs->sr_ctrls );
2257 rs->sr_ctrls = NULL;
2259 if ( !BER_BVISNULL( &ent.e_name ) ) {
2260 free( ent.e_name.bv_val );
2261 BER_BVZERO( &ent.e_name );
2263 if ( !BER_BVISNULL( &ent.e_nname ) ) {
2264 free( ent.e_nname.bv_val );
2265 BER_BVZERO( &ent.e_nname );
2267 entry_clean( &ent );