1 /* map.c - ldap backend mapping routines */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 1998-2010 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 ) {
178 struct ldapmap *at_map,
181 char ***mapped_attrs )
185 struct berval mapped;
187 if ( an == NULL && op->o_bd->be_extra_anlist == NULL ) {
188 *mapped_attrs = NULL;
194 for ( ; !BER_BVISNULL( &an[i].an_name ); i++ )
199 if ( op->o_bd->be_extra_anlist != NULL ) {
200 for ( ; !BER_BVISNULL( &op->o_bd->be_extra_anlist[x].an_name ); x++ )
204 assert( i > 0 || x > 0 );
206 na = (char **)ber_memcalloc_x( i + x + 1, sizeof(char *), op->o_tmpmemctx );
208 *mapped_attrs = NULL;
209 return LDAP_NO_MEMORY;
214 for ( i = 0; !BER_BVISNULL( &an[i].an_name ); i++ ) {
215 ldap_back_map( at_map, &an[i].an_name, &mapped, remap );
216 if ( !BER_BVISNULL( &mapped ) && !BER_BVISEMPTY( &mapped ) ) {
217 na[j++] = mapped.bv_val;
223 for ( x = 0; !BER_BVISNULL( &op->o_bd->be_extra_anlist[x].an_name ); x++ ) {
224 if ( op->o_bd->be_extra_anlist[x].an_desc &&
225 ad_inlist( op->o_bd->be_extra_anlist[x].an_desc, an ) )
230 ldap_back_map( at_map, &op->o_bd->be_extra_anlist[x].an_name, &mapped, remap );
231 if ( !BER_BVISNULL( &mapped ) && !BER_BVISEMPTY( &mapped ) ) {
232 na[j++] = mapped.bv_val;
237 if ( j == 0 && ( i > 0 || x > 0 ) ) {
238 na[j++] = LDAP_NO_ATTRS;
250 AttributeDescription *ad,
251 struct berval *mapped_attr,
252 struct berval *value,
253 struct berval *mapped_value,
260 ldap_back_map( &dc->target->mt_rwmap.rwm_at, &ad->ad_cname, mapped_attr, remap );
261 if ( BER_BVISNULL( mapped_attr ) || BER_BVISEMPTY( mapped_attr ) ) {
264 * FIXME: are we sure we need to search oc_map if at_map fails?
266 ldap_back_map( &dc->target->mt_rwmap.rwm_oc, &ad->ad_cname, mapped_attr, remap );
267 if ( BER_BVISNULL( mapped_attr ) || BER_BVISEMPTY( mapped_attr ) ) {
268 *mapped_attr = ad->ad_cname;
271 if ( dc->target->mt_rwmap.rwm_at.drop_missing ) {
275 *mapped_attr = ad->ad_cname;
278 if ( value == NULL ) {
282 if ( ad->ad_type->sat_syntax == slap_schema.si_syn_distinguishedName )
286 #ifdef ENABLE_REWRITE
287 fdc.ctx = "searchFilterAttrDN";
290 switch ( ldap_back_dn_massage( &fdc, value, &vtmp ) ) {
292 if ( vtmp.bv_val != value->bv_val ) {
297 case LDAP_UNWILLING_TO_PERFORM:
304 } else if ( ad->ad_type->sat_equality->smr_usage & SLAP_MR_MUTATION_NORMALIZER ) {
305 if ( ad->ad_type->sat_equality->smr_normalize(
306 (SLAP_MR_DENORMALIZE|SLAP_MR_VALUE_OF_ASSERTION_SYNTAX),
307 NULL, NULL, value, &vtmp, memctx ) )
313 } else if ( ad == slap_schema.si_ad_objectClass || ad == slap_schema.si_ad_structuralObjectClass ) {
314 ldap_back_map( &dc->target->mt_rwmap.rwm_oc, value, &vtmp, remap );
315 if ( BER_BVISNULL( &vtmp ) || BER_BVISEMPTY( &vtmp ) ) {
323 filter_escape_value_x( &vtmp, mapped_value, memctx );
327 ber_memfree( vtmp.bv_val );
330 ber_memfree_x( vtmp.bv_val, memctx );
338 ldap_back_int_filter_map_rewrite(
351 /* better than nothing... */
352 ber_bvfalse = BER_BVC( "(!(objectClass=*))" ),
353 ber_bvtf_false = BER_BVC( "(|)" ),
354 /* better than nothing... */
355 ber_bvtrue = BER_BVC( "(objectClass=*)" ),
356 ber_bvtf_true = BER_BVC( "(&)" ),
358 /* no longer needed; preserved for completeness */
359 ber_bvundefined = BER_BVC( "(?=undefined)" ),
361 ber_bverror = BER_BVC( "(?=error)" ),
362 ber_bvunknown = BER_BVC( "(?=unknown)" ),
363 ber_bvnone = BER_BVC( "(?=none)" );
366 assert( fstr != NULL );
370 ber_dupbv_x( fstr, &ber_bvnone, memctx );
374 switch ( ( f->f_choice & SLAPD_FILTER_MASK ) ) {
375 case LDAP_FILTER_EQUALITY:
376 if ( map_attr_value( dc, f->f_av_desc, &atmp,
377 &f->f_av_value, &vtmp, remap, memctx ) )
382 fstr->bv_len = atmp.bv_len + vtmp.bv_len
383 + ( sizeof("(=)") - 1 );
384 fstr->bv_val = ber_memalloc_x( fstr->bv_len + 1, memctx );
386 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s=%s)",
387 atmp.bv_val, vtmp.bv_len ? vtmp.bv_val : "" );
389 ber_memfree_x( vtmp.bv_val, memctx );
393 if ( map_attr_value( dc, f->f_av_desc, &atmp,
394 &f->f_av_value, &vtmp, remap, memctx ) )
399 fstr->bv_len = atmp.bv_len + vtmp.bv_len
400 + ( sizeof("(>=)") - 1 );
401 fstr->bv_val = ber_memalloc_x( fstr->bv_len + 1, memctx );
403 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s>=%s)",
404 atmp.bv_val, vtmp.bv_len ? vtmp.bv_val : "" );
406 ber_memfree_x( vtmp.bv_val, memctx );
410 if ( map_attr_value( dc, f->f_av_desc, &atmp,
411 &f->f_av_value, &vtmp, remap, memctx ) )
416 fstr->bv_len = atmp.bv_len + vtmp.bv_len
417 + ( sizeof("(<=)") - 1 );
418 fstr->bv_val = ber_memalloc_x( fstr->bv_len + 1, memctx );
420 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s<=%s)",
421 atmp.bv_val, vtmp.bv_len ? vtmp.bv_val : "" );
423 ber_memfree_x( vtmp.bv_val, memctx );
426 case LDAP_FILTER_APPROX:
427 if ( map_attr_value( dc, f->f_av_desc, &atmp,
428 &f->f_av_value, &vtmp, remap, memctx ) )
433 fstr->bv_len = atmp.bv_len + vtmp.bv_len
434 + ( sizeof("(~=)") - 1 );
435 fstr->bv_val = ber_memalloc_x( fstr->bv_len + 1, memctx );
437 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s~=%s)",
438 atmp.bv_val, vtmp.bv_len ? vtmp.bv_val : "" );
440 ber_memfree_x( vtmp.bv_val, memctx );
443 case LDAP_FILTER_SUBSTRINGS:
444 if ( map_attr_value( dc, f->f_sub_desc, &atmp,
445 NULL, NULL, remap, memctx ) )
450 /* cannot be a DN ... */
452 fstr->bv_len = atmp.bv_len + ( STRLENOF( "(=*)" ) );
453 fstr->bv_val = ber_memalloc_x( fstr->bv_len + 128, memctx ); /* FIXME: why 128 ? */
455 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s=*)",
458 if ( !BER_BVISNULL( &f->f_sub_initial ) ) {
461 filter_escape_value_x( &f->f_sub_initial, &vtmp, memctx );
463 fstr->bv_len += vtmp.bv_len;
464 fstr->bv_val = ber_memrealloc_x( fstr->bv_val, fstr->bv_len + 1, memctx );
466 snprintf( &fstr->bv_val[len - 2], vtmp.bv_len + 3,
467 /* "(attr=" */ "%s*)",
468 vtmp.bv_len ? vtmp.bv_val : "" );
470 ber_memfree_x( vtmp.bv_val, memctx );
473 if ( f->f_sub_any != NULL ) {
474 for ( i = 0; !BER_BVISNULL( &f->f_sub_any[i] ); i++ ) {
476 filter_escape_value_x( &f->f_sub_any[i], &vtmp, memctx );
478 fstr->bv_len += vtmp.bv_len + 1;
479 fstr->bv_val = ber_memrealloc_x( fstr->bv_val, fstr->bv_len + 1, memctx );
481 snprintf( &fstr->bv_val[len - 1], vtmp.bv_len + 3,
482 /* "(attr=[init]*[any*]" */ "%s*)",
483 vtmp.bv_len ? vtmp.bv_val : "" );
484 ber_memfree_x( vtmp.bv_val, memctx );
488 if ( !BER_BVISNULL( &f->f_sub_final ) ) {
491 filter_escape_value_x( &f->f_sub_final, &vtmp, memctx );
493 fstr->bv_len += vtmp.bv_len;
494 fstr->bv_val = ber_memrealloc_x( fstr->bv_val, fstr->bv_len + 1, memctx );
496 snprintf( &fstr->bv_val[len - 1], vtmp.bv_len + 3,
497 /* "(attr=[init*][any*]" */ "%s)",
498 vtmp.bv_len ? vtmp.bv_val : "" );
500 ber_memfree_x( vtmp.bv_val, memctx );
505 case LDAP_FILTER_PRESENT:
506 if ( map_attr_value( dc, f->f_desc, &atmp,
507 NULL, NULL, remap, memctx ) )
512 fstr->bv_len = atmp.bv_len + ( STRLENOF( "(=*)" ) );
513 fstr->bv_val = ber_memalloc_x( fstr->bv_len + 1, memctx );
515 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s=*)",
519 case LDAP_FILTER_AND:
521 case LDAP_FILTER_NOT:
522 fstr->bv_len = STRLENOF( "(%)" );
523 fstr->bv_val = ber_memalloc_x( fstr->bv_len + 128, memctx ); /* FIXME: why 128? */
525 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%c)",
526 f->f_choice == LDAP_FILTER_AND ? '&' :
527 f->f_choice == LDAP_FILTER_OR ? '|' : '!' );
529 for ( p = f->f_list; p != NULL; p = p->f_next ) {
534 rc = ldap_back_int_filter_map_rewrite( dc, p, &vtmp, remap, memctx );
535 if ( rc != LDAP_SUCCESS ) {
539 fstr->bv_len += vtmp.bv_len;
540 fstr->bv_val = ber_memrealloc_x( fstr->bv_val, fstr->bv_len + 1, memctx );
542 snprintf( &fstr->bv_val[len-1], vtmp.bv_len + 2,
543 /*"("*/ "%s)", vtmp.bv_len ? vtmp.bv_val : "" );
545 ber_memfree_x( vtmp.bv_val, memctx );
550 case LDAP_FILTER_EXT:
551 if ( f->f_mr_desc ) {
552 if ( map_attr_value( dc, f->f_mr_desc, &atmp,
553 &f->f_mr_value, &vtmp, remap, memctx ) )
559 BER_BVSTR( &atmp, "" );
560 filter_escape_value_x( &f->f_mr_value, &vtmp, memctx );
563 /* FIXME: cleanup (less ?: operators...) */
564 fstr->bv_len = atmp.bv_len +
565 ( f->f_mr_dnattrs ? STRLENOF( ":dn" ) : 0 ) +
566 ( !BER_BVISEMPTY( &f->f_mr_rule_text ) ? f->f_mr_rule_text.bv_len + 1 : 0 ) +
567 vtmp.bv_len + ( STRLENOF( "(:=)" ) );
568 fstr->bv_val = ber_memalloc_x( fstr->bv_len + 1, memctx );
570 snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s%s%s%s:=%s)",
572 f->f_mr_dnattrs ? ":dn" : "",
573 !BER_BVISEMPTY( &f->f_mr_rule_text ) ? ":" : "",
574 !BER_BVISEMPTY( &f->f_mr_rule_text ) ? f->f_mr_rule_text.bv_val : "",
575 vtmp.bv_len ? vtmp.bv_val : "" );
576 ber_memfree_x( vtmp.bv_val, memctx );
579 case SLAPD_FILTER_COMPUTED:
580 switch ( f->f_result ) {
581 /* FIXME: treat UNDEFINED as FALSE */
582 case SLAPD_COMPARE_UNDEFINED:
584 if ( META_BACK_TGT_NOUNDEFFILTER( dc->target ) ) {
585 return LDAP_COMPARE_FALSE;
589 case LDAP_COMPARE_FALSE:
590 if ( META_BACK_TGT_T_F( dc->target ) ) {
591 tmp = &ber_bvtf_false;
597 case LDAP_COMPARE_TRUE:
598 if ( META_BACK_TGT_T_F( dc->target ) ) {
599 tmp = &ber_bvtf_true;
611 ber_dupbv_x( fstr, tmp, memctx );
615 ber_dupbv_x( fstr, &ber_bvunknown, memctx );
623 ldap_back_filter_map_rewrite(
633 static char *dmy = "";
635 rc = ldap_back_int_filter_map_rewrite( dc, f, fstr, remap, memctx );
637 #ifdef ENABLE_REWRITE
638 if ( rc != LDAP_SUCCESS ) {
645 fdc.ctx = "searchFilter";
647 switch ( rewrite_session( fdc.target->mt_rwmap.rwm_rw, fdc.ctx,
648 ( !BER_BVISEMPTY( &ftmp ) ? ftmp.bv_val : dmy ),
649 fdc.conn, &fstr->bv_val ) )
651 case REWRITE_REGEXEC_OK:
652 if ( !BER_BVISNULL( fstr ) ) {
653 fstr->bv_len = strlen( fstr->bv_val );
658 Debug( LDAP_DEBUG_ARGS,
659 "[rw] %s: \"%s\" -> \"%s\"\n",
660 fdc.ctx, BER_BVISNULL( &ftmp ) ? "" : ftmp.bv_val,
661 BER_BVISNULL( fstr ) ? "" : fstr->bv_val );
665 case REWRITE_REGEXEC_UNWILLING:
667 fdc.rs->sr_err = LDAP_UNWILLING_TO_PERFORM;
668 fdc.rs->sr_text = "Operation not allowed";
670 rc = LDAP_UNWILLING_TO_PERFORM;
673 case REWRITE_REGEXEC_ERR:
675 fdc.rs->sr_err = LDAP_OTHER;
676 fdc.rs->sr_text = "Rewrite error";
682 if ( fstr->bv_val == dmy ) {
685 } else if ( fstr->bv_val != ftmp.bv_val ) {
686 /* NOTE: need to realloc mapped filter on slab
687 * and free the original one, until librewrite
690 ber_dupbv_x( &ftmp, fstr, memctx );
691 ch_free( fstr->bv_val );
694 #endif /* ENABLE_REWRITE */
700 ldap_back_referral_result_rewrite(
708 assert( dc != NULL );
709 assert( a_vals != NULL );
711 for ( last = 0; !BER_BVISNULL( &a_vals[ last ] ); last++ )
715 for ( i = 0; !BER_BVISNULL( &a_vals[ i ] ); i++ ) {
721 rc = ldap_url_parse( a_vals[ i ].bv_val, &ludp );
722 if ( rc != LDAP_URL_SUCCESS ) {
723 /* leave attr untouched if massage failed */
727 /* FIXME: URLs like "ldap:///dc=suffix" if passed
728 * thru ldap_url_parse() and ldap_url_desc2str()
729 * get rewritten as "ldap:///dc=suffix??base";
730 * we don't want this to occur... */
731 if ( ludp->lud_scope == LDAP_SCOPE_BASE ) {
732 ludp->lud_scope = LDAP_SCOPE_DEFAULT;
735 ber_str2bv( ludp->lud_dn, 0, 0, &olddn );
737 rc = ldap_back_dn_massage( dc, &olddn, &dn );
739 case LDAP_UNWILLING_TO_PERFORM:
741 * FIXME: need to check if it may be considered
742 * legal to trim values when adding/modifying;
743 * it should be when searching (e.g. ACLs).
745 LBER_FREE( a_vals[ i ].bv_val );
747 a_vals[ i ] = a_vals[ last ];
749 BER_BVZERO( &a_vals[ last ] );
755 /* leave attr untouched if massage failed */
756 if ( !BER_BVISNULL( &dn ) && olddn.bv_val != dn.bv_val )
760 ludp->lud_dn = dn.bv_val;
761 newurl = ldap_url_desc2str( ludp );
763 if ( newurl == NULL ) {
764 /* FIXME: leave attr untouched
765 * even if ldap_url_desc2str failed...
770 ber_memfree_x( a_vals[ i ].bv_val, memctx );
771 ber_str2bv_x( newurl, 0, 1, &a_vals[ i ], memctx );
773 ludp->lud_dn = olddn.bv_val;
778 ldap_free_urldesc( ludp );
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
800 assert( a_vals != NULL );
802 for ( last = 0; !BER_BVISNULL( &a_vals[last] ); last++ )
806 for ( i = 0; !BER_BVISNULL( &a_vals[i] ); i++ ) {
807 switch ( ldap_back_dn_massage( dc, &a_vals[i], &bv ) ) {
808 case LDAP_UNWILLING_TO_PERFORM:
810 * FIXME: need to check if it may be considered
811 * legal to trim values when adding/modifying;
812 * it should be when searching (e.g. ACLs).
814 ch_free( a_vals[i].bv_val );
816 a_vals[i] = a_vals[last];
818 BER_BVZERO( &a_vals[last] );
823 /* leave attr untouched if massage failed */
824 if ( !BER_BVISNULL( &bv ) && bv.bv_val != a_vals[i].bv_val ) {
825 ch_free( a_vals[i].bv_val );
836 ldap_dnattr_result_rewrite(
844 assert( a_vals != NULL );
846 for ( last = 0; !BER_BVISNULL( &a_vals[last] ); last++ )
850 for ( i = 0; !BER_BVISNULL( &a_vals[i] ); i++ ) {
851 switch ( ldap_back_dn_massage( dc, &a_vals[i], &bv ) ) {
852 case LDAP_UNWILLING_TO_PERFORM:
854 * FIXME: need to check if it may be considered
855 * legal to trim values when adding/modifying;
856 * it should be when searching (e.g. ACLs).
858 LBER_FREE( a_vals[i].bv_val );
860 a_vals[i] = a_vals[last];
862 BER_BVZERO( &a_vals[last] );
867 /* leave attr untouched if massage failed */
868 if ( !BER_BVISNULL( &bv ) && a_vals[i].bv_val != bv.bv_val ) {
869 LBER_FREE( a_vals[i].bv_val );