1/* $OpenLDAP$ */ 2/* This work is part of OpenLDAP Software <http://www.openldap.org/>. 3 * 4 * Copyright 1998-2011 The OpenLDAP Foundation. 5 * All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted only as authorized by the OpenLDAP 9 * Public License. 10 * 11 * A copy of this license is available in the file LICENSE in the 12 * top-level directory of the distribution or, alternatively, at 13 * <http://www.OpenLDAP.org/license.html>. 14 */ 15/* Portions Copyright (c) 1995 Regents of the University of Michigan. 16 * All rights reserved. 17 * 18 * Redistribution and use in source and binary forms are permitted 19 * provided that this notice is preserved and that due credit is given 20 * to the University of Michigan at Ann Arbor. The name of the University 21 * may not be used to endorse or promote products derived from this 22 * software without specific prior written permission. This software 23 * is provided ``as is'' without express or implied warranty. 24 */ 25 26#include "portable.h" 27 28#include <stdio.h> 29#include <ac/string.h> 30#include <ac/time.h> 31#include <ac/socket.h> 32 33#include "lutil.h" 34#include "slap.h" 35 36int 37do_add( Operation *op, SlapReply *rs ) 38{ 39 BerElement *ber = op->o_ber; 40 char *last; 41 struct berval dn = BER_BVNULL; 42 ber_len_t len; 43 ber_tag_t tag; 44 Modifications *modlist = NULL; 45 Modifications **modtail = &modlist; 46 Modifications tmp; 47 char textbuf[ SLAP_TEXT_BUFLEN ]; 48 size_t textlen = sizeof( textbuf ); 49 int rc = 0; 50 int freevals = 1; 51 OpExtraDB oex; 52 53 Debug( LDAP_DEBUG_TRACE, "%s do_add\n", 54 op->o_log_prefix, 0, 0 ); 55 56 /* 57 * Parse the add request. It looks like this: 58 * 59 * AddRequest := [APPLICATION 14] SEQUENCE { 60 * name DistinguishedName, 61 * attrs SEQUENCE OF SEQUENCE { 62 * type AttributeType, 63 * values SET OF AttributeValue 64 * } 65 * } 66 */ 67 68 /* get the name */ 69 if ( ber_scanf( ber, "{m", /*}*/ &dn ) == LBER_ERROR ) { 70 Debug( LDAP_DEBUG_ANY, "%s do_add: ber_scanf failed\n", 71 op->o_log_prefix, 0, 0 ); 72 send_ldap_discon( op, rs, LDAP_PROTOCOL_ERROR, "decoding error" ); 73 return SLAPD_DISCONNECT; 74 } 75 76 Debug( LDAP_DEBUG_ARGS, "%s do_add: dn (%s)\n", 77 op->o_log_prefix, dn.bv_val, 0 ); 78 79 /* get the attrs */ 80 for ( tag = ber_first_element( ber, &len, &last ); tag != LBER_DEFAULT; 81 tag = ber_next_element( ber, &len, last ) ) 82 { 83 Modifications *mod; 84 ber_tag_t rtag; 85 86 tmp.sml_nvalues = NULL; 87 88 rtag = ber_scanf( ber, "{m{W}}", &tmp.sml_type, &tmp.sml_values ); 89 90 if ( rtag == LBER_ERROR ) { 91 Debug( LDAP_DEBUG_ANY, "%s do_add: decoding error\n", 92 op->o_log_prefix, 0, 0 ); 93 send_ldap_discon( op, rs, LDAP_PROTOCOL_ERROR, "decoding error" ); 94 rs->sr_err = SLAPD_DISCONNECT; 95 goto done; 96 } 97 98 if ( tmp.sml_values == NULL ) { 99 Debug( LDAP_DEBUG_ANY, "%s do_add: no values for type %s\n", 100 op->o_log_prefix, tmp.sml_type.bv_val, 0 ); 101 send_ldap_error( op, rs, LDAP_PROTOCOL_ERROR, 102 "no values for attribute type" ); 103 goto done; 104 } 105 106 mod = (Modifications *) ch_malloc( sizeof(Modifications) ); 107 mod->sml_op = LDAP_MOD_ADD; 108 mod->sml_flags = 0; 109 mod->sml_next = NULL; 110 mod->sml_desc = NULL; 111 mod->sml_type = tmp.sml_type; 112 mod->sml_values = tmp.sml_values; 113 mod->sml_nvalues = NULL; 114 115 *modtail = mod; 116 modtail = &mod->sml_next; 117 } 118 119 if ( ber_scanf( ber, /*{*/ "}") == LBER_ERROR ) { 120 Debug( LDAP_DEBUG_ANY, "%s do_add: ber_scanf failed\n", 121 op->o_log_prefix, 0, 0 ); 122 send_ldap_discon( op, rs, LDAP_PROTOCOL_ERROR, "decoding error" ); 123 rs->sr_err = SLAPD_DISCONNECT; 124 goto done; 125 } 126 127 if ( get_ctrls( op, rs, 1 ) != LDAP_SUCCESS ) { 128 Debug( LDAP_DEBUG_ANY, "%s do_add: get_ctrls failed\n", 129 op->o_log_prefix, 0, 0 ); 130 goto done; 131 } 132 133 rs->sr_err = dnPrettyNormal( NULL, &dn, &op->o_req_dn, &op->o_req_ndn, 134 op->o_tmpmemctx ); 135 136 if ( rs->sr_err != LDAP_SUCCESS ) { 137 Debug( LDAP_DEBUG_ANY, "%s do_add: invalid dn (%s)\n", 138 op->o_log_prefix, dn.bv_val, 0 ); 139 send_ldap_error( op, rs, LDAP_INVALID_DN_SYNTAX, "invalid DN" ); 140 goto done; 141 } 142 143 op->ora_e = entry_alloc(); 144 ber_dupbv( &op->ora_e->e_name, &op->o_req_dn ); 145 ber_dupbv( &op->ora_e->e_nname, &op->o_req_ndn ); 146 147 Statslog( LDAP_DEBUG_STATS, "%s ADD dn=\"%s\"\n", 148 op->o_log_prefix, op->o_req_dn.bv_val, 0, 0, 0 ); 149 150 if ( modlist == NULL ) { 151 send_ldap_error( op, rs, LDAP_PROTOCOL_ERROR, 152 "no attributes provided" ); 153 goto done; 154 } 155 156 if ( dn_match( &op->ora_e->e_nname, &slap_empty_bv ) ) { 157 /* protocolError may be a more appropriate error */ 158 send_ldap_error( op, rs, LDAP_ALREADY_EXISTS, 159 "root DSE already exists" ); 160 goto done; 161 162 } else if ( dn_match( &op->ora_e->e_nname, &frontendDB->be_schemandn ) ) { 163 send_ldap_error( op, rs, LDAP_ALREADY_EXISTS, 164 "subschema subentry already exists" ); 165 goto done; 166 } 167 168 rs->sr_err = slap_mods_check( op, modlist, &rs->sr_text, 169 textbuf, textlen, NULL ); 170 171 if ( rs->sr_err != LDAP_SUCCESS ) { 172 send_ldap_result( op, rs ); 173 goto done; 174 } 175 176 /* temporary; remove if not invoking backend function */ 177 op->ora_modlist = modlist; 178 179 /* call this so global overlays/SLAPI have access to ora_e */ 180 rs->sr_err = slap_mods2entry( op->ora_modlist, &op->ora_e, 181 1, 0, &rs->sr_text, textbuf, textlen ); 182 if ( rs->sr_err != LDAP_SUCCESS ) { 183 send_ldap_result( op, rs ); 184 goto done; 185 } 186 187 freevals = 0; 188 189 oex.oe.oe_key = (void *)do_add; 190 oex.oe_db = NULL; 191 LDAP_SLIST_INSERT_HEAD(&op->o_extra, &oex.oe, oe_next); 192 193 op->o_bd = frontendDB; 194 rc = frontendDB->be_add( op, rs ); 195 LDAP_SLIST_REMOVE(&op->o_extra, &oex.oe, OpExtra, oe_next); 196 197#ifdef LDAP_X_TXN 198 if ( rc == LDAP_X_TXN_SPECIFY_OKAY ) { 199 /* skip cleanup */ 200 return rc; 201 } else 202#endif 203 if ( rc == 0 ) { 204 if ( op->ora_e != NULL && oex.oe_db != NULL ) { 205 BackendDB *bd = op->o_bd; 206 207 op->o_bd = oex.oe_db; 208 209 be_entry_release_w( op, op->ora_e ); 210 211 op->ora_e = NULL; 212 op->o_bd = bd; 213 } 214 } 215 216done:; 217 if ( modlist != NULL ) { 218 /* in case of error, free the values as well */ 219 slap_mods_free( modlist, freevals ); 220 } 221 222 if ( op->ora_e != NULL ) { 223 entry_free( op->ora_e ); 224 } 225 op->o_tmpfree( op->o_req_dn.bv_val, op->o_tmpmemctx ); 226 op->o_tmpfree( op->o_req_ndn.bv_val, op->o_tmpmemctx ); 227 228 return rc; 229} 230 231int 232fe_op_add( Operation *op, SlapReply *rs ) 233{ 234 Modifications **modtail = &op->ora_modlist; 235 int rc = 0; 236 BackendDB *op_be, *bd = op->o_bd; 237 char textbuf[ SLAP_TEXT_BUFLEN ]; 238 size_t textlen = sizeof( textbuf ); 239 240 /* 241 * We could be serving multiple database backends. Select the 242 * appropriate one, or send a referral to our "referral server" 243 * if we don't hold it. 244 */ 245 op->o_bd = select_backend( &op->ora_e->e_nname, 1 ); 246 if ( op->o_bd == NULL ) { 247 op->o_bd = bd; 248 rs->sr_ref = referral_rewrite( default_referral, 249 NULL, &op->ora_e->e_name, LDAP_SCOPE_DEFAULT ); 250 if ( !rs->sr_ref ) rs->sr_ref = default_referral; 251 if ( rs->sr_ref ) { 252 rs->sr_err = LDAP_REFERRAL; 253 send_ldap_result( op, rs ); 254 255 if ( rs->sr_ref != default_referral ) { 256 ber_bvarray_free( rs->sr_ref ); 257 } 258 } else { 259 send_ldap_error( op, rs, LDAP_UNWILLING_TO_PERFORM, 260 "no global superior knowledge" ); 261 } 262 goto done; 263 } 264 265 /* If we've got a glued backend, check the real backend */ 266 op_be = op->o_bd; 267 if ( SLAP_GLUE_INSTANCE( op->o_bd )) { 268 op->o_bd = select_backend( &op->ora_e->e_nname, 0 ); 269 } 270 271 /* check restrictions */ 272 if( backend_check_restrictions( op, rs, NULL ) != LDAP_SUCCESS ) { 273 send_ldap_result( op, rs ); 274 goto done; 275 } 276 277 /* check for referrals */ 278 if( backend_check_referrals( op, rs ) != LDAP_SUCCESS ) { 279 goto done; 280 } 281 282 rs->sr_err = slap_mods_obsolete_check( op, op->ora_modlist, 283 &rs->sr_text, textbuf, textlen ); 284 285 if ( rs->sr_err != LDAP_SUCCESS ) { 286 send_ldap_result( op, rs ); 287 goto done; 288 } 289 290 /* 291 * do the add if 1 && (2 || 3) 292 * 1) there is an add function implemented in this backend; 293 * 2) this backend is master for what it holds; 294 * 3) it's a replica and the dn supplied is the updatedn. 295 */ 296 if ( op->o_bd->be_add ) { 297 /* do the update here */ 298 int repl_user = be_isupdate( op ); 299 if ( !SLAP_SINGLE_SHADOW(op->o_bd) || repl_user ) { 300 int update = !BER_BVISEMPTY( &op->o_bd->be_update_ndn ); 301 302 op->o_bd = op_be; 303 304 if ( !update ) { 305 rs->sr_err = slap_mods_no_user_mod_check( op, op->ora_modlist, 306 &rs->sr_text, textbuf, textlen ); 307 308 if ( rs->sr_err != LDAP_SUCCESS ) { 309 send_ldap_result( op, rs ); 310 goto done; 311 } 312 } 313 314 if ( !repl_user ) { 315 /* go to the last mod */ 316 for ( modtail = &op->ora_modlist; 317 *modtail != NULL; 318 modtail = &(*modtail)->sml_next ) 319 { 320 assert( (*modtail)->sml_op == LDAP_MOD_ADD ); 321 assert( (*modtail)->sml_desc != NULL ); 322 } 323 324 325 /* check for unmodifiable attributes */ 326 rs->sr_err = slap_mods_no_repl_user_mod_check( op, 327 op->ora_modlist, &rs->sr_text, textbuf, textlen ); 328 if ( rs->sr_err != LDAP_SUCCESS ) { 329 send_ldap_result( op, rs ); 330 goto done; 331 } 332 } 333 334 rc = op->o_bd->be_add( op, rs ); 335 if ( rc == LDAP_SUCCESS ) { 336 OpExtra *oex; 337 /* NOTE: be_entry_release_w() is 338 * called by do_add(), so that global 339 * overlays on the way back can 340 * at least read the entry */ 341 LDAP_SLIST_FOREACH(oex, &op->o_extra, oe_next) { 342 if ( oex->oe_key == (void *)do_add ) { 343 ((OpExtraDB *)oex)->oe_db = op->o_bd; 344 break; 345 } 346 } 347 } 348 349 } else { 350 BerVarray defref = NULL; 351 352 defref = op->o_bd->be_update_refs 353 ? op->o_bd->be_update_refs : default_referral; 354 355 if ( defref != NULL ) { 356 rs->sr_ref = referral_rewrite( defref, 357 NULL, &op->ora_e->e_name, LDAP_SCOPE_DEFAULT ); 358 if ( rs->sr_ref == NULL ) rs->sr_ref = defref; 359 rs->sr_err = LDAP_REFERRAL; 360 if (!rs->sr_ref) rs->sr_ref = default_referral; 361 send_ldap_result( op, rs ); 362 363 if ( rs->sr_ref != default_referral ) { 364 ber_bvarray_free( rs->sr_ref ); 365 } 366 } else { 367 send_ldap_error( op, rs, 368 LDAP_UNWILLING_TO_PERFORM, 369 "shadow context; no update referral" ); 370 } 371 } 372 } else { 373 Debug( LDAP_DEBUG_ARGS, "do_add: no backend support\n", 0, 0, 0 ); 374 send_ldap_error( op, rs, LDAP_UNWILLING_TO_PERFORM, 375 "operation not supported within namingContext" ); 376 } 377 378done:; 379 op->o_bd = bd; 380 return rc; 381} 382 383int 384slap_mods2entry( 385 Modifications *mods, 386 Entry **e, 387 int initial, 388 int dup, 389 const char **text, 390 char *textbuf, size_t textlen ) 391{ 392 Attribute **tail; 393 int i; 394 395 if ( initial ) { 396 assert( (*e)->e_attrs == NULL ); 397 } 398 399 for ( tail = &(*e)->e_attrs; *tail != NULL; tail = &(*tail)->a_next ) 400 ; 401 402 *text = textbuf; 403 404 for( ; mods != NULL; mods = mods->sml_next ) { 405 Attribute *attr; 406 407 assert( mods->sml_desc != NULL ); 408 409 attr = attr_find( (*e)->e_attrs, mods->sml_desc ); 410 411 if( attr != NULL ) { 412#define SLURPD_FRIENDLY 413#ifdef SLURPD_FRIENDLY 414 int j; 415 416 if ( !initial ) { 417 /* 418 * This check allows overlays to override operational 419 * attributes by setting them directly in the entry. 420 * We assume slap_mods_no_user_mod_check() was called 421 * with the user modifications. 422 */ 423 *text = NULL; 424 return LDAP_SUCCESS; 425 } 426 427 i = attr->a_numvals; 428 j = mods->sml_numvals; 429 attr->a_numvals += j; 430 j++; /* NULL */ 431 432 attr->a_vals = ch_realloc( attr->a_vals, 433 sizeof( struct berval ) * (i+j) ); 434 435 /* checked for duplicates in slap_mods_check */ 436 437 if ( dup ) { 438 for ( j = 0; mods->sml_values[j].bv_val; j++ ) { 439 ber_dupbv( &attr->a_vals[i+j], &mods->sml_values[j] ); 440 } 441 BER_BVZERO( &attr->a_vals[i+j] ); 442 j++; 443 } else { 444 AC_MEMCPY( &attr->a_vals[i], mods->sml_values, 445 sizeof( struct berval ) * j ); 446 } 447 448 if( mods->sml_nvalues ) { 449 attr->a_nvals = ch_realloc( attr->a_nvals, 450 sizeof( struct berval ) * (i+j) ); 451 if ( dup ) { 452 for ( j = 0; mods->sml_nvalues[j].bv_val; j++ ) { 453 ber_dupbv( &attr->a_nvals[i+j], &mods->sml_nvalues[j] ); 454 } 455 BER_BVZERO( &attr->a_nvals[i+j] ); 456 } else { 457 AC_MEMCPY( &attr->a_nvals[i], mods->sml_nvalues, 458 sizeof( struct berval ) * j ); 459 } 460 } else { 461 attr->a_nvals = attr->a_vals; 462 } 463 464 continue; 465#else 466 snprintf( textbuf, textlen, 467 "attribute '%s' provided more than once", 468 mods->sml_desc->ad_cname.bv_val ); 469 *text = textbuf; 470 return LDAP_TYPE_OR_VALUE_EXISTS; 471#endif 472 } 473 474 attr = attr_alloc( mods->sml_desc ); 475 476 /* move values to attr structure */ 477 i = mods->sml_numvals; 478 attr->a_numvals = mods->sml_numvals; 479 if ( dup ) { 480 attr->a_vals = (BerVarray) ch_calloc( i+1, sizeof( BerValue )); 481 for ( i = 0; mods->sml_values[i].bv_val; i++ ) { 482 ber_dupbv( &attr->a_vals[i], &mods->sml_values[i] ); 483 } 484 BER_BVZERO( &attr->a_vals[i] ); 485 } else { 486 attr->a_vals = mods->sml_values; 487 } 488 489 if ( mods->sml_nvalues ) { 490 if ( dup ) { 491 i = mods->sml_numvals; 492 attr->a_nvals = (BerVarray) ch_calloc( i+1, sizeof( BerValue )); 493 for ( i = 0; mods->sml_nvalues[i].bv_val; i++ ) { 494 ber_dupbv( &attr->a_nvals[i], &mods->sml_nvalues[i] ); 495 } 496 BER_BVZERO( &attr->a_nvals[i] ); 497 } else { 498 attr->a_nvals = mods->sml_nvalues; 499 } 500 } else { 501 attr->a_nvals = attr->a_vals; 502 } 503 504 *tail = attr; 505 tail = &attr->a_next; 506 } 507 508 *text = NULL; 509 510 return LDAP_SUCCESS; 511} 512 513int 514slap_entry2mods( 515 Entry *e, 516 Modifications **mods, 517 const char **text, 518 char *textbuf, size_t textlen ) 519{ 520 Modifications *modhead = NULL; 521 Modifications *mod; 522 Modifications **modtail = &modhead; 523 Attribute *a_new; 524 AttributeDescription *a_new_desc; 525 int i, count; 526 527 a_new = e->e_attrs; 528 529 while ( a_new != NULL ) { 530 a_new_desc = a_new->a_desc; 531 mod = (Modifications *) ch_malloc( sizeof( Modifications )); 532 533 mod->sml_op = LDAP_MOD_REPLACE; 534 mod->sml_flags = 0; 535 536 mod->sml_type = a_new_desc->ad_cname; 537 538 count = a_new->a_numvals; 539 mod->sml_numvals = a_new->a_numvals; 540 541 mod->sml_values = (struct berval*) ch_malloc( 542 (count+1) * sizeof( struct berval) ); 543 544 /* see slap_mods_check() comments... 545 * if a_vals == a_nvals, there is no normalizer. 546 * in this case, mod->sml_nvalues must be left NULL. 547 */ 548 if ( a_new->a_vals != a_new->a_nvals ) { 549 mod->sml_nvalues = (struct berval*) ch_malloc( 550 (count+1) * sizeof( struct berval) ); 551 } else { 552 mod->sml_nvalues = NULL; 553 } 554 555 for ( i = 0; i < count; i++ ) { 556 ber_dupbv(mod->sml_values+i, a_new->a_vals+i); 557 if ( mod->sml_nvalues ) { 558 ber_dupbv( mod->sml_nvalues+i, a_new->a_nvals+i ); 559 } 560 } 561 562 mod->sml_values[count].bv_val = NULL; 563 mod->sml_values[count].bv_len = 0; 564 565 if ( mod->sml_nvalues ) { 566 mod->sml_nvalues[count].bv_val = NULL; 567 mod->sml_nvalues[count].bv_len = 0; 568 } 569 570 mod->sml_desc = a_new_desc; 571 mod->sml_next =NULL; 572 *modtail = mod; 573 modtail = &mod->sml_next; 574 a_new = a_new->a_next; 575 } 576 577 *mods = modhead; 578 579 return LDAP_SUCCESS; 580} 581 582int slap_add_opattrs( 583 Operation *op, 584 const char **text, 585 char *textbuf, 586 size_t textlen, 587 int manage_ctxcsn ) 588{ 589 struct berval name, timestamp, csn = BER_BVNULL; 590 struct berval nname, tmp; 591 char timebuf[ LDAP_LUTIL_GENTIME_BUFSIZE ]; 592 char csnbuf[ LDAP_PVT_CSNSTR_BUFSIZE ]; 593 Attribute *a; 594 595 if ( SLAP_LASTMOD( op->o_bd ) ) { 596 char *ptr; 597 int gotcsn = 0; 598 599 timestamp.bv_val = timebuf; 600 a = attr_find( op->ora_e->e_attrs, slap_schema.si_ad_entryCSN ); 601 if ( a ) { 602 gotcsn = 1; 603 csn = a->a_vals[0]; 604 } 605 if ( BER_BVISEMPTY( &op->o_csn )) { 606 if ( !gotcsn ) { 607 csn.bv_val = csnbuf; 608 csn.bv_len = sizeof(csnbuf); 609 slap_get_csn( op, &csn, manage_ctxcsn ); 610 } else { 611 if ( manage_ctxcsn ) 612 slap_queue_csn( op, &csn ); 613 } 614 } else { 615 csn = op->o_csn; 616 } 617 ptr = ber_bvchr( &csn, '#' ); 618 if ( ptr ) { 619 timestamp.bv_len = STRLENOF("YYYYMMDDHHMMSSZ"); 620 AC_MEMCPY( timebuf, csn.bv_val, timestamp.bv_len ); 621 timebuf[timestamp.bv_len-1] = 'Z'; 622 timebuf[timestamp.bv_len] = '\0'; 623 } else { 624 time_t now = slap_get_time(); 625 626 timestamp.bv_len = sizeof(timebuf); 627 628 slap_timestamp( &now, ×tamp ); 629 } 630 631 if ( BER_BVISEMPTY( &op->o_dn ) ) { 632 BER_BVSTR( &name, SLAPD_ANONYMOUS ); 633 nname = name; 634 } else { 635 name = op->o_dn; 636 nname = op->o_ndn; 637 } 638 639 a = attr_find( op->ora_e->e_attrs, 640 slap_schema.si_ad_entryUUID ); 641 if ( !a ) { 642 char uuidbuf[ LDAP_LUTIL_UUIDSTR_BUFSIZE ]; 643 644 tmp.bv_len = lutil_uuidstr( uuidbuf, sizeof( uuidbuf ) ); 645 tmp.bv_val = uuidbuf; 646 647 attr_merge_normalize_one( op->ora_e, 648 slap_schema.si_ad_entryUUID, &tmp, op->o_tmpmemctx ); 649 } 650 651 a = attr_find( op->ora_e->e_attrs, 652 slap_schema.si_ad_creatorsName ); 653 if ( !a ) { 654 attr_merge_one( op->ora_e, 655 slap_schema.si_ad_creatorsName, &name, &nname ); 656 } 657 658 a = attr_find( op->ora_e->e_attrs, 659 slap_schema.si_ad_createTimestamp ); 660 if ( !a ) { 661 attr_merge_one( op->ora_e, 662 slap_schema.si_ad_createTimestamp, ×tamp, NULL ); 663 } 664 665 if ( !gotcsn ) { 666 attr_merge_one( op->ora_e, 667 slap_schema.si_ad_entryCSN, &csn, NULL ); 668 } 669 670 a = attr_find( op->ora_e->e_attrs, 671 slap_schema.si_ad_modifiersName ); 672 if ( !a ) { 673 attr_merge_one( op->ora_e, 674 slap_schema.si_ad_modifiersName, &name, &nname ); 675 } 676 677 a = attr_find( op->ora_e->e_attrs, 678 slap_schema.si_ad_modifyTimestamp ); 679 if ( !a ) { 680 attr_merge_one( op->ora_e, 681 slap_schema.si_ad_modifyTimestamp, ×tamp, NULL ); 682 } 683 } 684 685 return LDAP_SUCCESS; 686} 687