2001-07-07 17:13:05 +08:00
|
|
|
/*
|
2003-01-04 04:20:47 +08:00
|
|
|
* Copyright 1998-2003 The OpenLDAP Foundation, All Rights Reserved.
|
2001-07-07 17:13:05 +08:00
|
|
|
* 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 "slap.h"
|
|
|
|
|
2002-09-03 03:41:03 +08:00
|
|
|
int
|
|
|
|
modify_check_duplicates(
|
|
|
|
AttributeDescription *ad,
|
|
|
|
MatchingRule *mr,
|
|
|
|
BerVarray vals,
|
|
|
|
BerVarray mods,
|
2003-01-24 09:43:09 +08:00
|
|
|
int permissive,
|
2002-09-03 03:41:03 +08:00
|
|
|
const char **text,
|
|
|
|
char *textbuf, size_t textlen )
|
|
|
|
{
|
2002-09-03 23:12:36 +08:00
|
|
|
int i, j, numvals = 0, nummods,
|
2003-01-24 09:43:09 +08:00
|
|
|
rc = LDAP_SUCCESS, matched;
|
2003-03-24 09:56:56 +08:00
|
|
|
/* this function is no longer used */
|
2002-09-03 03:41:03 +08:00
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
2002-01-20 03:54:48 +08:00
|
|
|
int
|
|
|
|
modify_add_values(
|
|
|
|
Entry *e,
|
|
|
|
Modification *mod,
|
2003-01-24 09:43:09 +08:00
|
|
|
int permissive,
|
2002-01-20 03:54:48 +08:00
|
|
|
const char **text,
|
|
|
|
char *textbuf, size_t textlen
|
|
|
|
)
|
|
|
|
{
|
|
|
|
int i, j;
|
2003-01-24 09:43:09 +08:00
|
|
|
int matched;
|
2002-01-20 03:54:48 +08:00
|
|
|
Attribute *a;
|
|
|
|
MatchingRule *mr = mod->sm_desc->ad_type->sat_equality;
|
|
|
|
const char *op;
|
|
|
|
|
|
|
|
switch( mod->sm_op ) {
|
|
|
|
case LDAP_MOD_ADD:
|
|
|
|
op = "add";
|
|
|
|
break;
|
|
|
|
case LDAP_MOD_REPLACE:
|
|
|
|
op = "replace";
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
op = "?";
|
|
|
|
assert( 0 );
|
|
|
|
}
|
|
|
|
|
|
|
|
a = attr_find( e->e_attrs, mod->sm_desc );
|
|
|
|
|
2003-01-24 09:43:09 +08:00
|
|
|
/*
|
|
|
|
* With permissive set, as long as the attribute being added
|
|
|
|
* has the same value(s?) as the existing attribute, then the
|
|
|
|
* modify will succeed.
|
|
|
|
*/
|
|
|
|
|
2002-01-20 03:54:48 +08:00
|
|
|
/* check if the values we're adding already exist */
|
|
|
|
if( mr == NULL || !mr->smr_match ) {
|
|
|
|
if ( a != NULL ) {
|
|
|
|
/* do not allow add of additional attribute
|
|
|
|
if no equality rule exists */
|
|
|
|
*text = textbuf;
|
|
|
|
snprintf( textbuf, textlen,
|
|
|
|
"modify/%s: %s: no equality matching rule",
|
|
|
|
op, mod->sm_desc->ad_cname.bv_val );
|
|
|
|
return LDAP_INAPPROPRIATE_MATCHING;
|
|
|
|
}
|
|
|
|
|
|
|
|
for ( i = 0; mod->sm_bvalues[i].bv_val != NULL; i++ ) {
|
|
|
|
/* test asserted values against existing values */
|
|
|
|
if( a ) {
|
2003-01-24 09:43:09 +08:00
|
|
|
for( matched = 0, j = 0; a->a_vals[j].bv_val != NULL; j++ ) {
|
2003-02-27 09:54:43 +08:00
|
|
|
if ( bvmatch( &mod->sm_bvalues[i], &a->a_vals[j] ) ) {
|
2003-01-24 09:43:09 +08:00
|
|
|
if ( permissive ) {
|
|
|
|
matched++;
|
|
|
|
continue;
|
|
|
|
}
|
2002-01-20 03:54:48 +08:00
|
|
|
/* value exists already */
|
|
|
|
*text = textbuf;
|
|
|
|
snprintf( textbuf, textlen,
|
|
|
|
"modify/%s: %s: value #%i already exists",
|
2002-03-24 00:53:44 +08:00
|
|
|
op, mod->sm_desc->ad_cname.bv_val, j );
|
2002-01-20 03:54:48 +08:00
|
|
|
return LDAP_TYPE_OR_VALUE_EXISTS;
|
|
|
|
}
|
|
|
|
}
|
2003-01-24 09:43:09 +08:00
|
|
|
if ( permissive && matched == j ) {
|
|
|
|
/* values already exist; do nothing */
|
|
|
|
return LDAP_SUCCESS;
|
|
|
|
}
|
2002-01-20 03:54:48 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/* test asserted values against themselves */
|
|
|
|
for( j = 0; j < i; j++ ) {
|
2003-03-17 02:10:16 +08:00
|
|
|
if ( bvmatch( &mod->sm_bvalues[i], &mod->sm_bvalues[j] ) ) {
|
2002-01-20 03:54:48 +08:00
|
|
|
/* value exists already */
|
|
|
|
*text = textbuf;
|
|
|
|
snprintf( textbuf, textlen,
|
|
|
|
"modify/%s: %s: value #%i already exists",
|
2002-03-24 00:53:44 +08:00
|
|
|
op, mod->sm_desc->ad_cname.bv_val, j );
|
2002-01-20 03:54:48 +08:00
|
|
|
return LDAP_TYPE_OR_VALUE_EXISTS;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
} else {
|
2003-03-01 11:37:16 +08:00
|
|
|
/* no normalization is done in this routine nor
|
|
|
|
* in the matching routines called by this routine.
|
|
|
|
* values are now normalized once on input to the
|
|
|
|
* server (whether from LDAP or from the underlying
|
|
|
|
* database).
|
|
|
|
* This should outperform the old code. No numbers
|
|
|
|
* are available yet.
|
|
|
|
*/
|
2002-09-03 03:41:03 +08:00
|
|
|
|
|
|
|
int rc;
|
|
|
|
|
2003-02-27 09:54:43 +08:00
|
|
|
if ( mod->sm_bvalues[1].bv_val == 0 ) {
|
2002-09-03 03:41:03 +08:00
|
|
|
if ( a != NULL ) {
|
|
|
|
int i;
|
|
|
|
|
2003-01-24 09:43:09 +08:00
|
|
|
for ( matched = 0, i = 0; a->a_vals[ i ].bv_val; i++ ) {
|
2002-09-03 03:41:03 +08:00
|
|
|
int match;
|
|
|
|
|
2003-02-27 09:54:43 +08:00
|
|
|
if( mod->sm_nvalues ) {
|
|
|
|
rc = value_match( &match, mod->sm_desc, mr,
|
|
|
|
SLAP_MR_EQUALITY
|
|
|
|
| SLAP_MR_VALUE_OF_ASSERTION_SYNTAX
|
|
|
|
| SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH
|
|
|
|
| SLAP_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH,
|
|
|
|
&a->a_nvals[i],
|
|
|
|
&mod->sm_nvalues[0],
|
|
|
|
text );
|
|
|
|
|
|
|
|
} else {
|
|
|
|
rc = value_match( &match, mod->sm_desc, mr,
|
|
|
|
SLAP_MR_EQUALITY
|
|
|
|
| SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
|
|
|
|
&a->a_vals[i],
|
|
|
|
&mod->sm_values[0],
|
|
|
|
text );
|
|
|
|
}
|
|
|
|
|
2002-01-20 03:54:48 +08:00
|
|
|
|
|
|
|
if( rc == LDAP_SUCCESS && match == 0 ) {
|
2003-01-24 09:43:09 +08:00
|
|
|
if ( permissive ) {
|
|
|
|
matched++;
|
|
|
|
continue;
|
|
|
|
}
|
2002-10-12 01:12:56 +08:00
|
|
|
*text = textbuf;
|
|
|
|
snprintf( textbuf, textlen,
|
|
|
|
"modify/%s: %s: value #0 already exists",
|
2003-05-15 19:47:42 +08:00
|
|
|
op, mod->sm_desc->ad_cname.bv_val );
|
2002-01-20 03:54:48 +08:00
|
|
|
return LDAP_TYPE_OR_VALUE_EXISTS;
|
|
|
|
}
|
|
|
|
}
|
2003-01-24 09:43:09 +08:00
|
|
|
if ( permissive && matched == i ) {
|
|
|
|
/* values already exist; do nothing */
|
|
|
|
return LDAP_SUCCESS;
|
|
|
|
}
|
2002-01-20 03:54:48 +08:00
|
|
|
}
|
|
|
|
|
2002-09-03 03:41:03 +08:00
|
|
|
} else {
|
|
|
|
rc = modify_check_duplicates( mod->sm_desc, mr,
|
|
|
|
a ? a->a_vals : NULL, mod->sm_bvalues,
|
2003-03-17 02:10:16 +08:00
|
|
|
permissive, text, textbuf, textlen );
|
2003-01-24 09:43:09 +08:00
|
|
|
|
|
|
|
if ( permissive && rc == LDAP_TYPE_OR_VALUE_EXISTS ) {
|
|
|
|
return LDAP_SUCCESS;
|
|
|
|
}
|
|
|
|
|
2002-09-03 03:41:03 +08:00
|
|
|
if ( rc != LDAP_SUCCESS ) {
|
|
|
|
return rc;
|
2002-01-20 03:54:48 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* no - add them */
|
2003-02-26 05:08:48 +08:00
|
|
|
if( attr_merge( e, mod->sm_desc, mod->sm_values, mod->sm_nvalues ) != 0 )
|
|
|
|
{
|
2002-01-20 03:54:48 +08:00
|
|
|
/* this should return result of attr_merge */
|
|
|
|
*text = textbuf;
|
|
|
|
snprintf( textbuf, textlen,
|
|
|
|
"modify/%s: %s: merge error",
|
|
|
|
op, mod->sm_desc->ad_cname.bv_val );
|
|
|
|
return LDAP_OTHER;
|
|
|
|
}
|
|
|
|
|
|
|
|
return LDAP_SUCCESS;
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
modify_delete_values(
|
|
|
|
Entry *e,
|
|
|
|
Modification *mod,
|
2003-01-24 09:43:09 +08:00
|
|
|
int permissive,
|
2002-01-20 03:54:48 +08:00
|
|
|
const char **text,
|
|
|
|
char *textbuf, size_t textlen
|
|
|
|
)
|
|
|
|
{
|
2002-09-08 00:08:30 +08:00
|
|
|
int i, j, k, rc = LDAP_SUCCESS;
|
2002-01-20 03:54:48 +08:00
|
|
|
Attribute *a;
|
2002-03-24 00:53:44 +08:00
|
|
|
MatchingRule *mr = mod->sm_desc->ad_type->sat_equality;
|
2002-09-08 00:08:30 +08:00
|
|
|
char dummy = '\0';
|
2002-01-20 03:54:48 +08:00
|
|
|
|
2003-01-24 09:43:09 +08:00
|
|
|
/*
|
|
|
|
* If permissive is set, then the non-existence of an
|
|
|
|
* attribute is not treated as an error.
|
|
|
|
*/
|
|
|
|
|
2002-01-20 03:54:48 +08:00
|
|
|
/* delete the entire attribute */
|
|
|
|
if ( mod->sm_bvalues == NULL ) {
|
2002-09-08 00:08:30 +08:00
|
|
|
rc = attr_delete( &e->e_attrs, mod->sm_desc );
|
2002-01-20 03:54:48 +08:00
|
|
|
|
2003-01-24 09:43:09 +08:00
|
|
|
if( permissive ) {
|
|
|
|
rc = LDAP_SUCCESS;
|
|
|
|
} else if( rc != LDAP_SUCCESS ) {
|
2002-01-20 03:54:48 +08:00
|
|
|
*text = textbuf;
|
|
|
|
snprintf( textbuf, textlen,
|
|
|
|
"modify/delete: %s: no such attribute",
|
|
|
|
mod->sm_desc->ad_cname.bv_val );
|
|
|
|
rc = LDAP_NO_SUCH_ATTRIBUTE;
|
|
|
|
}
|
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
|
|
|
if( mr == NULL || !mr->smr_match ) {
|
|
|
|
/* disallow specific attributes from being deleted if
|
|
|
|
no equality rule */
|
|
|
|
*text = textbuf;
|
|
|
|
snprintf( textbuf, textlen,
|
|
|
|
"modify/delete: %s: no equality matching rule",
|
|
|
|
mod->sm_desc->ad_cname.bv_val );
|
|
|
|
return LDAP_INAPPROPRIATE_MATCHING;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* delete specific values - find the attribute first */
|
|
|
|
if ( (a = attr_find( e->e_attrs, mod->sm_desc )) == NULL ) {
|
2003-01-24 09:43:09 +08:00
|
|
|
if( permissive ) {
|
|
|
|
return LDAP_SUCCESS;
|
|
|
|
}
|
2002-01-20 03:54:48 +08:00
|
|
|
*text = textbuf;
|
|
|
|
snprintf( textbuf, textlen,
|
|
|
|
"modify/delete: %s: no such attribute",
|
|
|
|
mod->sm_desc->ad_cname.bv_val );
|
|
|
|
return LDAP_NO_SUCH_ATTRIBUTE;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2003-03-01 11:37:16 +08:00
|
|
|
for ( i = 0; mod->sm_values[i].bv_val != NULL; i++ ) {
|
2002-09-08 00:08:30 +08:00
|
|
|
int found = 0;
|
2003-03-01 11:37:16 +08:00
|
|
|
for ( j = 0; a->a_vals[j].bv_val != NULL; j++ )
|
|
|
|
{
|
2002-01-20 03:54:48 +08:00
|
|
|
int match;
|
2002-09-08 00:08:30 +08:00
|
|
|
|
2003-02-27 09:54:43 +08:00
|
|
|
if( mod->sm_nvalues ) {
|
2003-03-01 11:37:16 +08:00
|
|
|
assert( a->a_nvals );
|
2003-02-27 09:54:43 +08:00
|
|
|
rc = (*mr->smr_match)( &match,
|
|
|
|
SLAP_MR_VALUE_OF_ASSERTION_SYNTAX
|
|
|
|
| SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH
|
|
|
|
| SLAP_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH,
|
|
|
|
a->a_desc->ad_type->sat_syntax,
|
2003-03-01 11:37:16 +08:00
|
|
|
mr, &a->a_nvals[j],
|
2003-02-27 09:54:43 +08:00
|
|
|
&mod->sm_nvalues[i] );
|
|
|
|
} else {
|
2003-03-24 09:56:56 +08:00
|
|
|
#if 0
|
2003-03-01 11:37:16 +08:00
|
|
|
assert( a->a_nvals == NULL );
|
2003-03-24 09:56:56 +08:00
|
|
|
#endif
|
2003-02-27 09:54:43 +08:00
|
|
|
rc = (*mr->smr_match)( &match,
|
|
|
|
SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
|
|
|
|
a->a_desc->ad_type->sat_syntax,
|
2003-03-24 09:56:56 +08:00
|
|
|
mr, &a->a_vals[j],
|
2003-02-27 09:54:43 +08:00
|
|
|
&mod->sm_values[i] );
|
|
|
|
}
|
2002-01-20 03:54:48 +08:00
|
|
|
|
2002-09-08 00:08:30 +08:00
|
|
|
if ( rc != LDAP_SUCCESS ) {
|
2002-10-12 01:12:56 +08:00
|
|
|
*text = textbuf;
|
|
|
|
snprintf( textbuf, textlen,
|
|
|
|
"%s: matching rule failed",
|
|
|
|
mod->sm_desc->ad_cname.bv_val );
|
2002-09-08 00:08:30 +08:00
|
|
|
goto return_results;
|
|
|
|
}
|
|
|
|
|
|
|
|
if ( match != 0 ) {
|
2002-01-20 03:54:48 +08:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
found = 1;
|
|
|
|
|
2002-09-08 00:08:30 +08:00
|
|
|
/* delete value and mark it as dummy */
|
2003-03-01 11:37:16 +08:00
|
|
|
free( a->a_vals[j].bv_val );
|
|
|
|
a->a_vals[j].bv_val = &dummy;
|
2003-03-24 09:56:56 +08:00
|
|
|
if( a->a_nvals != a->a_vals ) {
|
2003-03-01 11:37:16 +08:00
|
|
|
free( a->a_nvals[j].bv_val );
|
|
|
|
a->a_nvals[j].bv_val = &dummy;
|
|
|
|
}
|
2002-01-20 03:54:48 +08:00
|
|
|
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-09-08 00:08:30 +08:00
|
|
|
if ( found == 0 ) {
|
2002-01-20 03:54:48 +08:00
|
|
|
*text = textbuf;
|
|
|
|
snprintf( textbuf, textlen,
|
|
|
|
"modify/delete: %s: no such value",
|
|
|
|
mod->sm_desc->ad_cname.bv_val );
|
2002-09-08 00:08:30 +08:00
|
|
|
rc = LDAP_NO_SUCH_ATTRIBUTE;
|
|
|
|
goto return_results;
|
2002-01-20 03:54:48 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2002-09-08 00:08:30 +08:00
|
|
|
/* compact array skipping dummies */
|
2003-03-01 11:37:16 +08:00
|
|
|
for ( k = 0, j = 0; a->a_vals[k].bv_val != NULL; k++ )
|
|
|
|
{
|
|
|
|
/* skip dummies */
|
|
|
|
if( a->a_vals[k].bv_val == &dummy ) {
|
|
|
|
assert( a->a_nvals == NULL || a->a_nvals[k].bv_val == &dummy );
|
|
|
|
continue;
|
|
|
|
}
|
2002-09-08 00:08:30 +08:00
|
|
|
if ( j != k ) {
|
|
|
|
a->a_vals[ j ] = a->a_vals[ k ];
|
2003-03-24 09:56:56 +08:00
|
|
|
if (a->a_nvals != a->a_vals) {
|
2003-02-26 17:55:07 +08:00
|
|
|
a->a_nvals[ j ] = a->a_nvals[ k ];
|
|
|
|
}
|
2002-09-08 00:08:30 +08:00
|
|
|
}
|
|
|
|
|
2003-03-01 11:37:16 +08:00
|
|
|
j++;
|
2002-09-08 00:08:30 +08:00
|
|
|
}
|
2003-03-01 11:37:16 +08:00
|
|
|
|
|
|
|
a->a_vals[j].bv_val = NULL;
|
2003-03-24 09:56:56 +08:00
|
|
|
if (a->a_nvals != a->a_vals) a->a_nvals[j].bv_val = NULL;
|
2002-09-08 00:08:30 +08:00
|
|
|
|
2002-01-20 03:54:48 +08:00
|
|
|
/* if no values remain, delete the entire attribute */
|
|
|
|
if ( a->a_vals[0].bv_val == NULL ) {
|
|
|
|
if ( attr_delete( &e->e_attrs, mod->sm_desc ) ) {
|
|
|
|
*text = textbuf;
|
|
|
|
snprintf( textbuf, textlen,
|
|
|
|
"modify/delete: %s: no such attribute",
|
|
|
|
mod->sm_desc->ad_cname.bv_val );
|
2002-09-08 00:08:30 +08:00
|
|
|
rc = LDAP_NO_SUCH_ATTRIBUTE;
|
2002-01-20 03:54:48 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2002-09-08 00:08:30 +08:00
|
|
|
return_results:;
|
|
|
|
|
|
|
|
return rc;
|
2002-01-20 03:54:48 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
modify_replace_values(
|
|
|
|
Entry *e,
|
|
|
|
Modification *mod,
|
2003-01-24 09:43:09 +08:00
|
|
|
int permissive,
|
2002-01-20 03:54:48 +08:00
|
|
|
const char **text,
|
|
|
|
char *textbuf, size_t textlen
|
|
|
|
)
|
|
|
|
{
|
|
|
|
(void) attr_delete( &e->e_attrs, mod->sm_desc );
|
|
|
|
|
|
|
|
if ( mod->sm_bvalues ) {
|
2003-01-24 09:43:09 +08:00
|
|
|
return modify_add_values( e, mod, permissive, text, textbuf, textlen );
|
2002-01-20 03:54:48 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
return LDAP_SUCCESS;
|
|
|
|
}
|
|
|
|
|
2001-07-07 17:13:05 +08:00
|
|
|
void
|
|
|
|
slap_mod_free(
|
|
|
|
Modification *mod,
|
|
|
|
int freeit
|
|
|
|
)
|
|
|
|
{
|
2003-02-26 05:08:48 +08:00
|
|
|
if ( mod->sm_values != NULL ) ber_bvarray_free( mod->sm_values );
|
2003-02-26 15:39:30 +08:00
|
|
|
mod->sm_values = NULL;
|
2003-02-26 05:08:48 +08:00
|
|
|
|
|
|
|
if ( mod->sm_nvalues != NULL ) ber_bvarray_free( mod->sm_nvalues );
|
2003-02-26 15:39:30 +08:00
|
|
|
mod->sm_nvalues = NULL;
|
2001-07-07 17:13:05 +08:00
|
|
|
|
2003-02-26 15:39:30 +08:00
|
|
|
if( freeit ) free( mod );
|
2001-07-07 17:13:05 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
slap_mods_free(
|
|
|
|
Modifications *ml
|
|
|
|
)
|
|
|
|
{
|
|
|
|
Modifications *next;
|
|
|
|
|
|
|
|
for ( ; ml != NULL; ml = next ) {
|
|
|
|
next = ml->sml_next;
|
|
|
|
|
|
|
|
slap_mod_free( &ml->sml_mod, 0 );
|
|
|
|
free( ml );
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|