git.sur5r.net Git - openldap/blob - servers/slapd/modify.c

   1 /* $OpenLDAP$ */
   2 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
   3  *
   4  * Copyright 1998-2006 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
  30 #include <ac/socket.h>
  31 #include <ac/string.h>
  32 #include <ac/time.h>
  33
  34 #include "slap.h"
  35 #include "lutil.h"
  36
  37
  38 int
  39 do_modify(
  40     Operation   *op,
  41     SlapReply   *rs )
  42 {
  43         struct berval dn = BER_BVNULL;
  44         char            *last;
  45         ber_tag_t       tag;
  46         ber_len_t       len;
  47         Modifications   *modlist = NULL;
  48         Modifications   **modtail = &modlist;
  49         int             increment = 0;
  50         char            textbuf[ SLAP_TEXT_BUFLEN ];
  51         size_t          textlen = sizeof( textbuf );
  52
  53         Debug( LDAP_DEBUG_TRACE, "do_modify\n", 0, 0, 0 );
  54
  55         /*
  56          * Parse the modify request.  It looks like this:
  57          *
  58          *      ModifyRequest := [APPLICATION 6] SEQUENCE {
  59          *              name    DistinguishedName,
  60          *              mods    SEQUENCE OF SEQUENCE {
  61          *                      operation       ENUMERATED {
  62          *                              add     (0),
  63          *                              delete  (1),
  64          *                              replace (2)
  65          *                      },
  66          *                      modification    SEQUENCE {
  67          *                              type    AttributeType,
  68          *                              values  SET OF AttributeValue
  69          *                      }
  70          *              }
  71          *      }
  72          */
  73
  74         if ( ber_scanf( op->o_ber, "{m" /*}*/, &dn ) == LBER_ERROR ) {
  75                 Debug( LDAP_DEBUG_ANY, "do_modify: ber_scanf failed\n", 0, 0, 0 );
  76
  77                 send_ldap_discon( op, rs, LDAP_PROTOCOL_ERROR, "decoding error" );
  78                 return SLAPD_DISCONNECT;
  79         }
  80
  81         Debug( LDAP_DEBUG_ARGS, "do_modify: dn (%s)\n", dn.bv_val, 0, 0 );
  82
  83         /* collect modifications & save for later */
  84         for ( tag = ber_first_element( op->o_ber, &len, &last );
  85             tag != LBER_DEFAULT;
  86             tag = ber_next_element( op->o_ber, &len, last ) )
  87         {
  88                 ber_int_t mop;
  89                 Modifications tmp, *mod;
  90
  91                 tmp.sml_nvalues = NULL;
  92
  93                 if ( ber_scanf( op->o_ber, "{e{m[W]}}", &mop,
  94                     &tmp.sml_type, &tmp.sml_values ) == LBER_ERROR )
  95                 {
  96                         send_ldap_discon( op, rs, LDAP_PROTOCOL_ERROR,
  97                                 "decoding modlist error" );
  98                         rs->sr_err = SLAPD_DISCONNECT;
  99                         goto cleanup;
 100                 }
 101
 102                 mod = (Modifications *) ch_malloc( sizeof(Modifications) );
 103                 mod->sml_op = mop;
 104                 mod->sml_flags = 0;
 105                 mod->sml_type = tmp.sml_type;
 106                 mod->sml_values = tmp.sml_values;
 107                 mod->sml_nvalues = NULL;
 108                 mod->sml_desc = NULL;
 109                 mod->sml_next = NULL;
 110                 *modtail = mod;
 111
 112                 switch( mop ) {
 113                 case LDAP_MOD_ADD:
 114                         if ( mod->sml_values == NULL ) {
 115                                 Debug( LDAP_DEBUG_ANY,
 116                                         "do_modify: modify/add operation (%ld) requires values\n",
 117                                         (long) mop, 0, 0 );
 118
 119                                 send_ldap_error( op, rs, LDAP_PROTOCOL_ERROR,
 120                                         "modify/add operation requires values" );
 121                                 goto cleanup;
 122                         }
 123
 124                         /* fall through */
 125
 126                 case LDAP_MOD_DELETE:
 127                 case LDAP_MOD_REPLACE:
 128                         break;
 129
 130                 case LDAP_MOD_INCREMENT:
 131                         if( op->o_protocol >= LDAP_VERSION3 ) {
 132                                 increment++;
 133                                 if ( mod->sml_values == NULL ) {
 134                                         Debug( LDAP_DEBUG_ANY, "do_modify: "
 135                                                 "modify/increment operation (%ld) requires value\n",
 136                                                 (long) mop, 0, 0 );
 137
 138                                         send_ldap_error( op, rs, LDAP_PROTOCOL_ERROR,
 139                                                 "modify/increment operation requires value" );
 140                                         goto cleanup;
 141                                 }
 142
 143                                 if ( !BER_BVISNULL( &mod->sml_values[ 1 ] ) ) {
 144                                         Debug( LDAP_DEBUG_ANY, "do_modify: modify/increment "
 145                                                 "operation (%ld) requires single value\n",
 146                                                 (long) mop, 0, 0 );
 147
 148                                         send_ldap_error( op, rs, LDAP_PROTOCOL_ERROR,
 149                                                 "modify/increment operation requires single value" );
 150                                         goto cleanup;
 151                                 }
 152
 153                                 break;
 154                         }
 155                         /* fall thru */
 156
 157                 default: {
 158                                 Debug( LDAP_DEBUG_ANY,
 159                                         "do_modify: unrecognized modify operation (%ld)\n",
 160                                         (long) mop, 0, 0 );
 161
 162                                 send_ldap_error( op, rs, LDAP_PROTOCOL_ERROR,
 163                                         "unrecognized modify operation" );
 164                                 goto cleanup;
 165                         }
 166                 }
 167
 168                 modtail = &mod->sml_next;
 169         }
 170         *modtail = NULL;
 171
 172         if( get_ctrls( op, rs, 1 ) != LDAP_SUCCESS ) {
 173                 Debug( LDAP_DEBUG_ANY, "do_modify: get_ctrls failed\n", 0, 0, 0 );
 174                 goto cleanup;
 175         }
 176
 177         rs->sr_err = dnPrettyNormal( NULL, &dn, &op->o_req_dn, &op->o_req_ndn,
 178                 op->o_tmpmemctx );
 179         if( rs->sr_err != LDAP_SUCCESS ) {
 180                 Debug( LDAP_DEBUG_ANY,
 181                         "do_modify: invalid dn (%s)\n", dn.bv_val, 0, 0 );
 182                 send_ldap_error( op, rs, LDAP_INVALID_DN_SYNTAX, "invalid DN" );
 183                 goto cleanup;
 184         }
 185
 186         rs->sr_err = slap_mods_check( modlist,
 187                 &rs->sr_text, textbuf, textlen, NULL );
 188
 189         if ( rs->sr_err != LDAP_SUCCESS ) {
 190                 send_ldap_result( op, rs );
 191                 goto cleanup;
 192         }
 193
 194         /* FIXME: needs review */
 195         op->orm_modlist = modlist;
 196         op->orm_increment = increment;
 197
 198         op->o_bd = frontendDB;
 199         rs->sr_err = frontendDB->be_modify( op, rs );
 200
 201 #ifdef LDAP_X_TXN
 202         if( rs->sr_err == LDAP_X_TXN_SPECIFY_OKAY ) {
 203                 /* skip cleanup */
 204                 return rs->sr_err;
 205         }
 206 #endif
 207
 208 cleanup:
 209         op->o_tmpfree( op->o_req_dn.bv_val, op->o_tmpmemctx );
 210         op->o_tmpfree( op->o_req_ndn.bv_val, op->o_tmpmemctx );
 211         if ( op->orm_modlist != NULL ) slap_mods_free( op->orm_modlist, 1 );
 212
 213         return rs->sr_err;
 214 }
 215
 216 int
 217 fe_op_modify( Operation *op, SlapReply *rs )
 218 {
 219 #ifdef LDAP_DEBUG
 220         Modifications   *tmp;
 221 #endif
 222         int             manageDSAit;
 223         BackendDB       *op_be, *bd = op->o_bd;
 224         char            textbuf[ SLAP_TEXT_BUFLEN ];
 225         size_t          textlen = sizeof( textbuf );
 226
 227         if ( BER_BVISEMPTY( &op->o_req_ndn ) ) {
 228                 Debug( LDAP_DEBUG_ANY, "do_modify: root dse!\n", 0, 0, 0 );
 229
 230                 send_ldap_error( op, rs, LDAP_UNWILLING_TO_PERFORM,
 231                         "modify upon the root DSE not supported" );
 232                 goto cleanup;
 233
 234         } else if ( bvmatch( &op->o_req_ndn, &frontendDB->be_schemandn ) ) {
 235                 Debug( LDAP_DEBUG_ANY, "do_modify: subschema subentry!\n", 0, 0, 0 );
 236
 237                 send_ldap_error( op, rs, LDAP_UNWILLING_TO_PERFORM,
 238                         "modification of subschema subentry not supported" );
 239                 goto cleanup;
 240         }
 241
 242 #ifdef LDAP_DEBUG
 243         Debug( LDAP_DEBUG_ARGS, "modifications:\n", 0, 0, 0 );
 244
 245         for ( tmp = op->orm_modlist; tmp != NULL; tmp = tmp->sml_next ) {
 246                 Debug( LDAP_DEBUG_ARGS, "\t%s: %s\n",
 247                         tmp->sml_op == LDAP_MOD_ADD ? "add" :
 248                                 (tmp->sml_op == LDAP_MOD_INCREMENT ? "increment" :
 249                                 (tmp->sml_op == LDAP_MOD_DELETE ? "delete" :
 250                                         "replace")), tmp->sml_type.bv_val, 0 );
 251
 252                 if ( tmp->sml_values == NULL ) {
 253                         Debug( LDAP_DEBUG_ARGS, "%s\n",
 254                            "\t\tno values", NULL, NULL );
 255                 } else if ( BER_BVISNULL( &tmp->sml_values[ 0 ] ) ) {
 256                         Debug( LDAP_DEBUG_ARGS, "%s\n",
 257                            "\t\tzero values", NULL, NULL );
 258                 } else if ( BER_BVISNULL( &tmp->sml_values[ 1 ] ) ) {
 259                         Debug( LDAP_DEBUG_ARGS, "%s, length %ld\n",
 260                            "\t\tone value", (long) tmp->sml_values[0].bv_len, NULL );
 261                 } else {
 262                         Debug( LDAP_DEBUG_ARGS, "%s\n",
 263                            "\t\tmultiple values", NULL, NULL );
 264                 }
 265         }
 266
 267         if ( StatslogTest( LDAP_DEBUG_STATS ) ) {
 268                 char abuf[BUFSIZ/2], *ptr = abuf;
 269                 int len = 0;
 270
 271                 Statslog( LDAP_DEBUG_STATS, "%s MOD dn=\"%s\"\n",
 272                         op->o_log_prefix, op->o_req_dn.bv_val, 0, 0, 0 );
 273
 274                 for ( tmp = op->orm_modlist; tmp != NULL; tmp = tmp->sml_next ) {
 275                         if (len + 1 + tmp->sml_type.bv_len > sizeof(abuf)) {
 276                                 Statslog( LDAP_DEBUG_STATS, "%s MOD attr=%s\n",
 277                                     op->o_log_prefix, abuf, 0, 0, 0 );
 278
 279                                 len = 0;
 280                                 ptr = abuf;
 281
 282                                 if( 1 + tmp->sml_type.bv_len > sizeof(abuf)) {
 283                                         Statslog( LDAP_DEBUG_STATS, "%s MOD attr=%s\n",
 284                                                 op->o_log_prefix, tmp->sml_type.bv_val, 0, 0, 0 );
 285                                         continue;
 286                                 }
 287                         }
 288                         if (len) {
 289                                 *ptr++ = ' ';
 290                                 len++;
 291                         }
 292                         ptr = lutil_strcopy(ptr, tmp->sml_type.bv_val);
 293                         len += tmp->sml_type.bv_len;
 294                 }
 295                 if (len) {
 296                         Statslog( LDAP_DEBUG_STATS, "%s MOD attr=%s\n",
 297                                 op->o_log_prefix, abuf, 0, 0, 0 );
 298                 }
 299         }
 300 #endif  /* LDAP_DEBUG */
 301
 302         manageDSAit = get_manageDSAit( op );
 303
 304         /*
 305          * We could be serving multiple database backends.  Select the
 306          * appropriate one, or send a referral to our "referral server"
 307          * if we don't hold it.
 308          */
 309         op->o_bd = select_backend( &op->o_req_ndn, manageDSAit, 1 );
 310         if ( op->o_bd == NULL ) {
 311                 op->o_bd = bd;
 312                 rs->sr_ref = referral_rewrite( default_referral,
 313                         NULL, &op->o_req_dn, LDAP_SCOPE_DEFAULT );
 314                 if ( !rs->sr_ref ) {
 315                         rs->sr_ref = default_referral;
 316                 }
 317
 318                 if ( rs->sr_ref != NULL ) {
 319                         rs->sr_err = LDAP_REFERRAL;
 320                         send_ldap_result( op, rs );
 321
 322                         if ( rs->sr_ref != default_referral ) {
 323                                 ber_bvarray_free( rs->sr_ref );
 324                         }
 325
 326                 } else {
 327                         send_ldap_error( op, rs, LDAP_UNWILLING_TO_PERFORM,
 328                                 "no global superior knowledge" );
 329                 }
 330                 goto cleanup;
 331         }
 332
 333         /* If we've got a glued backend, check the real backend */
 334         op_be = op->o_bd;
 335         if ( SLAP_GLUE_INSTANCE( op->o_bd )) {
 336                 op->o_bd = select_backend( &op->o_req_ndn, manageDSAit, 0 );
 337         }
 338
 339         /* check restrictions */
 340         if ( backend_check_restrictions( op, rs, NULL ) != LDAP_SUCCESS ) {
 341                 send_ldap_result( op, rs );
 342                 goto cleanup;
 343         }
 344
 345         /* check for referrals */
 346         if ( backend_check_referrals( op, rs ) != LDAP_SUCCESS ) {
 347                 goto cleanup;
 348         }
 349
 350         rs->sr_err = slap_mods_obsolete_check( op, op->orm_modlist,
 351                 &rs->sr_text, textbuf, textlen );
 352         if ( rs->sr_err != LDAP_SUCCESS ) {
 353                 send_ldap_result( op, rs );
 354                 goto cleanup;
 355         }
 356
 357         /* check for modify/increment support */
 358         if ( op->orm_increment && !SLAP_INCREMENT( op->o_bd ) ) {
 359                 send_ldap_error( op, rs, LDAP_UNWILLING_TO_PERFORM,
 360                         "modify/increment not supported in context" );
 361         }
 362
 363         /*
 364          * do the modify if 1 && (2 || 3)
 365          * 1) there is a modify function implemented in this backend;
 366          * 2) this backend is master for what it holds;
 367          * 3) it's a replica and the dn supplied is the update_ndn.
 368          */
 369         if ( op->o_bd->be_modify ) {
 370                 /* do the update here */
 371                 int repl_user = be_isupdate( op );
 372
 373                 /*
 374                  * Multimaster slapd does not have to check for replicator dn
 375                  * because it accepts each modify request
 376                  */
 377                 if ( !SLAP_SINGLE_SHADOW(op->o_bd) || repl_user ) {
 378                         int update = !BER_BVISEMPTY( &op->o_bd->be_update_ndn );
 379                         slap_callback cb = { NULL, slap_replog_cb, NULL, NULL };
 380
 381                         op->o_bd = op_be;
 382
 383                         if ( !update ) {
 384                                 rs->sr_err = slap_mods_no_user_mod_check( op, op->orm_modlist,
 385                                         &rs->sr_text, textbuf, textlen );
 386                                 if ( rs->sr_err != LDAP_SUCCESS ) {
 387                                         send_ldap_result( op, rs );
 388                                         goto cleanup;
 389                                 }
 390                         }
 391
 392                         if ( !repl_user ) {
 393                                 /* but multimaster slapd logs only the ones
 394                                  * not from a replicator user */
 395                                 cb.sc_next = op->o_callback;
 396                                 op->o_callback = &cb;
 397                         }
 398                         op->o_bd->be_modify( op, rs );
 399
 400                 } else { /* send a referral */
 401                         BerVarray defref = op->o_bd->be_update_refs
 402                                 ? op->o_bd->be_update_refs : default_referral;
 403                         if ( defref != NULL ) {
 404                                 rs->sr_ref = referral_rewrite( defref,
 405                                         NULL, &op->o_req_dn,
 406                                         LDAP_SCOPE_DEFAULT );
 407                                 if ( rs->sr_ref == NULL ) {
 408                                         /* FIXME: must duplicate, because
 409                                          * overlays may muck with it */
 410                                         rs->sr_ref = defref;
 411                                 }
 412                                 rs->sr_err = LDAP_REFERRAL;
 413                                 send_ldap_result( op, rs );
 414                                 if ( rs->sr_ref != defref ) {
 415                                         ber_bvarray_free( rs->sr_ref );
 416                                 }
 417
 418                         } else {
 419                                 send_ldap_error( op, rs, LDAP_UNWILLING_TO_PERFORM,
 420                                         "shadow context; no update referral" );
 421                         }
 422                 }
 423
 424         } else {
 425                 send_ldap_error( op, rs, LDAP_UNWILLING_TO_PERFORM,
 426                     "operation not supported within namingContext" );
 427         }
 428
 429 cleanup:;
 430         op->o_bd = bd;
 431         return rs->sr_err;
 432 }
 433
 434 /*
 435  * Obsolete constraint checking.
 436  */
 437 int
 438 slap_mods_obsolete_check(
 439         Operation *op,
 440         Modifications *ml,
 441         const char **text,
 442         char *textbuf,
 443         size_t textlen )
 444 {
 445         if( get_relax( op ) ) return LDAP_SUCCESS;
 446
 447         for ( ; ml != NULL; ml = ml->sml_next ) {
 448                 if ( is_at_obsolete( ml->sml_desc->ad_type ) &&
 449                         (( ml->sml_op != LDAP_MOD_REPLACE &&
 450                                 ml->sml_op != LDAP_MOD_DELETE ) ||
 451                                         ml->sml_values != NULL ))
 452                 {
 453                         /*
 454                          * attribute is obsolete,
 455                          * only allow replace/delete with no values
 456                          */
 457                         snprintf( textbuf, textlen,
 458                                 "%s: attribute is obsolete",
 459                                 ml->sml_type.bv_val );
 460                         *text = textbuf;
 461                         return LDAP_CONSTRAINT_VIOLATION;
 462                 }
 463         }
 464
 465         return LDAP_SUCCESS;
 466 }
 467
 468 /*
 469  * No-user-modification constraint checking.
 470  */
 471 int
 472 slap_mods_no_user_mod_check(
 473         Operation *op,
 474         Modifications *ml,
 475         const char **text,
 476         char *textbuf,
 477         size_t textlen )
 478 {
 479         for ( ; ml != NULL; ml = ml->sml_next ) {
 480                 if ( !is_at_no_user_mod( ml->sml_desc->ad_type ) ) {
 481                         continue;
 482                 }
 483
 484                 if ( get_relax( op ) ) {
 485                         if ( ml->sml_desc->ad_type->sat_flags & SLAP_AT_MANAGEABLE ) {
 486                                 ml->sml_flags |= SLAP_MOD_MANAGING;
 487                                 continue;
 488                         }
 489
 490                         /* attribute not manageable */
 491                         snprintf( textbuf, textlen,
 492                                 "%s: no-user-modification attribute not manageable",
 493                                 ml->sml_type.bv_val );
 494
 495                 } else {
 496                         /* user modification disallowed */
 497                         snprintf( textbuf, textlen,
 498                                 "%s: no user modification allowed",
 499                                 ml->sml_type.bv_val );
 500                 }
 501
 502                 *text = textbuf;
 503                 return LDAP_CONSTRAINT_VIOLATION;
 504         }
 505
 506         return LDAP_SUCCESS;
 507 }
 508
 509 int
 510 slap_mods_no_repl_user_mod_check(
 511         Operation *op,
 512         Modifications *ml,
 513         const char **text,
 514         char *textbuf,
 515         size_t textlen )
 516 {
 517         Modifications *mods;
 518         Modifications *modp;
 519
 520         for ( mods = ml; mods != NULL; mods = mods->sml_next ) {
 521                 assert( mods->sml_op == LDAP_MOD_ADD );
 522
 523                 /* check doesn't already appear */
 524                 for ( modp = ml; modp != NULL; modp = modp->sml_next ) {
 525                         if ( mods->sml_desc == modp->sml_desc && mods != modp ) {
 526                                 snprintf( textbuf, textlen,
 527                                         "attribute '%s' provided more than once",
 528                                         mods->sml_desc->ad_cname.bv_val );
 529                                 *text = textbuf;
 530                                 return LDAP_TYPE_OR_VALUE_EXISTS;
 531                         }
 532                 }
 533         }
 534
 535         return LDAP_SUCCESS;
 536 }
 537
 538 /*
 539  * Do basic attribute type checking and syntax validation.
 540  */
 541 int slap_mods_check(
 542         Modifications *ml,
 543         const char **text,
 544         char *textbuf,
 545         size_t textlen,
 546         void *ctx )
 547 {
 548         int rc;
 549
 550         for( ; ml != NULL; ml = ml->sml_next ) {
 551                 AttributeDescription *ad = NULL;
 552
 553                 /* convert to attribute description */
 554                 if ( ml->sml_desc == NULL ) {
 555                         rc = slap_bv2ad( &ml->sml_type, &ml->sml_desc, text );
 556                         if( rc != LDAP_SUCCESS ) {
 557                                 snprintf( textbuf, textlen, "%s: %s",
 558                                         ml->sml_type.bv_val, *text );
 559                                 *text = textbuf;
 560                                 return rc;
 561                         }
 562                 }
 563
 564                 ad = ml->sml_desc;
 565
 566                 if( slap_syntax_is_binary( ad->ad_type->sat_syntax )
 567                         && !slap_ad_is_binary( ad ))
 568                 {
 569                         /* attribute requires binary transfer */
 570                         snprintf( textbuf, textlen,
 571                                 "%s: requires ;binary transfer",
 572                                 ml->sml_type.bv_val );
 573                         *text = textbuf;
 574                         return LDAP_UNDEFINED_TYPE;
 575                 }
 576
 577                 if( !slap_syntax_is_binary( ad->ad_type->sat_syntax )
 578                         && slap_ad_is_binary( ad ))
 579                 {
 580                         /* attribute does not require binary transfer */
 581                         snprintf( textbuf, textlen,
 582                                 "%s: disallows ;binary transfer",
 583                                 ml->sml_type.bv_val );
 584                         *text = textbuf;
 585                         return LDAP_UNDEFINED_TYPE;
 586                 }
 587
 588                 if( slap_ad_is_tag_range( ad )) {
 589                         /* attribute requires binary transfer */
 590                         snprintf( textbuf, textlen,
 591                                 "%s: inappropriate use of tag range option",
 592                                 ml->sml_type.bv_val );
 593                         *text = textbuf;
 594                         return LDAP_UNDEFINED_TYPE;
 595                 }
 596
 597 #if 0
 598                 if ( is_at_obsolete( ad->ad_type ) &&
 599                         (( ml->sml_op != LDAP_MOD_REPLACE &&
 600                                 ml->sml_op != LDAP_MOD_DELETE ) ||
 601                                         ml->sml_values != NULL ))
 602                 {
 603                         /*
 604                          * attribute is obsolete,
 605                          * only allow replace/delete with no values
 606                          */
 607                         snprintf( textbuf, textlen,
 608                                 "%s: attribute is obsolete",
 609                                 ml->sml_type.bv_val );
 610                         *text = textbuf;
 611                         return LDAP_CONSTRAINT_VIOLATION;
 612                 }
 613 #endif
 614
 615                 if ( ml->sml_op == LDAP_MOD_INCREMENT &&
 616 #ifdef SLAPD_REAL_SYNTAX
 617                         !is_at_syntax( ad->ad_type, SLAPD_REAL_SYNTAX ) &&
 618 #endif
 619                         !is_at_syntax( ad->ad_type, SLAPD_INTEGER_SYNTAX ) )
 620                 {
 621                         /*
 622                          * attribute values must be INTEGER or REAL
 623                          */
 624                         snprintf( textbuf, textlen,
 625                                 "%s: attribute syntax inappropriate for increment",
 626                                 ml->sml_type.bv_val );
 627                         *text = textbuf;
 628                         return LDAP_CONSTRAINT_VIOLATION;
 629                 }
 630
 631                 /*
 632                  * check values
 633                  */
 634                 if( ml->sml_values != NULL ) {
 635                         ber_len_t nvals;
 636                         slap_syntax_validate_func *validate =
 637                                 ad->ad_type->sat_syntax->ssyn_validate;
 638                         slap_syntax_transform_func *pretty =
 639                                 ad->ad_type->sat_syntax->ssyn_pretty;
 640
 641                         if( !pretty && !validate ) {
 642                                 *text = "no validator for syntax";
 643                                 snprintf( textbuf, textlen,
 644                                         "%s: no validator for syntax %s",
 645                                         ml->sml_type.bv_val,
 646                                         ad->ad_type->sat_syntax->ssyn_oid );
 647                                 *text = textbuf;
 648                                 return LDAP_INVALID_SYNTAX;
 649                         }
 650
 651                         /*
 652                          * check that each value is valid per syntax
 653                          *      and pretty if appropriate
 654                          */
 655                         for ( nvals = 0; !BER_BVISNULL( &ml->sml_values[nvals] ); nvals++ ) {
 656                                 struct berval pval;
 657
 658                                 if ( pretty ) {
 659                                         rc = ordered_value_pretty( ad,
 660                                                 &ml->sml_values[nvals], &pval, ctx );
 661                                 } else {
 662                                         rc = ordered_value_validate( ad,
 663                                                 &ml->sml_values[nvals], ml->sml_op );
 664                                 }
 665
 666                                 if( rc != 0 ) {
 667                                         snprintf( textbuf, textlen,
 668                                                 "%s: value #%ld invalid per syntax",
 669                                                 ml->sml_type.bv_val, (long) nvals );
 670                                         *text = textbuf;
 671                                         return LDAP_INVALID_SYNTAX;
 672                                 }
 673
 674                                 if( pretty ) {
 675                                         ber_memfree_x( ml->sml_values[nvals].bv_val, ctx );
 676                                         ml->sml_values[nvals] = pval;
 677                                 }
 678                         }
 679
 680                         /*
 681                          * a rough single value check... an additional check is needed
 682                          * to catch add of single value to existing single valued attribute
 683                          */
 684                         if ((ml->sml_op == LDAP_MOD_ADD || ml->sml_op == LDAP_MOD_REPLACE)
 685                                 && nvals > 1 && is_at_single_value( ad->ad_type ))
 686                         {
 687                                 snprintf( textbuf, textlen,
 688                                         "%s: multiple values provided",
 689                                         ml->sml_type.bv_val );
 690                                 *text = textbuf;
 691                                 return LDAP_CONSTRAINT_VIOLATION;
 692                         }
 693
 694                         /* if the type has a normalizer, generate the
 695                          * normalized values. otherwise leave them NULL.
 696                          *
 697                          * this is different from the rule for attributes
 698                          * in an entry - in an attribute list, the normalized
 699                          * value is set equal to the non-normalized value
 700                          * when there is no normalizer.
 701                          */
 702                         if( nvals && ad->ad_type->sat_equality &&
 703                                 ad->ad_type->sat_equality->smr_normalize )
 704                         {
 705                                 ml->sml_nvalues = ber_memalloc_x(
 706                                         (nvals+1)*sizeof(struct berval), ctx );
 707
 708                                 for ( nvals = 0; !BER_BVISNULL( &ml->sml_values[nvals] ); nvals++ ) {
 709                                         rc = ordered_value_normalize(
 710                                                 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
 711                                                 ad,
 712                                                 ad->ad_type->sat_equality,
 713                                                 &ml->sml_values[nvals], &ml->sml_nvalues[nvals], ctx );
 714                                         if ( rc ) {
 715                                                 Debug( LDAP_DEBUG_ANY,
 716                                                         "<= str2entry NULL (ssyn_normalize %d)\n",
 717                                                         rc, 0, 0 );
 718                                                 snprintf( textbuf, textlen,
 719                                                         "%s: value #%ld normalization failed",
 720                                                         ml->sml_type.bv_val, (long) nvals );
 721                                                 *text = textbuf;
 722                                                 return rc;
 723                                         }
 724                                 }
 725
 726                                 BER_BVZERO( &ml->sml_nvalues[nvals] );
 727                         }
 728
 729                         /* check for duplicates, but ignore Deletes.
 730                          */
 731                         if( nvals > 1 && ml->sml_op != LDAP_MOD_DELETE ) {
 732 #define SLAP_MODS_CHECK_QUICKSORT
 733 #ifndef SLAP_MODS_CHECK_QUICKSORT
 734                                 int             i, j, rc, match;
 735                                 MatchingRule *mr = ad->ad_type->sat_equality;
 736
 737                                 for ( i = 1; i < nvals ; i++ ) {
 738                                         /* test asserted values against themselves */
 739                                         for( j = 0; j < i; j++ ) {
 740                                                 rc = ordered_value_match( &match, ml->sml_desc, mr,
 741                                                         SLAP_MR_EQUALITY
 742                                                                 | SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX
 743                                                                 | SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH
 744                                                                 | SLAP_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH,
 745                                                         ml->sml_nvalues
 746                                                                 ? &ml->sml_nvalues[i]
 747                                                                 : &ml->sml_values[i],
 748                                                         ml->sml_nvalues
 749                                                                 ? &ml->sml_nvalues[j]
 750                                                                 : &ml->sml_values[j],
 751                                                         text );
 752                                                 if ( rc == LDAP_SUCCESS && match == 0 ) {
 753                                                         /* value exists already */
 754                                                         snprintf( textbuf, textlen,
 755                                                                 "%s: value #%d provided more than once",
 756                                                                 ml->sml_desc->ad_cname.bv_val, j );
 757                                                         *text = textbuf;
 758                                                         return LDAP_TYPE_OR_VALUE_EXISTS;
 759
 760                                                 } else if ( rc != LDAP_SUCCESS ) {
 761                                                         return rc;
 762                                                 }
 763                                         }
 764                                 }
 765 #else   /* SLAP_MODS_CHECK_QUICKSORT */
 766
 767 /* Quicksort + Insertion sort for small arrays */
 768
 769 #define SMALL   8
 770 #define SWAP(a,b,tmp)   tmp=(a);(a)=(b);(b)=tmp
 771 #define COMP(a,b)       match=0; rc = ordered_value_match( &match, \
 772                                                 ml->sml_desc, mr, SLAP_MR_EQUALITY \
 773                                                                 | SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX \
 774                                                                 | SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH \
 775                                                                 | SLAP_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH, \
 776                                                                 &(a), &(b), text );
 777
 778                                         MatchingRule *mr = ad->ad_type->sat_equality;
 779                                         int istack[sizeof(int)*16];
 780                                         int i,j,k,l,ir,jstack, rc, match, *ix, itmp;
 781                                         struct berval a, *cv;
 782
 783 /* If PRESERVE_ORDER is defined only the index array is sorted; the
 784  * actual values are left in their incoming order. Otherwise, the
 785  * only reason to keep the index array is to identify the offending
 786  * value when duplicates are found.
 787  */
 788 #define PRESERVE_ORDER
 789 #ifndef PRESERVE_ORDER
 790                                         struct berval va, *v, *nv, bvtmp;
 791
 792 #define IX(x)   x
 793 #define EXCH(x,y)       SWAP(ix[x],ix[y],itmp); SWAP(cv[x],cv[y],bvtmp); \
 794         if (nv) {SWAP(v[x],v[y],bvtmp);}
 795 #define SETA(x) itmp = ix[x]; a = cv[x]; if (nv) va=v[x]
 796 #define GETA(x) ix[x] = itmp; cv[x] = a; if (nv) v[x]=va
 797 #define SET(x,y)        ix[x] = ix[y]; cv[x] = cv[y]; if (nv) v[x]=v[y]
 798
 799                                         v = ml->sml_values;
 800                                         nv = ml->sml_nvalues;
 801
 802 #else   /* PRESERVE_ORDER */
 803
 804 #define IX(x)   ix[x]
 805 #define EXCH(x,y)       SWAP(ix[x],ix[y],itmp)
 806 #define SETA(x) itmp = ix[x]; a = cv[itmp]
 807 #define GETA(x) ix[x] = itmp;
 808 #define SET(x,y)        ix[x] = ix[y]
 809
 810 #endif  /* PRESERVE_ORDER */
 811
 812                                         cv = ml->sml_nvalues ? ml->sml_nvalues : ml->sml_values;
 813                                         if ( ad == slap_schema.si_ad_objectClass )
 814                                                 mr = NULL;      /* shortcut matching */
 815
 816                                         /* record indices to preserve input ordering */
 817                                         ix = slap_sl_malloc( nvals * sizeof(int), ctx );
 818                                         for (i=0; i<nvals; i++) ix[i] = i;
 819
 820                                         ir = nvals-1;
 821                                         l = 0;
 822                                         jstack = 0;
 823
 824                                         for(;;) {
 825                                                 if (ir - l < SMALL) {   /* Insertion sort */
 826                                                         match=1;
 827                                                         for (j=l+1;j<=ir;j++) {
 828                                                                 SETA(j);
 829                                                                 for (i=j-1;i>=0;i--) {
 830                                                                         COMP(cv[IX(i)], a);
 831                                                                         if ( match <= 0 )
 832                                                                                 break;
 833                                                                         SET(i+1,i);
 834                                                                 }
 835                                                                 GETA(i+1);
 836                                                                 if ( match == 0 ) goto done;
 837                                                         }
 838                                                         if ( jstack == 0 ) break;
 839                                                         if ( match == 0 ) break;
 840                                                         ir = istack[jstack--];
 841                                                         l = istack[jstack--];
 842                                                 } else {
 843                                                         k = (l + ir) >> 1;      /* Choose median of left, center, right */
 844                                                         EXCH(k, l+1);
 845                                                         COMP( cv[IX(l)], cv[IX(ir)] );
 846                                                         if ( match > 0 ) {
 847                                                                 EXCH(l, ir);
 848                                                         } else if ( match == 0 ) {
 849                                                                 i = ir;
 850                                                                 break;
 851                                                         }
 852                                                         COMP( cv[IX(l+1)], cv[IX(ir)] );
 853                                                         if ( match > 0 ) {
 854                                                                 EXCH(l+1, ir);
 855                                                         } else if ( match == 0 ) {
 856                                                                 i = ir;
 857                                                                 break;
 858                                                         }
 859                                                         COMP( cv[IX(l)], cv[IX(l+1)] );
 860                                                         if ( match > 0 ) {
 861                                                                 EXCH(l, l+1);
 862                                                         } else if ( match == 0 ) {
 863                                                                 i = l;
 864                                                                 break;
 865                                                         }
 866                                                         i = l+1;
 867                                                         j = ir;
 868                                                         a = cv[IX(i)];
 869                                                         for(;;) {
 870                                                                 do {
 871                                                                         i++;
 872                                                                         COMP( cv[IX(i)], a );
 873                                                                 } while( match < 0 );
 874                                                                 while( match > 0 ) {
 875                                                                         j--;
 876                                                                         COMP( cv[IX(j)], a );
 877                                                                 }
 878                                                                 if (j < i) {
 879                                                                         match = 1;
 880                                                                         break;
 881                                                                 }
 882                                                                 if ( match == 0 ) {
 883                                                                         i = l+1;
 884                                                                         break;
 885                                                                 }
 886                                                                 EXCH(i,j);
 887                                                         }
 888                                                         if ( match == 0 )
 889                                                                 break;
 890                                                         EXCH(l+1,j);
 891                                                         jstack += 2;
 892                                                         if (ir-i+1 >= j) {
 893                                                                 istack[jstack] = ir;
 894                                                                 istack[jstack-1] = i;
 895                                                                 ir = j;
 896                                                         } else {
 897                                                                 istack[jstack] = j;
 898                                                                 istack[jstack-1] = l;
 899                                                                 l = i;
 900                                                 }
 901                                         }
 902                                 }
 903 done:
 904                                 if ( i >= 0 )
 905                                         j = ix[i];
 906
 907                                 slap_sl_free( ix, ctx );
 908
 909                                 if ( rc != LDAP_SUCCESS ) {
 910                                         return rc;
 911                                 } else if ( match == 0 ) {
 912                                         /* value exists already */
 913                                         assert( i >= 0 );
 914                                         assert( i < nvals );
 915                                         snprintf( textbuf, textlen,
 916                                                 "%s: value #%d provided more than once",
 917                                                 ml->sml_desc->ad_cname.bv_val, j );
 918                                         *text = textbuf;
 919                                         return LDAP_TYPE_OR_VALUE_EXISTS;
 920                                 }
 921 #endif  /* SLAP_MODS_CHECK_QUICKSORT */
 922                         }
 923                 }
 924         }
 925
 926         return LDAP_SUCCESS;
 927 }
 928
 929 /* Enter with bv->bv_len = sizeof buffer, returns with
 930  * actual length of string
 931  */
 932 void slap_timestamp( time_t *tm, struct berval *bv )
 933 {
 934         struct tm *ltm;
 935 #ifdef HAVE_GMTIME_R
 936         struct tm ltm_buf;
 937
 938         ltm = gmtime_r( tm, &ltm_buf );
 939 #else
 940         ldap_pvt_thread_mutex_lock( &gmtime_mutex );
 941         ltm = gmtime( tm );
 942 #endif
 943
 944         bv->bv_len = lutil_gentime( bv->bv_val, bv->bv_len, ltm );
 945
 946 #ifndef HAVE_GMTIME_R
 947         ldap_pvt_thread_mutex_unlock( &gmtime_mutex );
 948 #endif
 949 }
 950
 951 /* Called for all modify and modrdn ops. If the current op was replicated
 952  * from elsewhere, all of the attrs should already be present.
 953  */
 954 void slap_mods_opattrs(
 955         Operation *op,
 956         Modifications **modsp,
 957         int manage_ctxcsn )
 958 {
 959         struct berval name, timestamp, csn = BER_BVNULL;
 960         struct berval nname;
 961         char timebuf[ LDAP_LUTIL_GENTIME_BUFSIZE ];
 962         char csnbuf[ LDAP_LUTIL_CSNSTR_BUFSIZE ];
 963         Modifications *mod, **modtail, *modlast;
 964         int gotcsn = 0, gotmname = 0, gotmtime = 0;
 965
 966         if ( SLAP_LASTMOD( op->o_bd ) ) {
 967                 char *ptr;
 968                 timestamp.bv_val = timebuf;
 969                 for ( modtail = modsp; *modtail; modtail = &(*modtail)->sml_next ) {
 970                         if ( (*modtail)->sml_op != LDAP_MOD_ADD &&
 971                                 (*modtail)->sml_op != LDAP_MOD_REPLACE ) continue;
 972                         if ( (*modtail)->sml_desc == slap_schema.si_ad_entryCSN ) {
 973                                 csn = (*modtail)->sml_values[0];
 974                                 gotcsn = 1;
 975                         } else
 976                         if ( (*modtail)->sml_desc == slap_schema.si_ad_modifiersName ) {
 977                                 gotmname = 1;
 978                         } else
 979                         if ( (*modtail)->sml_desc == slap_schema.si_ad_modifyTimestamp ) {
 980                                 gotmtime = 1;
 981                         }
 982                 }
 983                 if ( BER_BVISEMPTY( &op->o_csn )) {
 984                         if ( !gotcsn ) {
 985                                 csn.bv_val = csnbuf;
 986                                 csn.bv_len = sizeof( csnbuf );
 987                                 slap_get_csn( op, &csn, manage_ctxcsn );
 988                         } else {
 989                                 if ( manage_ctxcsn )
 990                                         slap_queue_csn( op, &csn );
 991                         }
 992                 } else {
 993                         csn = op->o_csn;
 994                 }
 995                 ptr = ber_bvchr( &csn, '#' );
 996                 if ( ptr ) {
 997                         timestamp.bv_len = ptr - csn.bv_val;
 998                         if ( timestamp.bv_len >= sizeof( timebuf ))     /* ?!? */
 999                                 timestamp.bv_len = sizeof( timebuf ) - 1;
1000                         AC_MEMCPY( timebuf, csn.bv_val, timestamp.bv_len );
1001                         timebuf[timestamp.bv_len] = '\0';
1002                 } else {
1003                         time_t now = slap_get_time();
1004
1005                         timestamp.bv_len = sizeof(timebuf);
1006
1007                         slap_timestamp( &now, &timestamp );
1008                 }
1009
1010                 if ( BER_BVISEMPTY( &op->o_dn ) ) {
1011                         BER_BVSTR( &name, SLAPD_ANONYMOUS );
1012                         nname = name;
1013                 } else {
1014                         name = op->o_dn;
1015                         nname = op->o_ndn;
1016                 }
1017
1018                 if ( !gotcsn ) {
1019                         mod = (Modifications *) ch_malloc( sizeof( Modifications ) );
1020                         mod->sml_op = LDAP_MOD_REPLACE;
1021                         mod->sml_flags = SLAP_MOD_INTERNAL;
1022                         mod->sml_next = NULL;
1023                         BER_BVZERO( &mod->sml_type );
1024                         mod->sml_desc = slap_schema.si_ad_entryCSN;
1025                         mod->sml_values = (BerVarray) ch_malloc( 2 * sizeof( struct berval ) );
1026                         ber_dupbv( &mod->sml_values[0], &csn );
1027                         BER_BVZERO( &mod->sml_values[1] );
1028                         assert( !BER_BVISNULL( &mod->sml_values[0] ) );
1029                         mod->sml_nvalues = NULL;
1030                         *modtail = mod;
1031                         modlast = mod;
1032                         modtail = &mod->sml_next;
1033                 }
1034
1035                 if ( !gotmname ) {
1036                         mod = (Modifications *) ch_malloc( sizeof( Modifications ) );
1037                         mod->sml_op = LDAP_MOD_REPLACE;
1038                         mod->sml_flags = SLAP_MOD_INTERNAL;
1039                         mod->sml_next = NULL;
1040                         BER_BVZERO( &mod->sml_type );
1041                         mod->sml_desc = slap_schema.si_ad_modifiersName;
1042                         mod->sml_values = (BerVarray) ch_malloc( 2 * sizeof( struct berval ) );
1043                         ber_dupbv( &mod->sml_values[0], &name );
1044                         BER_BVZERO( &mod->sml_values[1] );
1045                         assert( !BER_BVISNULL( &mod->sml_values[0] ) );
1046                         mod->sml_nvalues =
1047                                 (BerVarray) ch_malloc( 2 * sizeof( struct berval ) );
1048                         ber_dupbv( &mod->sml_nvalues[0], &nname );
1049                         BER_BVZERO( &mod->sml_nvalues[1] );
1050                         assert( !BER_BVISNULL( &mod->sml_nvalues[0] ) );
1051                         *modtail = mod;
1052                         modtail = &mod->sml_next;
1053                 }
1054
1055                 if ( !gotmtime ) {
1056                         mod = (Modifications *) ch_malloc( sizeof( Modifications ) );
1057                         mod->sml_op = LDAP_MOD_REPLACE;
1058                         mod->sml_flags = SLAP_MOD_INTERNAL;
1059                         mod->sml_next = NULL;
1060                         BER_BVZERO( &mod->sml_type );
1061                         mod->sml_desc = slap_schema.si_ad_modifyTimestamp;
1062                         mod->sml_values = (BerVarray) ch_malloc( 2 * sizeof( struct berval ) );
1063                         ber_dupbv( &mod->sml_values[0], &timestamp );
1064                         BER_BVZERO( &mod->sml_values[1] );
1065                         assert( !BER_BVISNULL( &mod->sml_values[0] ) );
1066                         mod->sml_nvalues = NULL;
1067                         *modtail = mod;
1068                         modtail = &mod->sml_next;
1069                 }
1070         }
1071 }
1072