2 * Copyright (c) 1995 Regents of the University of Michigan.
5 * Redistribution and use in source and binary forms are permitted
6 * provided that this notice is preserved and that due credit is given
7 * to the University of Michigan at Ann Arbor. The name of the University
8 * may not be used to endorse or promote products derived from this
9 * software without specific prior written permission. This software
10 * is provided ``as is'' without express or implied warranty.
17 #include <sys/types.h>
18 #include <sys/socket.h>
21 extern Backend *select_backend();
23 extern char *default_referral;
24 extern time_t currenttime;
25 extern pthread_mutex_t currenttime_mutex;
26 extern int global_lastmod;
28 static void modlist_free();
29 static void add_lastmods();
39 unsigned long tag, len;
44 Debug( LDAP_DEBUG_TRACE, "do_modify\n", 0, 0, 0 );
47 * Parse the modify request. It looks like this:
49 * ModifyRequest := [APPLICATION 6] SEQUENCE {
50 * name DistinguishedName,
51 * mods SEQUENCE OF SEQUENCE {
52 * operation ENUMERATED {
57 * modification SEQUENCE {
59 * values SET OF AttributeValue
65 if ( ber_scanf( op->o_ber, "{a", &dn ) == LBER_ERROR ) {
66 Debug( LDAP_DEBUG_ANY, "ber_scanf failed\n", 0, 0, 0 );
67 send_ldap_result( conn, op, LDAP_PROTOCOL_ERROR, NULL, "" );
73 Debug( LDAP_DEBUG_ARGS, "do_modify: dn (%s)\n", dn, 0, 0 );
75 /* collect modifications & save for later */
78 for ( tag = ber_first_element( op->o_ber, &len, &last );
80 tag = ber_next_element( op->o_ber, &len, last ) )
82 (*modtail) = (LDAPMod *) ch_calloc( 1, sizeof(LDAPMod) );
84 if ( ber_scanf( op->o_ber, "{i{a[V]}}", &(*modtail)->mod_op,
85 &(*modtail)->mod_type, &(*modtail)->mod_bvalues )
88 send_ldap_result( conn, op, LDAP_PROTOCOL_ERROR, NULL,
97 if ( (*modtail)->mod_op != LDAP_MOD_ADD &&
98 (*modtail)->mod_op != LDAP_MOD_DELETE &&
99 (*modtail)->mod_op != LDAP_MOD_REPLACE )
101 send_ldap_result( conn, op, LDAP_PROTOCOL_ERROR, NULL,
102 "unrecognized modify operation" );
105 modlist_free( mods );
109 if ( (*modtail)->mod_bvalues == NULL && (*modtail)->mod_op
110 != LDAP_MOD_DELETE ) {
111 send_ldap_result( conn, op, LDAP_PROTOCOL_ERROR, NULL,
115 modlist_free( mods );
118 attr_normalize( (*modtail)->mod_type );
120 modtail = &(*modtail)->mod_next;
125 Debug( LDAP_DEBUG_ARGS, "modifications:\n", 0, 0, 0 );
126 for ( tmp = mods; tmp != NULL; tmp = tmp->mod_next ) {
127 Debug( LDAP_DEBUG_ARGS, "\t%s: %s\n", tmp->mod_op
128 == LDAP_MOD_ADD ? "add" : (tmp->mod_op == LDAP_MOD_DELETE ?
129 "delete" : "replace"), tmp->mod_type, 0 );
133 Statslog( LDAP_DEBUG_STATS, "conn=%d op=%d MOD dn=\"%s\"\n",
134 conn->c_connid, op->o_opid, dn, 0, 0 );
137 * We could be serving multiple database backends. Select the
138 * appropriate one, or send a referral to our "referral server"
139 * if we don't hold it.
141 if ( (be = select_backend( dn )) == NULL ) {
144 modlist_free( mods );
145 send_ldap_result( conn, op, LDAP_PARTIAL_RESULTS, NULL,
151 * do the modify if 1 && (2 || 3)
152 * 1) there is a modify function implemented in this backend;
153 * 2) this backend is master for what it holds;
154 * 3) it's a replica and the dn supplied is the updatedn.
156 if ( be->be_modify != NULL ) {
157 /* do the update here */
158 if ( be->be_updatedn == NULL ||
159 strcasecmp( be->be_updatedn, op->o_dn ) == 0 ) {
161 if ( (be->be_lastmod == ON || ( be->be_lastmod == UNDEFINED &&
162 global_lastmod == ON ) ) && be->be_updatedn == NULL ) {
163 add_lastmods( op, &mods );
165 if ( (*be->be_modify)( be, conn, op, odn, mods ) == 0 ) {
166 replog( be, LDAP_REQ_MODIFY, dn, mods, 0 );
169 /* send a referral */
171 send_ldap_result( conn, op, LDAP_PARTIAL_RESULTS, NULL,
175 send_ldap_result( conn, op, LDAP_UNWILLING_TO_PERFORM, NULL,
176 "Function not implemented" );
181 modlist_free( mods );
191 for ( ; mods != NULL; mods = next ) {
192 next = mods->mod_next;
193 free( mods->mod_type );
194 if ( mods->mod_bvalues != NULL )
195 ber_bvecfree( mods->mod_bvalues );
201 add_lastmods( Operation *op, LDAPMod **mods )
205 struct berval *bvals[2];
210 Debug( LDAP_DEBUG_TRACE, "add_lastmods\n", 0, 0, 0 );
215 /* remove any attempts by the user to modify these attrs */
216 for ( m = mods; *m != NULL; m = &(*m)->mod_next ) {
217 if ( strcasecmp( (*m)->mod_type, "modifytimestamp" ) == 0 ||
218 strcasecmp( (*m)->mod_type, "modifiersname" ) == 0 ||
219 strcasecmp( (*m)->mod_type, "createtimestamp" ) == 0 ||
220 strcasecmp( (*m)->mod_type, "creatorsname" ) == 0 ) {
222 Debug( LDAP_DEBUG_TRACE,
223 "add_lastmods: found lastmod attr: %s\n",
224 (*m)->mod_type, 0, 0 );
227 free( tmp->mod_type );
228 if ( tmp->mod_bvalues != NULL ) {
229 ber_bvecfree( tmp->mod_bvalues );
237 if ( op->o_dn == NULL || op->o_dn[0] == '\0' ) {
238 bv.bv_val = "NULLDN";
239 bv.bv_len = strlen( bv.bv_val );
241 bv.bv_val = op->o_dn;
242 bv.bv_len = strlen( bv.bv_val );
244 tmp = (LDAPMod *) ch_calloc( 1, sizeof(LDAPMod) );
245 tmp->mod_type = strdup( "modifiersname" );
246 tmp->mod_op = LDAP_MOD_REPLACE;
247 tmp->mod_bvalues = (struct berval **) ch_calloc( 1,
248 2 * sizeof(struct berval *) );
249 tmp->mod_bvalues[0] = ber_bvdup( &bv );
250 tmp->mod_next = *mods;
253 pthread_mutex_lock( ¤ttime_mutex );
254 ltm = localtime( ¤ttime );
255 strftime( buf, sizeof(buf), "%y%m%d%H%M%SZ", ltm );
256 pthread_mutex_unlock( ¤ttime_mutex );
258 bv.bv_len = strlen( bv.bv_val );
259 tmp = (LDAPMod *) ch_calloc( 1, sizeof(LDAPMod) );
260 tmp->mod_type = strdup( "modifytimestamp" );
261 tmp->mod_op = LDAP_MOD_REPLACE;
262 tmp->mod_bvalues = (struct berval **) ch_calloc( 1, 2 * sizeof(struct berval *) );
263 tmp->mod_bvalues[0] = ber_bvdup( &bv );
264 tmp->mod_next = *mods;