1 /* rwmmap.c - rewrite/mapping routines */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 1999-2007 The OpenLDAP Foundation.
6 * Portions Copyright 1999-2003 Howard Chu.
7 * Portions Copyright 2000-2003 Pierangelo Masarati.
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted only as authorized by the OpenLDAP
14 * A copy of this license is available in the file LICENSE in the
15 * top-level directory of the distribution or, alternatively, at
16 * <http://www.OpenLDAP.org/license.html>.
19 * This work was initially developed by the Howard Chu for inclusion
20 * in OpenLDAP Software and subsequently enhanced by Pierangelo
30 #include <ac/string.h>
31 #include <ac/socket.h>
36 #undef ldap_debug /* silence a warning in ldap-int.h */
37 #include "../../../libraries/libldap/ldap-int.h"
40 rwm_mapping_cmp( const void *c1, const void *c2 )
42 struct ldapmapping *map1 = (struct ldapmapping *)c1;
43 struct ldapmapping *map2 = (struct ldapmapping *)c2;
44 int rc = map1->m_src.bv_len - map2->m_src.bv_len;
50 return strcasecmp( map1->m_src.bv_val, map2->m_src.bv_val );
54 rwm_mapping_dup( void *c1, void *c2 )
56 struct ldapmapping *map1 = (struct ldapmapping *)c1;
57 struct ldapmapping *map2 = (struct ldapmapping *)c2;
58 int rc = map1->m_src.bv_len - map2->m_src.bv_len;
64 return ( ( strcasecmp( map1->m_src.bv_val, map2->m_src.bv_val ) == 0 ) ? -1 : 0 );
68 rwm_map_init( struct ldapmap *lm, struct ldapmapping **m )
70 struct ldapmapping *mapping;
78 mapping = (struct ldapmapping *)ch_calloc( 2,
79 sizeof( struct ldapmapping ) );
80 if ( mapping == NULL ) {
81 return LDAP_NO_MEMORY;
84 /* FIXME: I don't think this is needed any more... */
85 rc = slap_str2ad( "objectClass", &mapping[0].m_src_ad, &text );
86 if ( rc != LDAP_SUCCESS ) {
91 mapping[0].m_dst_ad = mapping[0].m_src_ad;
92 ber_dupbv( &mapping[0].m_src, &mapping[0].m_src_ad->ad_cname );
93 ber_dupbv( &mapping[0].m_dst, &mapping[0].m_src );
95 mapping[1].m_src = mapping[0].m_src;
96 mapping[1].m_dst = mapping[0].m_dst;
97 mapping[1].m_src_ad = mapping[0].m_src_ad;
98 mapping[1].m_dst_ad = mapping[1].m_src_ad;
100 avl_insert( &lm->map, (caddr_t)&mapping[0],
101 rwm_mapping_cmp, rwm_mapping_dup );
102 avl_insert( &lm->remap, (caddr_t)&mapping[1],
103 rwm_mapping_cmp, rwm_mapping_dup );
111 rwm_mapping( struct ldapmap *map, struct berval *s, struct ldapmapping **m, int remap )
114 struct ldapmapping fmapping;
122 if ( remap == RWM_REMAP ) {
130 *m = (struct ldapmapping *)avl_find( tree, (caddr_t)&fmapping,
134 return map->drop_missing;
141 rwm_map( struct ldapmap *map, struct berval *s, struct berval *bv, int remap )
143 struct ldapmapping *mapping;
145 /* map->map may be NULL when mapping is configured,
146 * but map->remap can't */
147 if ( map->remap == NULL ) {
153 ( void )rwm_mapping( map, s, &mapping, remap );
154 if ( mapping != NULL ) {
155 if ( !BER_BVISNULL( &mapping->m_dst ) ) {
156 *bv = mapping->m_dst;
161 if ( !map->drop_missing ) {
167 * Map attribute names in place
171 struct ldapmap *at_map,
172 struct ldapmap *oc_map,
179 assert( anp != NULL );
187 for ( i = 0; !BER_BVISNULL( &an[i].an_name ); i++ )
189 *anp = ch_malloc( ( i + 1 )* sizeof( AttributeName ) );
190 if ( *anp == NULL ) {
191 return LDAP_NO_MEMORY;
194 for ( i = 0, j = 0; !BER_BVISNULL( &an[i].an_name ); i++ ) {
195 struct ldapmapping *m;
196 int at_drop_missing = 0,
199 if ( an[i].an_desc ) {
201 /* FIXME: better leave as is? */
205 at_drop_missing = rwm_mapping( at_map, &an[i].an_name, &m, remap );
206 if ( at_drop_missing || ( m && BER_BVISNULL( &m->m_dst ) ) ) {
217 if ( remap == RWM_MAP ) {
218 (*anp)[j].an_name = m->m_dst;
219 (*anp)[j].an_desc = m->m_dst_ad;
221 (*anp)[j].an_name = m->m_src;
222 (*anp)[j].an_desc = m->m_src_ad;
229 } else if ( an[i].an_oc ) {
231 /* FIXME: better leave as is? */
235 oc_drop_missing = rwm_mapping( oc_map, &an[i].an_name, &m, remap );
237 if ( oc_drop_missing || ( m && BER_BVISNULL( &m->m_dst ) ) ) {
248 if ( remap == RWM_MAP ) {
249 (*anp)[j].an_name = m->m_dst;
250 (*anp)[j].an_oc = m->m_dst_oc;
252 (*anp)[j].an_name = m->m_src;
253 (*anp)[j].an_oc = m->m_src_oc;
257 at_drop_missing = rwm_mapping( at_map, &an[i].an_name, &m, remap );
259 if ( at_drop_missing || !m ) {
260 oc_drop_missing = rwm_mapping( oc_map, &an[i].an_name, &m, remap );
262 /* if both at_map and oc_map required to drop missing,
264 if ( oc_drop_missing && at_drop_missing ) {
268 /* if no oc_map mapping was found and at_map required
269 * to drop missing, then do it; otherwise, at_map wins
270 * and an is considered an attr and is left unchanged */
272 if ( at_drop_missing ) {
280 if ( BER_BVISNULL( &m->m_dst ) ) {
285 if ( remap == RWM_MAP ) {
286 (*anp)[j].an_name = m->m_dst;
287 (*anp)[j].an_oc = m->m_dst_oc;
289 (*anp)[j].an_name = m->m_src;
290 (*anp)[j].an_oc = m->m_src_oc;
296 if ( !BER_BVISNULL( &m->m_dst ) ) {
298 if ( remap == RWM_MAP ) {
299 (*anp)[j].an_name = m->m_dst;
300 (*anp)[j].an_desc = m->m_dst_ad;
302 (*anp)[j].an_name = m->m_src;
303 (*anp)[j].an_desc = m->m_src_ad;
311 if ( j == 0 && i != 0 ) {
312 memset( &(*anp)[0], 0, sizeof( AttributeName ) );
313 BER_BVSTR( &(*anp)[0].an_name, LDAP_NO_ATTRS );
316 memset( &(*anp)[j], 0, sizeof( AttributeName ) );
323 struct ldapmap *at_map,
326 char ***mapped_attrs )
332 *mapped_attrs = NULL;
336 for ( i = 0; !BER_BVISNULL( &an[ i ].an_name ); i++ )
339 na = (char **)ch_calloc( i + 1, sizeof( char * ) );
341 *mapped_attrs = NULL;
342 return LDAP_NO_MEMORY;
345 for ( i = j = 0; !BER_BVISNULL( &an[i].an_name ); i++ ) {
346 struct ldapmapping *mapping;
348 if ( rwm_mapping( at_map, &an[i].an_name, &mapping, remap ) ) {
353 na[ j++ ] = an[ i ].an_name.bv_val;
355 } else if ( !BER_BVISNULL( &mapping->m_dst ) ) {
356 na[ j++ ] = mapping->m_dst.bv_val;
360 if ( j == 0 && i != 0 ) {
361 na[ j++ ] = LDAP_NO_ATTRS;
374 AttributeDescription **adp,
375 struct berval *mapped_attr,
376 struct berval *value,
377 struct berval *mapped_value,
380 struct berval vtmp = BER_BVNULL;
382 AttributeDescription *ad = *adp;
383 struct ldapmapping *mapping = NULL;
385 rwm_mapping( &dc->rwmap->rwm_at, &ad->ad_cname, &mapping, remap );
386 if ( mapping == NULL ) {
387 if ( dc->rwmap->rwm_at.drop_missing ) {
391 *mapped_attr = ad->ad_cname;
394 *mapped_attr = mapping->m_dst;
397 if ( value != NULL ) {
398 assert( mapped_value != NULL );
400 if ( ad->ad_type->sat_syntax == slap_schema.si_syn_distinguishedName
401 || ( mapping != NULL && mapping->m_dst_ad->ad_type->sat_syntax == slap_schema.si_syn_distinguishedName ) )
406 #ifdef ENABLE_REWRITE
407 fdc.ctx = "searchFilterAttrDN";
408 #endif /* ENABLE_REWRITE */
411 rc = rwm_dn_massage_normalize( &fdc, value, &vtmp );
414 if ( vtmp.bv_val != value->bv_val ) {
419 case LDAP_UNWILLING_TO_PERFORM:
425 } else if ( ad == slap_schema.si_ad_objectClass
426 || ad == slap_schema.si_ad_structuralObjectClass )
428 rwm_map( &dc->rwmap->rwm_oc, value, &vtmp, remap );
429 if ( BER_BVISNULL( &vtmp ) || BER_BVISEMPTY( &vtmp ) ) {
437 filter_escape_value( &vtmp, mapped_value );
440 ch_free( vtmp.bv_val );
444 if ( mapping != NULL ) {
445 assert( mapping->m_dst_ad != NULL );
446 *adp = mapping->m_dst_ad;
453 rwm_int_filter_map_rewrite(
457 struct berval *fstr )
461 AttributeDescription *ad;
466 /* better than nothing... */
467 ber_bvfalse = BER_BVC( "(!(objectClass=*))" ),
468 ber_bvtf_false = BER_BVC( "(|)" ),
469 /* better than nothing... */
470 ber_bvtrue = BER_BVC( "(objectClass=*)" ),
471 ber_bvtf_true = BER_BVC( "(&)" ),
473 /* no longer needed; preserved for completeness */
474 ber_bvundefined = BER_BVC( "(?=undefined)" ),
476 ber_bverror = BER_BVC( "(?=error)" ),
477 ber_bvunknown = BER_BVC( "(?=unknown)" ),
478 ber_bvnone = BER_BVC( "(?=none)" );
481 assert( fstr != NULL );
485 ber_dupbv( fstr, &ber_bvnone );
489 switch ( f->f_choice & SLAPD_FILTER_MASK ) {
490 case LDAP_FILTER_EQUALITY:
492 if ( map_attr_value( dc, &ad, &atmp,
493 &f->f_av_value, &vtmp, RWM_MAP ) )
498 fstr->bv_len = atmp.bv_len + vtmp.bv_len + STRLENOF( "(=)" );
499 fstr->bv_val = ch_malloc( fstr->bv_len + 1 );
501 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s=%s)",
502 atmp.bv_val, vtmp.bv_val );
504 ch_free( vtmp.bv_val );
509 if ( map_attr_value( dc, &ad, &atmp,
510 &f->f_av_value, &vtmp, RWM_MAP ) )
515 fstr->bv_len = atmp.bv_len + vtmp.bv_len + STRLENOF( "(>=)" );
516 fstr->bv_val = ch_malloc( fstr->bv_len + 1 );
518 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s>=%s)",
519 atmp.bv_val, vtmp.bv_val );
521 ch_free( vtmp.bv_val );
526 if ( map_attr_value( dc, &ad, &atmp,
527 &f->f_av_value, &vtmp, RWM_MAP ) )
532 fstr->bv_len = atmp.bv_len + vtmp.bv_len + STRLENOF( "(<=)" );
533 fstr->bv_val = ch_malloc( fstr->bv_len + 1 );
535 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s<=%s)",
536 atmp.bv_val, vtmp.bv_val );
538 ch_free( vtmp.bv_val );
541 case LDAP_FILTER_APPROX:
543 if ( map_attr_value( dc, &ad, &atmp,
544 &f->f_av_value, &vtmp, RWM_MAP ) )
549 fstr->bv_len = atmp.bv_len + vtmp.bv_len + STRLENOF( "(~=)" );
550 fstr->bv_val = ch_malloc( fstr->bv_len + 1 );
552 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s~=%s)",
553 atmp.bv_val, vtmp.bv_val );
555 ch_free( vtmp.bv_val );
558 case LDAP_FILTER_SUBSTRINGS:
560 if ( map_attr_value( dc, &ad, &atmp,
561 NULL, NULL, RWM_MAP ) )
566 /* cannot be a DN ... */
568 fstr->bv_len = atmp.bv_len + STRLENOF( "(=*)" );
569 fstr->bv_val = ch_malloc( fstr->bv_len + 128 );
571 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s=*)",
574 if ( !BER_BVISNULL( &f->f_sub_initial ) ) {
577 filter_escape_value( &f->f_sub_initial, &vtmp );
579 fstr->bv_len += vtmp.bv_len;
580 fstr->bv_val = ch_realloc( fstr->bv_val, fstr->bv_len + 1 );
582 snprintf( &fstr->bv_val[len - 2], vtmp.bv_len + 3,
583 /* "(attr=" */ "%s*)",
586 ch_free( vtmp.bv_val );
589 if ( f->f_sub_any != NULL ) {
590 for ( i = 0; !BER_BVISNULL( &f->f_sub_any[i] ); i++ ) {
592 filter_escape_value( &f->f_sub_any[i], &vtmp );
594 fstr->bv_len += vtmp.bv_len + 1;
595 fstr->bv_val = ch_realloc( fstr->bv_val, fstr->bv_len + 1 );
597 snprintf( &fstr->bv_val[len - 1], vtmp.bv_len + 3,
598 /* "(attr=[init]*[any*]" */ "%s*)",
600 ch_free( vtmp.bv_val );
604 if ( !BER_BVISNULL( &f->f_sub_final ) ) {
607 filter_escape_value( &f->f_sub_final, &vtmp );
609 fstr->bv_len += vtmp.bv_len;
610 fstr->bv_val = ch_realloc( fstr->bv_val, fstr->bv_len + 1 );
612 snprintf( &fstr->bv_val[len - 1], vtmp.bv_len + 3,
613 /* "(attr=[init*][any*]" */ "%s)",
616 ch_free( vtmp.bv_val );
621 case LDAP_FILTER_PRESENT:
623 if ( map_attr_value( dc, &ad, &atmp,
624 NULL, NULL, RWM_MAP ) )
629 fstr->bv_len = atmp.bv_len + STRLENOF( "(=*)" );
630 fstr->bv_val = ch_malloc( fstr->bv_len + 1 );
632 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s=*)",
636 case LDAP_FILTER_AND:
638 case LDAP_FILTER_NOT:
639 fstr->bv_len = STRLENOF( "(%)" );
640 fstr->bv_val = ch_malloc( fstr->bv_len + 128 );
642 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%c)",
643 f->f_choice == LDAP_FILTER_AND ? '&' :
644 f->f_choice == LDAP_FILTER_OR ? '|' : '!' );
646 for ( p = f->f_list; p != NULL; p = p->f_next ) {
651 rc = rwm_int_filter_map_rewrite( op, dc, p, &vtmp );
652 if ( rc != LDAP_SUCCESS ) {
656 fstr->bv_len += vtmp.bv_len;
657 fstr->bv_val = ch_realloc( fstr->bv_val, fstr->bv_len + 1 );
659 snprintf( &fstr->bv_val[len-1], vtmp.bv_len + 2,
660 /*"("*/ "%s)", vtmp.bv_val );
662 ch_free( vtmp.bv_val );
667 case LDAP_FILTER_EXT: {
668 if ( f->f_mr_desc ) {
670 if ( map_attr_value( dc, &ad, &atmp,
671 &f->f_mr_value, &vtmp, RWM_MAP ) )
677 BER_BVSTR( &atmp, "" );
678 filter_escape_value( &f->f_mr_value, &vtmp );
682 fstr->bv_len = atmp.bv_len +
683 ( f->f_mr_dnattrs ? STRLENOF( ":dn" ) : 0 ) +
684 ( f->f_mr_rule_text.bv_len ? f->f_mr_rule_text.bv_len + 1 : 0 ) +
685 vtmp.bv_len + STRLENOF( "(:=)" );
686 fstr->bv_val = ch_malloc( fstr->bv_len + 1 );
688 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s%s%s%s:=%s)",
690 f->f_mr_dnattrs ? ":dn" : "",
691 !BER_BVISEMPTY( &f->f_mr_rule_text ) ? ":" : "",
692 !BER_BVISEMPTY( &f->f_mr_rule_text ) ? f->f_mr_rule_text.bv_val : "",
694 ch_free( vtmp.bv_val );
700 filter_free_x( op, f );
701 f->f_choice = SLAPD_FILTER_COMPUTED;
702 f->f_result = SLAPD_COMPARE_UNDEFINED;
705 case SLAPD_FILTER_COMPUTED:
706 switch ( f->f_result ) {
707 case LDAP_COMPARE_FALSE:
708 /* FIXME: treat UNDEFINED as FALSE */
709 case SLAPD_COMPARE_UNDEFINED:
710 if ( dc->rwmap->rwm_flags & RWM_F_SUPPORT_T_F ) {
711 tmp = &ber_bvtf_false;
717 case LDAP_COMPARE_TRUE:
718 if ( dc->rwmap->rwm_flags & RWM_F_SUPPORT_T_F ) {
719 tmp = &ber_bvtf_true;
730 ber_dupbv( fstr, tmp );
734 ber_dupbv( fstr, &ber_bvunknown );
742 rwm_filter_map_rewrite(
746 struct berval *fstr )
752 rc = rwm_int_filter_map_rewrite( op, dc, f, fstr );
754 #ifdef ENABLE_REWRITE
762 fdc.ctx = "searchFilter";
764 switch ( rewrite_session( fdc.rwmap->rwm_rw, fdc.ctx,
765 ( !BER_BVISEMPTY( &ftmp ) ? ftmp.bv_val : "" ),
766 fdc.conn, &fstr->bv_val ) )
768 case REWRITE_REGEXEC_OK:
769 if ( !BER_BVISNULL( fstr ) ) {
770 fstr->bv_len = strlen( fstr->bv_val );
771 ch_free( ftmp.bv_val );
777 Debug( LDAP_DEBUG_ARGS,
778 "[rw] %s: \"%s\" -> \"%s\"\n",
779 fdc.ctx, ftmp.bv_val, fstr->bv_val );
783 case REWRITE_REGEXEC_UNWILLING:
785 fdc.rs->sr_err = LDAP_UNWILLING_TO_PERFORM;
786 fdc.rs->sr_text = "Operation not allowed";
788 rc = LDAP_UNWILLING_TO_PERFORM;
791 case REWRITE_REGEXEC_ERR:
793 fdc.rs->sr_err = LDAP_OTHER;
794 fdc.rs->sr_text = "Rewrite error";
799 #endif /* ENABLE_REWRITE */
805 * I don't like this much, but we need two different
806 * functions because different heap managers may be
807 * in use in back-ldap/meta to reduce the amount of
808 * calls to malloc routines, and some of the free()
809 * routines may be macros with args
812 rwm_referral_rewrite(
817 BerVarray *pa_nvals )
819 slap_overinst *on = (slap_overinst *) op->o_bd->bd_info;
820 struct ldaprwmap *rwmap =
821 (struct ldaprwmap *)on->on_bi.bi_private;
826 struct berval dn = BER_BVNULL,
829 assert( a_vals != NULL );
832 * Rewrite the dn if needed
835 #ifdef ENABLE_REWRITE
836 dc.conn = op->o_conn;
838 dc.ctx = (char *)cookie;
839 #else /* ! ENABLE_REWRITE */
840 dc.tofrom = ((int *)cookie)[0];
842 #endif /* ! ENABLE_REWRITE */
844 for ( last = 0; !BER_BVISNULL( &a_vals[last] ); last++ )
848 if ( pa_nvals != NULL ) {
849 if ( *pa_nvals == NULL ) {
850 *pa_nvals = ch_malloc( ( last + 2 ) * sizeof(struct berval) );
851 memset( *pa_nvals, 0, ( last + 2 ) * sizeof(struct berval) );
855 for ( i = 0; !BER_BVISNULL( &a_vals[i] ); i++ ) {
856 struct berval olddn = BER_BVNULL,
862 rc = ldap_url_parse( oldval.bv_val, &ludp );
863 if ( rc != LDAP_URL_SUCCESS ) {
864 /* leave attr untouched if massage failed */
865 if ( pa_nvals && BER_BVISNULL( &(*pa_nvals)[i] ) ) {
866 ber_dupbv( &(*pa_nvals)[i], &oldval );
871 /* FIXME: URLs like "ldap:///dc=suffix" if passed
872 * thru ldap_url_parse() and ldap_url_desc2str()
873 * get rewritten as "ldap:///dc=suffix??base";
874 * we don't want this to occur... */
875 if ( ludp->lud_scope == LDAP_SCOPE_BASE ) {
876 ludp->lud_scope = LDAP_SCOPE_DEFAULT;
879 ber_str2bv( ludp->lud_dn, 0, 0, &olddn );
884 rc = rwm_dn_massage_pretty_normalize( &dc, &olddn,
887 rc = rwm_dn_massage_pretty( &dc, &olddn, &dn );
891 case LDAP_UNWILLING_TO_PERFORM:
893 * FIXME: need to check if it may be considered
894 * legal to trim values when adding/modifying;
895 * it should be when searching (e.g. ACLs).
897 ch_free( a_vals[i].bv_val );
899 a_vals[i] = a_vals[last];
901 (*pa_nvals)[i] = (*pa_nvals)[last];
904 BER_BVZERO( &a_vals[last] );
906 BER_BVZERO( &(*pa_nvals)[last] );
912 if ( !BER_BVISNULL( &dn ) && dn.bv_val != olddn.bv_val ) {
915 ludp->lud_dn = dn.bv_val;
916 newurl = ldap_url_desc2str( ludp );
917 ludp->lud_dn = olddn.bv_val;
918 ch_free( dn.bv_val );
919 if ( newurl == NULL ) {
920 /* FIXME: leave attr untouched
921 * even if ldap_url_desc2str failed...
926 ber_str2bv( newurl, 0, 1, &a_vals[i] );
930 ludp->lud_dn = ndn.bv_val;
931 newurl = ldap_url_desc2str( ludp );
932 ludp->lud_dn = olddn.bv_val;
933 ch_free( ndn.bv_val );
934 if ( newurl == NULL ) {
935 /* FIXME: leave attr untouched
936 * even if ldap_url_desc2str failed...
938 ch_free( a_vals[i].bv_val );
943 if ( !BER_BVISNULL( &(*pa_nvals)[i] ) ) {
944 ch_free( (*pa_nvals)[i].bv_val );
946 ber_str2bv( newurl, 0, 1, &(*pa_nvals)[i] );
950 ch_free( oldval.bv_val );
951 ludp->lud_dn = olddn.bv_val;
956 /* leave attr untouched if massage failed */
957 if ( pa_nvals && BER_BVISNULL( &(*pa_nvals)[i] ) ) {
958 ber_dupbv( &(*pa_nvals)[i], &a_vals[i] );
962 ldap_free_urldesc( ludp );
969 * I don't like this much, but we need two different
970 * functions because different heap managers may be
971 * in use in back-ldap/meta to reduce the amount of
972 * calls to malloc routines, and some of the free()
973 * routines may be macros with args
981 BerVarray *pa_nvals )
983 slap_overinst *on = (slap_overinst *) op->o_bd->bd_info;
984 struct ldaprwmap *rwmap =
985 (struct ldaprwmap *)on->on_bi.bi_private;
990 struct berval dn = BER_BVNULL,
998 if ( pa_nvals == NULL || *pa_nvals == NULL ) {
1005 * Rewrite the dn if needed
1008 #ifdef ENABLE_REWRITE
1009 dc.conn = op->o_conn;
1011 dc.ctx = (char *)cookie;
1012 #else /* ! ENABLE_REWRITE */
1013 dc.tofrom = ((int *)cookie)[0];
1015 #endif /* ! ENABLE_REWRITE */
1017 for ( last = 0; !BER_BVISNULL( &in[last] ); last++ );
1019 if ( pa_nvals != NULL ) {
1020 if ( *pa_nvals == NULL ) {
1021 *pa_nvals = ch_malloc( ( last + 2 ) * sizeof(struct berval) );
1022 memset( *pa_nvals, 0, ( last + 2 ) * sizeof(struct berval) );
1026 for ( i = 0; !BER_BVISNULL( &in[i] ); i++ ) {
1032 ndn = (*pa_nvals)[i];
1033 rc = rwm_dn_massage_pretty_normalize( &dc, &in[i], &dn, &ndn );
1035 rc = rwm_dn_massage_pretty( &dc, &in[i], &dn );
1039 rc = rwm_dn_massage_normalize( &dc, &in[i], &ndn );
1043 case LDAP_UNWILLING_TO_PERFORM:
1045 * FIXME: need to check if it may be considered
1046 * legal to trim values when adding/modifying;
1047 * it should be when searching (e.g. ACLs).
1049 ch_free( in[i].bv_val );
1052 if ( a_vals && pa_nvals ) {
1053 (*pa_nvals)[i] = (*pa_nvals)[last];
1056 BER_BVZERO( &in[last] );
1057 if ( a_vals && pa_nvals ) {
1058 BER_BVZERO( &(*pa_nvals)[last] );
1065 if ( !BER_BVISNULL( &dn ) && dn.bv_val != a_vals[i].bv_val ) {
1066 ch_free( a_vals[i].bv_val );
1070 if ( !BER_BVISNULL( &(*pa_nvals)[i] ) ) {
1071 ch_free( (*pa_nvals)[i].bv_val );
1073 (*pa_nvals)[i] = ndn;
1078 if ( !BER_BVISNULL( &ndn ) && ndn.bv_val != (*pa_nvals)[i].bv_val ) {
1079 ch_free( (*pa_nvals)[i].bv_val );
1080 (*pa_nvals)[i] = ndn;
1086 /* leave attr untouched if massage failed */
1087 if ( a_vals && pa_nvals && BER_BVISNULL( &(*pa_nvals)[i] ) ) {
1088 dnNormalize( 0, NULL, NULL, &a_vals[i], &(*pa_nvals)[i], NULL );
1098 rwm_referral_result_rewrite(
1104 for ( last = 0; !BER_BVISNULL( &a_vals[last] ); last++ );
1107 for ( i = 0; !BER_BVISNULL( &a_vals[i] ); i++ ) {
1113 rc = ldap_url_parse( a_vals[i].bv_val, &ludp );
1114 if ( rc != LDAP_URL_SUCCESS ) {
1115 /* leave attr untouched if massage failed */
1119 /* FIXME: URLs like "ldap:///dc=suffix" if passed
1120 * thru ldap_url_parse() and ldap_url_desc2str()
1121 * get rewritten as "ldap:///dc=suffix??base";
1122 * we don't want this to occur... */
1123 if ( ludp->lud_scope == LDAP_SCOPE_BASE ) {
1124 ludp->lud_scope = LDAP_SCOPE_DEFAULT;
1127 ber_str2bv( ludp->lud_dn, 0, 0, &olddn );
1130 rc = rwm_dn_massage_pretty( dc, &olddn, &dn );
1132 case LDAP_UNWILLING_TO_PERFORM:
1134 * FIXME: need to check if it may be considered
1135 * legal to trim values when adding/modifying;
1136 * it should be when searching (e.g. ACLs).
1138 ch_free( a_vals[i].bv_val );
1140 a_vals[i] = a_vals[last];
1142 BER_BVZERO( &a_vals[last] );
1148 /* leave attr untouched if massage failed */
1149 if ( !BER_BVISNULL( &dn ) && olddn.bv_val != dn.bv_val ) {
1152 ludp->lud_dn = dn.bv_val;
1153 newurl = ldap_url_desc2str( ludp );
1154 if ( newurl == NULL ) {
1155 /* FIXME: leave attr untouched
1156 * even if ldap_url_desc2str failed...
1161 ch_free( a_vals[i].bv_val );
1162 ber_str2bv( newurl, 0, 1, &a_vals[i] );
1163 LDAP_FREE( newurl );
1164 ludp->lud_dn = olddn.bv_val;
1169 ldap_free_urldesc( ludp );
1176 rwm_dnattr_result_rewrite(
1182 for ( last = 0; !BER_BVISNULL( &a_vals[last] ); last++ );
1185 for ( i = 0; !BER_BVISNULL( &a_vals[i] ); i++ ) {
1190 rc = rwm_dn_massage_pretty( dc, &a_vals[i], &dn );
1192 case LDAP_UNWILLING_TO_PERFORM:
1194 * FIXME: need to check if it may be considered
1195 * legal to trim values when adding/modifying;
1196 * it should be when searching (e.g. ACLs).
1198 ch_free( a_vals[i].bv_val );
1200 a_vals[i] = a_vals[last];
1202 BER_BVZERO( &a_vals[last] );
1207 /* leave attr untouched if massage failed */
1208 if ( !BER_BVISNULL( &dn ) && a_vals[i].bv_val != dn.bv_val ) {
1209 ch_free( a_vals[i].bv_val );
1220 rwm_mapping_dst_free( void *v_mapping )
1222 struct ldapmapping *mapping = v_mapping;
1224 if ( BER_BVISEMPTY( &mapping[0].m_dst ) ) {
1225 rwm_mapping_free( &mapping[ -1 ] );
1230 rwm_mapping_free( void *v_mapping )
1232 struct ldapmapping *mapping = v_mapping;
1234 if ( !BER_BVISNULL( &mapping[0].m_src ) ) {
1235 ch_free( mapping[0].m_src.bv_val );
1238 if ( mapping[0].m_flags & RWMMAP_F_FREE_SRC ) {
1239 if ( mapping[0].m_flags & RWMMAP_F_IS_OC ) {
1240 if ( mapping[0].m_src_oc ) {
1241 ch_free( mapping[0].m_src_oc );
1245 if ( mapping[0].m_src_ad ) {
1246 ch_free( mapping[0].m_src_ad );
1251 if ( !BER_BVISNULL( &mapping[0].m_dst ) ) {
1252 ch_free( mapping[0].m_dst.bv_val );
1255 if ( mapping[0].m_flags & RWMMAP_F_FREE_DST ) {
1256 if ( mapping[0].m_flags & RWMMAP_F_IS_OC ) {
1257 if ( mapping[0].m_dst_oc ) {
1258 ch_free( mapping[0].m_dst_oc );
1262 if ( mapping[0].m_dst_ad ) {
1263 ch_free( mapping[0].m_dst_ad );
1272 #endif /* SLAPD_OVER_RWM */