/* $OpenLDAP$ */ /* * Copyright 1998-2003 The OpenLDAP Foundation, All Rights Reserved. * COPYING RESTRICTIONS APPLY, see COPYRIGHT file */ /* * Copyright (c) 1995 Regents of the University of Michigan. * All rights reserved. * * Redistribution and use in source and binary forms are permitted * provided that this notice is preserved and that due credit is given * to the University of Michigan at Ann Arbor. The name of the University * may not be used to endorse or promote products derived from this * software without specific prior written permission. This software * is provided ``as is'' without express or implied warranty. */ #include "portable.h" #include "slapi_common.h" #include #include #include #include #include "lutil.h" #include "ldap_pvt.h" #include "slap.h" #include "slapi.h" #ifdef LDAP_SLAPI static LDAPMod **Modifications2LDAPMods (Modifications **modlist); static Modifications *LDAPMods2Modifications (LDAPMod **mods); static void FreeLDAPMods (LDAPMod **mods); #endif /* LDAP_SLAPI */ int do_modify( Connection *conn, Operation *op ) { struct berval dn = { 0, NULL }; struct berval pdn = { 0, NULL }; struct berval ndn = { 0, NULL }; char *last; ber_tag_t tag; ber_len_t len; Modifications *modlist = NULL; Modifications **modtail = &modlist; #ifdef LDAP_SLAPI LDAPMod **modv = NULL; #endif #ifdef LDAP_DEBUG Modifications *tmp; #endif Backend *be; int rc; const char *text; int manageDSAit; Slapi_PBlock *pb = op->o_pb; #ifdef NEW_LOGGING LDAP_LOG( OPERATION, ENTRY, "do_modify: enter\n", 0, 0, 0 ); #else Debug( LDAP_DEBUG_TRACE, "do_modify\n", 0, 0, 0 ); #endif /* * Parse the modify request. It looks like this: * * ModifyRequest := [APPLICATION 6] SEQUENCE { * name DistinguishedName, * mods SEQUENCE OF SEQUENCE { * operation ENUMERATED { * add (0), * delete (1), * replace (2) * }, * modification SEQUENCE { * type AttributeType, * values SET OF AttributeValue * } * } * } */ if ( ber_scanf( op->o_ber, "{m" /*}*/, &dn ) == LBER_ERROR ) { #ifdef NEW_LOGGING LDAP_LOG( OPERATION, ERR, "do_modify: ber_scanf failed\n", 0, 0, 0 ); #else Debug( LDAP_DEBUG_ANY, "do_modify: ber_scanf failed\n", 0, 0, 0 ); #endif send_ldap_disconnect( conn, op, LDAP_PROTOCOL_ERROR, "decoding error" ); return SLAPD_DISCONNECT; } #ifdef NEW_LOGGING LDAP_LOG( OPERATION, ARGS, "do_modify: dn (%s)\n", dn.bv_val, 0, 0 ); #else Debug( LDAP_DEBUG_ARGS, "do_modify: dn (%s)\n", dn.bv_val, 0, 0 ); #endif /* collect modifications & save for later */ for ( tag = ber_first_element( op->o_ber, &len, &last ); tag != LBER_DEFAULT; tag = ber_next_element( op->o_ber, &len, last ) ) { ber_int_t mop; Modifications tmp, *mod; if ( ber_scanf( op->o_ber, "{i{m[W]}}", &mop, &tmp.sml_type, &tmp.sml_bvalues ) == LBER_ERROR ) { send_ldap_disconnect( conn, op, LDAP_PROTOCOL_ERROR, "decoding modlist error" ); rc = SLAPD_DISCONNECT; goto cleanup; } mod = (Modifications *) ch_malloc( sizeof(Modifications) ); mod->sml_op = mop; mod->sml_type = tmp.sml_type; mod->sml_bvalues = tmp.sml_bvalues; mod->sml_desc = NULL; mod->sml_next = NULL; *modtail = mod; switch( mop ) { case LDAP_MOD_ADD: if ( mod->sml_bvalues == NULL ) { #ifdef NEW_LOGGING LDAP_LOG( OPERATION, ERR, "do_modify: modify/add operation (%ld) requires values\n", (long)mop, 0, 0 ); #else Debug( LDAP_DEBUG_ANY, "do_modify: modify/add operation (%ld) requires values\n", (long) mop, 0, 0 ); #endif send_ldap_result( conn, op, LDAP_PROTOCOL_ERROR, NULL, "modify/add operation requires values", NULL, NULL ); rc = LDAP_PROTOCOL_ERROR; goto cleanup; } /* fall through */ case LDAP_MOD_DELETE: case LDAP_MOD_REPLACE: break; default: { #ifdef NEW_LOGGING LDAP_LOG( OPERATION, ERR, "do_modify: invalid modify operation (%ld)\n", (long)mop, 0, 0 ); #else Debug( LDAP_DEBUG_ANY, "do_modify: invalid modify operation (%ld)\n", (long) mop, 0, 0 ); #endif send_ldap_result( conn, op, LDAP_PROTOCOL_ERROR, NULL, "unrecognized modify operation", NULL, NULL ); rc = LDAP_PROTOCOL_ERROR; goto cleanup; } } modtail = &mod->sml_next; } *modtail = NULL; if( (rc = get_ctrls( conn, op, 1 )) != LDAP_SUCCESS ) { #ifdef NEW_LOGGING LDAP_LOG( OPERATION, ERR, "do_modify: get_ctrls failed\n", 0, 0, 0 ); #else Debug( LDAP_DEBUG_ANY, "do_modify: get_ctrls failed\n", 0, 0, 0 ); #endif goto cleanup; } rc = dnPrettyNormal( NULL, &dn, &pdn, &ndn ); if( rc != LDAP_SUCCESS ) { #ifdef NEW_LOGGING LDAP_LOG( OPERATION, INFO, "do_modify: conn %d invalid dn (%s)\n", conn->c_connid, dn.bv_val, 0 ); #else Debug( LDAP_DEBUG_ANY, "do_modify: invalid dn (%s)\n", dn.bv_val, 0, 0 ); #endif send_ldap_result( conn, op, rc = LDAP_INVALID_DN_SYNTAX, NULL, "invalid DN", NULL, NULL ); goto cleanup; } if( ndn.bv_len == 0 ) { #ifdef NEW_LOGGING LDAP_LOG( OPERATION, ERR, "do_modify: attempt to modify root DSE.\n",0, 0, 0 ); #else Debug( LDAP_DEBUG_ANY, "do_modify: root dse!\n", 0, 0, 0 ); #endif send_ldap_result( conn, op, rc = LDAP_UNWILLING_TO_PERFORM, NULL, "modify upon the root DSE not supported", NULL, NULL ); goto cleanup; } else if ( bvmatch( &ndn, &global_schemandn ) ) { #ifdef NEW_LOGGING LDAP_LOG( OPERATION, ERR, "do_modify: attempt to modify subschema subentry.\n" , 0, 0, 0 ); #else Debug( LDAP_DEBUG_ANY, "do_modify: subschema subentry!\n", 0, 0, 0 ); #endif send_ldap_result( conn, op, rc = LDAP_UNWILLING_TO_PERFORM, NULL, "modification of subschema subentry not supported", NULL, NULL ); goto cleanup; } #ifdef LDAP_DEBUG #ifdef NEW_LOGGING LDAP_LOG( OPERATION, DETAIL1, "do_modify: modifications:\n", 0, 0, 0 ); #else Debug( LDAP_DEBUG_ARGS, "modifications:\n", 0, 0, 0 ); #endif for ( tmp = modlist; tmp != NULL; tmp = tmp->sml_next ) { #ifdef NEW_LOGGING LDAP_LOG( OPERATION, DETAIL1, "\t%s: %s\n", tmp->sml_op == LDAP_MOD_ADD ? "add" : (tmp->sml_op == LDAP_MOD_DELETE ? "delete" : "replace"), tmp->sml_type.bv_val, 0 ); if ( tmp->sml_bvalues == NULL ) { LDAP_LOG( OPERATION, DETAIL1, "\t\tno values", 0, 0, 0 ); } else if ( tmp->sml_bvalues[0].bv_val == NULL ) { LDAP_LOG( OPERATION, DETAIL1, "\t\tzero values", 0, 0, 0 ); } else if ( tmp->sml_bvalues[1].bv_val == NULL ) { LDAP_LOG( OPERATION, DETAIL1, "\t\tone value", 0, 0, 0 ); } else { LDAP_LOG( OPERATION, DETAIL1, "\t\tmultiple values", 0, 0, 0 ); } #else Debug( LDAP_DEBUG_ARGS, "\t%s: %s\n", tmp->sml_op == LDAP_MOD_ADD ? "add" : (tmp->sml_op == LDAP_MOD_DELETE ? "delete" : "replace"), tmp->sml_type.bv_val, 0 ); if ( tmp->sml_bvalues == NULL ) { Debug( LDAP_DEBUG_ARGS, "%s\n", "\t\tno values", NULL, NULL ); } else if ( tmp->sml_bvalues[0].bv_val == NULL ) { Debug( LDAP_DEBUG_ARGS, "%s\n", "\t\tzero values", NULL, NULL ); } else if ( tmp->sml_bvalues[1].bv_val == NULL ) { Debug( LDAP_DEBUG_ARGS, "%s, length %ld\n", "\t\tone value", (long) tmp->sml_bvalues[0].bv_len, NULL ); } else { Debug( LDAP_DEBUG_ARGS, "%s\n", "\t\tmultiple values", NULL, NULL ); } #endif } #endif if ( StatslogTest( LDAP_DEBUG_STATS ) ) { char abuf[BUFSIZ/2], *ptr = abuf; int len = 0; Statslog( LDAP_DEBUG_STATS, "conn=%lu op=%lu MOD dn=\"%s\"\n", op->o_connid, op->o_opid, dn.bv_val, 0, 0 ); for ( tmp = modlist; tmp != NULL; tmp = tmp->sml_next ) { if (len + 1 + tmp->sml_type.bv_len > sizeof(abuf)) { Statslog( LDAP_DEBUG_STATS, "conn=%lu op=%lu MOD attr=%s\n", op->o_connid, op->o_opid, abuf, 0, 0 ); len = 0; ptr = abuf; } if (len) { *ptr++ = ' '; len++; } ptr = lutil_strcopy(ptr, tmp->sml_type.bv_val); len += tmp->sml_type.bv_len; } if (len) { Statslog( LDAP_DEBUG_STATS, "conn=%lu op=%lu MOD attr=%s\n", op->o_connid, op->o_opid, abuf, 0, 0 ); } } manageDSAit = get_manageDSAit( op ); /* * We could be serving multiple database backends. Select the * appropriate one, or send a referral to our "referral server" * if we don't hold it. */ if ( (be = select_backend( &ndn, manageDSAit, 0 )) == NULL ) { BerVarray ref = referral_rewrite( default_referral, NULL, &pdn, LDAP_SCOPE_DEFAULT ); send_ldap_result( conn, op, rc = LDAP_REFERRAL, NULL, NULL, ref ? ref : default_referral, NULL ); ber_bvarray_free( ref ); goto cleanup; } /* check restrictions */ rc = backend_check_restrictions( be, conn, op, NULL, &text ) ; if( rc != LDAP_SUCCESS ) { send_ldap_result( conn, op, rc, NULL, text, NULL, NULL ); goto cleanup; } /* check for referrals */ rc = backend_check_referrals( be, conn, op, &pdn, &ndn ); if ( rc != LDAP_SUCCESS ) { goto cleanup; } /* deref suffix alias if appropriate */ suffix_alias( be, &ndn ); #if defined( LDAP_SLAPI ) slapi_x_backend_set_pb( pb, be ); slapi_x_connection_set_pb( pb, conn ); slapi_x_operation_set_pb( pb, op ); slapi_pblock_set( pb, SLAPI_MODIFY_TARGET, (void *)dn.bv_val ); slapi_pblock_set( pb, SLAPI_MANAGEDSAIT, (void *)(1) ); modv = Modifications2LDAPMods( &modlist ); slapi_pblock_set( pb, SLAPI_MODIFY_MODS, (void *)modv ); rc = doPluginFNs( be, SLAPI_PLUGIN_PRE_MODIFY_FN, pb ); if ( rc != 0 ) { /* * A preoperation plugin failure will abort the * entire operation. */ #ifdef NEW_LOGGING LDAP_LOG( OPERATION, INFO, "do_modify: modify preoperation plugin " "failed\n", 0, 0, 0 ); #else Debug(LDAP_DEBUG_TRACE, "do_modify: modify preoperation plugin failed.\n", 0, 0, 0); #endif if ( slapi_pblock_get( pb, SLAPI_RESULT_CODE, (void *)&rc ) != 0) { rc = LDAP_OPERATIONS_ERROR; } ldap_mods_free( modv, 1 ); modv = NULL; goto cleanup; } /* * It's possible that the preoperation plugin changed the * modification array, so we need to convert it back to * a Modification list. * * Calling Modifications2LDAPMods() destroyed modlist so * we don't need to free it. */ slapi_pblock_get( pb, SLAPI_MODIFY_MODS, (void **)&modv ); modlist = LDAPMods2Modifications( modv ); #endif /* defined( LDAP_SLAPI ) */ /* * do the modify if 1 && (2 || 3) * 1) there is a modify function implemented in this backend; * 2) this backend is master for what it holds; * 3) it's a replica and the dn supplied is the update_ndn. */ if ( be->be_modify ) { /* do the update here */ int repl_user = be_isupdate( be, &op->o_ndn ); #ifndef SLAPD_MULTIMASTER /* Multimaster slapd does not have to check for replicator dn * because it accepts each modify request */ if ( !be->be_update_ndn.bv_len || repl_user ) #endif { int update = be->be_update_ndn.bv_len; const char *text; char textbuf[SLAP_TEXT_BUFLEN]; size_t textlen = sizeof textbuf; rc = slap_mods_check( modlist, update, &text, textbuf, textlen ); if( rc != LDAP_SUCCESS ) { send_ldap_result( conn, op, rc, NULL, text, NULL, NULL ); goto cleanup; } if ( !repl_user ) { for( modtail = &modlist; *modtail != NULL; modtail = &(*modtail)->sml_next ) { /* empty */ } rc = slap_mods_opattrs( be, op, modlist, modtail, &text, textbuf, textlen ); if( rc != LDAP_SUCCESS ) { send_ldap_result( conn, op, rc, NULL, text, NULL, NULL ); goto cleanup; } } if ( (*be->be_modify)( be, conn, op, &pdn, &ndn, modlist ) == 0 #ifdef SLAPD_MULTIMASTER && !repl_user #endif ) { /* but we log only the ones not from a replicator user */ replog( be, op, &pdn, &ndn, modlist ); } #ifndef SLAPD_MULTIMASTER /* send a referral */ } else { BerVarray defref = be->be_update_refs ? be->be_update_refs : default_referral; BerVarray ref = referral_rewrite( defref, NULL, &pdn, LDAP_SCOPE_DEFAULT ); send_ldap_result( conn, op, rc = LDAP_REFERRAL, NULL, NULL, ref ? ref : defref, NULL ); ber_bvarray_free( ref ); #endif } } else { send_ldap_result( conn, op, rc = LDAP_UNWILLING_TO_PERFORM, NULL, "operation not supported within namingContext", NULL, NULL ); } #if defined( LDAP_SLAPI ) if ( doPluginFNs( be, SLAPI_PLUGIN_POST_MODIFY_FN, pb ) != 0 ) { #ifdef NEW_LOGGING LDAP_LOG( OPERATION, INFO, "do_modify: modify postoperation plugins " "failed\n", 0, 0, 0 ); #else Debug(LDAP_DEBUG_TRACE, "do_modify: modify postoperation plugins " "failed.\n", 0, 0, 0); #endif } #endif /* defined( LDAP_SLAPI ) */ cleanup: free( pdn.bv_val ); free( ndn.bv_val ); if ( modlist != NULL ) slap_mods_free( modlist ); #if defined( LDAP_SLAPI ) if ( modv != NULL ) FreeLDAPMods( modv ); #endif return rc; } /* * Do basic attribute type checking and syntax validation. */ int slap_mods_check( Modifications *ml, int update, const char **text, char *textbuf, size_t textlen ) { int rc; for( ; ml != NULL; ml = ml->sml_next ) { AttributeDescription *ad = NULL; /* convert to attribute description */ rc = slap_bv2ad( &ml->sml_type, &ml->sml_desc, text ); if( rc != LDAP_SUCCESS ) { snprintf( textbuf, textlen, "%s: %s", ml->sml_type.bv_val, *text ); *text = textbuf; return rc; } ad = ml->sml_desc; if( slap_syntax_is_binary( ad->ad_type->sat_syntax ) && !slap_ad_is_binary( ad )) { /* attribute requires binary transfer */ snprintf( textbuf, textlen, "%s: requires ;binary transfer", ml->sml_type.bv_val ); *text = textbuf; return LDAP_UNDEFINED_TYPE; } if( !slap_syntax_is_binary( ad->ad_type->sat_syntax ) && slap_ad_is_binary( ad )) { /* attribute requires binary transfer */ snprintf( textbuf, textlen, "%s: disallows ;binary transfer", ml->sml_type.bv_val ); *text = textbuf; return LDAP_UNDEFINED_TYPE; } if( slap_ad_is_tag_range( ad )) { /* attribute requires binary transfer */ snprintf( textbuf, textlen, "%s: inappropriate use of tag range option", ml->sml_type.bv_val ); *text = textbuf; return LDAP_UNDEFINED_TYPE; } if (!update && is_at_no_user_mod( ad->ad_type )) { /* user modification disallowed */ snprintf( textbuf, textlen, "%s: no user modification allowed", ml->sml_type.bv_val ); *text = textbuf; return LDAP_CONSTRAINT_VIOLATION; } if ( is_at_obsolete( ad->ad_type ) && ( ml->sml_op == LDAP_MOD_ADD || ml->sml_bvalues != NULL ) ) { /* * attribute is obsolete, * only allow replace/delete with no values */ snprintf( textbuf, textlen, "%s: attribute is obsolete", ml->sml_type.bv_val ); *text = textbuf; return LDAP_CONSTRAINT_VIOLATION; } /* * check values */ if( ml->sml_bvalues != NULL ) { ber_len_t nvals; slap_syntax_validate_func *validate = ad->ad_type->sat_syntax->ssyn_validate; slap_syntax_transform_func *pretty = ad->ad_type->sat_syntax->ssyn_pretty; if( !pretty && !validate ) { *text = "no validator for syntax"; snprintf( textbuf, textlen, "%s: no validator for syntax %s", ml->sml_type.bv_val, ad->ad_type->sat_syntax->ssyn_oid ); *text = textbuf; return LDAP_INVALID_SYNTAX; } /* * check that each value is valid per syntax * and pretty if appropriate */ for( nvals = 0; ml->sml_bvalues[nvals].bv_val; nvals++ ) { struct berval pval; if( pretty ) { rc = pretty( ad->ad_type->sat_syntax, &ml->sml_bvalues[nvals], &pval ); } else { rc = validate( ad->ad_type->sat_syntax, &ml->sml_bvalues[nvals] ); } if( rc != 0 ) { snprintf( textbuf, textlen, "%s: value #%ld invalid per syntax", ml->sml_type.bv_val, (long) nvals ); *text = textbuf; return LDAP_INVALID_SYNTAX; } if( pretty ) { ber_memfree( ml->sml_bvalues[nvals].bv_val ); ml->sml_bvalues[nvals] = pval; } } /* * a rough single value check... an additional check is needed * to catch add of single value to existing single valued attribute */ if( ( ml->sml_op == LDAP_MOD_ADD || ml->sml_op == LDAP_MOD_REPLACE ) && nvals > 1 && is_at_single_value( ad->ad_type )) { snprintf( textbuf, textlen, "%s: multiple value provided", ml->sml_type.bv_val ); *text = textbuf; return LDAP_CONSTRAINT_VIOLATION; } } } return LDAP_SUCCESS; } int slap_mods_opattrs( Backend *be, Operation *op, Modifications *mods, Modifications **modtail, const char **text, char *textbuf, size_t textlen ) { struct berval name, timestamp, csn; char timebuf[ LDAP_LUTIL_GENTIME_BUFSIZE ]; char csnbuf[ LDAP_LUTIL_CSNSTR_BUFSIZE ]; Modifications *mod; int mop = op->o_tag == LDAP_REQ_ADD ? LDAP_MOD_ADD : LDAP_MOD_REPLACE; assert( modtail != NULL ); assert( *modtail == NULL ); if( SLAP_LASTMOD(be) ) { struct tm *ltm; time_t now = slap_get_time(); ldap_pvt_thread_mutex_lock( &gmtime_mutex ); ltm = gmtime( &now ); lutil_gentime( timebuf, sizeof(timebuf), ltm ); csn.bv_len = lutil_csnstr( csnbuf, sizeof( csnbuf ), 0, 0 ); ldap_pvt_thread_mutex_unlock( &gmtime_mutex ); csn.bv_val = csnbuf; timestamp.bv_val = timebuf; timestamp.bv_len = strlen(timebuf); if( op->o_dn.bv_len == 0 ) { name.bv_val = SLAPD_ANONYMOUS; name.bv_len = sizeof(SLAPD_ANONYMOUS)-1; } else { name = op->o_dn; } } if( op->o_tag == LDAP_REQ_ADD ) { struct berval tmpval; if( global_schemacheck ) { int rc = mods_structural_class( mods, &tmpval, text, textbuf, textlen ); if( rc != LDAP_SUCCESS ) { return rc; } mod = (Modifications *) ch_malloc( sizeof( Modifications ) ); mod->sml_op = mop; mod->sml_type.bv_val = NULL; mod->sml_desc = slap_schema.si_ad_structuralObjectClass; mod->sml_bvalues = (BerVarray) ch_malloc( 2 * sizeof( struct berval ) ); ber_dupbv( &mod->sml_bvalues[0], &tmpval ); mod->sml_bvalues[1].bv_val = NULL; assert( mod->sml_bvalues[0].bv_val ); *modtail = mod; modtail = &mod->sml_next; } if( SLAP_LASTMOD(be) ) { char uuidbuf[ LDAP_LUTIL_UUIDSTR_BUFSIZE ]; tmpval.bv_len = lutil_uuidstr( uuidbuf, sizeof( uuidbuf ) ); tmpval.bv_val = uuidbuf; mod = (Modifications *) ch_malloc( sizeof( Modifications ) ); mod->sml_op = mop; mod->sml_type.bv_val = NULL; mod->sml_desc = slap_schema.si_ad_entryUUID; mod->sml_bvalues = (BerVarray) ch_malloc( 2 * sizeof( struct berval ) ); ber_dupbv( &mod->sml_bvalues[0], &tmpval ); mod->sml_bvalues[1].bv_val = NULL; assert( mod->sml_bvalues[0].bv_val ); *modtail = mod; modtail = &mod->sml_next; mod = (Modifications *) ch_malloc( sizeof( Modifications ) ); mod->sml_op = mop; mod->sml_type.bv_val = NULL; mod->sml_desc = slap_schema.si_ad_creatorsName; mod->sml_bvalues = (BerVarray) ch_malloc( 2 * sizeof( struct berval ) ); ber_dupbv( &mod->sml_bvalues[0], &name ); mod->sml_bvalues[1].bv_val = NULL; assert( mod->sml_bvalues[0].bv_val ); *modtail = mod; modtail = &mod->sml_next; mod = (Modifications *) ch_malloc( sizeof( Modifications ) ); mod->sml_op = mop; mod->sml_type.bv_val = NULL; mod->sml_desc = slap_schema.si_ad_createTimestamp; mod->sml_bvalues = (BerVarray) ch_malloc( 2 * sizeof( struct berval ) ); ber_dupbv( &mod->sml_bvalues[0], ×tamp ); mod->sml_bvalues[1].bv_val = NULL; assert( mod->sml_bvalues[0].bv_val ); *modtail = mod; modtail = &mod->sml_next; } } if( SLAP_LASTMOD(be) ) { mod = (Modifications *) ch_malloc( sizeof( Modifications ) ); mod->sml_op = mop; mod->sml_type.bv_val = NULL; mod->sml_desc = slap_schema.si_ad_entryCSN; mod->sml_bvalues = (BerVarray) ch_malloc( 2 * sizeof( struct berval ) ); ber_dupbv( &mod->sml_bvalues[0], &csn ); mod->sml_bvalues[1].bv_val = NULL; assert( mod->sml_bvalues[0].bv_val ); *modtail = mod; modtail = &mod->sml_next; mod = (Modifications *) ch_malloc( sizeof( Modifications ) ); mod->sml_op = mop; mod->sml_type.bv_val = NULL; mod->sml_desc = slap_schema.si_ad_modifiersName; mod->sml_bvalues = (BerVarray) ch_malloc( 2 * sizeof( struct berval ) ); ber_dupbv( &mod->sml_bvalues[0], &name ); mod->sml_bvalues[1].bv_val = NULL; assert( mod->sml_bvalues[0].bv_val ); *modtail = mod; modtail = &mod->sml_next; mod = (Modifications *) ch_malloc( sizeof( Modifications ) ); mod->sml_op = mop; mod->sml_type.bv_val = NULL; mod->sml_desc = slap_schema.si_ad_modifyTimestamp; mod->sml_bvalues = (BerVarray) ch_malloc( 2 * sizeof( struct berval ) ); ber_dupbv( &mod->sml_bvalues[0], ×tamp ); mod->sml_bvalues[1].bv_val = NULL; assert( mod->sml_bvalues[0].bv_val ); *modtail = mod; modtail = &mod->sml_next; } *modtail = NULL; return LDAP_SUCCESS; } #ifdef LDAP_SLAPI /* * Synthesise an LDAPMod array from a Modifications list to pass * to SLAPI. This synthesis is destructive and as such the * Modifications list may not be used after calling this * function. * * This function must also be called before slap_mods_check(). */ static LDAPMod **Modifications2LDAPMods(Modifications **pmodlist) { Modifications *ml, *modlist; LDAPMod **mods, *modp; int i, j; modlist = *pmodlist; for( i = 0, ml = modlist; ml != NULL; i++, ml = ml->sml_next ) ; mods = (LDAPMod **)ch_malloc( (i + 1) * sizeof(LDAPMod *) ); for( i = 0, ml = modlist; ml != NULL; ml = ml->sml_next ) { modp = mods[i]; modp->mod_op = ml->sml_op | LDAP_MOD_BVALUES; /* Take ownership of original type. */ modp->mod_type = ml->sml_type.bv_val; ml->sml_type.bv_val = NULL; if ( ml->sml_bvalues != NULL ) { for( j = 0; ml->sml_bvalues[j].bv_val != NULL; j++ ) ; modp->mod_bvalues = (struct berval **)ch_malloc( (j + 1) * sizeof(struct berval *) ); for( j = 0; ml->sml_bvalues[j].bv_val != NULL; j++ ) { /* Take ownership of original values. */ modp->mod_bvalues[j] = (struct berval *)ch_malloc( sizeof(struct berval) ); modp->mod_bvalues[j]->bv_len = ml->sml_bvalues[j].bv_len; modp->mod_bvalues[j]->bv_val = ml->sml_bvalues[j].bv_val; ml->sml_bvalues[j].bv_len = 0; ml->sml_bvalues[j].bv_val = NULL; } modp->mod_bvalues[j] = NULL; } else { modp->mod_bvalues = NULL; } i++; } mods[i] = NULL; slap_mods_free( modlist ); *pmodlist = NULL; return mods; } /* * Convert a potentially modified array of LDAPMods back to a * Modification list. * * The returned Modification list contains pointers into the * LDAPMods array; the latter MUST be freed with FreeLDAPMods() * (see below). */ static Modifications *LDAPMods2Modifications (LDAPMod **mods) { Modifications *modlist, **modtail; LDAPMod **modp; modtail = &modlist; for( modp = mods; *modp != NULL; modp++ ) { Modifications *mod; int i; char **p; struct berval **bvp; mod = (Modifications *) ch_malloc( sizeof(Modifications) ); mod->sml_op = (*modp)->mod_op & (~LDAP_MOD_BVALUES); mod->sml_type.bv_val = (*modp)->mod_type; mod->sml_type.bv_len = strlen( mod->sml_type.bv_val ); mod->sml_desc = NULL; mod->sml_next = NULL; if ( (*modp)->mod_op & LDAP_MOD_BVALUES ) { for( i = 0, bvp = (*modp)->mod_bvalues; *bvp != NULL; bvp++, i++ ) ; } else { for( i = 0, p = (*modp)->mod_values; *p != NULL; p++, i++ ) ; } mod->sml_bvalues = (BerVarray) ch_malloc( (i + 1) * sizeof(struct berval) ); /* NB: This implicitly trusts a plugin to return valid modifications. */ if ( (*modp)->mod_op & LDAP_MOD_BVALUES ) { for( i = 0, bvp = (*modp)->mod_bvalues; *bvp != NULL; bvp++, i++ ) { mod->sml_bvalues[i].bv_val = (*bvp)->bv_val; mod->sml_bvalues[i].bv_len = (*bvp)->bv_len; } } else { for( i = 0, p = (*modp)->mod_values; *p != NULL; p++, i++ ) { mod->sml_bvalues[i].bv_val = *p; mod->sml_bvalues[i].bv_len = strlen( *p ); } } mod->sml_bvalues[i].bv_val = NULL; *modtail = mod; modtail = &mod->sml_next; } return modlist; } /* * This function only frees the parts of the mods array that * are not shared with the Modification list that was created * by LDAPMods2Modifications. * */ static void FreeLDAPMods (LDAPMod **mods) { int i, j; if (mods == NULL) return; for ( i = 0; mods[i] != NULL; i++ ) { /* * Don't free values themselves; they're owned by the * Modification list. Do free the containing array. */ if ( mods[i]->mod_op & LDAP_MOD_BVALUES ) { for ( j = 0; mods[i]->mod_bvalues[j] != NULL; j++ ) { ch_free( mods[i]->mod_bvalues[j] ); } ch_free( mods[i]->mod_bvalues ); } else { ch_free( mods[i]->mod_values ); } /* Don't free type, for same reasons. */ ch_free( mods[i] ); } ch_free( mods ); } #endif /* LDAP_SLAPI */