/* * Copyright 1998-2001 The OpenLDAP Foundation, All Rights Reserved. * COPYING RESTRICTIONS APPLY, see COPYRIGHT file * * Copyright 2001, Pierangelo Masarati, All rights reserved. * * This work has been developed to fulfill the requirements * of SysNet s.n.c. and it has been donated * to the OpenLDAP Foundation in the hope that it may be useful * to the Open Source community, but WITHOUT ANY WARRANTY. * * Permission is granted to anyone to use this software for any purpose * on any computer system, and to alter it and redistribute it, subject * to the following restrictions: * * 1. The author and SysNet s.n.c. are not responsible for the consequences * of use of this software, no matter how awful, even if they arise from * flaws in it. * * 2. The origin of this software must not be misrepresented, either by * explicit claim or by omission. Since few users ever read sources, * credits should appear in the documentation. * * 3. Altered versions must be plainly marked as such, and must not be * misrepresented as being the original software. Since few users * ever read sources, credits should appear in the documentation. * SysNet s.n.c. cannot be responsible for the consequences of the * alterations. * * 4. This notice may not be removed or altered. * * * This software is based on the backend back-ldap, implemented * by Howard Chu , and modified by Mark Valence * , Pierangelo Masarati and other * contributors. The contribution of the original software to the present * implementation is acknowledged in this copyright statement. * * A special acknowledgement goes to Howard for the overall architecture * (and for borrowing large pieces of code), and to Mark, who implemented * from scratch the attribute/objectclass mapping. * * The original copyright statement follows. * * Copyright 1999, Howard Chu, All rights reserved. * * Permission is granted to anyone to use this software for any purpose * on any computer system, and to alter it and redistribute it, subject * to the following restrictions: * * 1. The author is not responsible for the consequences of use of this * software, no matter how awful, even if they arise from flaws in it. * * 2. The origin of this software must not be misrepresented, either by * explicit claim or by omission. Since few users ever read sources, * credits should appear in the documentation. * * 3. Altered versions must be plainly marked as such, and must not be * misrepresented as being the original software. Since few users * ever read sources, credits should appear in the * documentation. * * 4. This notice may not be removed or altered. * */ #include "portable.h" #include #include #include #include "slap.h" #include "../back-ldap/back-ldap.h" #include "back-meta.h" int meta_back_add( Backend *be, Connection *conn, Operation *op, Entry *e ) { struct metainfo *li = ( struct metainfo * )be->be_private; struct metaconn *lc; int i, candidate = -1; Attribute *a; LDAPMod **attrs; char *mdn = NULL, *mapped; #ifdef NEW_LOGGING LDAP_LOG(( "backend", LDAP_LEVEL_ENTRY, "meta_back_add: %s\n", e->e_dn )); #else /* !NEW_LOGGING */ Debug(LDAP_DEBUG_ARGS, "==> meta_back_add: %s\n%s%s", e->e_dn, "", ""); #endif /* !NEW_LOGGING */ /* * get the current connection */ lc = meta_back_getconn( li, conn, op, META_OP_REQUIRE_SINGLE, e->e_ndn, &candidate ); if ( !lc || !meta_back_dobind( lc, op ) ) { return -1; } /* * Rewrite the add dn, if needed */ switch ( rewrite_session( li->targets[ candidate ]->rwinfo, "addDn", e->e_dn, conn, &mdn )) { case REWRITE_REGEXEC_OK: if ( mdn == NULL ) { mdn = e->e_dn; } #ifdef NEW_LOGGING LDAP_LOG(( "backend", LDAP_LEVEL_DETAIL1, "[rw] addDn: \"%s\" -> \"%s\"\n", e->e_dn, mdn )); #else /* !NEW_LOGGING */ Debug( LDAP_DEBUG_ARGS, "rw> addDn: \"%s\" -> \"%s\"\n%s", e->e_dn, mdn, "" ); #endif /* !NEW_LOGGING */ break; case REWRITE_REGEXEC_UNWILLING: send_ldap_result( conn, op, LDAP_UNWILLING_TO_PERFORM, NULL, "Unwilling to perform", NULL, NULL ); return -1; case REWRITE_REGEXEC_ERR: send_ldap_result( conn, op, LDAP_OPERATIONS_ERROR, NULL, "Operations error", NULL, NULL ); return -1; } /* Count number of attributes in entry */ for ( i = 1, a = e->e_attrs; a; i++, a = a->a_next ); /* Create array of LDAPMods for ldap_add() */ attrs = ch_malloc( sizeof( LDAPMod * )*i ); for ( i = 0, a = e->e_attrs; a; a = a->a_next ) { /* * lastmod should always be , so that * creation/modification operational attrs * of the target directory are used, if available */ #if 0 if ( !strcasecmp( a->a_desc->ad_cname->bv_val, slap_schema.si_ad_creatorsName->ad_cname->bv_val ) || !strcasecmp( a->a_desc->ad_cname->bv_val, slap_schema.si_ad_createTimestamp->ad_cname->bv_val ) || !strcasecmp( a->a_desc->ad_cname->bv_val, slap_schema.si_ad_modifiersName->ad_cname->bv_val ) || !strcasecmp( a->a_desc->ad_cname->bv_val, slap_schema.si_ad_modifyTimestamp->ad_cname->bv_val ) ) { continue; } #endif mapped = ldap_back_map( &li->targets[ candidate ]->at_map, a->a_desc->ad_cname->bv_val, 0); if ( mapped == NULL ) { continue; } attrs[ i ] = ch_malloc( sizeof( LDAPMod ) ); if ( attrs[ i ] == NULL ) { continue; } attrs[ i ]->mod_op = LDAP_MOD_BVALUES; attrs[ i ]->mod_type = mapped; /* * FIXME: dn-valued attrs should be rewritten * to allow their use in ACLs at the back-ldap * level. */ if ( strcmp( a->a_desc->ad_type->sat_syntax->ssyn_oid, SLAPD_DN_SYNTAX ) == 0 ) { ldap_dnattr_rewrite( li->targets[ candidate ]->rwinfo, a->a_vals, conn ); } attrs[ i ]->mod_vals.modv_bvals = a->a_vals; i++; } attrs[ i ] = NULL; ldap_add_s( lc->conns[ candidate ]->ld, mdn, attrs ); for ( --i; i >= 0; --i ) { free( attrs[ i ] ); } free( attrs ); if ( mdn != e->e_dn ) { free( mdn ); } return meta_back_op_result( lc, op ); }