2 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
4 * Copyright 1999-2005 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>
32 #include "../back-ldap/back-ldap.h"
33 #include "back-meta.h"
34 #undef ldap_debug /* silence a warning in ldap-int.h */
36 #include "../../../libraries/libldap/ldap-int.h"
46 typedef enum meta_search_candidate_t {
48 META_SEARCH_NOT_CANDIDATE,
50 } meta_search_candidate_t;
52 static meta_search_candidate_t
53 meta_back_search_start(
57 metasingleconn_t *msc,
62 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
63 struct berval realbase = op->o_req_dn;
64 int realscope = op->ors_scope;
65 ber_len_t suffixlen = 0;
66 struct berval mbase = BER_BVNULL;
67 struct berval mfilter = BER_BVNULL;
68 char **mapped_attrs = NULL;
70 meta_search_candidate_t retcode;
71 struct timeval tv, *tvp = NULL;
73 /* should we check return values? */
74 if ( op->ors_deref != -1 ) {
75 ldap_set_option( msc->msc_ld, LDAP_OPT_DEREF,
76 ( void * )&op->ors_deref );
79 if ( op->ors_tlimit != SLAP_NO_LIMIT ) {
80 tv.tv_sec = op->ors_tlimit > 0 ? op->ors_tlimit : 1;
84 dc->target = &mi->mi_targets[ candidate ];
87 * modifies the base according to the scope, if required
89 suffixlen = mi->mi_targets[ candidate ].mt_nsuffix.bv_len;
90 if ( suffixlen > op->o_req_ndn.bv_len ) {
91 switch ( op->ors_scope ) {
92 case LDAP_SCOPE_SUBTREE:
94 * make the target suffix the new base
95 * FIXME: this is very forgiving, because
96 * "illegal" searchBases may be turned
97 * into the suffix of the target; however,
98 * the requested searchBase already passed
99 * thru the candidate analyzer...
101 if ( dnIsSuffix( &mi->mi_targets[ candidate ].mt_nsuffix,
104 realbase = mi->mi_targets[ candidate ].mt_nsuffix;
105 if ( mi->mi_targets[ candidate ].mt_scope == LDAP_SCOPE_SUBORDINATE ) {
106 realscope = LDAP_SCOPE_SUBORDINATE;
111 * this target is no longer candidate
113 return META_SEARCH_NOT_CANDIDATE;
117 case LDAP_SCOPE_SUBORDINATE:
118 case LDAP_SCOPE_ONELEVEL:
120 struct berval rdn = mi->mi_targets[ candidate ].mt_nsuffix;
121 rdn.bv_len -= op->o_req_ndn.bv_len + STRLENOF( "," );
122 if ( dnIsOneLevelRDN( &rdn )
123 && dnIsSuffix( &mi->mi_targets[ candidate ].mt_nsuffix, &op->o_req_ndn ) )
126 * if there is exactly one level,
127 * make the target suffix the new
128 * base, and make scope "base"
130 realbase = mi->mi_targets[ candidate ].mt_nsuffix;
131 if ( op->ors_scope == LDAP_SCOPE_SUBORDINATE ) {
132 if ( mi->mi_targets[ candidate ].mt_scope == LDAP_SCOPE_SUBORDINATE ) {
133 realscope = LDAP_SCOPE_SUBORDINATE;
135 realscope = LDAP_SCOPE_SUBTREE;
138 realscope = LDAP_SCOPE_BASE;
141 } /* else continue with the next case */
144 case LDAP_SCOPE_BASE:
146 * this target is no longer candidate
148 return META_SEARCH_NOT_CANDIDATE;
153 * Rewrite the search base, if required
155 dc->ctx = "searchBase";
156 switch ( ldap_back_dn_massage( dc, &realbase, &mbase ) ) {
160 case REWRITE_REGEXEC_UNWILLING:
161 rs->sr_err = LDAP_UNWILLING_TO_PERFORM;
162 rs->sr_text = "Operation not allowed";
163 send_ldap_result( op, rs );
164 return META_SEARCH_ERR;
166 case REWRITE_REGEXEC_ERR:
169 * this target is no longer candidate
171 return META_SEARCH_NOT_CANDIDATE;
177 rc = ldap_back_filter_map_rewrite( dc, op->ors_filter,
178 &mfilter, BACKLDAP_MAP );
183 case LDAP_COMPARE_FALSE:
186 * this target is no longer candidate
188 retcode = META_SEARCH_NOT_CANDIDATE;
193 * Maps required attributes
195 rc = ldap_back_map_attrs( &mi->mi_targets[ candidate ].mt_rwmap.rwm_at,
196 op->ors_attrs, BACKLDAP_MAP, &mapped_attrs );
197 if ( rc != LDAP_SUCCESS ) {
199 * this target is no longer candidate
201 retcode = META_SEARCH_NOT_CANDIDATE;
208 rc = ldap_search_ext( msc->msc_ld,
209 mbase.bv_val, realscope, mfilter.bv_val,
210 mapped_attrs, op->ors_attrsonly,
211 op->o_ctrls, NULL, tvp, op->ors_slimit,
212 &candidates[ candidate ].sr_msgid );
213 if ( rc == LDAP_SUCCESS ) {
214 retcode = META_SEARCH_CANDIDATE;
217 candidates[ candidate ].sr_msgid = -1;
218 retcode = META_SEARCH_NOT_CANDIDATE;
222 if ( mapped_attrs ) {
223 free( mapped_attrs );
225 if ( mfilter.bv_val != op->ors_filterstr.bv_val ) {
226 free( mfilter.bv_val );
228 if ( mbase.bv_val != realbase.bv_val ) {
229 free( mbase.bv_val );
236 meta_back_search( Operation *op, SlapReply *rs )
238 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
240 struct timeval tv = { 0, 0 };
241 time_t stoptime = (time_t)-1;
242 LDAPMessage *res = NULL, *e;
243 int rc = 0, sres = LDAP_SUCCESS;
244 char *matched = NULL;
245 int last = 0, ncandidates = 0,
246 initial_candidates = 0, candidate_match = 0;
251 SlapReply *candidates = meta_back_candidates_get( op );
254 * controls are set in ldap_back_dobind()
256 * FIXME: in case of values return filter, we might want
257 * to map attrs and maybe rewrite value
259 mc = meta_back_getconn( op, rs, NULL, LDAP_BACK_SENDERR );
260 if ( !mc || !meta_back_dobind( op, rs, mc, LDAP_BACK_SENDERR ) ) {
264 dc.conn = op->o_conn;
270 for ( i = 0; i < mi->mi_ntargets; i++ ) {
271 metasingleconn_t *msc = &mc->mc_conns[ i ];
273 candidates[ i ].sr_msgid = -1;
274 candidates[ i ].sr_matched = NULL;
275 candidates[ i ].sr_text = NULL;
276 candidates[ i ].sr_ref = NULL;
277 candidates[ i ].sr_ctrls = NULL;
279 if ( candidates[ i ].sr_tag != META_CANDIDATE
280 || candidates[ i ].sr_err != LDAP_SUCCESS )
285 switch ( meta_back_search_start( op, rs, &dc, msc, i, candidates ) )
287 case META_SEARCH_NOT_CANDIDATE:
290 case META_SEARCH_CANDIDATE:
291 candidates[ i ].sr_type = REP_INTERMEDIATE;
295 case META_SEARCH_ERR:
301 initial_candidates = ncandidates;
308 for ( i = 0; i < mi->mi_ntargets; i++ ) {
309 if ( candidates[ i ].sr_tag == META_CANDIDATE ) {
317 Debug( LDAP_DEBUG_ANY, "%s meta_back_search: ncandidates=%d "
318 "cnd=\"%s\"\n", op->o_log_prefix, ncandidates, cnd );
322 if ( initial_candidates == 0 ) {
323 /* NOTE: here we are not sending any matchedDN;
324 * this is intended, because if the back-meta
325 * is serving this search request, but no valid
326 * candidate could be looked up, it means that
327 * there is a hole in the mapping of the targets
328 * and thus no knowledge of any remote superior
330 Debug( LDAP_DEBUG_ANY, "%s meta_back_search: "
331 "base=\"%s\" scope=%d: "
332 "no candidate could be selected\n",
333 op->o_log_prefix, op->o_req_dn.bv_val,
336 /* FIXME: we're sending the first error we encounter;
337 * maybe we should pick the worst... */
338 rc = LDAP_NO_SUCH_OBJECT;
339 for ( i = 0; i < mi->mi_ntargets; i++ ) {
340 if ( candidates[ i ].sr_tag == META_CANDIDATE
341 && candidates[ i ].sr_err != LDAP_SUCCESS )
343 rc = candidates[ i ].sr_err;
348 send_ldap_error( op, rs, rc, NULL );
353 /* We pull apart the ber result, stuff it into a slapd entry, and
354 * let send_search_entry stuff it back into ber format. Slow & ugly,
355 * but this is necessary for version matching, and for ACL processing.
358 if ( op->ors_tlimit != SLAP_NO_LIMIT ) {
359 stoptime = op->o_time + op->ors_tlimit;
363 * In case there are no candidates, no cycle takes place...
365 * FIXME: we might use a queue, to better balance the load
366 * among the candidates
368 for ( rc = 0; ncandidates > 0; ) {
369 int gotit = 0, doabandon = 0;
371 for ( i = 0; i < mi->mi_ntargets; i++ ) {
372 metasingleconn_t *msc = &mc->mc_conns[ i ];
374 if ( candidates[ i ].sr_msgid == -1 ) {
378 /* check for abandon */
379 if ( op->o_abandon ) {
384 * FIXME: handle time limit as well?
385 * Note that target servers are likely
386 * to handle it, so at some time we'll
387 * get a LDAP_TIMELIMIT_EXCEEDED from
391 rc = ldap_result( msc->msc_ld, candidates[ i ].sr_msgid,
395 /* FIXME: res should not need to be freed */
396 assert( res == NULL );
398 /* check time limit */
399 if ( op->ors_tlimit != SLAP_NO_LIMIT
400 && slap_get_time() > stoptime )
403 rc = rs->sr_err = LDAP_TIMELIMIT_EXCEEDED;
404 savepriv = op->o_private;
405 op->o_private = (void *)i;
406 send_ldap_result( op, rs );
407 op->o_private = savepriv;
413 } else if ( rc == -1 ) {
415 /* something REALLY bad happened! */
416 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
417 candidates[ i ].sr_type = REP_RESULT;
419 if ( meta_back_retry( op, rs, mc, i, LDAP_BACK_DONTSEND ) ) {
420 switch ( meta_back_search_start( op, rs, &dc, msc, i, candidates ) )
422 case META_SEARCH_CANDIDATE:
426 rc = rs->sr_err = LDAP_OTHER;
433 * When no candidates are left,
434 * the outer cycle finishes
436 candidates[ i ].sr_msgid = -1;
438 rs->sr_err = candidates[ i ].sr_err = LDAP_OTHER;
439 rs->sr_text = "remote server unavailable";
441 } else if ( rc == LDAP_RES_SEARCH_ENTRY ) {
442 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
443 /* don't retry any more... */
444 candidates[ i ].sr_type = REP_RESULT;
449 e = ldap_first_entry( msc->msc_ld, res );
450 savepriv = op->o_private;
451 op->o_private = (void *)i;
452 rs->sr_err = meta_send_entry( op, rs, mc, i, e );
456 switch ( rs->sr_err ) {
457 case LDAP_SIZELIMIT_EXCEEDED:
458 savepriv = op->o_private;
459 op->o_private = (void *)i;
460 send_ldap_result( op, rs );
461 op->o_private = savepriv;
462 rs->sr_err = LDAP_SUCCESS;
465 case LDAP_UNAVAILABLE:
466 rs->sr_err = LDAP_OTHER;
469 op->o_private = savepriv;
475 * If scope is BASE, we need to jump out
476 * as soon as one entry is found; if
477 * the target pool is properly crafted,
478 * this should correspond to the sole
479 * entry that has the base DN
481 /* FIXME: this defeats the purpose of
482 * doing a search with scope == base and
483 * sizelimit = 1 to determine if a
484 * candidate is actually unique */
485 if ( op->ors_scope == LDAP_SCOPE_BASE
486 && rs->sr_nentries > 0 )
495 } else if ( rc == LDAP_RES_SEARCH_REFERENCE ) {
496 char **references = NULL;
499 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
500 /* don't retry any more... */
501 candidates[ i ].sr_type = REP_RESULT;
506 rc = ldap_parse_reference( msc->msc_ld, res,
507 &references, &rs->sr_ctrls, 1 );
510 if ( rc != LDAP_SUCCESS ) {
514 if ( references == NULL ) {
518 #ifdef ENABLE_REWRITE
519 dc.ctx = "referralDN";
520 #else /* ! ENABLE_REWRITE */
523 #endif /* ! ENABLE_REWRITE */
525 /* FIXME: merge all and return at the end */
527 for ( cnt = 0; references[ cnt ]; cnt++ )
530 rs->sr_ref = ch_calloc( sizeof( struct berval ), cnt + 1 );
532 for ( cnt = 0; references[ cnt ]; cnt++ ) {
533 ber_str2bv( references[ cnt ], 0, 1, &rs->sr_ref[ cnt ] );
535 BER_BVZERO( &rs->sr_ref[ cnt ] );
537 ( void )ldap_back_referral_result_rewrite( &dc, rs->sr_ref );
539 if ( rs->sr_ref != NULL && !BER_BVISNULL( &rs->sr_ref[ 0 ] ) ) {
540 /* ignore return value by now */
541 savepriv = op->o_private;
542 op->o_private = (void *)i;
543 ( void )send_search_reference( op, rs );
544 op->o_private = savepriv;
546 ber_bvarray_free( rs->sr_ref );
552 ber_memvfree( (void **)references );
555 if ( rs->sr_ctrls ) {
556 ldap_controls_free( rs->sr_ctrls );
560 } else if ( rc == LDAP_RES_SEARCH_RESULT ) {
561 char buf[ SLAP_TEXT_BUFLEN ];
562 char **references = NULL;
564 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
565 /* don't retry any more... */
566 candidates[ i ].sr_type = REP_RESULT;
569 /* NOTE: ignores response controls
570 * (and intermediate response controls
571 * as well, except for those with search
572 * references); this may not be correct,
573 * but if they're not ignored then
574 * back-meta would need to merge them
575 * consistently (think of pagedResults...)
577 if ( ldap_parse_result( msc->msc_ld,
579 &candidates[ i ].sr_err,
580 (char **)&candidates[ i ].sr_matched,
581 NULL /* (char **)&candidates[ i ].sr_text */ ,
583 NULL /* &candidates[ i ].sr_ctrls (unused) */ ,
584 1 ) != LDAP_SUCCESS )
587 ldap_get_option( msc->msc_ld,
588 LDAP_OPT_ERROR_NUMBER,
590 sres = slap_map_api2result( rs );
591 candidates[ i ].sr_type = REP_RESULT;
595 rs->sr_err = candidates[ i ].sr_err;
596 sres = slap_map_api2result( rs );
599 /* massage matchedDN if need be */
600 if ( candidates[ i ].sr_matched != NULL ) {
601 #ifndef LDAP_NULL_IS_NULL
602 if ( candidates[ i ].sr_matched[ 0 ] == '\0' ) {
603 ldap_memfree( (char *)candidates[ i ].sr_matched );
604 candidates[ i ].sr_matched = NULL;
607 #endif /* LDAP_NULL_IS_NULL */
609 struct berval match, mmatch;
611 ber_str2bv( candidates[ i ].sr_matched,
613 candidates[ i ].sr_matched = NULL;
615 dc.ctx = "matchedDN";
616 dc.target = &mi->mi_targets[ i ];
617 if ( !ldap_back_dn_massage( &dc, &match, &mmatch ) ) {
618 if ( mmatch.bv_val == match.bv_val ) {
619 candidates[ i ].sr_matched = ch_strdup( mmatch.bv_val );
622 candidates[ i ].sr_matched = mmatch.bv_val;
627 ldap_memfree( match.bv_val );
631 #ifndef LDAP_NULL_IS_NULL
632 /* just get rid of the error message, if any */
633 if ( candidates[ i ].sr_text && candidates[ i ].sr_text[ 0 ] == '\0' )
635 ldap_memfree( (char *)candidates[ i ].sr_text );
636 candidates[ i ].sr_text = NULL;
638 #endif /* LDAP_NULL_IS_NULL */
640 /* add references to array */
645 for ( cnt = 0; references[ cnt ]; cnt++ )
648 sr_ref = ch_calloc( sizeof( struct berval ), cnt + 1 );
650 for ( cnt = 0; references[ cnt ]; cnt++ ) {
651 ber_str2bv( references[ cnt ], 0, 1, &sr_ref[ cnt ] );
653 BER_BVZERO( &sr_ref[ cnt ] );
655 ( void )ldap_back_referral_result_rewrite( &dc, sr_ref );
658 ber_memvfree( (void **)references );
660 if ( rs->sr_v2ref == NULL ) {
661 rs->sr_v2ref = sr_ref;
664 for ( cnt = 0; !BER_BVISNULL( &sr_ref[ cnt ] ); cnt++ ) {
665 ber_bvarray_add( &rs->sr_v2ref, &sr_ref[ cnt ] );
667 ber_memfree( sr_ref );
671 rs->sr_err = candidates[ i ].sr_err;
672 sres = slap_map_api2result( rs );
674 snprintf( buf, sizeof( buf ),
675 "%s meta_back_search[%ld] "
676 "match=\"%s\" err=%ld\n",
678 candidates[ i ].sr_matched ? candidates[ i ].sr_matched : "",
679 (long) candidates[ i ].sr_err );
680 Debug( LDAP_DEBUG_ANY, "%s", buf, 0, 0 );
683 case LDAP_NO_SUCH_OBJECT:
684 /* is_ok is touched any time a valid
685 * (even intermediate) result is
686 * returned; as a consequence, if
687 * a candidate returns noSuchObject
688 * it is ignored and the candidate
689 * is simply demoted. */
701 if ( META_BACK_ONERR_STOP( mi ) ) {
702 savepriv = op->o_private;
703 op->o_private = (void *)i;
704 send_ldap_result( op, rs );
705 op->o_private = savepriv;
715 * When no candidates are left,
716 * the outer cycle finishes
718 candidates[ i ].sr_msgid = -1;
727 /* check for abandon */
728 if ( op->o_abandon || doabandon ) {
729 for ( i = 0; i < mi->mi_ntargets; i++ ) {
730 metasingleconn_t *msc = &mc->mc_conns[ i ];
732 if ( candidates[ i ].sr_msgid != -1 ) {
733 ldap_abandon_ext( msc->msc_ld,
734 candidates[ i ].sr_msgid,
736 candidates[ i ].sr_msgid = -1;
740 if ( op->o_abandon ) {
747 LDAP_BACK_TV_SET( &tv );
748 ldap_pvt_thread_yield();
758 * FIXME: need a better strategy to handle errors
760 rc = meta_back_op_result( mc, op, rs, META_TARGET_NONE );
765 * Rewrite the matched portion of the search base, if required
767 * FIXME: only the last one gets caught!
769 savepriv = op->o_private;
770 op->o_private = (void *)(long)mi->mi_ntargets;
771 if ( candidate_match > 0 ) {
772 struct berval pmatched = BER_BVNULL;
774 /* we use the first one */
775 for ( i = 0; i < mi->mi_ntargets; i++ ) {
776 if ( candidates[ i ].sr_tag == META_CANDIDATE
777 && candidates[ i ].sr_matched != NULL )
779 struct berval bv, pbv;
782 /* if we got success, and this target
783 * returned noSuchObject, and its suffix
784 * is a superior of the searchBase,
785 * ignore the matchedDN */
786 if ( sres == LDAP_SUCCESS
787 && candidates[ i ].sr_err == LDAP_NO_SUCH_OBJECT
788 && op->o_req_ndn.bv_len > mi->mi_targets[ i ].mt_nsuffix.bv_len )
790 free( (char *)candidates[ i ].sr_matched );
791 candidates[ i ].sr_matched = NULL;
795 ber_str2bv( candidates[ i ].sr_matched, 0, 0, &bv );
796 rc = dnPretty( NULL, &bv, &pbv, op->o_tmpmemctx );
798 if ( rc == LDAP_SUCCESS ) {
800 /* NOTE: if they all are superiors
801 * of the baseDN, the shorter is also
802 * superior of the longer... */
803 if ( pbv.bv_len > pmatched.bv_len ) {
804 if ( !BER_BVISNULL( &pmatched ) ) {
805 op->o_tmpfree( pmatched.bv_val, op->o_tmpmemctx );
808 op->o_private = (void *)i;
811 op->o_tmpfree( pbv.bv_val, op->o_tmpmemctx );
815 if ( candidates[ i ].sr_matched != NULL ) {
816 free( (char *)candidates[ i ].sr_matched );
817 candidates[ i ].sr_matched = NULL;
822 if ( !BER_BVISNULL( &pmatched ) ) {
823 matched = pmatched.bv_val;
826 } else if ( sres == LDAP_NO_SUCH_OBJECT ) {
827 matched = op->o_bd->be_suffix[ 0 ].bv_val;
836 for ( i = 0; i < mi->mi_ntargets; i++ ) {
837 if ( candidates[ i ].sr_tag == META_CANDIDATE ) {
845 snprintf( buf, sizeof( buf ), "%s meta_back_search: is_scope=%d is_ok=%d cnd=\"%s\"\n",
846 op->o_log_prefix, initial_candidates, is_ok, cnd );
848 Debug( LDAP_DEBUG_ANY, "%s", buf, 0, 0 );
853 * In case we returned at least one entry, we return LDAP_SUCCESS
854 * otherwise, the latter error code we got
856 * FIXME: we should handle error codes and return the more
857 * important/reasonable
860 if ( sres == LDAP_SUCCESS && rs->sr_v2ref ) {
861 sres = LDAP_REFERRAL;
864 rs->sr_matched = matched;
865 rs->sr_ref = ( sres == LDAP_REFERRAL ? rs->sr_v2ref : NULL );
866 send_ldap_result( op, rs );
867 op->o_private = savepriv;
868 rs->sr_matched = NULL;
872 if ( matched && matched != op->o_bd->be_suffix[ 0 ].bv_val ) {
873 op->o_tmpfree( matched, op->o_tmpmemctx );
876 if ( rs->sr_v2ref ) {
877 ber_bvarray_free( rs->sr_v2ref );
880 for ( i = 0; i < mi->mi_ntargets; i++ ) {
881 if ( candidates[ i ].sr_tag != META_CANDIDATE ) {
885 if ( candidates[ i ].sr_matched ) {
886 free( (char *)candidates[ i ].sr_matched );
887 candidates[ i ].sr_matched = NULL;
890 if ( candidates[ i ].sr_text ) {
891 ldap_memfree( (char *)candidates[ i ].sr_text );
892 candidates[ i ].sr_text = NULL;
895 if ( candidates[ i ].sr_ref ) {
896 ber_bvarray_free( candidates[ i ].sr_ref );
897 candidates[ i ].sr_ref = NULL;
900 if ( candidates[ i ].sr_ctrls ) {
901 ldap_controls_free( candidates[ i ].sr_ctrls );
902 candidates[ i ].sr_ctrls = NULL;
906 meta_back_release_conn( op, mc );
919 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
920 struct berval a, mapped;
922 BerElement ber = *e->lm_ber;
923 Attribute *attr, **attrp;
930 if ( ber_scanf( &ber, "{m{", &bdn ) == LBER_ERROR ) {
931 return LDAP_DECODING_ERROR;
935 * Rewrite the dn of the result, if needed
937 dc.target = &mi->mi_targets[ target ];
938 dc.conn = op->o_conn;
940 dc.ctx = "searchResult";
942 rs->sr_err = ldap_back_dn_massage( &dc, &bdn, &dn );
943 if ( rs->sr_err != LDAP_SUCCESS) {
948 * Note: this may fail if the target host(s) schema differs
949 * from the one known to the meta, and a DN with unknown
950 * attributes is returned.
952 * FIXME: should we log anything, or delegate to dnNormalize?
954 rc = dnPrettyNormal( NULL, &dn, &ent.e_name, &ent.e_nname,
956 if ( dn.bv_val != bdn.bv_val ) {
961 if ( rc != LDAP_SUCCESS ) {
962 return LDAP_INVALID_DN_SYNTAX;
968 if ( mi->mi_cache.ttl != META_DNCACHE_DISABLED ) {
969 ( void )meta_dncache_update_entry( &mi->mi_cache,
970 &ent.e_nname, target );
973 attrp = &ent.e_attrs;
975 dc.ctx = "searchAttrDN";
976 while ( ber_scanf( &ber, "{m", &a ) != LBER_ERROR ) {
978 slap_syntax_validate_func *validate;
979 slap_syntax_transform_func *pretty;
981 ldap_back_map( &mi->mi_targets[ target ].mt_rwmap.rwm_at,
982 &a, &mapped, BACKLDAP_REMAP );
983 if ( BER_BVISNULL( &mapped ) || mapped.bv_val[0] == '\0' ) {
984 ( void )ber_scanf( &ber, "x" /* [W] */ );
987 attr = ( Attribute * )ch_calloc( 1, sizeof( Attribute ) );
988 if ( attr == NULL ) {
991 if ( slap_bv2ad( &mapped, &attr->a_desc, &text )
993 if ( slap_bv2undef_ad( &mapped, &attr->a_desc, &text,
994 SLAP_AD_PROXIED ) != LDAP_SUCCESS )
996 char buf[ SLAP_TEXT_BUFLEN ];
998 snprintf( buf, sizeof( buf ),
999 "%s meta_send_entry(\"%s\"): "
1000 "slap_bv2undef_ad(%s): %s\n",
1001 op->o_log_prefix, ent.e_name.bv_val,
1002 mapped.bv_val, text );
1004 Debug( LDAP_DEBUG_ANY, "%s", buf, 0, 0 );
1010 /* no subschemaSubentry */
1011 if ( attr->a_desc == slap_schema.si_ad_subschemaSubentry
1012 || attr->a_desc == slap_schema.si_ad_entryDN )
1016 * We eat target's subschemaSubentry because
1017 * a search for this value is likely not
1018 * to resolve to the appropriate backend;
1019 * later, the local subschemaSubentry is
1022 * We also eat entryDN because the frontend
1023 * will reattach it without checking if already
1026 ( void )ber_scanf( &ber, "x" /* [W] */ );
1032 if ( ber_scanf( &ber, "[W]", &attr->a_vals ) == LBER_ERROR
1033 || attr->a_vals == NULL )
1035 attr->a_vals = (struct berval *)&slap_dummy_bv;
1038 for ( last = 0; !BER_BVISNULL( &attr->a_vals[ last ] ); ++last )
1042 validate = attr->a_desc->ad_type->sat_syntax->ssyn_validate;
1043 pretty = attr->a_desc->ad_type->sat_syntax->ssyn_pretty;
1045 if ( !validate && !pretty ) {
1050 if ( attr->a_desc == slap_schema.si_ad_objectClass
1051 || attr->a_desc == slap_schema.si_ad_structuralObjectClass )
1055 for ( bv = attr->a_vals; !BER_BVISNULL( bv ); bv++ ) {
1056 ldap_back_map( &mi->mi_targets[ target ].mt_rwmap.rwm_oc,
1057 bv, &mapped, BACKLDAP_REMAP );
1058 if ( BER_BVISNULL( &mapped ) || mapped.bv_val[0] == '\0') {
1064 *bv = attr->a_vals[ last ];
1065 BER_BVZERO( &attr->a_vals[ last ] );
1068 } else if ( mapped.bv_val != bv->bv_val ) {
1070 ber_dupbv( bv, &mapped );
1074 * It is necessary to try to rewrite attributes with
1075 * dn syntax because they might be used in ACLs as
1076 * members of groups; since ACLs are applied to the
1077 * rewritten stuff, no dn-based subecj clause could
1078 * be used at the ldap backend side (see
1079 * http://www.OpenLDAP.org/faq/data/cache/452.html)
1080 * The problem can be overcome by moving the dn-based
1081 * ACLs to the target directory server, and letting
1082 * everything pass thru the ldap backend.
1087 if ( attr->a_desc->ad_type->sat_syntax ==
1088 slap_schema.si_syn_distinguishedName )
1090 ldap_dnattr_result_rewrite( &dc, attr->a_vals );
1092 } else if ( attr->a_desc == slap_schema.si_ad_ref ) {
1093 ldap_back_referral_result_rewrite( &dc, attr->a_vals );
1097 for ( i = 0; i < last; i++ ) {
1102 rc = pretty( attr->a_desc->ad_type->sat_syntax,
1103 &attr->a_vals[i], &pval, NULL );
1106 rc = validate( attr->a_desc->ad_type->sat_syntax,
1111 LBER_FREE( attr->a_vals[i].bv_val );
1112 if ( --last == i ) {
1113 BER_BVZERO( &attr->a_vals[ i ] );
1116 attr->a_vals[i] = attr->a_vals[last];
1117 BER_BVZERO( &attr->a_vals[last] );
1123 LBER_FREE( attr->a_vals[i].bv_val );
1124 attr->a_vals[i] = pval;
1128 if ( last == 0 && attr->a_vals != &slap_dummy_bv ) {
1134 if ( last && attr->a_desc->ad_type->sat_equality &&
1135 attr->a_desc->ad_type->sat_equality->smr_normalize )
1139 attr->a_nvals = ch_malloc( ( last + 1 ) * sizeof( struct berval ) );
1140 for ( i = 0; i<last; i++ ) {
1141 attr->a_desc->ad_type->sat_equality->smr_normalize(
1142 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
1143 attr->a_desc->ad_type->sat_syntax,
1144 attr->a_desc->ad_type->sat_equality,
1145 &attr->a_vals[i], &attr->a_nvals[i],
1148 BER_BVZERO( &attr->a_nvals[i] );
1151 attr->a_nvals = attr->a_vals;
1155 attrp = &attr->a_next;
1158 rs->sr_entry = &ent;
1159 rs->sr_attrs = op->ors_attrs;
1161 rc = send_search_entry( op, rs );
1163 case LDAP_UNAVAILABLE:
1167 rs->sr_entry = NULL;
1168 rs->sr_attrs = NULL;
1170 if ( !BER_BVISNULL( &ent.e_name ) ) {
1171 free( ent.e_name.bv_val );
1172 BER_BVZERO( &ent.e_name );
1174 if ( !BER_BVISNULL( &ent.e_nname ) ) {
1175 free( ent.e_nname.bv_val );
1176 BER_BVZERO( &ent.e_nname );
1178 entry_clean( &ent );