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"
47 meta_back_search_start(
51 metasingleconn_t *msc,
56 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
57 struct berval realbase = op->o_req_dn;
58 int realscope = op->ors_scope;
59 ber_len_t suffixlen = 0;
60 struct berval mbase = BER_BVNULL;
61 struct berval mfilter = BER_BVNULL;
62 char **mapped_attrs = NULL;
65 /* should we check return values? */
66 if ( op->ors_deref != -1 ) {
67 ldap_set_option( msc->msc_ld, LDAP_OPT_DEREF,
68 ( void * )&op->ors_deref);
70 if ( op->ors_tlimit != SLAP_NO_LIMIT ) {
71 ldap_set_option( msc->msc_ld, LDAP_OPT_TIMELIMIT,
72 ( void * )&op->ors_tlimit);
74 if ( op->ors_slimit != SLAP_NO_LIMIT ) {
75 ldap_set_option( msc->msc_ld, LDAP_OPT_SIZELIMIT,
76 ( void * )&op->ors_slimit);
79 dc->target = &mi->mi_targets[ candidate ];
82 * modifies the base according to the scope, if required
84 suffixlen = mi->mi_targets[ candidate ].mt_nsuffix.bv_len;
85 if ( suffixlen > op->o_req_ndn.bv_len ) {
86 switch ( op->ors_scope ) {
87 case LDAP_SCOPE_SUBTREE:
89 * make the target suffix the new base
90 * FIXME: this is very forgiving, because
91 * "illegal" searchBases may be turned
92 * into the suffix of the target; however,
93 * the requested searchBase already passed
94 * thru the candidate analyzer...
96 if ( dnIsSuffix( &mi->mi_targets[ candidate ].mt_nsuffix,
99 realbase = mi->mi_targets[ candidate ].mt_nsuffix;
100 #ifdef LDAP_SCOPE_SUBORDINATE
101 if ( mi->mi_targets[ candidate ].mt_scope == LDAP_SCOPE_SUBORDINATE ) {
102 realscope = LDAP_SCOPE_SUBORDINATE;
104 #endif /* LDAP_SCOPE_SUBORDINATE */
108 * this target is no longer candidate
114 #ifdef LDAP_SCOPE_SUBORDINATE
115 case LDAP_SCOPE_SUBORDINATE:
116 #endif /* LDAP_SCOPE_SUBORDINATE */
117 case LDAP_SCOPE_ONELEVEL:
119 struct berval rdn = mi->mi_targets[ candidate ].mt_nsuffix;
120 rdn.bv_len -= op->o_req_ndn.bv_len + STRLENOF( "," );
121 if ( dnIsOneLevelRDN( &rdn )
122 && dnIsSuffix( &mi->mi_targets[ candidate ].mt_nsuffix, &op->o_req_ndn ) )
125 * if there is exactly one level,
126 * make the target suffix the new
127 * base, and make scope "base"
129 realbase = mi->mi_targets[ candidate ].mt_nsuffix;
130 #ifdef LDAP_SCOPE_SUBORDINATE
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 #endif /* LDAP_SCOPE_SUBORDINATE */
140 realscope = LDAP_SCOPE_BASE;
143 } /* else continue with the next case */
146 case LDAP_SCOPE_BASE:
148 * this target is no longer candidate
155 * Rewrite the search base, if required
157 dc->ctx = "searchBase";
158 switch ( ldap_back_dn_massage( dc, &realbase, &mbase ) ) {
162 case REWRITE_REGEXEC_UNWILLING:
163 rs->sr_err = LDAP_UNWILLING_TO_PERFORM;
164 rs->sr_text = "Operation not allowed";
165 send_ldap_result( op, rs );
168 case REWRITE_REGEXEC_ERR:
171 * this target is no longer candidate
179 rc = ldap_back_filter_map_rewrite( dc, op->ors_filter,
180 &mfilter, BACKLDAP_MAP );
185 case LDAP_COMPARE_FALSE:
188 * this target is no longer candidate
195 * Maps required attributes
197 rc = ldap_back_map_attrs( &mi->mi_targets[ candidate ].mt_rwmap.rwm_at,
198 op->ors_attrs, BACKLDAP_MAP, &mapped_attrs );
199 if ( rc != LDAP_SUCCESS ) {
201 * this target is no longer candidate
210 rc = ldap_search_ext( msc->msc_ld,
211 mbase.bv_val, realscope, mfilter.bv_val,
212 mapped_attrs, op->ors_attrsonly,
213 op->o_ctrls, NULL, NULL, op->ors_slimit,
214 &candidates[ candidate ].sr_msgid );
215 if ( rc == LDAP_SUCCESS ) {
219 candidates[ candidate ].sr_msgid = -1;
224 if ( mapped_attrs ) {
225 free( mapped_attrs );
227 if ( mfilter.bv_val != op->ors_filterstr.bv_val ) {
228 free( mfilter.bv_val );
230 if ( mbase.bv_val != realbase.bv_val ) {
231 free( mbase.bv_val );
238 meta_back_search( Operation *op, SlapReply *rs )
240 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
242 struct timeval tv = { 0, 0 };
244 LDAPMessage *res = NULL, *e;
245 int rc = 0, sres = LDAP_SUCCESS;
246 char *matched = NULL;
247 int last = 0, ncandidates = 0,
248 initial_candidates = 0, candidate_match = 0;
253 SlapReply *candidates = meta_back_candidates_get( op );
256 * controls are set in ldap_back_dobind()
258 * FIXME: in case of values return filter, we might want
259 * to map attrs and maybe rewrite value
261 mc = meta_back_getconn( op, rs, NULL, LDAP_BACK_SENDERR );
262 if ( !mc || !meta_back_dobind( op, rs, mc, LDAP_BACK_SENDERR ) ) {
266 dc.conn = op->o_conn;
272 for ( i = 0; i < mi->mi_ntargets; i++ ) {
273 metasingleconn_t *msc = &mc->mc_conns[ i ];
275 candidates[ i ].sr_msgid = -1;
276 candidates[ i ].sr_matched = NULL;
277 candidates[ i ].sr_text = NULL;
278 candidates[ i ].sr_ref = NULL;
279 candidates[ i ].sr_ctrls = NULL;
281 if ( candidates[ i ].sr_tag != META_CANDIDATE
282 || candidates[ i ].sr_err != LDAP_SUCCESS )
287 switch ( meta_back_search_start( op, rs, &dc, msc, i, candidates ) )
302 initial_candidates = ncandidates;
309 for ( i = 0; i < mi->mi_ntargets; i++ ) {
310 if ( candidates[ i ].sr_tag == META_CANDIDATE ) {
318 Debug( LDAP_DEBUG_ANY, "%s meta_back_search: ncandidates=%d "
319 "cnd=\"%s\"\n", op->o_log_prefix, ncandidates, cnd );
323 if ( initial_candidates == 0 ) {
324 /* NOTE: here we are not sending any matchedDN;
325 * this is intended, because if the back-meta
326 * is serving this search request, but no valid
327 * candidate could be looked up, it means that
328 * there is a hole in the mapping of the targets
329 * and thus no knowledge of any remote superior
331 Debug( LDAP_DEBUG_ANY, "%s meta_back_search: "
332 "base=\"%s\" scope=%d: "
333 "no candidate could be selected\n",
334 op->o_log_prefix, op->o_req_dn.bv_val,
337 /* FIXME: we're sending the first error we encounter;
338 * maybe we should pick the worst... */
339 rc = LDAP_NO_SUCH_OBJECT;
340 for ( i = 0; i < mi->mi_ntargets; i++ ) {
341 if ( candidates[ i ].sr_tag == META_CANDIDATE
342 && candidates[ i ].sr_err != LDAP_SUCCESS )
344 rc = candidates[ i ].sr_err;
349 send_ldap_error( op, rs, rc, NULL );
354 /* We pull apart the ber result, stuff it into a slapd entry, and
355 * let send_search_entry stuff it back into ber format. Slow & ugly,
356 * but this is necessary for version matching, and for ACL processing.
359 if ( op->ors_tlimit != SLAP_NO_LIMIT ) {
360 stoptime = op->o_time + op->ors_tlimit;
364 * In case there are no candidates, no cycle takes place...
366 * FIXME: we might use a queue, to better balance the load
367 * among the candidates
369 for ( rc = 0; ncandidates > 0; ) {
370 int gotit = 0, doabandon = 0;
372 for ( i = 0; i < mi->mi_ntargets; i++ ) {
373 metasingleconn_t *msc = &mc->mc_conns[ i ];
375 if ( candidates[ i ].sr_msgid == -1 ) {
379 /* check for abandon */
380 if ( op->o_abandon ) {
385 * FIXME: handle time limit as well?
386 * Note that target servers are likely
387 * to handle it, so at some time we'll
388 * 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 ( void )meta_clear_unused_candidates( op, -1 );
417 rs->sr_err = LDAP_OTHER;
418 savepriv = op->o_private;
419 op->o_private = (void *)i;
420 send_ldap_result( op, rs );
421 op->o_private = savepriv;
423 /* anything else needs be done? */
425 /* FIXME: res should not need to be freed */
426 assert( res == NULL );
430 } else if ( rc == LDAP_RES_SEARCH_ENTRY ) {
431 if ( --op->ors_slimit == -1 ) {
435 rs->sr_err = LDAP_SIZELIMIT_EXCEEDED;
436 savepriv = op->o_private;
437 op->o_private = (void *)i;
438 send_ldap_result( op, rs );
439 op->o_private = savepriv;
445 e = ldap_first_entry( msc->msc_ld, res );
446 savepriv = op->o_private;
447 op->o_private = (void *)i;
448 meta_send_entry( op, rs, mc, i, e );
449 op->o_private = savepriv;
458 * If scope is BASE, we need to jump out
459 * as soon as one entry is found; if
460 * the target pool is properly crafted,
461 * this should correspond to the sole
462 * entry that has the base DN
464 /* FIXME: this defeats the purpose of
465 * doing a search with scope == base and
466 * sizelimit = 1 to determine if a
467 * candidate is actually unique */
468 if ( op->ors_scope == LDAP_SCOPE_BASE
469 && rs->sr_nentries > 0 )
478 } else if ( rc == LDAP_RES_SEARCH_REFERENCE ) {
479 char **references = NULL;
484 rc = ldap_parse_reference( msc->msc_ld, res,
485 &references, &rs->sr_ctrls, 1 );
488 if ( rc != LDAP_SUCCESS ) {
492 if ( references == NULL ) {
496 #ifdef ENABLE_REWRITE
497 dc.ctx = "referralDN";
498 #else /* ! ENABLE_REWRITE */
501 #endif /* ! ENABLE_REWRITE */
503 /* FIXME: merge all and return at the end */
505 for ( cnt = 0; references[ cnt ]; cnt++ )
508 rs->sr_ref = ch_calloc( sizeof( struct berval ), cnt + 1 );
510 for ( cnt = 0; references[ cnt ]; cnt++ ) {
511 ber_str2bv( references[ cnt ], 0, 1, &rs->sr_ref[ cnt ] );
513 BER_BVZERO( &rs->sr_ref[ cnt ] );
515 ( void )ldap_back_referral_result_rewrite( &dc, rs->sr_ref );
517 if ( rs->sr_ref != NULL && !BER_BVISNULL( &rs->sr_ref[ 0 ] ) ) {
518 /* ignore return value by now */
519 savepriv = op->o_private;
520 op->o_private = (void *)i;
521 ( void )send_search_reference( op, rs );
522 op->o_private = savepriv;
524 ber_bvarray_free( rs->sr_ref );
530 ldap_value_free( references );
533 if ( rs->sr_ctrls ) {
534 ldap_controls_free( rs->sr_ctrls );
538 } else if ( rc == LDAP_RES_SEARCH_RESULT ) {
539 char buf[ SLAP_TEXT_BUFLEN ];
540 char **references = NULL;
542 if ( ldap_parse_result( msc->msc_ld,
544 &candidates[ i ].sr_err,
545 (char **)&candidates[ i ].sr_matched,
546 NULL /* (char **)&candidates[ i ].sr_text */ ,
548 &candidates[ i ].sr_ctrls, 1 ) != LDAP_SUCCESS )
551 ldap_get_option( msc->msc_ld,
552 LDAP_OPT_ERROR_NUMBER,
554 sres = slap_map_api2result( rs );
558 rs->sr_err = candidates[ i ].sr_err;
559 sres = slap_map_api2result( rs );
562 /* massage matchedDN if need be */
563 if ( candidates[ i ].sr_matched != NULL ) {
564 if ( candidates[ i ].sr_matched[ 0 ] == '\0' ) {
565 ldap_memfree( (char *)candidates[ i ].sr_matched );
566 candidates[ i ].sr_matched = NULL;
569 struct berval match, mmatch;
571 ber_str2bv( candidates[ i ].sr_matched,
574 dc.ctx = "matchedDN";
575 dc.target = &mi->mi_targets[ i ];
577 if ( !ldap_back_dn_massage( &dc, &match, &mmatch ) ) {
578 if ( mmatch.bv_val == match.bv_val ) {
579 candidates[ i ].sr_matched = ch_strdup( mmatch.bv_val );
582 candidates[ i ].sr_matched = mmatch.bv_val;
587 ldap_memfree( match.bv_val );
591 /* just get rid of the error message, if any */
592 if ( candidates[ i ].sr_text && candidates[ i ].sr_text[ 0 ] == '\0' )
594 ldap_memfree( (char *)candidates[ i ].sr_text );
595 candidates[ i ].sr_text = NULL;
598 /* add references to array */
603 for ( cnt = 0; references[ cnt ]; cnt++ )
606 sr_ref = ch_calloc( sizeof( struct berval ), cnt + 1 );
608 for ( cnt = 0; references[ cnt ]; cnt++ ) {
609 ber_str2bv( references[ cnt ], 0, 1, &sr_ref[ cnt ] );
611 BER_BVZERO( &sr_ref[ cnt ] );
613 ( void )ldap_back_referral_result_rewrite( &dc, sr_ref );
616 ldap_value_free( references );
618 if ( rs->sr_v2ref == NULL ) {
619 rs->sr_v2ref = sr_ref;
622 for ( cnt = 0; !BER_BVISNULL( &sr_ref[ cnt ] ); cnt++ ) {
623 ber_bvarray_add( &rs->sr_v2ref, &sr_ref[ cnt ] );
625 ber_memfree( sr_ref );
629 rs->sr_err = candidates[ i ].sr_err;
630 sres = slap_map_api2result( rs );
632 snprintf( buf, sizeof( buf ),
633 "%s meta_back_search[%ld] "
634 "match=\"%s\" err=%ld\n",
636 candidates[ i ].sr_matched ? candidates[ i ].sr_matched : "",
637 (long) candidates[ i ].sr_err );
638 Debug( LDAP_DEBUG_ANY, "%s", buf, 0, 0 );
641 case LDAP_NO_SUCH_OBJECT:
642 /* is_ok is touched any time a valid
643 * (even intermediate) result is
644 * returned; as a consequence, if
645 * a candidate returns noSuchObject
646 * it is ignored and the candidate
647 * is simply demoted. */
659 if ( META_BACK_ONERR_STOP( mi ) ) {
660 savepriv = op->o_private;
661 op->o_private = (void *)i;
662 send_ldap_result( op, rs );
663 op->o_private = savepriv;
673 * When no candidates are left,
674 * the outer cycle finishes
676 candidates[ i ].sr_msgid = -1;
685 /* check for abandon */
686 if ( op->o_abandon || doabandon ) {
687 for ( i = 0; i < mi->mi_ntargets; i++ ) {
688 metasingleconn_t *msc = &mc->mc_conns[ i ];
690 if ( candidates[ i ].sr_msgid != -1 ) {
691 ldap_abandon_ext( msc->msc_ld,
692 candidates[ i ].sr_msgid,
694 candidates[ i ].sr_msgid = -1;
698 if ( op->o_abandon ) {
705 LDAP_BACK_TV_SET( &tv );
706 ldap_pvt_thread_yield();
716 * FIXME: need a better strategy to handle errors
718 rc = meta_back_op_result( mc, op, rs, META_TARGET_NONE );
723 * Rewrite the matched portion of the search base, if required
725 * FIXME: only the last one gets caught!
727 savepriv = op->o_private;
728 op->o_private = (void *)(long)mi->mi_ntargets;
729 if ( candidate_match > 0 ) {
730 struct berval pmatched = BER_BVNULL;
732 /* we use the first one */
733 for ( i = 0; i < mi->mi_ntargets; i++ ) {
734 if ( candidates[ i ].sr_tag == META_CANDIDATE
735 && candidates[ i ].sr_matched )
737 struct berval bv, pbv;
740 ber_str2bv( candidates[ i ].sr_matched, 0, 0, &bv );
741 rc = dnPretty( NULL, &bv, &pbv, op->o_tmpmemctx );
743 if ( rc == LDAP_SUCCESS ) {
745 /* NOTE: if they all are superiors
746 * of the baseDN, the shorter is also
747 * superior of the longer... */
748 if ( pbv.bv_len > pmatched.bv_len ) {
749 if ( !BER_BVISNULL( &pmatched ) ) {
750 op->o_tmpfree( pmatched.bv_val, op->o_tmpmemctx );
753 op->o_private = (void *)i;
756 op->o_tmpfree( pbv.bv_val, op->o_tmpmemctx );
760 if ( candidates[ i ].sr_matched != NULL ) {
761 free( (char *)candidates[ i ].sr_matched );
762 candidates[ i ].sr_matched = NULL;
767 if ( !BER_BVISNULL( &pmatched ) ) {
768 matched = pmatched.bv_val;
771 } else if ( sres == LDAP_NO_SUCH_OBJECT ) {
772 matched = op->o_bd->be_suffix[ 0 ].bv_val;
781 for ( i = 0; i < mi->mi_ntargets; i++ ) {
782 if ( candidates[ i ].sr_tag == META_CANDIDATE ) {
790 snprintf( buf, sizeof( buf ), "%s meta_back_search: is_scope=%d is_ok=%d cnd=\"%s\"\n",
791 op->o_log_prefix, initial_candidates, is_ok, cnd );
793 Debug( LDAP_DEBUG_ANY, "%s", buf, 0, 0 );
798 * In case we returned at least one entry, we return LDAP_SUCCESS
799 * otherwise, the latter error code we got
801 * FIXME: we should handle error codes and return the more
802 * important/reasonable
805 if ( sres == LDAP_SUCCESS && rs->sr_v2ref ) {
806 sres = LDAP_REFERRAL;
809 rs->sr_matched = matched;
810 rs->sr_ref = ( sres == LDAP_REFERRAL ? rs->sr_v2ref : NULL );
811 send_ldap_result( op, rs );
812 op->o_private = savepriv;
813 rs->sr_matched = NULL;
817 if ( matched && matched != op->o_bd->be_suffix[ 0 ].bv_val ) {
818 op->o_tmpfree( matched, op->o_tmpmemctx );
821 if ( rs->sr_v2ref ) {
822 ber_bvarray_free( rs->sr_v2ref );
825 for ( i = 0; i < mi->mi_ntargets; i++ ) {
826 if ( candidates[ i ].sr_tag != META_CANDIDATE ) {
830 if ( candidates[ i ].sr_matched ) {
831 free( (char *)candidates[ i ].sr_matched );
832 candidates[ i ].sr_matched = NULL;
835 if ( candidates[ i ].sr_text ) {
836 ldap_memfree( (char *)candidates[ i ].sr_text );
837 candidates[ i ].sr_text = NULL;
840 if ( candidates[ i ].sr_ref ) {
841 ber_bvarray_free( candidates[ i ].sr_ref );
842 candidates[ i ].sr_ref = NULL;
845 if ( candidates[ i ].sr_ctrls ) {
846 ldap_controls_free( candidates[ i ].sr_ctrls );
847 candidates[ i ].sr_ctrls = NULL;
851 meta_back_release_conn( op, mc );
864 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
865 struct berval a, mapped;
867 BerElement ber = *e->lm_ber;
868 Attribute *attr, **attrp;
875 if ( ber_scanf( &ber, "{m{", &bdn ) == LBER_ERROR ) {
876 return LDAP_DECODING_ERROR;
880 * Rewrite the dn of the result, if needed
882 dc.target = &mi->mi_targets[ target ];
883 dc.conn = op->o_conn;
885 dc.ctx = "searchResult";
887 rs->sr_err = ldap_back_dn_massage( &dc, &bdn, &dn );
888 if ( rs->sr_err != LDAP_SUCCESS) {
893 * Note: this may fail if the target host(s) schema differs
894 * from the one known to the meta, and a DN with unknown
895 * attributes is returned.
897 * FIXME: should we log anything, or delegate to dnNormalize?
899 rc = dnPrettyNormal( NULL, &dn, &ent.e_name, &ent.e_nname,
901 if ( dn.bv_val != bdn.bv_val ) {
906 if ( rc != LDAP_SUCCESS ) {
907 return LDAP_INVALID_DN_SYNTAX;
913 if ( mi->mi_cache.ttl != META_DNCACHE_DISABLED ) {
914 ( void )meta_dncache_update_entry( &mi->mi_cache,
915 &ent.e_nname, target );
918 attrp = &ent.e_attrs;
920 dc.ctx = "searchAttrDN";
921 while ( ber_scanf( &ber, "{m", &a ) != LBER_ERROR ) {
923 slap_syntax_validate_func *validate;
924 slap_syntax_transform_func *pretty;
926 ldap_back_map( &mi->mi_targets[ target ].mt_rwmap.rwm_at,
927 &a, &mapped, BACKLDAP_REMAP );
928 if ( BER_BVISNULL( &mapped ) || mapped.bv_val[0] == '\0' ) {
931 attr = ( Attribute * )ch_calloc( 1, sizeof( Attribute ) );
932 if ( attr == NULL ) {
935 if ( slap_bv2ad( &mapped, &attr->a_desc, &text )
937 if ( slap_bv2undef_ad( &mapped, &attr->a_desc, &text,
938 SLAP_AD_PROXIED ) != LDAP_SUCCESS )
940 char buf[ SLAP_TEXT_BUFLEN ];
942 snprintf( buf, sizeof( buf ),
943 "%s meta_send_entry(\"%s\"): "
944 "slap_bv2undef_ad(%s): %s\n",
945 op->o_log_prefix, ent.e_name.bv_val,
946 mapped.bv_val, text );
948 Debug( LDAP_DEBUG_ANY, "%s", buf, 0, 0 );
954 /* no subschemaSubentry */
955 if ( attr->a_desc == slap_schema.si_ad_subschemaSubentry
956 || attr->a_desc == slap_schema.si_ad_entryDN )
960 * We eat target's subschemaSubentry because
961 * a search for this value is likely not
962 * to resolve to the appropriate backend;
963 * later, the local subschemaSubentry is
966 * We also eat entryDN because the frontend
967 * will reattach it without checking if already
970 ( void )ber_scanf( &ber, "x" /* [W] */ );
976 if ( ber_scanf( &ber, "[W]", &attr->a_vals ) == LBER_ERROR
977 || attr->a_vals == NULL )
979 attr->a_vals = (struct berval *)&slap_dummy_bv;
982 for ( last = 0; !BER_BVISNULL( &attr->a_vals[ last ] ); ++last )
986 validate = attr->a_desc->ad_type->sat_syntax->ssyn_validate;
987 pretty = attr->a_desc->ad_type->sat_syntax->ssyn_pretty;
989 if ( !validate && !pretty ) {
994 if ( attr->a_desc == slap_schema.si_ad_objectClass
995 || attr->a_desc == slap_schema.si_ad_structuralObjectClass )
999 for ( bv = attr->a_vals; !BER_BVISNULL( bv ); bv++ ) {
1000 ldap_back_map( &mi->mi_targets[ target ].mt_rwmap.rwm_oc,
1001 bv, &mapped, BACKLDAP_REMAP );
1002 if ( BER_BVISNULL( &mapped ) || mapped.bv_val[0] == '\0') {
1008 *bv = attr->a_vals[ last ];
1009 BER_BVZERO( &attr->a_vals[ last ] );
1012 } else if ( mapped.bv_val != bv->bv_val ) {
1014 ber_dupbv( bv, &mapped );
1018 * It is necessary to try to rewrite attributes with
1019 * dn syntax because they might be used in ACLs as
1020 * members of groups; since ACLs are applied to the
1021 * rewritten stuff, no dn-based subecj clause could
1022 * be used at the ldap backend side (see
1023 * http://www.OpenLDAP.org/faq/data/cache/452.html)
1024 * The problem can be overcome by moving the dn-based
1025 * ACLs to the target directory server, and letting
1026 * everything pass thru the ldap backend.
1031 if ( attr->a_desc->ad_type->sat_syntax ==
1032 slap_schema.si_syn_distinguishedName )
1034 ldap_dnattr_result_rewrite( &dc, attr->a_vals );
1036 } else if ( attr->a_desc == slap_schema.si_ad_ref ) {
1037 ldap_back_referral_result_rewrite( &dc, attr->a_vals );
1041 for ( i = 0; i < last; i++ ) {
1046 rc = pretty( attr->a_desc->ad_type->sat_syntax,
1047 &attr->a_vals[i], &pval, NULL );
1050 rc = validate( attr->a_desc->ad_type->sat_syntax,
1055 LBER_FREE( attr->a_vals[i].bv_val );
1056 if ( --last == i ) {
1057 BER_BVZERO( &attr->a_vals[ i ] );
1060 attr->a_vals[i] = attr->a_vals[last];
1061 BER_BVZERO( &attr->a_vals[last] );
1067 LBER_FREE( attr->a_vals[i].bv_val );
1068 attr->a_vals[i] = pval;
1072 if ( last == 0 && attr->a_vals != &slap_dummy_bv ) {
1078 if ( last && attr->a_desc->ad_type->sat_equality &&
1079 attr->a_desc->ad_type->sat_equality->smr_normalize )
1083 attr->a_nvals = ch_malloc( ( last + 1 ) * sizeof( struct berval ) );
1084 for ( i = 0; i<last; i++ ) {
1085 attr->a_desc->ad_type->sat_equality->smr_normalize(
1086 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
1087 attr->a_desc->ad_type->sat_syntax,
1088 attr->a_desc->ad_type->sat_equality,
1089 &attr->a_vals[i], &attr->a_nvals[i],
1092 BER_BVZERO( &attr->a_nvals[i] );
1095 attr->a_nvals = attr->a_vals;
1099 attrp = &attr->a_next;
1102 rs->sr_entry = &ent;
1103 rs->sr_attrs = op->ors_attrs;
1105 send_search_entry( op, rs );
1106 rs->sr_entry = NULL;
1107 rs->sr_attrs = NULL;
1109 if ( !BER_BVISNULL( &ent.e_name ) ) {
1110 free( ent.e_name.bv_val );
1111 BER_BVZERO( &ent.e_name );
1113 if ( !BER_BVISNULL( &ent.e_nname ) ) {
1114 free( ent.e_nname.bv_val );
1115 BER_BVZERO( &ent.e_nname );
1117 entry_clean( &ent );
1119 return LDAP_SUCCESS;