1 /* rwmmap.c - rewrite/mapping routines */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 1999-2005 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->m_src_ad, &text );
86 if ( rc != LDAP_SUCCESS ) {
90 mapping->m_dst_ad = mapping->m_src_ad;
91 ber_dupbv( &mapping->m_dst, &mapping->m_src_ad->ad_cname );
92 ber_dupbv( &mapping->m_dst, &mapping->m_src );
94 mapping[1].m_src = mapping->m_src;
95 mapping[1].m_dst = mapping->m_dst;
97 avl_insert( &lm->map, (caddr_t)mapping,
98 rwm_mapping_cmp, rwm_mapping_dup );
99 avl_insert( &lm->remap, (caddr_t)&mapping[1],
100 rwm_mapping_cmp, rwm_mapping_dup );
108 rwm_mapping( struct ldapmap *map, struct berval *s, struct ldapmapping **m, int remap )
111 struct ldapmapping fmapping;
115 if ( remap == RWM_REMAP ) {
123 *m = (struct ldapmapping *)avl_find( tree, (caddr_t)&fmapping,
127 return map->drop_missing;
134 rwm_map( struct ldapmap *map, struct berval *s, struct berval *bv, int remap )
136 struct ldapmapping *mapping;
139 ( void )rwm_mapping( map, s, &mapping, remap );
140 if ( mapping != NULL ) {
141 if ( !BER_BVISNULL( &mapping->m_dst ) ) {
142 *bv = mapping->m_dst;
147 if ( !map->drop_missing ) {
153 * Map attribute names in place
157 struct ldapmap *at_map,
158 struct ldapmap *oc_map,
174 for ( i = 0; !BER_BVISNULL( &an[i].an_name ); i++ )
176 *anp = ch_malloc( ( i + 1 )* sizeof( AttributeName ) );
177 if ( *anp == NULL ) {
178 return LDAP_NO_MEMORY;
181 for ( i = 0, j = 0; !BER_BVISNULL( &an[i].an_name ); i++ ) {
182 struct ldapmapping *m;
183 int at_drop_missing = 0,
186 if ( an[i].an_desc ) {
188 /* FIXME: better leave as is? */
192 at_drop_missing = rwm_mapping( at_map, &an[i].an_name, &m, remap );
193 if ( at_drop_missing || ( m && BER_BVISNULL( &m->m_dst ) ) ) {
204 if ( remap == RWM_MAP ) {
205 (*anp)[j].an_name = m->m_dst;
206 (*anp)[j].an_desc = m->m_dst_ad;
208 (*anp)[j].an_name = m->m_src;
209 (*anp)[j].an_desc = m->m_src_ad;
216 } else if ( an[i].an_oc ) {
218 /* FIXME: better leave as is? */
222 oc_drop_missing = rwm_mapping( oc_map, &an[i].an_name, &m, remap );
224 if ( oc_drop_missing || ( m && BER_BVISNULL( &m->m_dst ) ) ) {
235 if ( remap == RWM_MAP ) {
236 (*anp)[j].an_name = m->m_dst;
237 (*anp)[j].an_oc = m->m_dst_oc;
239 (*anp)[j].an_name = m->m_src;
240 (*anp)[j].an_oc = m->m_src_oc;
244 at_drop_missing = rwm_mapping( at_map, &an[i].an_name, &m, remap );
246 if ( at_drop_missing || !m ) {
248 oc_drop_missing = rwm_mapping( oc_map, &an[i].an_name, &m, remap );
250 /* if both at_map and oc_map required to drop missing,
252 if ( oc_drop_missing && at_drop_missing ) {
256 /* if no oc_map mapping was found and at_map required
257 * to drop missing, then do it; otherwise, at_map wins
258 * and an is considered an attr and is left unchanged */
260 if ( at_drop_missing ) {
268 if ( BER_BVISNULL( &m->m_dst ) ) {
273 if ( remap == RWM_MAP ) {
274 (*anp)[j].an_name = m->m_dst;
275 (*anp)[j].an_oc = m->m_dst_oc;
277 (*anp)[j].an_name = m->m_src;
278 (*anp)[j].an_oc = m->m_src_oc;
284 if ( !BER_BVISNULL( &m->m_dst ) ) {
286 if ( remap == RWM_MAP ) {
287 (*anp)[j].an_name = m->m_dst;
288 (*anp)[j].an_desc = m->m_dst_ad;
290 (*anp)[j].an_name = m->m_src;
291 (*anp)[j].an_desc = m->m_src_ad;
299 if ( j == 0 && i != 0 ) {
300 memset( &(*anp)[0], 0, sizeof( AttributeName ) );
301 BER_BVSTR( &(*anp)[0].an_name, LDAP_NO_ATTRS );
303 memset( &(*anp)[j], 0, sizeof( AttributeName ) );
310 struct ldapmap *at_map,
320 *mapped_attrs = NULL;
324 for ( i = 0; !BER_BVISNULL( &an[ i ].an_name ); i++ ) {
328 na = (char **)ch_calloc( i + 1, sizeof( char * ) );
330 *mapped_attrs = NULL;
331 return LDAP_NO_MEMORY;
334 for ( i = j = 0; !BER_BVISNULL( &an[i].an_name ); i++ ) {
335 struct ldapmapping *mapping;
337 if ( rwm_mapping( at_map, &an[i].an_name, &mapping, remap ) ) {
342 na[ j++ ] = an[ i ].an_name.bv_val;
344 } else if ( !BER_BVISNULL( &mapping->m_dst ) ) {
345 na[ j++ ] = mapping->m_dst.bv_val;
349 if ( j == 0 && i != 0 ) {
350 na[ j++ ] = LDAP_NO_ATTRS;
363 AttributeDescription **adp,
364 struct berval *mapped_attr,
365 struct berval *value,
366 struct berval *mapped_value,
369 struct berval vtmp = BER_BVNULL;
371 AttributeDescription *ad = *adp;
372 struct ldapmapping *mapping = NULL;
374 rwm_mapping( &dc->rwmap->rwm_at, &ad->ad_cname, &mapping, remap );
375 if ( mapping == NULL ) {
376 if ( dc->rwmap->rwm_at.drop_missing ) {
380 *mapped_attr = ad->ad_cname;
383 *mapped_attr = mapping->m_dst;
386 if ( value != NULL ) {
387 assert( mapped_value != NULL );
389 if ( ad->ad_type->sat_syntax == slap_schema.si_syn_distinguishedName
390 || ( mapping != NULL && mapping->m_dst_ad->ad_type->sat_syntax == slap_schema.si_syn_distinguishedName ) )
395 #ifdef ENABLE_REWRITE
396 fdc.ctx = "searchFilterAttrDN";
397 #endif /* ENABLE_REWRITE */
400 rc = rwm_dn_massage_normalize( &fdc, value, &vtmp );
403 if ( vtmp.bv_val != value->bv_val ) {
408 case LDAP_UNWILLING_TO_PERFORM:
414 } else if ( ad == slap_schema.si_ad_objectClass
415 || ad == slap_schema.si_ad_structuralObjectClass )
417 rwm_map( &dc->rwmap->rwm_oc, value, &vtmp, remap );
418 if ( BER_BVISNULL( &vtmp ) || BER_BVISEMPTY( &vtmp ) ) {
426 filter_escape_value( &vtmp, mapped_value );
429 ch_free( vtmp.bv_val );
433 if ( mapping != NULL ) {
434 assert( mapping->m_dst_ad != NULL );
435 *adp = mapping->m_dst_ad;
442 rwm_int_filter_map_rewrite(
445 struct berval *fstr )
453 /* better than nothing... */
454 ber_bvfalse = BER_BVC( "(!(objectClass=*))" ),
455 ber_bvtf_false = BER_BVC( "(|)" ),
456 /* better than nothing... */
457 ber_bvtrue = BER_BVC( "(objectClass=*)" ),
458 ber_bvtf_true = BER_BVC( "(&)" ),
459 ber_bvundefined = BER_BVC( "(?=undefined)" ),
460 ber_bverror = BER_BVC( "(?=error)" ),
461 ber_bvunknown = BER_BVC( "(?=unknown)" ),
462 ber_bvnone = BER_BVC( "(?=none)" );
466 ber_dupbv( fstr, &ber_bvnone );
470 switch ( f->f_choice ) {
471 case LDAP_FILTER_EQUALITY:
472 if ( map_attr_value( dc, &f->f_av_desc, &atmp,
473 &f->f_av_value, &vtmp, RWM_MAP ) )
478 fstr->bv_len = atmp.bv_len + vtmp.bv_len + STRLENOF( "(=)" );
479 fstr->bv_val = ch_malloc( fstr->bv_len + 1 );
481 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s=%s)",
482 atmp.bv_val, vtmp.bv_val );
484 ch_free( vtmp.bv_val );
488 if ( map_attr_value( dc, &f->f_av_desc, &atmp,
489 &f->f_av_value, &vtmp, RWM_MAP ) )
494 fstr->bv_len = atmp.bv_len + vtmp.bv_len + STRLENOF( "(>=)" );
495 fstr->bv_val = ch_malloc( fstr->bv_len + 1 );
497 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s>=%s)",
498 atmp.bv_val, vtmp.bv_val );
500 ch_free( vtmp.bv_val );
504 if ( map_attr_value( dc, &f->f_av_desc, &atmp,
505 &f->f_av_value, &vtmp, RWM_MAP ) )
510 fstr->bv_len = atmp.bv_len + vtmp.bv_len + STRLENOF( "(<=)" );
511 fstr->bv_val = ch_malloc( fstr->bv_len + 1 );
513 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s<=%s)",
514 atmp.bv_val, vtmp.bv_val );
516 ch_free( vtmp.bv_val );
519 case LDAP_FILTER_APPROX:
520 if ( map_attr_value( dc, &f->f_av_desc, &atmp,
521 &f->f_av_value, &vtmp, RWM_MAP ) )
526 fstr->bv_len = atmp.bv_len + vtmp.bv_len + STRLENOF( "(~=)" );
527 fstr->bv_val = ch_malloc( fstr->bv_len + 1 );
529 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s~=%s)",
530 atmp.bv_val, vtmp.bv_val );
532 ch_free( vtmp.bv_val );
535 case LDAP_FILTER_SUBSTRINGS:
536 if ( map_attr_value( dc, &f->f_sub_desc, &atmp,
537 NULL, NULL, RWM_MAP ) )
542 /* cannot be a DN ... */
544 fstr->bv_len = atmp.bv_len + STRLENOF( "(=*)" );
545 fstr->bv_val = ch_malloc( fstr->bv_len + 128 );
547 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s=*)",
550 if ( !BER_BVISNULL( &f->f_sub_initial ) ) {
553 filter_escape_value( &f->f_sub_initial, &vtmp );
555 fstr->bv_len += vtmp.bv_len;
556 fstr->bv_val = ch_realloc( fstr->bv_val, fstr->bv_len + 1 );
558 snprintf( &fstr->bv_val[len - 2], vtmp.bv_len + 3,
559 /* "(attr=" */ "%s*)",
562 ch_free( vtmp.bv_val );
565 if ( f->f_sub_any != NULL ) {
566 for ( i = 0; !BER_BVISNULL( &f->f_sub_any[i] ); i++ ) {
568 filter_escape_value( &f->f_sub_any[i], &vtmp );
570 fstr->bv_len += vtmp.bv_len + 1;
571 fstr->bv_val = ch_realloc( fstr->bv_val, fstr->bv_len + 1 );
573 snprintf( &fstr->bv_val[len - 1], vtmp.bv_len + 3,
574 /* "(attr=[init]*[any*]" */ "%s*)",
576 ch_free( vtmp.bv_val );
580 if ( !BER_BVISNULL( &f->f_sub_final ) ) {
583 filter_escape_value( &f->f_sub_final, &vtmp );
585 fstr->bv_len += vtmp.bv_len;
586 fstr->bv_val = ch_realloc( fstr->bv_val, fstr->bv_len + 1 );
588 snprintf( &fstr->bv_val[len - 1], vtmp.bv_len + 3,
589 /* "(attr=[init*][any*]" */ "%s)",
592 ch_free( vtmp.bv_val );
597 case LDAP_FILTER_PRESENT:
598 if ( map_attr_value( dc, &f->f_desc, &atmp,
599 NULL, NULL, RWM_MAP ) )
604 fstr->bv_len = atmp.bv_len + STRLENOF( "(=*)" );
605 fstr->bv_val = ch_malloc( fstr->bv_len + 1 );
607 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s=*)",
611 case LDAP_FILTER_AND:
613 case LDAP_FILTER_NOT:
614 fstr->bv_len = STRLENOF( "(%)" );
615 fstr->bv_val = ch_malloc( fstr->bv_len + 128 );
617 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%c)",
618 f->f_choice == LDAP_FILTER_AND ? '&' :
619 f->f_choice == LDAP_FILTER_OR ? '|' : '!' );
621 for ( p = f->f_list; p != NULL; p = p->f_next ) {
624 if ( rwm_int_filter_map_rewrite( dc, p, &vtmp ) )
629 fstr->bv_len += vtmp.bv_len;
630 fstr->bv_val = ch_realloc( fstr->bv_val, fstr->bv_len + 1 );
632 snprintf( &fstr->bv_val[len-1], vtmp.bv_len + 2,
633 /*"("*/ "%s)", vtmp.bv_val );
635 ch_free( vtmp.bv_val );
640 case LDAP_FILTER_EXT: {
641 if ( f->f_mr_desc ) {
642 if ( map_attr_value( dc, &f->f_mr_desc, &atmp,
643 &f->f_mr_value, &vtmp, RWM_MAP ) )
649 BER_BVSTR( &atmp, "" );
650 filter_escape_value( &f->f_mr_value, &vtmp );
654 fstr->bv_len = atmp.bv_len +
655 ( f->f_mr_dnattrs ? STRLENOF( ":dn" ) : 0 ) +
656 ( f->f_mr_rule_text.bv_len ? f->f_mr_rule_text.bv_len + 1 : 0 ) +
657 vtmp.bv_len + STRLENOF( "(:=)" );
658 fstr->bv_val = ch_malloc( fstr->bv_len + 1 );
660 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s%s%s%s:=%s)",
662 f->f_mr_dnattrs ? ":dn" : "",
663 !BER_BVISEMPTY( &f->f_mr_rule_text ) ? ":" : "",
664 !BER_BVISEMPTY( &f->f_mr_rule_text ) ? f->f_mr_rule_text.bv_val : "",
666 ch_free( vtmp.bv_val );
670 case SLAPD_FILTER_COMPUTED:
671 switch ( f->f_result ) {
672 case LDAP_COMPARE_FALSE:
673 if ( dc->rwmap->rwm_flags & RWM_F_SUPPORT_T_F ) {
674 tmp = ber_bvtf_false;
679 case SLAPD_COMPARE_UNDEFINED:
683 case LDAP_COMPARE_TRUE:
684 if ( dc->rwmap->rwm_flags & RWM_F_SUPPORT_T_F ) {
696 ber_dupbv( fstr, &tmp );
700 ber_dupbv( fstr, &ber_bvunknown );
708 rwm_filter_map_rewrite(
711 struct berval *fstr )
717 rc = rwm_int_filter_map_rewrite( dc, f, fstr );
719 #ifdef ENABLE_REWRITE
720 if ( rc != LDAP_SUCCESS ) {
727 fdc.ctx = "searchFilter";
729 switch ( rewrite_session( fdc.rwmap->rwm_rw, fdc.ctx,
730 ( !BER_BVISEMPTY( &ftmp ) ? ftmp.bv_val : "" ),
731 fdc.conn, &fstr->bv_val ) )
733 case REWRITE_REGEXEC_OK:
734 if ( !BER_BVISNULL( fstr ) ) {
735 fstr->bv_len = strlen( fstr->bv_val );
736 ch_free( ftmp.bv_val );
742 Debug( LDAP_DEBUG_ARGS,
743 "[rw] %s: \"%s\" -> \"%s\"\n",
744 fdc.ctx, ftmp.bv_val, fstr->bv_val );
748 case REWRITE_REGEXEC_UNWILLING:
750 fdc.rs->sr_err = LDAP_UNWILLING_TO_PERFORM;
751 fdc.rs->sr_text = "Operation not allowed";
753 rc = LDAP_UNWILLING_TO_PERFORM;
756 case REWRITE_REGEXEC_ERR:
758 fdc.rs->sr_err = LDAP_OTHER;
759 fdc.rs->sr_text = "Rewrite error";
765 #endif /* ENABLE_REWRITE */
770 * I don't like this much, but we need two different
771 * functions because different heap managers may be
772 * in use in back-ldap/meta to reduce the amount of
773 * calls to malloc routines, and some of the free()
774 * routines may be macros with args
777 rwm_referral_rewrite(
782 BerVarray *pa_nvals )
784 slap_overinst *on = (slap_overinst *) op->o_bd->bd_info;
785 struct ldaprwmap *rwmap =
786 (struct ldaprwmap *)on->on_bi.bi_private;
791 struct berval dn = BER_BVNULL,
797 * Rewrite the dn if needed
800 #ifdef ENABLE_REWRITE
801 dc.conn = op->o_conn;
803 dc.ctx = (char *)cookie;
804 #else /* ! ENABLE_REWRITE */
805 dc.tofrom = ((int *)cookie)[0];
807 #endif /* ! ENABLE_REWRITE */
809 for ( last = 0; !BER_BVISNULL( &a_vals[last] ); last++ )
813 if ( pa_nvals != NULL ) {
814 if ( *pa_nvals == NULL ) {
815 *pa_nvals = ch_malloc( ( last + 2 ) * sizeof(struct berval) );
816 memset( *pa_nvals, 0, ( last + 2 ) * sizeof(struct berval) );
820 for ( i = 0; !BER_BVISNULL( &a_vals[i] ); i++ ) {
821 struct berval olddn = BER_BVNULL,
827 rc = ldap_url_parse( oldval.bv_val, &ludp );
828 if ( rc != LDAP_URL_SUCCESS ) {
829 /* leave attr untouched if massage failed */
830 if ( pa_nvals && BER_BVISNULL( &(*pa_nvals)[i] ) ) {
831 ber_dupbv( &(*pa_nvals)[i], &oldval );
836 /* FIXME: URLs like "ldap:///dc=suffix" if passed
837 * thru ldap_url_parse() and ldap_url_desc2str()
838 * get rewritten as "ldap:///dc=suffix??base";
839 * we don't want this to occur... */
840 if ( ludp->lud_scope == LDAP_SCOPE_BASE ) {
841 ludp->lud_scope = LDAP_SCOPE_DEFAULT;
844 ber_str2bv( ludp->lud_dn, 0, 0, &olddn );
849 rc = rwm_dn_massage_pretty_normalize( &dc, &olddn,
852 rc = rwm_dn_massage_pretty( &dc, &olddn, &dn );
856 case LDAP_UNWILLING_TO_PERFORM:
858 * FIXME: need to check if it may be considered
859 * legal to trim values when adding/modifying;
860 * it should be when searching (e.g. ACLs).
862 ch_free( a_vals[i].bv_val );
864 a_vals[i] = a_vals[last];
866 (*pa_nvals)[i] = (*pa_nvals)[last];
869 BER_BVZERO( &a_vals[last] );
871 BER_BVZERO( &(*pa_nvals)[last] );
877 if ( !BER_BVISNULL( &dn ) && dn.bv_val != olddn.bv_val ) {
880 ludp->lud_dn = dn.bv_val;
881 newurl = ldap_url_desc2str( ludp );
882 ludp->lud_dn = olddn.bv_val;
883 ch_free( dn.bv_val );
884 if ( newurl == NULL ) {
885 /* FIXME: leave attr untouched
886 * even if ldap_url_desc2str failed...
891 ber_str2bv( newurl, 0, 1, &a_vals[i] );
895 ludp->lud_dn = ndn.bv_val;
896 newurl = ldap_url_desc2str( ludp );
897 ludp->lud_dn = olddn.bv_val;
898 ch_free( ndn.bv_val );
899 if ( newurl == NULL ) {
900 /* FIXME: leave attr untouched
901 * even if ldap_url_desc2str failed...
903 ch_free( a_vals[i].bv_val );
908 if ( !BER_BVISNULL( &(*pa_nvals)[i] ) ) {
909 ch_free( (*pa_nvals)[i].bv_val );
911 ber_str2bv( newurl, 0, 1, &(*pa_nvals)[i] );
915 ch_free( oldval.bv_val );
916 ludp->lud_dn = olddn.bv_val;
921 /* leave attr untouched if massage failed */
922 if ( pa_nvals && BER_BVISNULL( &(*pa_nvals)[i] ) ) {
923 ber_dupbv( &(*pa_nvals)[i], &a_vals[i] );
927 ldap_free_urldesc( ludp );
934 * I don't like this much, but we need two different
935 * functions because different heap managers may be
936 * in use in back-ldap/meta to reduce the amount of
937 * calls to malloc routines, and some of the free()
938 * routines may be macros with args
946 BerVarray *pa_nvals )
948 slap_overinst *on = (slap_overinst *) op->o_bd->bd_info;
949 struct ldaprwmap *rwmap =
950 (struct ldaprwmap *)on->on_bi.bi_private;
955 struct berval dn = BER_BVNULL,
963 if ( pa_nvals == NULL || *pa_nvals == NULL ) {
970 * Rewrite the dn if needed
973 #ifdef ENABLE_REWRITE
974 dc.conn = op->o_conn;
976 dc.ctx = (char *)cookie;
977 #else /* ! ENABLE_REWRITE */
978 dc.tofrom = ((int *)cookie)[0];
980 #endif /* ! ENABLE_REWRITE */
982 for ( last = 0; !BER_BVISNULL( &in[last] ); last++ );
984 if ( pa_nvals != NULL ) {
985 if ( *pa_nvals == NULL ) {
986 *pa_nvals = ch_malloc( ( last + 2 ) * sizeof(struct berval) );
987 memset( *pa_nvals, 0, ( last + 2 ) * sizeof(struct berval) );
991 for ( i = 0; !BER_BVISNULL( &in[i] ); i++ ) {
997 ndn = (*pa_nvals)[i];
998 rc = rwm_dn_massage_pretty_normalize( &dc, &in[i], &dn, &ndn );
1000 rc = rwm_dn_massage_pretty( &dc, &in[i], &dn );
1004 rc = rwm_dn_massage_normalize( &dc, &in[i], &ndn );
1008 case LDAP_UNWILLING_TO_PERFORM:
1010 * FIXME: need to check if it may be considered
1011 * legal to trim values when adding/modifying;
1012 * it should be when searching (e.g. ACLs).
1014 ch_free( in[i].bv_val );
1017 if ( a_vals && pa_nvals ) {
1018 (*pa_nvals)[i] = (*pa_nvals)[last];
1021 BER_BVZERO( &in[last] );
1022 if ( a_vals && pa_nvals ) {
1023 BER_BVZERO( &(*pa_nvals)[last] );
1030 if ( !BER_BVISNULL( &dn ) && dn.bv_val != a_vals[i].bv_val ) {
1031 ch_free( a_vals[i].bv_val );
1035 if ( !BER_BVISNULL( &(*pa_nvals)[i] ) ) {
1036 ch_free( (*pa_nvals)[i].bv_val );
1038 (*pa_nvals)[i] = ndn;
1043 if ( !BER_BVISNULL( &ndn ) && ndn.bv_val != (*pa_nvals)[i].bv_val ) {
1044 ch_free( (*pa_nvals)[i].bv_val );
1045 (*pa_nvals)[i] = ndn;
1051 /* leave attr untouched if massage failed */
1052 if ( a_vals && pa_nvals && BER_BVISNULL( &(*pa_nvals)[i] ) ) {
1053 dnNormalize( 0, NULL, NULL, &a_vals[i], &(*pa_nvals)[i], NULL );
1063 rwm_referral_result_rewrite(
1070 for ( last = 0; !BER_BVISNULL( &a_vals[last] ); last++ );
1073 for ( i = 0; !BER_BVISNULL( &a_vals[i] ); i++ ) {
1079 rc = ldap_url_parse( a_vals[i].bv_val, &ludp );
1080 if ( rc != LDAP_URL_SUCCESS ) {
1081 /* leave attr untouched if massage failed */
1085 /* FIXME: URLs like "ldap:///dc=suffix" if passed
1086 * thru ldap_url_parse() and ldap_url_desc2str()
1087 * get rewritten as "ldap:///dc=suffix??base";
1088 * we don't want this to occur... */
1089 if ( ludp->lud_scope == LDAP_SCOPE_BASE ) {
1090 ludp->lud_scope = LDAP_SCOPE_DEFAULT;
1093 ber_str2bv( ludp->lud_dn, 0, 0, &olddn );
1096 rc = rwm_dn_massage_pretty( dc, &olddn, &dn );
1098 case LDAP_UNWILLING_TO_PERFORM:
1100 * FIXME: need to check if it may be considered
1101 * legal to trim values when adding/modifying;
1102 * it should be when searching (e.g. ACLs).
1104 ch_free( a_vals[i].bv_val );
1106 a_vals[i] = a_vals[last];
1108 BER_BVZERO( &a_vals[last] );
1114 /* leave attr untouched if massage failed */
1115 if ( !BER_BVISNULL( &dn ) && olddn.bv_val != dn.bv_val ) {
1118 ludp->lud_dn = dn.bv_val;
1119 newurl = ldap_url_desc2str( ludp );
1120 if ( newurl == NULL ) {
1121 /* FIXME: leave attr untouched
1122 * even if ldap_url_desc2str failed...
1127 ch_free( a_vals[i].bv_val );
1128 ber_str2bv( newurl, 0, 1, &a_vals[i] );
1129 LDAP_FREE( newurl );
1130 ludp->lud_dn = olddn.bv_val;
1135 ldap_free_urldesc( ludp );
1142 rwm_dnattr_result_rewrite(
1149 for ( last = 0; !BER_BVISNULL( &a_vals[last] ); last++ );
1152 for ( i = 0; !BER_BVISNULL( &a_vals[i] ); i++ ) {
1157 rc = rwm_dn_massage_pretty( dc, &a_vals[i], &dn );
1159 case LDAP_UNWILLING_TO_PERFORM:
1161 * FIXME: need to check if it may be considered
1162 * legal to trim values when adding/modifying;
1163 * it should be when searching (e.g. ACLs).
1165 ch_free( a_vals[i].bv_val );
1167 a_vals[i] = a_vals[last];
1169 BER_BVZERO( &a_vals[last] );
1174 /* leave attr untouched if massage failed */
1175 if ( !BER_BVISNULL( &dn ) && a_vals[i].bv_val != dn.bv_val ) {
1176 ch_free( a_vals[i].bv_val );
1187 rwm_mapping_free( void *v_mapping )
1189 struct ldapmapping *mapping = v_mapping;
1191 if ( !BER_BVISNULL( &mapping[0].m_src ) ) {
1192 ch_free( mapping[0].m_src.bv_val );
1195 if ( mapping[0].m_flags & RWMMAP_F_FREE_SRC ) {
1196 if ( mapping[0].m_flags & RWMMAP_F_IS_OC ) {
1197 if ( mapping[0].m_src_oc ) {
1198 ch_free( mapping[0].m_src_oc );
1202 if ( mapping[0].m_src_ad ) {
1203 ch_free( mapping[0].m_src_ad );
1208 if ( !BER_BVISNULL( &mapping[0].m_dst ) ) {
1209 ch_free( mapping[0].m_dst.bv_val );
1212 if ( mapping[0].m_flags & RWMMAP_F_FREE_DST ) {
1213 if ( mapping[0].m_flags & RWMMAP_F_IS_OC ) {
1214 if ( mapping[0].m_dst_oc ) {
1215 ch_free( mapping[0].m_dst_oc );
1219 if ( mapping[0].m_dst_ad ) {
1220 ch_free( mapping[0].m_dst_ad );
1229 #endif /* SLAPD_OVER_RWM */