1 /* rwmmap.c - rewrite/mapping routines */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 1999-2006 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 ) {
90 mapping[0].m_dst_ad = mapping[0].m_src_ad;
91 ber_dupbv( &mapping[0].m_src, &mapping[0].m_src_ad->ad_cname );
92 ber_dupbv( &mapping[0].m_dst, &mapping[0].m_src );
94 mapping[1].m_src = mapping[0].m_src;
95 mapping[1].m_dst = mapping[0].m_dst;
96 mapping[1].m_src_ad = mapping[0].m_src_ad;
97 mapping[1].m_dst_ad = mapping[1].m_src_ad;
99 avl_insert( &lm->map, (caddr_t)&mapping[0],
100 rwm_mapping_cmp, rwm_mapping_dup );
101 avl_insert( &lm->remap, (caddr_t)&mapping[1],
102 rwm_mapping_cmp, rwm_mapping_dup );
110 rwm_mapping( struct ldapmap *map, struct berval *s, struct ldapmapping **m, int remap )
113 struct ldapmapping fmapping;
117 if ( remap == RWM_REMAP ) {
125 *m = (struct ldapmapping *)avl_find( tree, (caddr_t)&fmapping,
129 return map->drop_missing;
136 rwm_map( struct ldapmap *map, struct berval *s, struct berval *bv, int remap )
138 struct ldapmapping *mapping;
141 ( void )rwm_mapping( map, s, &mapping, remap );
142 if ( mapping != NULL ) {
143 if ( !BER_BVISNULL( &mapping->m_dst ) ) {
144 *bv = mapping->m_dst;
149 if ( !map->drop_missing ) {
155 * Map attribute names in place
159 struct ldapmap *at_map,
160 struct ldapmap *oc_map,
168 assert( anp != NULL );
176 for ( i = 0; !BER_BVISNULL( &an[i].an_name ); i++ )
178 *anp = ch_malloc( ( i + 1 )* sizeof( AttributeName ) );
179 if ( *anp == NULL ) {
180 return LDAP_NO_MEMORY;
183 for ( i = 0, j = 0; !BER_BVISNULL( &an[i].an_name ); i++ ) {
184 struct ldapmapping *m;
185 int at_drop_missing = 0,
188 if ( an[i].an_desc ) {
190 /* FIXME: better leave as is? */
194 at_drop_missing = rwm_mapping( at_map, &an[i].an_name, &m, remap );
195 if ( at_drop_missing || ( m && BER_BVISNULL( &m->m_dst ) ) ) {
206 if ( remap == RWM_MAP ) {
207 (*anp)[j].an_name = m->m_dst;
208 (*anp)[j].an_desc = m->m_dst_ad;
210 (*anp)[j].an_name = m->m_src;
211 (*anp)[j].an_desc = m->m_src_ad;
218 } else if ( an[i].an_oc ) {
220 /* FIXME: better leave as is? */
224 oc_drop_missing = rwm_mapping( oc_map, &an[i].an_name, &m, remap );
226 if ( oc_drop_missing || ( m && BER_BVISNULL( &m->m_dst ) ) ) {
237 if ( remap == RWM_MAP ) {
238 (*anp)[j].an_name = m->m_dst;
239 (*anp)[j].an_oc = m->m_dst_oc;
241 (*anp)[j].an_name = m->m_src;
242 (*anp)[j].an_oc = m->m_src_oc;
246 at_drop_missing = rwm_mapping( at_map, &an[i].an_name, &m, remap );
248 if ( at_drop_missing || !m ) {
250 oc_drop_missing = rwm_mapping( oc_map, &an[i].an_name, &m, remap );
252 /* if both at_map and oc_map required to drop missing,
254 if ( oc_drop_missing && at_drop_missing ) {
258 /* if no oc_map mapping was found and at_map required
259 * to drop missing, then do it; otherwise, at_map wins
260 * and an is considered an attr and is left unchanged */
262 if ( at_drop_missing ) {
270 if ( BER_BVISNULL( &m->m_dst ) ) {
275 if ( remap == RWM_MAP ) {
276 (*anp)[j].an_name = m->m_dst;
277 (*anp)[j].an_oc = m->m_dst_oc;
279 (*anp)[j].an_name = m->m_src;
280 (*anp)[j].an_oc = m->m_src_oc;
286 if ( !BER_BVISNULL( &m->m_dst ) ) {
288 if ( remap == RWM_MAP ) {
289 (*anp)[j].an_name = m->m_dst;
290 (*anp)[j].an_desc = m->m_dst_ad;
292 (*anp)[j].an_name = m->m_src;
293 (*anp)[j].an_desc = m->m_src_ad;
301 if ( j == 0 && i != 0 ) {
302 memset( &(*anp)[0], 0, sizeof( AttributeName ) );
303 BER_BVSTR( &(*anp)[0].an_name, LDAP_NO_ATTRS );
305 memset( &(*anp)[j], 0, sizeof( AttributeName ) );
312 struct ldapmap *at_map,
322 *mapped_attrs = NULL;
326 for ( i = 0; !BER_BVISNULL( &an[ i ].an_name ); i++ ) {
330 na = (char **)ch_calloc( i + 1, sizeof( char * ) );
332 *mapped_attrs = NULL;
333 return LDAP_NO_MEMORY;
336 for ( i = j = 0; !BER_BVISNULL( &an[i].an_name ); i++ ) {
337 struct ldapmapping *mapping;
339 if ( rwm_mapping( at_map, &an[i].an_name, &mapping, remap ) ) {
344 na[ j++ ] = an[ i ].an_name.bv_val;
346 } else if ( !BER_BVISNULL( &mapping->m_dst ) ) {
347 na[ j++ ] = mapping->m_dst.bv_val;
351 if ( j == 0 && i != 0 ) {
352 na[ j++ ] = LDAP_NO_ATTRS;
365 AttributeDescription **adp,
366 struct berval *mapped_attr,
367 struct berval *value,
368 struct berval *mapped_value,
371 struct berval vtmp = BER_BVNULL;
373 AttributeDescription *ad = *adp;
374 struct ldapmapping *mapping = NULL;
376 rwm_mapping( &dc->rwmap->rwm_at, &ad->ad_cname, &mapping, remap );
377 if ( mapping == NULL ) {
378 if ( dc->rwmap->rwm_at.drop_missing ) {
382 *mapped_attr = ad->ad_cname;
385 *mapped_attr = mapping->m_dst;
388 if ( value != NULL ) {
389 assert( mapped_value != NULL );
391 if ( ad->ad_type->sat_syntax == slap_schema.si_syn_distinguishedName
392 || ( mapping != NULL && mapping->m_dst_ad->ad_type->sat_syntax == slap_schema.si_syn_distinguishedName ) )
397 #ifdef ENABLE_REWRITE
398 fdc.ctx = "searchFilterAttrDN";
399 #endif /* ENABLE_REWRITE */
402 rc = rwm_dn_massage_normalize( &fdc, value, &vtmp );
405 if ( vtmp.bv_val != value->bv_val ) {
410 case LDAP_UNWILLING_TO_PERFORM:
416 } else if ( ad == slap_schema.si_ad_objectClass
417 || ad == slap_schema.si_ad_structuralObjectClass )
419 rwm_map( &dc->rwmap->rwm_oc, value, &vtmp, remap );
420 if ( BER_BVISNULL( &vtmp ) || BER_BVISEMPTY( &vtmp ) ) {
428 filter_escape_value( &vtmp, mapped_value );
431 ch_free( vtmp.bv_val );
435 if ( mapping != NULL ) {
436 assert( mapping->m_dst_ad != NULL );
437 *adp = mapping->m_dst_ad;
444 rwm_int_filter_map_rewrite(
448 struct berval *fstr )
456 /* better than nothing... */
457 ber_bvfalse = BER_BVC( "(!(objectClass=*))" ),
458 ber_bvtf_false = BER_BVC( "(|)" ),
459 /* better than nothing... */
460 ber_bvtrue = BER_BVC( "(objectClass=*)" ),
461 ber_bvtf_true = BER_BVC( "(&)" ),
463 /* no longer needed; preserved for completeness */
464 ber_bvundefined = BER_BVC( "(?=undefined)" ),
466 ber_bverror = BER_BVC( "(?=error)" ),
467 ber_bvunknown = BER_BVC( "(?=unknown)" ),
468 ber_bvnone = BER_BVC( "(?=none)" );
472 ber_dupbv( fstr, &ber_bvnone );
476 switch ( f->f_choice ) {
477 case LDAP_FILTER_EQUALITY:
478 if ( map_attr_value( dc, &f->f_av_desc, &atmp,
479 &f->f_av_value, &vtmp, RWM_MAP ) )
484 fstr->bv_len = atmp.bv_len + vtmp.bv_len + STRLENOF( "(=)" );
485 fstr->bv_val = ch_malloc( fstr->bv_len + 1 );
487 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s=%s)",
488 atmp.bv_val, vtmp.bv_val );
490 ch_free( vtmp.bv_val );
494 if ( map_attr_value( dc, &f->f_av_desc, &atmp,
495 &f->f_av_value, &vtmp, RWM_MAP ) )
500 fstr->bv_len = atmp.bv_len + vtmp.bv_len + STRLENOF( "(>=)" );
501 fstr->bv_val = ch_malloc( fstr->bv_len + 1 );
503 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s>=%s)",
504 atmp.bv_val, vtmp.bv_val );
506 ch_free( vtmp.bv_val );
510 if ( map_attr_value( dc, &f->f_av_desc, &atmp,
511 &f->f_av_value, &vtmp, RWM_MAP ) )
516 fstr->bv_len = atmp.bv_len + vtmp.bv_len + STRLENOF( "(<=)" );
517 fstr->bv_val = ch_malloc( fstr->bv_len + 1 );
519 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s<=%s)",
520 atmp.bv_val, vtmp.bv_val );
522 ch_free( vtmp.bv_val );
525 case LDAP_FILTER_APPROX:
526 if ( map_attr_value( dc, &f->f_av_desc, &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_SUBSTRINGS:
542 if ( map_attr_value( dc, &f->f_sub_desc, &atmp,
543 NULL, NULL, RWM_MAP ) )
548 /* cannot be a DN ... */
550 fstr->bv_len = atmp.bv_len + STRLENOF( "(=*)" );
551 fstr->bv_val = ch_malloc( fstr->bv_len + 128 );
553 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s=*)",
556 if ( !BER_BVISNULL( &f->f_sub_initial ) ) {
559 filter_escape_value( &f->f_sub_initial, &vtmp );
561 fstr->bv_len += vtmp.bv_len;
562 fstr->bv_val = ch_realloc( fstr->bv_val, fstr->bv_len + 1 );
564 snprintf( &fstr->bv_val[len - 2], vtmp.bv_len + 3,
565 /* "(attr=" */ "%s*)",
568 ch_free( vtmp.bv_val );
571 if ( f->f_sub_any != NULL ) {
572 for ( i = 0; !BER_BVISNULL( &f->f_sub_any[i] ); i++ ) {
574 filter_escape_value( &f->f_sub_any[i], &vtmp );
576 fstr->bv_len += vtmp.bv_len + 1;
577 fstr->bv_val = ch_realloc( fstr->bv_val, fstr->bv_len + 1 );
579 snprintf( &fstr->bv_val[len - 1], vtmp.bv_len + 3,
580 /* "(attr=[init]*[any*]" */ "%s*)",
582 ch_free( vtmp.bv_val );
586 if ( !BER_BVISNULL( &f->f_sub_final ) ) {
589 filter_escape_value( &f->f_sub_final, &vtmp );
591 fstr->bv_len += vtmp.bv_len;
592 fstr->bv_val = ch_realloc( fstr->bv_val, fstr->bv_len + 1 );
594 snprintf( &fstr->bv_val[len - 1], vtmp.bv_len + 3,
595 /* "(attr=[init*][any*]" */ "%s)",
598 ch_free( vtmp.bv_val );
603 case LDAP_FILTER_PRESENT:
604 if ( map_attr_value( dc, &f->f_desc, &atmp,
605 NULL, NULL, RWM_MAP ) )
610 fstr->bv_len = atmp.bv_len + STRLENOF( "(=*)" );
611 fstr->bv_val = ch_malloc( fstr->bv_len + 1 );
613 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s=*)",
617 case LDAP_FILTER_AND:
619 case LDAP_FILTER_NOT:
620 fstr->bv_len = STRLENOF( "(%)" );
621 fstr->bv_val = ch_malloc( fstr->bv_len + 128 );
623 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%c)",
624 f->f_choice == LDAP_FILTER_AND ? '&' :
625 f->f_choice == LDAP_FILTER_OR ? '|' : '!' );
627 for ( p = f->f_list; p != NULL; p = p->f_next ) {
632 rc = rwm_int_filter_map_rewrite( op, dc, p, &vtmp );
633 if ( rc != LDAP_SUCCESS ) {
637 fstr->bv_len += vtmp.bv_len;
638 fstr->bv_val = ch_realloc( fstr->bv_val, fstr->bv_len + 1 );
640 snprintf( &fstr->bv_val[len-1], vtmp.bv_len + 2,
641 /*"("*/ "%s)", vtmp.bv_val );
643 ch_free( vtmp.bv_val );
648 case LDAP_FILTER_EXT: {
649 if ( f->f_mr_desc ) {
650 if ( map_attr_value( dc, &f->f_mr_desc, &atmp,
651 &f->f_mr_value, &vtmp, RWM_MAP ) )
657 BER_BVSTR( &atmp, "" );
658 filter_escape_value( &f->f_mr_value, &vtmp );
662 fstr->bv_len = atmp.bv_len +
663 ( f->f_mr_dnattrs ? STRLENOF( ":dn" ) : 0 ) +
664 ( f->f_mr_rule_text.bv_len ? f->f_mr_rule_text.bv_len + 1 : 0 ) +
665 vtmp.bv_len + STRLENOF( "(:=)" );
666 fstr->bv_val = ch_malloc( fstr->bv_len + 1 );
668 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s%s%s%s:=%s)",
670 f->f_mr_dnattrs ? ":dn" : "",
671 !BER_BVISEMPTY( &f->f_mr_rule_text ) ? ":" : "",
672 !BER_BVISEMPTY( &f->f_mr_rule_text ) ? f->f_mr_rule_text.bv_val : "",
674 ch_free( vtmp.bv_val );
680 filter_free_x( op, f );
681 f->f_choice = SLAPD_FILTER_COMPUTED;
682 f->f_result = SLAPD_COMPARE_UNDEFINED;
685 case SLAPD_FILTER_COMPUTED:
686 switch ( f->f_result ) {
687 case LDAP_COMPARE_FALSE:
688 /* FIXME: treat UNDEFINED as FALSE */
689 case SLAPD_COMPARE_UNDEFINED:
690 if ( dc->rwmap->rwm_flags & RWM_F_SUPPORT_T_F ) {
691 tmp = &ber_bvtf_false;
697 case LDAP_COMPARE_TRUE:
698 if ( dc->rwmap->rwm_flags & RWM_F_SUPPORT_T_F ) {
699 tmp = &ber_bvtf_true;
710 ber_dupbv( fstr, tmp );
714 ber_dupbv( fstr, &ber_bvunknown );
722 rwm_filter_map_rewrite(
726 struct berval *fstr )
732 rc = rwm_int_filter_map_rewrite( op, dc, f, fstr );
734 #ifdef ENABLE_REWRITE
742 fdc.ctx = "searchFilter";
744 switch ( rewrite_session( fdc.rwmap->rwm_rw, fdc.ctx,
745 ( !BER_BVISEMPTY( &ftmp ) ? ftmp.bv_val : "" ),
746 fdc.conn, &fstr->bv_val ) )
748 case REWRITE_REGEXEC_OK:
749 if ( !BER_BVISNULL( fstr ) ) {
750 fstr->bv_len = strlen( fstr->bv_val );
751 ch_free( ftmp.bv_val );
757 Debug( LDAP_DEBUG_ARGS,
758 "[rw] %s: \"%s\" -> \"%s\"\n",
759 fdc.ctx, ftmp.bv_val, fstr->bv_val );
763 case REWRITE_REGEXEC_UNWILLING:
765 fdc.rs->sr_err = LDAP_UNWILLING_TO_PERFORM;
766 fdc.rs->sr_text = "Operation not allowed";
768 rc = LDAP_UNWILLING_TO_PERFORM;
771 case REWRITE_REGEXEC_ERR:
773 fdc.rs->sr_err = LDAP_OTHER;
774 fdc.rs->sr_text = "Rewrite error";
779 #endif /* ENABLE_REWRITE */
785 * I don't like this much, but we need two different
786 * functions because different heap managers may be
787 * in use in back-ldap/meta to reduce the amount of
788 * calls to malloc routines, and some of the free()
789 * routines may be macros with args
792 rwm_referral_rewrite(
797 BerVarray *pa_nvals )
799 slap_overinst *on = (slap_overinst *) op->o_bd->bd_info;
800 struct ldaprwmap *rwmap =
801 (struct ldaprwmap *)on->on_bi.bi_private;
806 struct berval dn = BER_BVNULL,
809 assert( a_vals != NULL );
812 * Rewrite the dn if needed
815 #ifdef ENABLE_REWRITE
816 dc.conn = op->o_conn;
818 dc.ctx = (char *)cookie;
819 #else /* ! ENABLE_REWRITE */
820 dc.tofrom = ((int *)cookie)[0];
822 #endif /* ! ENABLE_REWRITE */
824 for ( last = 0; !BER_BVISNULL( &a_vals[last] ); last++ )
828 if ( pa_nvals != NULL ) {
829 if ( *pa_nvals == NULL ) {
830 *pa_nvals = ch_malloc( ( last + 2 ) * sizeof(struct berval) );
831 memset( *pa_nvals, 0, ( last + 2 ) * sizeof(struct berval) );
835 for ( i = 0; !BER_BVISNULL( &a_vals[i] ); i++ ) {
836 struct berval olddn = BER_BVNULL,
842 rc = ldap_url_parse( oldval.bv_val, &ludp );
843 if ( rc != LDAP_URL_SUCCESS ) {
844 /* leave attr untouched if massage failed */
845 if ( pa_nvals && BER_BVISNULL( &(*pa_nvals)[i] ) ) {
846 ber_dupbv( &(*pa_nvals)[i], &oldval );
851 /* FIXME: URLs like "ldap:///dc=suffix" if passed
852 * thru ldap_url_parse() and ldap_url_desc2str()
853 * get rewritten as "ldap:///dc=suffix??base";
854 * we don't want this to occur... */
855 if ( ludp->lud_scope == LDAP_SCOPE_BASE ) {
856 ludp->lud_scope = LDAP_SCOPE_DEFAULT;
859 ber_str2bv( ludp->lud_dn, 0, 0, &olddn );
864 rc = rwm_dn_massage_pretty_normalize( &dc, &olddn,
867 rc = rwm_dn_massage_pretty( &dc, &olddn, &dn );
871 case LDAP_UNWILLING_TO_PERFORM:
873 * FIXME: need to check if it may be considered
874 * legal to trim values when adding/modifying;
875 * it should be when searching (e.g. ACLs).
877 ch_free( a_vals[i].bv_val );
879 a_vals[i] = a_vals[last];
881 (*pa_nvals)[i] = (*pa_nvals)[last];
884 BER_BVZERO( &a_vals[last] );
886 BER_BVZERO( &(*pa_nvals)[last] );
892 if ( !BER_BVISNULL( &dn ) && dn.bv_val != olddn.bv_val ) {
895 ludp->lud_dn = dn.bv_val;
896 newurl = ldap_url_desc2str( ludp );
897 ludp->lud_dn = olddn.bv_val;
898 ch_free( dn.bv_val );
899 if ( newurl == NULL ) {
900 /* FIXME: leave attr untouched
901 * even if ldap_url_desc2str failed...
906 ber_str2bv( newurl, 0, 1, &a_vals[i] );
910 ludp->lud_dn = ndn.bv_val;
911 newurl = ldap_url_desc2str( ludp );
912 ludp->lud_dn = olddn.bv_val;
913 ch_free( ndn.bv_val );
914 if ( newurl == NULL ) {
915 /* FIXME: leave attr untouched
916 * even if ldap_url_desc2str failed...
918 ch_free( a_vals[i].bv_val );
923 if ( !BER_BVISNULL( &(*pa_nvals)[i] ) ) {
924 ch_free( (*pa_nvals)[i].bv_val );
926 ber_str2bv( newurl, 0, 1, &(*pa_nvals)[i] );
930 ch_free( oldval.bv_val );
931 ludp->lud_dn = olddn.bv_val;
936 /* leave attr untouched if massage failed */
937 if ( pa_nvals && BER_BVISNULL( &(*pa_nvals)[i] ) ) {
938 ber_dupbv( &(*pa_nvals)[i], &a_vals[i] );
942 ldap_free_urldesc( ludp );
949 * I don't like this much, but we need two different
950 * functions because different heap managers may be
951 * in use in back-ldap/meta to reduce the amount of
952 * calls to malloc routines, and some of the free()
953 * routines may be macros with args
961 BerVarray *pa_nvals )
963 slap_overinst *on = (slap_overinst *) op->o_bd->bd_info;
964 struct ldaprwmap *rwmap =
965 (struct ldaprwmap *)on->on_bi.bi_private;
970 struct berval dn = BER_BVNULL,
978 if ( pa_nvals == NULL || *pa_nvals == NULL ) {
985 * Rewrite the dn if needed
988 #ifdef ENABLE_REWRITE
989 dc.conn = op->o_conn;
991 dc.ctx = (char *)cookie;
992 #else /* ! ENABLE_REWRITE */
993 dc.tofrom = ((int *)cookie)[0];
995 #endif /* ! ENABLE_REWRITE */
997 for ( last = 0; !BER_BVISNULL( &in[last] ); last++ );
999 if ( pa_nvals != NULL ) {
1000 if ( *pa_nvals == NULL ) {
1001 *pa_nvals = ch_malloc( ( last + 2 ) * sizeof(struct berval) );
1002 memset( *pa_nvals, 0, ( last + 2 ) * sizeof(struct berval) );
1006 for ( i = 0; !BER_BVISNULL( &in[i] ); i++ ) {
1012 ndn = (*pa_nvals)[i];
1013 rc = rwm_dn_massage_pretty_normalize( &dc, &in[i], &dn, &ndn );
1015 rc = rwm_dn_massage_pretty( &dc, &in[i], &dn );
1019 rc = rwm_dn_massage_normalize( &dc, &in[i], &ndn );
1023 case LDAP_UNWILLING_TO_PERFORM:
1025 * FIXME: need to check if it may be considered
1026 * legal to trim values when adding/modifying;
1027 * it should be when searching (e.g. ACLs).
1029 ch_free( in[i].bv_val );
1032 if ( a_vals && pa_nvals ) {
1033 (*pa_nvals)[i] = (*pa_nvals)[last];
1036 BER_BVZERO( &in[last] );
1037 if ( a_vals && pa_nvals ) {
1038 BER_BVZERO( &(*pa_nvals)[last] );
1045 if ( !BER_BVISNULL( &dn ) && dn.bv_val != a_vals[i].bv_val ) {
1046 ch_free( a_vals[i].bv_val );
1050 if ( !BER_BVISNULL( &(*pa_nvals)[i] ) ) {
1051 ch_free( (*pa_nvals)[i].bv_val );
1053 (*pa_nvals)[i] = ndn;
1058 if ( !BER_BVISNULL( &ndn ) && ndn.bv_val != (*pa_nvals)[i].bv_val ) {
1059 ch_free( (*pa_nvals)[i].bv_val );
1060 (*pa_nvals)[i] = ndn;
1066 /* leave attr untouched if massage failed */
1067 if ( a_vals && pa_nvals && BER_BVISNULL( &(*pa_nvals)[i] ) ) {
1068 dnNormalize( 0, NULL, NULL, &a_vals[i], &(*pa_nvals)[i], NULL );
1078 rwm_referral_result_rewrite(
1085 for ( last = 0; !BER_BVISNULL( &a_vals[last] ); last++ );
1088 for ( i = 0; !BER_BVISNULL( &a_vals[i] ); i++ ) {
1094 rc = ldap_url_parse( a_vals[i].bv_val, &ludp );
1095 if ( rc != LDAP_URL_SUCCESS ) {
1096 /* leave attr untouched if massage failed */
1100 /* FIXME: URLs like "ldap:///dc=suffix" if passed
1101 * thru ldap_url_parse() and ldap_url_desc2str()
1102 * get rewritten as "ldap:///dc=suffix??base";
1103 * we don't want this to occur... */
1104 if ( ludp->lud_scope == LDAP_SCOPE_BASE ) {
1105 ludp->lud_scope = LDAP_SCOPE_DEFAULT;
1108 ber_str2bv( ludp->lud_dn, 0, 0, &olddn );
1111 rc = rwm_dn_massage_pretty( dc, &olddn, &dn );
1113 case LDAP_UNWILLING_TO_PERFORM:
1115 * FIXME: need to check if it may be considered
1116 * legal to trim values when adding/modifying;
1117 * it should be when searching (e.g. ACLs).
1119 ch_free( a_vals[i].bv_val );
1121 a_vals[i] = a_vals[last];
1123 BER_BVZERO( &a_vals[last] );
1129 /* leave attr untouched if massage failed */
1130 if ( !BER_BVISNULL( &dn ) && olddn.bv_val != dn.bv_val ) {
1133 ludp->lud_dn = dn.bv_val;
1134 newurl = ldap_url_desc2str( ludp );
1135 if ( newurl == NULL ) {
1136 /* FIXME: leave attr untouched
1137 * even if ldap_url_desc2str failed...
1142 ch_free( a_vals[i].bv_val );
1143 ber_str2bv( newurl, 0, 1, &a_vals[i] );
1144 LDAP_FREE( newurl );
1145 ludp->lud_dn = olddn.bv_val;
1150 ldap_free_urldesc( ludp );
1157 rwm_dnattr_result_rewrite(
1164 for ( last = 0; !BER_BVISNULL( &a_vals[last] ); last++ );
1167 for ( i = 0; !BER_BVISNULL( &a_vals[i] ); i++ ) {
1172 rc = rwm_dn_massage_pretty( dc, &a_vals[i], &dn );
1174 case LDAP_UNWILLING_TO_PERFORM:
1176 * FIXME: need to check if it may be considered
1177 * legal to trim values when adding/modifying;
1178 * it should be when searching (e.g. ACLs).
1180 ch_free( a_vals[i].bv_val );
1182 a_vals[i] = a_vals[last];
1184 BER_BVZERO( &a_vals[last] );
1189 /* leave attr untouched if massage failed */
1190 if ( !BER_BVISNULL( &dn ) && a_vals[i].bv_val != dn.bv_val ) {
1191 ch_free( a_vals[i].bv_val );
1202 rwm_mapping_dst_free( void *v_mapping )
1204 struct ldapmapping *mapping = v_mapping;
1206 if ( BER_BVISEMPTY( &mapping[0].m_dst ) ) {
1207 rwm_mapping_free( &mapping[ -1 ] );
1212 rwm_mapping_free( void *v_mapping )
1214 struct ldapmapping *mapping = v_mapping;
1216 if ( !BER_BVISNULL( &mapping[0].m_src ) ) {
1217 ch_free( mapping[0].m_src.bv_val );
1220 if ( mapping[0].m_flags & RWMMAP_F_FREE_SRC ) {
1221 if ( mapping[0].m_flags & RWMMAP_F_IS_OC ) {
1222 if ( mapping[0].m_src_oc ) {
1223 ch_free( mapping[0].m_src_oc );
1227 if ( mapping[0].m_src_ad ) {
1228 ch_free( mapping[0].m_src_ad );
1233 if ( !BER_BVISNULL( &mapping[0].m_dst ) ) {
1234 ch_free( mapping[0].m_dst.bv_val );
1237 if ( mapping[0].m_flags & RWMMAP_F_FREE_DST ) {
1238 if ( mapping[0].m_flags & RWMMAP_F_IS_OC ) {
1239 if ( mapping[0].m_dst_oc ) {
1240 ch_free( mapping[0].m_dst_oc );
1244 if ( mapping[0].m_dst_ad ) {
1245 ch_free( mapping[0].m_dst_ad );
1254 #endif /* SLAPD_OVER_RWM */