1 /* rwmmap.c - rewrite/mapping routines */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 1999-2015 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 /* NOTE: this is needed to make sure that
86 * does not filter out all attributes including objectClass */
87 rc = slap_str2ad( "objectClass", &mapping[0].m_src_ad, &text );
88 if ( rc != LDAP_SUCCESS ) {
93 mapping[0].m_dst_ad = mapping[0].m_src_ad;
94 ber_dupbv( &mapping[0].m_src, &mapping[0].m_src_ad->ad_cname );
95 ber_dupbv( &mapping[0].m_dst, &mapping[0].m_src );
97 mapping[1].m_src = mapping[0].m_src;
98 mapping[1].m_dst = mapping[0].m_dst;
99 mapping[1].m_src_ad = mapping[0].m_src_ad;
100 mapping[1].m_dst_ad = mapping[1].m_src_ad;
102 avl_insert( &lm->map, (caddr_t)&mapping[0],
103 rwm_mapping_cmp, rwm_mapping_dup );
104 avl_insert( &lm->remap, (caddr_t)&mapping[1],
105 rwm_mapping_cmp, rwm_mapping_dup );
113 rwm_mapping( struct ldapmap *map, struct berval *s, struct ldapmapping **m, int remap )
116 struct ldapmapping fmapping;
124 /* let special attrnames slip through (ITS#5760) */
125 if ( bvmatch( s, slap_bv_no_attrs )
126 || bvmatch( s, slap_bv_all_user_attrs )
127 || bvmatch( s, slap_bv_all_operational_attrs ) )
133 if ( remap == RWM_REMAP ) {
141 *m = (struct ldapmapping *)avl_find( tree, (caddr_t)&fmapping,
145 return map->drop_missing;
152 rwm_map( struct ldapmap *map, struct berval *s, struct berval *bv, int remap )
154 struct ldapmapping *mapping;
156 /* map->map may be NULL when mapping is configured,
157 * but map->remap can't */
158 if ( map->remap == NULL ) {
164 ( void )rwm_mapping( map, s, &mapping, remap );
165 if ( mapping != NULL ) {
166 if ( !BER_BVISNULL( &mapping->m_dst ) ) {
167 *bv = mapping->m_dst;
172 if ( !map->drop_missing ) {
178 * Map attribute names in place
183 struct ldapmap *at_map,
184 struct ldapmap *oc_map,
191 assert( anp != NULL );
195 if ( an == NULL && op->o_bd->be_extra_anlist == NULL ) {
201 for ( i = 0; !BER_BVISNULL( &an[i].an_name ); i++ )
206 if ( op->o_bd->be_extra_anlist ) {
207 for ( ; !BER_BVISNULL( &op->o_bd->be_extra_anlist[x].an_name ); x++ )
211 assert( i > 0 || x > 0 );
212 *anp = op->o_tmpcalloc( ( i + x + 1 ), sizeof( AttributeName ),
214 if ( *anp == NULL ) {
215 return LDAP_NO_MEMORY;
220 for ( i = 0; !BER_BVISNULL( &an[i].an_name ); i++ ) {
221 struct ldapmapping *m;
222 int at_drop_missing = 0,
225 if ( an[i].an_desc ) {
227 /* FIXME: better leave as is? */
231 at_drop_missing = rwm_mapping( at_map, &an[i].an_name, &m, remap );
232 if ( at_drop_missing || ( m && BER_BVISNULL( &m->m_dst ) ) ) {
243 if ( remap == RWM_MAP ) {
244 (*anp)[j].an_name = m->m_dst;
245 (*anp)[j].an_desc = m->m_dst_ad;
247 (*anp)[j].an_name = m->m_src;
248 (*anp)[j].an_desc = m->m_src_ad;
255 } else if ( an[i].an_oc ) {
257 /* FIXME: better leave as is? */
261 oc_drop_missing = rwm_mapping( oc_map, &an[i].an_name, &m, remap );
263 if ( oc_drop_missing || ( m && BER_BVISNULL( &m->m_dst ) ) ) {
274 if ( remap == RWM_MAP ) {
275 (*anp)[j].an_name = m->m_dst;
276 (*anp)[j].an_oc = m->m_dst_oc;
278 (*anp)[j].an_name = m->m_src;
279 (*anp)[j].an_oc = m->m_src_oc;
283 at_drop_missing = rwm_mapping( at_map, &an[i].an_name, &m, remap );
285 if ( at_drop_missing || !m ) {
286 oc_drop_missing = rwm_mapping( oc_map, &an[i].an_name, &m, remap );
288 /* if both at_map and oc_map required to drop missing,
290 if ( oc_drop_missing && at_drop_missing ) {
294 /* if no oc_map mapping was found and at_map required
295 * to drop missing, then do it; otherwise, at_map wins
296 * and an is considered an attr and is left unchanged */
298 if ( at_drop_missing ) {
306 if ( BER_BVISNULL( &m->m_dst ) ) {
311 if ( remap == RWM_MAP ) {
312 (*anp)[j].an_name = m->m_dst;
313 (*anp)[j].an_oc = m->m_dst_oc;
315 (*anp)[j].an_name = m->m_src;
316 (*anp)[j].an_oc = m->m_src_oc;
322 if ( !BER_BVISNULL( &m->m_dst ) ) {
324 if ( remap == RWM_MAP ) {
325 (*anp)[j].an_name = m->m_dst;
326 (*anp)[j].an_desc = m->m_dst_ad;
328 (*anp)[j].an_name = m->m_src;
329 (*anp)[j].an_desc = m->m_src_ad;
338 if ( op->o_bd->be_extra_anlist != NULL ) {
339 /* we assume be_extra_anlist are already mapped */
340 for ( x = 0; !BER_BVISNULL( &op->o_bd->be_extra_anlist[x].an_name ); x++ ) {
341 BER_BVZERO( &(*anp)[j].an_name );
342 if ( op->o_bd->be_extra_anlist[x].an_desc &&
343 ad_inlist( op->o_bd->be_extra_anlist[x].an_desc, *anp ) )
348 (*anp)[j] = op->o_bd->be_extra_anlist[x];
353 if ( j == 0 && ( i != 0 || x != 0 ) ) {
354 memset( &(*anp)[0], 0, sizeof( AttributeName ) );
355 (*anp)[0].an_name = *slap_bv_no_attrs;
358 memset( &(*anp)[j], 0, sizeof( AttributeName ) );
366 struct ldapmap *at_map,
369 char ***mapped_attrs )
375 *mapped_attrs = NULL;
379 for ( i = 0; !BER_BVISNULL( &an[ i ].an_name ); i++ )
382 na = (char **)ch_calloc( i + 1, sizeof( char * ) );
384 *mapped_attrs = NULL;
385 return LDAP_NO_MEMORY;
388 for ( i = j = 0; !BER_BVISNULL( &an[i].an_name ); i++ ) {
389 struct ldapmapping *mapping;
391 if ( rwm_mapping( at_map, &an[i].an_name, &mapping, remap ) ) {
396 na[ j++ ] = an[ i ].an_name.bv_val;
398 } else if ( !BER_BVISNULL( &mapping->m_dst ) ) {
399 na[ j++ ] = mapping->m_dst.bv_val;
403 if ( j == 0 && i != 0 ) {
404 na[ j++ ] = LDAP_NO_ATTRS;
418 AttributeDescription **adp,
419 struct berval *mapped_attr,
420 struct berval *value,
421 struct berval *mapped_value,
425 struct berval vtmp = BER_BVNULL;
427 AttributeDescription *ad = *adp;
428 struct ldapmapping *mapping = NULL;
430 rwm_mapping( &dc->rwmap->rwm_at, &ad->ad_cname, &mapping, remap );
431 if ( mapping == NULL ) {
432 if ( dc->rwmap->rwm_at.drop_missing ) {
436 *mapped_attr = ad->ad_cname;
439 *mapped_attr = mapping->m_dst;
442 if ( value != NULL ) {
443 assert( mapped_value != NULL );
445 if ( ad->ad_type->sat_syntax == slap_schema.si_syn_distinguishedName
446 || ( mapping != NULL && mapping->m_dst_ad->ad_type->sat_syntax == slap_schema.si_syn_distinguishedName ) )
451 fdc.ctx = "searchFilterAttrDN";
454 rc = rwm_dn_massage_normalize( &fdc, value, &vtmp );
457 if ( vtmp.bv_val != value->bv_val ) {
462 case LDAP_UNWILLING_TO_PERFORM:
468 } else if ( ad->ad_type->sat_equality &&
469 ( ad->ad_type->sat_equality->smr_usage & SLAP_MR_MUTATION_NORMALIZER ) )
471 if ( ad->ad_type->sat_equality->smr_normalize(
472 (SLAP_MR_DENORMALIZE|SLAP_MR_VALUE_OF_ASSERTION_SYNTAX),
473 NULL, NULL, value, &vtmp, memctx ) )
479 } else if ( ad == slap_schema.si_ad_objectClass
480 || ad == slap_schema.si_ad_structuralObjectClass )
482 rwm_map( &dc->rwmap->rwm_oc, value, &vtmp, remap );
483 if ( BER_BVISNULL( &vtmp ) || BER_BVISEMPTY( &vtmp ) ) {
491 filter_escape_value_x( &vtmp, mapped_value, memctx );
495 ch_free( vtmp.bv_val );
499 ber_memfree_x( vtmp.bv_val, memctx );
504 if ( mapping != NULL ) {
505 assert( mapping->m_dst_ad != NULL );
506 *adp = mapping->m_dst_ad;
513 rwm_int_filter_map_rewrite(
517 struct berval *fstr )
521 AttributeDescription *ad;
526 /* better than nothing... */
527 ber_bvfalse = BER_BVC( "(!(objectClass=*))" ),
528 ber_bvtf_false = BER_BVC( "(|)" ),
529 /* better than nothing... */
530 ber_bvtrue = BER_BVC( "(objectClass=*)" ),
531 ber_bvtf_true = BER_BVC( "(&)" ),
533 /* no longer needed; preserved for completeness */
534 ber_bvundefined = BER_BVC( "(?=undefined)" ),
536 ber_bverror = BER_BVC( "(?=error)" ),
537 ber_bvunknown = BER_BVC( "(?=unknown)" ),
538 ber_bvnone = BER_BVC( "(?=none)" );
541 assert( fstr != NULL );
545 ber_dupbv_x( fstr, &ber_bvnone, op->o_tmpmemctx );
550 /* ITS#6814: give the caller a chance to use undefined filters */
551 if ( f->f_choice & SLAPD_FILTER_UNDEFINED ) {
556 switch ( f->f_choice & SLAPD_FILTER_MASK ) {
557 case LDAP_FILTER_EQUALITY:
559 if ( map_attr_value( dc, &ad, &atmp,
560 &f->f_av_value, &vtmp, RWM_MAP, op->o_tmpmemctx ) )
565 fstr->bv_len = atmp.bv_len + vtmp.bv_len + STRLENOF( "(=)" );
566 fstr->bv_val = op->o_tmpalloc( fstr->bv_len + 1, op->o_tmpmemctx );
568 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s=%s)",
569 atmp.bv_val, vtmp.bv_len ? vtmp.bv_val : "" );
571 op->o_tmpfree( vtmp.bv_val, op->o_tmpmemctx );
576 if ( map_attr_value( dc, &ad, &atmp,
577 &f->f_av_value, &vtmp, RWM_MAP, op->o_tmpmemctx ) )
582 fstr->bv_len = atmp.bv_len + vtmp.bv_len + STRLENOF( "(>=)" );
583 fstr->bv_val = op->o_tmpalloc( fstr->bv_len + 1, op->o_tmpmemctx );
585 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s>=%s)",
586 atmp.bv_val, vtmp.bv_len ? vtmp.bv_val : "" );
588 op->o_tmpfree( vtmp.bv_val, op->o_tmpmemctx );
593 if ( map_attr_value( dc, &ad, &atmp,
594 &f->f_av_value, &vtmp, RWM_MAP, op->o_tmpmemctx ) )
599 fstr->bv_len = atmp.bv_len + vtmp.bv_len + STRLENOF( "(<=)" );
600 fstr->bv_val = op->o_tmpalloc( fstr->bv_len + 1, op->o_tmpmemctx );
602 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s<=%s)",
603 atmp.bv_val, vtmp.bv_len ? vtmp.bv_val : "" );
605 op->o_tmpfree( vtmp.bv_val, op->o_tmpmemctx );
608 case LDAP_FILTER_APPROX:
610 if ( map_attr_value( dc, &ad, &atmp,
611 &f->f_av_value, &vtmp, RWM_MAP, op->o_tmpmemctx ) )
616 fstr->bv_len = atmp.bv_len + vtmp.bv_len + STRLENOF( "(~=)" );
617 fstr->bv_val = op->o_tmpalloc( fstr->bv_len + 1, op->o_tmpmemctx );
619 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s~=%s)",
620 atmp.bv_val, vtmp.bv_len ? vtmp.bv_val : "" );
622 op->o_tmpfree( vtmp.bv_val, op->o_tmpmemctx );
625 case LDAP_FILTER_SUBSTRINGS:
627 if ( map_attr_value( dc, &ad, &atmp,
628 NULL, NULL, RWM_MAP, op->o_tmpmemctx ) )
633 /* cannot be a DN ... */
635 fstr->bv_len = atmp.bv_len + STRLENOF( "(=*)" );
636 fstr->bv_val = op->o_tmpalloc( fstr->bv_len + 128, op->o_tmpmemctx );
638 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s=*)",
641 if ( !BER_BVISNULL( &f->f_sub_initial ) ) {
644 filter_escape_value_x( &f->f_sub_initial, &vtmp, op->o_tmpmemctx );
646 fstr->bv_len += vtmp.bv_len;
647 fstr->bv_val = op->o_tmprealloc( fstr->bv_val, fstr->bv_len + 1,
650 snprintf( &fstr->bv_val[len - 2], vtmp.bv_len + 3,
651 /* "(attr=" */ "%s*)",
652 vtmp.bv_len ? vtmp.bv_val : "" );
654 op->o_tmpfree( vtmp.bv_val, op->o_tmpmemctx );
657 if ( f->f_sub_any != NULL ) {
658 for ( i = 0; !BER_BVISNULL( &f->f_sub_any[i] ); i++ ) {
660 filter_escape_value_x( &f->f_sub_any[i], &vtmp,
663 fstr->bv_len += vtmp.bv_len + 1;
664 fstr->bv_val = op->o_tmprealloc( fstr->bv_val, fstr->bv_len + 1,
667 snprintf( &fstr->bv_val[len - 1], vtmp.bv_len + 3,
668 /* "(attr=[init]*[any*]" */ "%s*)",
669 vtmp.bv_len ? vtmp.bv_val : "" );
670 op->o_tmpfree( vtmp.bv_val, op->o_tmpmemctx );
674 if ( !BER_BVISNULL( &f->f_sub_final ) ) {
677 filter_escape_value_x( &f->f_sub_final, &vtmp, op->o_tmpmemctx );
679 fstr->bv_len += vtmp.bv_len;
680 fstr->bv_val = op->o_tmprealloc( fstr->bv_val, fstr->bv_len + 1,
683 snprintf( &fstr->bv_val[len - 1], vtmp.bv_len + 3,
684 /* "(attr=[init*][any*]" */ "%s)",
685 vtmp.bv_len ? vtmp.bv_val : "" );
687 op->o_tmpfree( vtmp.bv_val, op->o_tmpmemctx );
692 case LDAP_FILTER_PRESENT:
694 if ( map_attr_value( dc, &ad, &atmp,
695 NULL, NULL, RWM_MAP, op->o_tmpmemctx ) )
700 fstr->bv_len = atmp.bv_len + STRLENOF( "(=*)" );
701 fstr->bv_val = op->o_tmpalloc( fstr->bv_len + 1, op->o_tmpmemctx );
703 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s=*)",
707 case LDAP_FILTER_AND:
709 case LDAP_FILTER_NOT:
710 fstr->bv_len = STRLENOF( "(%)" );
711 fstr->bv_val = op->o_tmpalloc( fstr->bv_len + 128, op->o_tmpmemctx );
713 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%c)",
714 f->f_choice == LDAP_FILTER_AND ? '&' :
715 f->f_choice == LDAP_FILTER_OR ? '|' : '!' );
717 for ( p = f->f_list; p != NULL; p = p->f_next ) {
722 rc = rwm_int_filter_map_rewrite( op, dc, p, &vtmp );
723 if ( rc != LDAP_SUCCESS ) {
727 fstr->bv_len += vtmp.bv_len;
728 fstr->bv_val = op->o_tmprealloc( fstr->bv_val, fstr->bv_len + 1,
731 snprintf( &fstr->bv_val[len-1], vtmp.bv_len + 2,
732 /*"("*/ "%s)", vtmp.bv_len ? vtmp.bv_val : "" );
734 op->o_tmpfree( vtmp.bv_val, op->o_tmpmemctx );
739 case LDAP_FILTER_EXT: {
740 if ( f->f_mr_desc ) {
742 if ( map_attr_value( dc, &ad, &atmp,
743 &f->f_mr_value, &vtmp, RWM_MAP, op->o_tmpmemctx ) )
749 BER_BVSTR( &atmp, "" );
750 filter_escape_value_x( &f->f_mr_value, &vtmp, op->o_tmpmemctx );
754 fstr->bv_len = atmp.bv_len +
755 ( f->f_mr_dnattrs ? STRLENOF( ":dn" ) : 0 ) +
756 ( f->f_mr_rule_text.bv_len ? f->f_mr_rule_text.bv_len + 1 : 0 ) +
757 vtmp.bv_len + STRLENOF( "(:=)" );
758 fstr->bv_val = op->o_tmpalloc( fstr->bv_len + 1, op->o_tmpmemctx );
760 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s%s%s%s:=%s)",
762 f->f_mr_dnattrs ? ":dn" : "",
763 !BER_BVISEMPTY( &f->f_mr_rule_text ) ? ":" : "",
764 !BER_BVISEMPTY( &f->f_mr_rule_text ) ? f->f_mr_rule_text.bv_val : "",
765 vtmp.bv_len ? vtmp.bv_val : "" );
766 op->o_tmpfree( vtmp.bv_val, op->o_tmpmemctx );
772 filter_free_x( op, f, 0 );
773 f->f_choice = SLAPD_FILTER_COMPUTED;
774 f->f_result = SLAPD_COMPARE_UNDEFINED;
777 case SLAPD_FILTER_COMPUTED:
778 switch ( f->f_result ) {
779 case LDAP_COMPARE_FALSE:
780 /* FIXME: treat UNDEFINED as FALSE */
781 case SLAPD_COMPARE_UNDEFINED:
782 if ( dc->rwmap->rwm_flags & RWM_F_SUPPORT_T_F ) {
783 tmp = &ber_bvtf_false;
789 case LDAP_COMPARE_TRUE:
790 if ( dc->rwmap->rwm_flags & RWM_F_SUPPORT_T_F ) {
791 tmp = &ber_bvtf_true;
802 ber_dupbv_x( fstr, tmp, op->o_tmpmemctx );
806 ber_dupbv_x( fstr, &ber_bvunknown, op->o_tmpmemctx );
814 rwm_filter_map_rewrite(
818 struct berval *fstr )
824 rc = rwm_int_filter_map_rewrite( op, dc, f, fstr );
833 fdc.ctx = "searchFilter";
835 switch ( rewrite_session( fdc.rwmap->rwm_rw, fdc.ctx,
836 ( !BER_BVISEMPTY( &ftmp ) ? ftmp.bv_val : "" ),
837 fdc.conn, &fstr->bv_val ) )
839 case REWRITE_REGEXEC_OK:
840 if ( !BER_BVISNULL( fstr ) ) {
841 fstr->bv_len = strlen( fstr->bv_val );
847 Debug( LDAP_DEBUG_ARGS,
848 "[rw] %s: \"%s\" -> \"%s\"\n",
849 fdc.ctx, ftmp.bv_val, fstr->bv_val );
850 if ( fstr->bv_val != ftmp.bv_val ) {
851 ber_bvreplace_x( &ftmp, fstr, op->o_tmpmemctx );
852 ch_free( fstr->bv_val );
858 case REWRITE_REGEXEC_UNWILLING:
860 fdc.rs->sr_err = LDAP_UNWILLING_TO_PERFORM;
861 fdc.rs->sr_text = "Operation not allowed";
863 op->o_tmpfree( ftmp.bv_val, op->o_tmpmemctx );
864 rc = LDAP_UNWILLING_TO_PERFORM;
867 case REWRITE_REGEXEC_ERR:
869 fdc.rs->sr_err = LDAP_OTHER;
870 fdc.rs->sr_text = "Rewrite error";
872 op->o_tmpfree( ftmp.bv_val, op->o_tmpmemctx );
881 * I don't like this much, but we need two different
882 * functions because different heap managers may be
883 * in use in back-ldap/meta to reduce the amount of
884 * calls to malloc routines, and some of the free()
885 * routines may be macros with args
888 rwm_referral_rewrite(
893 BerVarray *pa_nvals )
895 slap_overinst *on = (slap_overinst *) op->o_bd->bd_info;
896 struct ldaprwmap *rwmap =
897 (struct ldaprwmap *)on->on_bi.bi_private;
902 struct berval dn = BER_BVNULL,
905 assert( a_vals != NULL );
908 * Rewrite the dn if needed
911 dc.conn = op->o_conn;
913 dc.ctx = (char *)cookie;
915 for ( last = 0; !BER_BVISNULL( &a_vals[last] ); last++ )
919 if ( pa_nvals != NULL ) {
920 if ( *pa_nvals == NULL ) {
921 *pa_nvals = ch_malloc( ( last + 2 ) * sizeof(struct berval) );
922 memset( *pa_nvals, 0, ( last + 2 ) * sizeof(struct berval) );
926 for ( i = 0; !BER_BVISNULL( &a_vals[i] ); i++ ) {
927 struct berval olddn = BER_BVNULL,
933 rc = ldap_url_parse( oldval.bv_val, &ludp );
934 if ( rc != LDAP_URL_SUCCESS ) {
935 /* leave attr untouched if massage failed */
936 if ( pa_nvals && BER_BVISNULL( &(*pa_nvals)[i] ) ) {
937 ber_dupbv( &(*pa_nvals)[i], &oldval );
942 /* FIXME: URLs like "ldap:///dc=suffix" if passed
943 * thru ldap_url_parse() and ldap_url_desc2str()
944 * get rewritten as "ldap:///dc=suffix??base";
945 * we don't want this to occur... */
946 if ( ludp->lud_scope == LDAP_SCOPE_BASE ) {
947 ludp->lud_scope = LDAP_SCOPE_DEFAULT;
950 ber_str2bv( ludp->lud_dn, 0, 0, &olddn );
955 rc = rwm_dn_massage_pretty_normalize( &dc, &olddn,
958 rc = rwm_dn_massage_pretty( &dc, &olddn, &dn );
962 case LDAP_UNWILLING_TO_PERFORM:
964 * FIXME: need to check if it may be considered
965 * legal to trim values when adding/modifying;
966 * it should be when searching (e.g. ACLs).
968 ch_free( a_vals[i].bv_val );
970 a_vals[i] = a_vals[last];
972 (*pa_nvals)[i] = (*pa_nvals)[last];
975 BER_BVZERO( &a_vals[last] );
977 BER_BVZERO( &(*pa_nvals)[last] );
983 if ( !BER_BVISNULL( &dn ) && dn.bv_val != olddn.bv_val ) {
986 ludp->lud_dn = dn.bv_val;
987 newurl = ldap_url_desc2str( ludp );
988 ludp->lud_dn = olddn.bv_val;
989 ch_free( dn.bv_val );
990 if ( newurl == NULL ) {
991 /* FIXME: leave attr untouched
992 * even if ldap_url_desc2str failed...
997 ber_str2bv( newurl, 0, 1, &a_vals[i] );
998 ber_memfree( newurl );
1001 ludp->lud_dn = ndn.bv_val;
1002 newurl = ldap_url_desc2str( ludp );
1003 ludp->lud_dn = olddn.bv_val;
1004 ch_free( ndn.bv_val );
1005 if ( newurl == NULL ) {
1006 /* FIXME: leave attr untouched
1007 * even if ldap_url_desc2str failed...
1009 ch_free( a_vals[i].bv_val );
1014 if ( !BER_BVISNULL( &(*pa_nvals)[i] ) ) {
1015 ch_free( (*pa_nvals)[i].bv_val );
1017 ber_str2bv( newurl, 0, 1, &(*pa_nvals)[i] );
1018 ber_memfree( newurl );
1021 ch_free( oldval.bv_val );
1022 ludp->lud_dn = olddn.bv_val;
1027 /* leave attr untouched if massage failed */
1028 if ( pa_nvals && BER_BVISNULL( &(*pa_nvals)[i] ) ) {
1029 ber_dupbv( &(*pa_nvals)[i], &a_vals[i] );
1033 ldap_free_urldesc( ludp );
1040 * I don't like this much, but we need two different
1041 * functions because different heap managers may be
1042 * in use in back-ldap/meta to reduce the amount of
1043 * calls to malloc routines, and some of the free()
1044 * routines may be macros with args
1052 BerVarray *pa_nvals )
1054 slap_overinst *on = (slap_overinst *) op->o_bd->bd_info;
1055 struct ldaprwmap *rwmap =
1056 (struct ldaprwmap *)on->on_bi.bi_private;
1061 struct berval dn = BER_BVNULL,
1069 if ( pa_nvals == NULL || *pa_nvals == NULL ) {
1076 * Rewrite the dn if needed
1079 dc.conn = op->o_conn;
1081 dc.ctx = (char *)cookie;
1083 for ( last = 0; !BER_BVISNULL( &in[last] ); last++ );
1085 if ( pa_nvals != NULL ) {
1086 if ( *pa_nvals == NULL ) {
1087 *pa_nvals = ch_malloc( ( last + 2 ) * sizeof(struct berval) );
1088 memset( *pa_nvals, 0, ( last + 2 ) * sizeof(struct berval) );
1092 for ( i = 0; !BER_BVISNULL( &in[i] ); i++ ) {
1098 ndn = (*pa_nvals)[i];
1099 rc = rwm_dn_massage_pretty_normalize( &dc, &in[i], &dn, &ndn );
1101 rc = rwm_dn_massage_pretty( &dc, &in[i], &dn );
1105 rc = rwm_dn_massage_normalize( &dc, &in[i], &ndn );
1109 case LDAP_UNWILLING_TO_PERFORM:
1111 * FIXME: need to check if it may be considered
1112 * legal to trim values when adding/modifying;
1113 * it should be when searching (e.g. ACLs).
1115 ch_free( in[i].bv_val );
1118 if ( a_vals && pa_nvals ) {
1119 (*pa_nvals)[i] = (*pa_nvals)[last];
1122 BER_BVZERO( &in[last] );
1123 if ( a_vals && pa_nvals ) {
1124 BER_BVZERO( &(*pa_nvals)[last] );
1131 if ( !BER_BVISNULL( &dn ) && dn.bv_val != a_vals[i].bv_val ) {
1132 ch_free( a_vals[i].bv_val );
1136 if ( !BER_BVISNULL( &(*pa_nvals)[i] ) ) {
1137 ch_free( (*pa_nvals)[i].bv_val );
1139 (*pa_nvals)[i] = ndn;
1144 if ( !BER_BVISNULL( &ndn ) && ndn.bv_val != (*pa_nvals)[i].bv_val ) {
1145 ch_free( (*pa_nvals)[i].bv_val );
1146 (*pa_nvals)[i] = ndn;
1152 /* leave attr untouched if massage failed */
1153 if ( a_vals && pa_nvals && BER_BVISNULL( &(*pa_nvals)[i] ) ) {
1154 dnNormalize( 0, NULL, NULL, &a_vals[i], &(*pa_nvals)[i], NULL );
1164 rwm_referral_result_rewrite(
1170 for ( last = 0; !BER_BVISNULL( &a_vals[last] ); last++ );
1173 for ( i = 0; !BER_BVISNULL( &a_vals[i] ); i++ ) {
1179 rc = ldap_url_parse( a_vals[i].bv_val, &ludp );
1180 if ( rc != LDAP_URL_SUCCESS ) {
1181 /* leave attr untouched if massage failed */
1185 /* FIXME: URLs like "ldap:///dc=suffix" if passed
1186 * thru ldap_url_parse() and ldap_url_desc2str()
1187 * get rewritten as "ldap:///dc=suffix??base";
1188 * we don't want this to occur... */
1189 if ( ludp->lud_scope == LDAP_SCOPE_BASE ) {
1190 ludp->lud_scope = LDAP_SCOPE_DEFAULT;
1193 ber_str2bv( ludp->lud_dn, 0, 0, &olddn );
1196 rc = rwm_dn_massage_pretty( dc, &olddn, &dn );
1198 case LDAP_UNWILLING_TO_PERFORM:
1200 * FIXME: need to check if it may be considered
1201 * legal to trim values when adding/modifying;
1202 * it should be when searching (e.g. ACLs).
1204 ch_free( a_vals[i].bv_val );
1206 a_vals[i] = a_vals[last];
1208 BER_BVZERO( &a_vals[last] );
1214 /* leave attr untouched if massage failed */
1215 if ( !BER_BVISNULL( &dn ) && olddn.bv_val != dn.bv_val ) {
1218 ludp->lud_dn = dn.bv_val;
1219 newurl = ldap_url_desc2str( ludp );
1220 if ( newurl == NULL ) {
1221 /* FIXME: leave attr untouched
1222 * even if ldap_url_desc2str failed...
1227 ch_free( a_vals[i].bv_val );
1228 ber_str2bv( newurl, 0, 1, &a_vals[i] );
1229 ber_memfree( newurl );
1230 ludp->lud_dn = olddn.bv_val;
1235 ldap_free_urldesc( ludp );
1242 rwm_dnattr_result_rewrite(
1249 for ( last = 0; !BER_BVISNULL( &a_vals[last] ); last++ );
1252 for ( i = 0; !BER_BVISNULL( &a_vals[i] ); i++ ) {
1253 struct berval pdn, ndn = BER_BVNULL;
1257 rc = rwm_dn_massage_pretty_normalize( dc, &a_vals[i], &pdn, &ndn );
1259 case LDAP_UNWILLING_TO_PERFORM:
1261 * FIXME: need to check if it may be considered
1262 * legal to trim values when adding/modifying;
1263 * it should be when searching (e.g. ACLs).
1265 assert( a_vals[i].bv_val != a_nvals[i].bv_val );
1266 ch_free( a_vals[i].bv_val );
1267 ch_free( a_nvals[i].bv_val );
1269 a_vals[i] = a_vals[last];
1270 a_nvals[i] = a_nvals[last];
1272 BER_BVZERO( &a_vals[last] );
1273 BER_BVZERO( &a_nvals[last] );
1278 /* leave attr untouched if massage failed */
1279 if ( !BER_BVISNULL( &pdn ) && a_vals[i].bv_val != pdn.bv_val ) {
1280 ch_free( a_vals[i].bv_val );
1283 if ( !BER_BVISNULL( &ndn ) && a_nvals[i].bv_val != ndn.bv_val ) {
1284 ch_free( a_nvals[i].bv_val );
1295 rwm_mapping_dst_free( void *v_mapping )
1297 struct ldapmapping *mapping = v_mapping;
1299 if ( BER_BVISEMPTY( &mapping[0].m_dst ) ) {
1300 rwm_mapping_free( &mapping[ -1 ] );
1305 rwm_mapping_free( void *v_mapping )
1307 struct ldapmapping *mapping = v_mapping;
1309 if ( !BER_BVISNULL( &mapping[0].m_src ) ) {
1310 ch_free( mapping[0].m_src.bv_val );
1313 if ( mapping[0].m_flags & RWMMAP_F_FREE_SRC ) {
1314 if ( mapping[0].m_flags & RWMMAP_F_IS_OC ) {
1315 if ( mapping[0].m_src_oc ) {
1316 ch_free( mapping[0].m_src_oc );
1320 if ( mapping[0].m_src_ad ) {
1321 ch_free( mapping[0].m_src_ad );
1326 if ( !BER_BVISNULL( &mapping[0].m_dst ) ) {
1327 ch_free( mapping[0].m_dst.bv_val );
1330 if ( mapping[0].m_flags & RWMMAP_F_FREE_DST ) {
1331 if ( mapping[0].m_flags & RWMMAP_F_IS_OC ) {
1332 if ( mapping[0].m_dst_oc ) {
1333 ch_free( mapping[0].m_dst_oc );
1337 if ( mapping[0].m_dst_ad ) {
1338 ch_free( mapping[0].m_dst_ad );
1347 #endif /* SLAPD_OVER_RWM */