1 /* map.c - ldap backend mapping routines */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 1998-2011 The OpenLDAP Foundation.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted only as authorized by the OpenLDAP
12 * A copy of this license is available in the file LICENSE in the
13 * top-level directory of the distribution or, alternatively, at
14 * <http://www.OpenLDAP.org/license.html>.
17 * This work was initially developed by the Howard Chu for inclusion
18 * in OpenLDAP Software and subsequently enhanced by Pierangelo
21 /* This is an altered version */
23 * Copyright 1999, Howard Chu, All rights reserved. <hyc@highlandsun.com>
25 * Permission is granted to anyone to use this software for any purpose
26 * on any computer system, and to alter it and redistribute it, subject
27 * to the following restrictions:
29 * 1. The author is not responsible for the consequences of use of this
30 * software, no matter how awful, even if they arise from flaws in it.
32 * 2. The origin of this software must not be misrepresented, either by
33 * explicit claim or by omission. Since few users ever read sources,
34 * credits should appear in the documentation.
36 * 3. Altered versions must be plainly marked as such, and must not be
37 * misrepresented as being the original software. Since few users
38 * ever read sources, credits should appear in the documentation.
40 * 4. This notice may not be removed or altered.
44 * Copyright 2000, Pierangelo Masarati, All rights reserved. <ando@sys-net.it>
46 * This software is being modified by Pierangelo Masarati.
47 * The previously reported conditions apply to the modified code as well.
48 * Changes in the original code are highlighted where required.
49 * Credits for the original code go to the author, Howard Chu.
56 #include <ac/string.h>
57 #include <ac/socket.h>
61 #include "../back-ldap/back-ldap.h"
62 #include "back-meta.h"
64 #undef ldap_debug /* silence a warning in ldap-int.h */
65 #include "../../../libraries/libldap/ldap-int.h"
68 mapping_cmp ( const void *c1, const void *c2 )
70 struct ldapmapping *map1 = (struct ldapmapping *)c1;
71 struct ldapmapping *map2 = (struct ldapmapping *)c2;
72 int rc = map1->src.bv_len - map2->src.bv_len;
74 return ( strcasecmp( map1->src.bv_val, map2->src.bv_val ) );
78 mapping_dup ( void *c1, void *c2 )
80 struct ldapmapping *map1 = (struct ldapmapping *)c1;
81 struct ldapmapping *map2 = (struct ldapmapping *)c2;
83 return ( ( strcasecmp( map1->src.bv_val, map2->src.bv_val ) == 0 ) ? -1 : 0 );
87 ldap_back_map_init ( struct ldapmap *lm, struct ldapmapping **m )
89 struct ldapmapping *mapping;
95 mapping = (struct ldapmapping *)ch_calloc( 2,
96 sizeof( struct ldapmapping ) );
97 if ( mapping == NULL ) {
101 ber_str2bv( "objectclass", STRLENOF("objectclass"), 1, &mapping[0].src);
102 ber_dupbv( &mapping[0].dst, &mapping[0].src );
103 mapping[1].src = mapping[0].src;
104 mapping[1].dst = mapping[0].dst;
106 avl_insert( &lm->map, (caddr_t)&mapping[0],
107 mapping_cmp, mapping_dup );
108 avl_insert( &lm->remap, (caddr_t)&mapping[1],
109 mapping_cmp, mapping_dup );
114 ldap_back_mapping ( struct ldapmap *map, struct berval *s, struct ldapmapping **m,
118 struct ldapmapping fmapping;
122 /* let special attrnames slip through (ITS#5760) */
123 if ( bvmatch( s, slap_bv_no_attrs )
124 || bvmatch( s, slap_bv_all_user_attrs )
125 || bvmatch( s, slap_bv_all_operational_attrs ) )
131 if ( remap == BACKLDAP_REMAP ) {
139 *m = (struct ldapmapping *)avl_find( tree, (caddr_t)&fmapping, mapping_cmp );
141 return map->drop_missing;
148 ldap_back_map ( struct ldapmap *map, struct berval *s, struct berval *bv,
151 struct ldapmapping *mapping;
154 /* map->map may be NULL when mapping is configured,
155 * but map->remap can't */
156 if ( map->remap == NULL ) {
162 drop_missing = ldap_back_mapping( map, s, &mapping, remap );
163 if ( mapping != NULL ) {
164 if ( !BER_BVISNULL( &mapping->dst ) ) {
170 if ( !drop_missing ) {
177 struct ldapmap *at_map,
180 char ***mapped_attrs,
185 struct berval mapped;
188 *mapped_attrs = NULL;
192 for ( i = 0; !BER_BVISNULL( &an[i].an_name ); i++ )
195 na = (char **)ber_memcalloc_x( i + 1, sizeof(char *), memctx );
197 *mapped_attrs = NULL;
198 return LDAP_NO_MEMORY;
201 for ( i = j = 0; !BER_BVISNULL( &an[i].an_name ); i++ ) {
202 ldap_back_map( at_map, &an[i].an_name, &mapped, remap );
203 if ( !BER_BVISNULL( &mapped ) && !BER_BVISEMPTY( &mapped ) ) {
204 na[j++] = mapped.bv_val;
207 if ( j == 0 && i != 0 ) {
208 na[j++] = LDAP_NO_ATTRS;
219 AttributeDescription *ad,
220 struct berval *mapped_attr,
221 struct berval *value,
222 struct berval *mapped_value,
229 ldap_back_map( &dc->target->mt_rwmap.rwm_at, &ad->ad_cname, mapped_attr, remap );
230 if ( BER_BVISNULL( mapped_attr ) || BER_BVISEMPTY( mapped_attr ) ) {
233 * FIXME: are we sure we need to search oc_map if at_map fails?
235 ldap_back_map( &dc->target->mt_rwmap.rwm_oc, &ad->ad_cname, mapped_attr, remap );
236 if ( BER_BVISNULL( mapped_attr ) || BER_BVISEMPTY( mapped_attr ) ) {
237 *mapped_attr = ad->ad_cname;
240 if ( dc->target->mt_rwmap.rwm_at.drop_missing ) {
244 *mapped_attr = ad->ad_cname;
247 if ( value == NULL ) {
251 if ( ad->ad_type->sat_syntax == slap_schema.si_syn_distinguishedName )
255 #ifdef ENABLE_REWRITE
256 fdc.ctx = "searchFilterAttrDN";
259 switch ( ldap_back_dn_massage( &fdc, value, &vtmp ) ) {
261 if ( vtmp.bv_val != value->bv_val ) {
266 case LDAP_UNWILLING_TO_PERFORM:
273 } else if ( ad->ad_type->sat_equality->smr_usage & SLAP_MR_MUTATION_NORMALIZER ) {
274 if ( ad->ad_type->sat_equality->smr_normalize(
275 (SLAP_MR_DENORMALIZE|SLAP_MR_VALUE_OF_ASSERTION_SYNTAX),
276 NULL, NULL, value, &vtmp, memctx ) )
282 } else if ( ad == slap_schema.si_ad_objectClass || ad == slap_schema.si_ad_structuralObjectClass ) {
283 ldap_back_map( &dc->target->mt_rwmap.rwm_oc, value, &vtmp, remap );
284 if ( BER_BVISNULL( &vtmp ) || BER_BVISEMPTY( &vtmp ) ) {
292 filter_escape_value_x( &vtmp, mapped_value, memctx );
296 ber_memfree( vtmp.bv_val );
299 ber_memfree_x( vtmp.bv_val, memctx );
307 ldap_back_int_filter_map_rewrite(
320 /* better than nothing... */
321 ber_bvfalse = BER_BVC( "(!(objectClass=*))" ),
322 ber_bvtf_false = BER_BVC( "(|)" ),
323 /* better than nothing... */
324 ber_bvtrue = BER_BVC( "(objectClass=*)" ),
325 ber_bvtf_true = BER_BVC( "(&)" ),
327 /* no longer needed; preserved for completeness */
328 ber_bvundefined = BER_BVC( "(?=undefined)" ),
330 ber_bverror = BER_BVC( "(?=error)" ),
331 ber_bvunknown = BER_BVC( "(?=unknown)" ),
332 ber_bvnone = BER_BVC( "(?=none)" );
335 assert( fstr != NULL );
339 ber_dupbv_x( fstr, &ber_bvnone, memctx );
343 switch ( ( f->f_choice & SLAPD_FILTER_MASK ) ) {
344 case LDAP_FILTER_EQUALITY:
345 if ( map_attr_value( dc, f->f_av_desc, &atmp,
346 &f->f_av_value, &vtmp, remap, memctx ) )
351 fstr->bv_len = atmp.bv_len + vtmp.bv_len
352 + ( sizeof("(=)") - 1 );
353 fstr->bv_val = ber_memalloc_x( fstr->bv_len + 1, memctx );
355 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s=%s)",
356 atmp.bv_val, vtmp.bv_len ? vtmp.bv_val : "" );
358 ber_memfree_x( vtmp.bv_val, memctx );
362 if ( map_attr_value( dc, f->f_av_desc, &atmp,
363 &f->f_av_value, &vtmp, remap, memctx ) )
368 fstr->bv_len = atmp.bv_len + vtmp.bv_len
369 + ( sizeof("(>=)") - 1 );
370 fstr->bv_val = ber_memalloc_x( fstr->bv_len + 1, memctx );
372 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s>=%s)",
373 atmp.bv_val, vtmp.bv_len ? vtmp.bv_val : "" );
375 ber_memfree_x( vtmp.bv_val, memctx );
379 if ( map_attr_value( dc, f->f_av_desc, &atmp,
380 &f->f_av_value, &vtmp, remap, memctx ) )
385 fstr->bv_len = atmp.bv_len + vtmp.bv_len
386 + ( sizeof("(<=)") - 1 );
387 fstr->bv_val = ber_memalloc_x( fstr->bv_len + 1, memctx );
389 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s<=%s)",
390 atmp.bv_val, vtmp.bv_len ? vtmp.bv_val : "" );
392 ber_memfree_x( vtmp.bv_val, memctx );
395 case LDAP_FILTER_APPROX:
396 if ( map_attr_value( dc, f->f_av_desc, &atmp,
397 &f->f_av_value, &vtmp, remap, memctx ) )
402 fstr->bv_len = atmp.bv_len + vtmp.bv_len
403 + ( sizeof("(~=)") - 1 );
404 fstr->bv_val = ber_memalloc_x( fstr->bv_len + 1, memctx );
406 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s~=%s)",
407 atmp.bv_val, vtmp.bv_len ? vtmp.bv_val : "" );
409 ber_memfree_x( vtmp.bv_val, memctx );
412 case LDAP_FILTER_SUBSTRINGS:
413 if ( map_attr_value( dc, f->f_sub_desc, &atmp,
414 NULL, NULL, remap, memctx ) )
419 /* cannot be a DN ... */
421 fstr->bv_len = atmp.bv_len + ( STRLENOF( "(=*)" ) );
422 fstr->bv_val = ber_memalloc_x( fstr->bv_len + 128, memctx ); /* FIXME: why 128 ? */
424 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s=*)",
427 if ( !BER_BVISNULL( &f->f_sub_initial ) ) {
430 filter_escape_value_x( &f->f_sub_initial, &vtmp, memctx );
432 fstr->bv_len += vtmp.bv_len;
433 fstr->bv_val = ber_memrealloc_x( fstr->bv_val, fstr->bv_len + 1, memctx );
435 snprintf( &fstr->bv_val[len - 2], vtmp.bv_len + 3,
436 /* "(attr=" */ "%s*)",
437 vtmp.bv_len ? vtmp.bv_val : "" );
439 ber_memfree_x( vtmp.bv_val, memctx );
442 if ( f->f_sub_any != NULL ) {
443 for ( i = 0; !BER_BVISNULL( &f->f_sub_any[i] ); i++ ) {
445 filter_escape_value_x( &f->f_sub_any[i], &vtmp, memctx );
447 fstr->bv_len += vtmp.bv_len + 1;
448 fstr->bv_val = ber_memrealloc_x( fstr->bv_val, fstr->bv_len + 1, memctx );
450 snprintf( &fstr->bv_val[len - 1], vtmp.bv_len + 3,
451 /* "(attr=[init]*[any*]" */ "%s*)",
452 vtmp.bv_len ? vtmp.bv_val : "" );
453 ber_memfree_x( vtmp.bv_val, memctx );
457 if ( !BER_BVISNULL( &f->f_sub_final ) ) {
460 filter_escape_value_x( &f->f_sub_final, &vtmp, memctx );
462 fstr->bv_len += vtmp.bv_len;
463 fstr->bv_val = ber_memrealloc_x( fstr->bv_val, fstr->bv_len + 1, memctx );
465 snprintf( &fstr->bv_val[len - 1], vtmp.bv_len + 3,
466 /* "(attr=[init*][any*]" */ "%s)",
467 vtmp.bv_len ? vtmp.bv_val : "" );
469 ber_memfree_x( vtmp.bv_val, memctx );
474 case LDAP_FILTER_PRESENT:
475 if ( map_attr_value( dc, f->f_desc, &atmp,
476 NULL, NULL, remap, memctx ) )
481 fstr->bv_len = atmp.bv_len + ( STRLENOF( "(=*)" ) );
482 fstr->bv_val = ber_memalloc_x( fstr->bv_len + 1, memctx );
484 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s=*)",
488 case LDAP_FILTER_AND:
490 case LDAP_FILTER_NOT:
491 fstr->bv_len = STRLENOF( "(%)" );
492 fstr->bv_val = ber_memalloc_x( fstr->bv_len + 128, memctx ); /* FIXME: why 128? */
494 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%c)",
495 f->f_choice == LDAP_FILTER_AND ? '&' :
496 f->f_choice == LDAP_FILTER_OR ? '|' : '!' );
498 for ( p = f->f_list; p != NULL; p = p->f_next ) {
503 rc = ldap_back_int_filter_map_rewrite( dc, p, &vtmp, remap, memctx );
504 if ( rc != LDAP_SUCCESS ) {
508 fstr->bv_len += vtmp.bv_len;
509 fstr->bv_val = ber_memrealloc_x( fstr->bv_val, fstr->bv_len + 1, memctx );
511 snprintf( &fstr->bv_val[len-1], vtmp.bv_len + 2,
512 /*"("*/ "%s)", vtmp.bv_len ? vtmp.bv_val : "" );
514 ber_memfree_x( vtmp.bv_val, memctx );
519 case LDAP_FILTER_EXT:
520 if ( f->f_mr_desc ) {
521 if ( map_attr_value( dc, f->f_mr_desc, &atmp,
522 &f->f_mr_value, &vtmp, remap, memctx ) )
528 BER_BVSTR( &atmp, "" );
529 filter_escape_value_x( &f->f_mr_value, &vtmp, memctx );
532 /* FIXME: cleanup (less ?: operators...) */
533 fstr->bv_len = atmp.bv_len +
534 ( f->f_mr_dnattrs ? STRLENOF( ":dn" ) : 0 ) +
535 ( !BER_BVISEMPTY( &f->f_mr_rule_text ) ? f->f_mr_rule_text.bv_len + 1 : 0 ) +
536 vtmp.bv_len + ( STRLENOF( "(:=)" ) );
537 fstr->bv_val = ber_memalloc_x( fstr->bv_len + 1, memctx );
539 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s%s%s%s:=%s)",
541 f->f_mr_dnattrs ? ":dn" : "",
542 !BER_BVISEMPTY( &f->f_mr_rule_text ) ? ":" : "",
543 !BER_BVISEMPTY( &f->f_mr_rule_text ) ? f->f_mr_rule_text.bv_val : "",
544 vtmp.bv_len ? vtmp.bv_val : "" );
545 ber_memfree_x( vtmp.bv_val, memctx );
548 case SLAPD_FILTER_COMPUTED:
549 switch ( f->f_result ) {
550 /* FIXME: treat UNDEFINED as FALSE */
551 case SLAPD_COMPARE_UNDEFINED:
553 if ( META_BACK_TGT_NOUNDEFFILTER( dc->target ) ) {
554 return LDAP_COMPARE_FALSE;
558 case LDAP_COMPARE_FALSE:
559 if ( META_BACK_TGT_T_F( dc->target ) ) {
560 tmp = &ber_bvtf_false;
566 case LDAP_COMPARE_TRUE:
567 if ( META_BACK_TGT_T_F( dc->target ) ) {
568 tmp = &ber_bvtf_true;
580 ber_dupbv_x( fstr, tmp, memctx );
584 ber_dupbv_x( fstr, &ber_bvunknown, memctx );
592 ldap_back_filter_map_rewrite(
602 static char *dmy = "";
604 rc = ldap_back_int_filter_map_rewrite( dc, f, fstr, remap, memctx );
606 #ifdef ENABLE_REWRITE
607 if ( rc != LDAP_SUCCESS ) {
614 fdc.ctx = "searchFilter";
616 switch ( rewrite_session( fdc.target->mt_rwmap.rwm_rw, fdc.ctx,
617 ( !BER_BVISEMPTY( &ftmp ) ? ftmp.bv_val : dmy ),
618 fdc.conn, &fstr->bv_val ) )
620 case REWRITE_REGEXEC_OK:
621 if ( !BER_BVISNULL( fstr ) ) {
622 fstr->bv_len = strlen( fstr->bv_val );
627 Debug( LDAP_DEBUG_ARGS,
628 "[rw] %s: \"%s\" -> \"%s\"\n",
629 fdc.ctx, BER_BVISNULL( &ftmp ) ? "" : ftmp.bv_val,
630 BER_BVISNULL( fstr ) ? "" : fstr->bv_val );
634 case REWRITE_REGEXEC_UNWILLING:
636 fdc.rs->sr_err = LDAP_UNWILLING_TO_PERFORM;
637 fdc.rs->sr_text = "Operation not allowed";
639 rc = LDAP_UNWILLING_TO_PERFORM;
642 case REWRITE_REGEXEC_ERR:
644 fdc.rs->sr_err = LDAP_OTHER;
645 fdc.rs->sr_text = "Rewrite error";
651 if ( fstr->bv_val == dmy ) {
654 } else if ( fstr->bv_val != ftmp.bv_val ) {
655 /* NOTE: need to realloc mapped filter on slab
656 * and free the original one, until librewrite
659 ber_dupbv_x( &ftmp, fstr, memctx );
660 ch_free( fstr->bv_val );
663 #endif /* ENABLE_REWRITE */
669 ldap_back_referral_result_rewrite(
677 assert( dc != NULL );
678 assert( a_vals != NULL );
680 for ( last = 0; !BER_BVISNULL( &a_vals[ last ] ); last++ )
684 for ( i = 0; !BER_BVISNULL( &a_vals[ i ] ); i++ ) {
690 rc = ldap_url_parse( a_vals[ i ].bv_val, &ludp );
691 if ( rc != LDAP_URL_SUCCESS ) {
692 /* leave attr untouched if massage failed */
696 /* FIXME: URLs like "ldap:///dc=suffix" if passed
697 * thru ldap_url_parse() and ldap_url_desc2str()
698 * get rewritten as "ldap:///dc=suffix??base";
699 * we don't want this to occur... */
700 if ( ludp->lud_scope == LDAP_SCOPE_BASE ) {
701 ludp->lud_scope = LDAP_SCOPE_DEFAULT;
704 ber_str2bv( ludp->lud_dn, 0, 0, &olddn );
706 rc = ldap_back_dn_massage( dc, &olddn, &dn );
708 case LDAP_UNWILLING_TO_PERFORM:
710 * FIXME: need to check if it may be considered
711 * legal to trim values when adding/modifying;
712 * it should be when searching (e.g. ACLs).
714 ber_memfree( a_vals[ i ].bv_val );
716 a_vals[ i ] = a_vals[ last ];
718 BER_BVZERO( &a_vals[ last ] );
724 /* leave attr untouched if massage failed */
725 if ( !BER_BVISNULL( &dn ) && olddn.bv_val != dn.bv_val )
729 ludp->lud_dn = dn.bv_val;
730 newurl = ldap_url_desc2str( ludp );
732 if ( newurl == NULL ) {
733 /* FIXME: leave attr untouched
734 * even if ldap_url_desc2str failed...
739 ber_memfree_x( a_vals[ i ].bv_val, memctx );
740 ber_str2bv_x( newurl, 0, 1, &a_vals[ i ], memctx );
741 ber_memfree( newurl );
742 ludp->lud_dn = olddn.bv_val;
747 ldap_free_urldesc( ludp );
754 * I don't like this much, but we need two different
755 * functions because different heap managers may be
756 * in use in back-ldap/meta to reduce the amount of
757 * calls to malloc routines, and some of the free()
758 * routines may be macros with args
769 assert( a_vals != NULL );
771 for ( last = 0; !BER_BVISNULL( &a_vals[last] ); last++ )
775 for ( i = 0; !BER_BVISNULL( &a_vals[i] ); i++ ) {
776 switch ( ldap_back_dn_massage( dc, &a_vals[i], &bv ) ) {
777 case LDAP_UNWILLING_TO_PERFORM:
779 * FIXME: need to check if it may be considered
780 * legal to trim values when adding/modifying;
781 * it should be when searching (e.g. ACLs).
783 ch_free( a_vals[i].bv_val );
785 a_vals[i] = a_vals[last];
787 BER_BVZERO( &a_vals[last] );
792 /* leave attr untouched if massage failed */
793 if ( !BER_BVISNULL( &bv ) && bv.bv_val != a_vals[i].bv_val ) {
794 ch_free( a_vals[i].bv_val );
805 ldap_dnattr_result_rewrite(
813 assert( a_vals != NULL );
815 for ( last = 0; !BER_BVISNULL( &a_vals[last] ); last++ )
819 for ( i = 0; !BER_BVISNULL( &a_vals[i] ); i++ ) {
820 switch ( ldap_back_dn_massage( dc, &a_vals[i], &bv ) ) {
821 case LDAP_UNWILLING_TO_PERFORM:
823 * FIXME: need to check if it may be considered
824 * legal to trim values when adding/modifying;
825 * it should be when searching (e.g. ACLs).
827 ber_memfree( a_vals[i].bv_val );
829 a_vals[i] = a_vals[last];
831 BER_BVZERO( &a_vals[last] );
836 /* leave attr untouched if massage failed */
837 if ( !BER_BVISNULL( &bv ) && a_vals[i].bv_val != bv.bv_val ) {
838 ber_memfree( a_vals[i].bv_val );