dbm/tests/lots.c

   1 /* -*- Mode: C; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
   2 /* ***** BEGIN LICENSE BLOCK *****
   3  * Version: MPL 1.1/GPL 2.0/LGPL 2.1
   4  *
   5  * The contents of this file are subject to the Mozilla Public License Version
   6  * 1.1 (the "License"); you may not use this file except in compliance with
   7  * the License. You may obtain a copy of the License at
   8  * http://www.mozilla.org/MPL/
   9  *
  10  * Software distributed under the License is distributed on an "AS IS" basis,
  11  * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
  12  * for the specific language governing rights and limitations under the
  13  * License.
  14  *
  15  * The Original Code is mozilla.org code.
  16  *
  17  * The Initial Developer of the Original Code is
  18  * Netscape Communications Corporation.
  19  * Portions created by the Initial Developer are Copyright (C) 1998
  20  * the Initial Developer. All Rights Reserved.
  21  *
  22  * Contributor(s):
  23  *
  24  * Alternatively, the contents of this file may be used under the terms of
  25  * either the GNU General Public License Version 2 or later (the "GPL"), or
  26  * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
  27  * in which case the provisions of the GPL or the LGPL are applicable instead
  28  * of those above. If you wish to allow use of your version of this file only
  29  * under the terms of either the GPL or the LGPL, and not to allow others to
  30  * use your version of this file under the terms of the MPL, indicate your
  31  * decision by deleting the provisions above and replace them with the notice
  32  * and other provisions required by the GPL or the LGPL. If you do not delete
  33  * the provisions above, a recipient may use your version of this file under
  34  * the terms of any one of the MPL, the GPL or the LGPL.
  35  *
  36  * ***** END LICENSE BLOCK ***** */
  37
  38 /* use sequental numbers printed to strings
  39  * to store lots and lots of entries in the
  40  * database.
  41  *
  42  * Start with 100 entries, put them and then
  43  * read them out.  Then delete the first
  44  * half and verify that all of the first half
  45  * is gone and then verify that the second
  46  * half is still there.
  47  * Then add the first half back and verify
  48  * again.  Then delete the middle third
  49  * and verify again.
  50  * Then increase the size by 1000 and do
  51  * the whole add delete thing again.
  52  *
  53  * The data for each object is the number string translated
  54  * to hex and replicated a random number of times.  The
  55  * number of times that the data is replicated is the first
  56  * int32 in the data.
  57  */
  58
  59 #include <stdio.h>
  60
  61 #include <stdlib.h>
  62 #ifdef STDC_HEADERS
  63 #include <stdarg.h>
  64 #else
  65 #include <varargs.h>
  66 #endif
  67
  68 #ifdef HAVE_MEMORY_H
  69 #include <memory.h>
  70 #endif
  71 #include <string.h>
  72 #include <assert.h>
  73 #include "mcom_db.h"
  74
  75 DB *database=0;
  76 int MsgPriority=5;
  77
  78 #if defined(_WINDOWS) && !defined(WIN32)
  79 #define int32 long
  80 #define uint32 unsigned long
  81 #else
  82 #define int32 int
  83 #define uint32 unsigned int
  84 #endif
  85
  86 typedef enum {
  87 USE_LARGE_KEY,
  88 USE_SMALL_KEY
  89 } key_type_enum;
  90
  91 #define TraceMe(priority, msg)          \
  92         do {                                                    \
  93                 if(priority <= MsgPriority)     \
  94                   {                                                     \
  95                         ReportStatus msg;               \
  96                   }                                                     \
  97         } while(0)
  98
  99 int
 100 ReportStatus(char *string, ...)
 101 {
 102     va_list args;
 103
 104 #ifdef STDC_HEADERS
 105     va_start(args, string);
 106 #else
 107     va_start(args);
 108 #endif
 109     vfprintf(stderr, string, args);
 110     va_end(args);
 111
 112         fprintf (stderr, "\n");
 113
 114         return(0);
 115 }
 116
 117 int
 118 ReportError(char *string, ...)
 119 {
 120     va_list args;
 121
 122 #ifdef STDC_HEADERS
 123     va_start(args, string);
 124 #else
 125     va_start(args);
 126 #endif
 127         fprintf (stderr, "\n    ");
 128     vfprintf(stderr, string, args);
 129         fprintf (stderr, "\n");
 130     va_end(args);
 131
 132         return(0);
 133 }
 134
 135 DBT * MakeLargeKey(int32 num)
 136 {
 137         int32 low_bits;
 138         static DBT rv;
 139         static char *string_rv=0;
 140         int rep_char;
 141         size_t size;
 142
 143         if(string_rv)
 144                 free(string_rv);
 145
 146         /* generate a really large text key derived from
 147          * an int32
 148          */
 149         low_bits = (num % 10000) + 1;
 150
 151         /* get the repeat char from the low 26 */
 152         rep_char = (char) ((low_bits % 26) + 'a');
 153
 154         /* malloc a string low_bits wide */
 155         size = low_bits*sizeof(char);
 156         string_rv = (char *)malloc(size);
 157
 158         memset(string_rv, rep_char, size);
 159
 160         rv.data = string_rv;
 161         rv.size = size;
 162
 163         return(&rv);
 164 }
 165
 166 DBT * MakeSmallKey(int32 num)
 167 {
 168         static DBT rv;
 169         static char data_string[64];
 170
 171         rv.data = data_string;
 172
 173         sprintf(data_string, "%ld", (long)num);
 174         rv.size = strlen(data_string);
 175
 176         return(&rv);
 177
 178 }
 179
 180 DBT * GenKey(int32 num, key_type_enum key_type)
 181 {
 182         DBT *key;
 183
 184         switch(key_type)
 185           {
 186                 case USE_LARGE_KEY:
 187                         key = MakeLargeKey(num);
 188                         break;
 189                 case USE_SMALL_KEY:
 190                         key = MakeSmallKey(num);
 191                         break;
 192                 default:
 193                         abort();
 194                         break;
 195           }
 196
 197         return(key);
 198 }
 199
 200 int
 201 SeqDatabase()
 202 {
 203         int status;
 204         DBT key, data;
 205
 206         ReportStatus("SEQuencing through database...");
 207
 208         /* seq through the whole database */
 209     if(!(status = (*database->seq)(database, &key, &data, R_FIRST)))
 210           {
 211         while(!(status = (database->seq) (database, &key, &data, R_NEXT)))
 212                         ; /* null body */
 213           }
 214
 215         if(status < 0)
 216                 ReportError("Error seq'ing database");
 217
 218         return(status);
 219 }
 220
 221 int
 222 VerifyData(DBT *data, int32 num, key_type_enum key_type)
 223 {
 224         int32 count, compare_num;
 225         size_t size;
 226         int32 *int32_array;
 227
 228         /* The first int32 is count
 229          * The other n entries should
 230          * all equal num
 231          */
 232         if(data->size < sizeof(int32))
 233           {
 234                 ReportError("Data size corrupted");
 235                 return -1;
 236           }
 237
 238         memcpy(&count, data->data, sizeof(int32));
 239
 240         size = sizeof(int32)*(count+1);
 241
 242         if(size != data->size)
 243           {
 244                 ReportError("Data size corrupted");
 245                 return -1;
 246           }
 247
 248         int32_array = (int32*)data->data;
 249
 250         for(;count > 0; count--)
 251           {
 252                 memcpy(&compare_num, &int32_array[count], sizeof(int32));
 253
 254                 if(compare_num != num)
 255               {
 256                     ReportError("Data corrupted");
 257                     return -1;
 258               }
 259           }
 260
 261         return(0);
 262 }
 263
 264
 265 /* verify that a range of number strings exist
 266  * or don't exist. And that the data is valid
 267  */
 268 #define SHOULD_EXIST 1
 269 #define SHOULD_NOT_EXIST 0
 270 int
 271 VerifyRange(int32 low, int32 high, int32 should_exist, key_type_enum key_type)
 272 {
 273         DBT *key, data;
 274         int32 num;
 275         int status;
 276
 277         TraceMe(1, ("Verifying: %ld to %ld, using %s keys",
 278                     low, high, key_type == USE_SMALL_KEY ? "SMALL" : "LARGE"));
 279
 280         for(num = low; num <= high; num++)
 281           {
 282
 283                 key = GenKey(num, key_type);
 284
 285                 status = (*database->get)(database, key, &data, 0);
 286
 287                 if(status == 0)
 288                   {
 289                         /* got the item */
 290                         if(!should_exist)
 291                           {
 292                                 ReportError("Item exists but shouldn't: %ld", num);
 293                           }
 294                         else
 295                           {
 296                             /* else verify the data */
 297                             VerifyData(&data, num, key_type);
 298                           }
 299                   }
 300                 else if(status > 0)
 301                   {
 302                         /* item not found */
 303                         if(should_exist)
 304                           {
 305                                 ReportError("Item not found but should be: %ld", num);
 306                           }
 307                   }
 308                 else
 309                   {
 310                         /* database error */
 311                         ReportError("Database error");
 312                         return(-1);
 313                   }
 314
 315           }
 316
 317         TraceMe(1, ("Correctly verified: %ld to %ld", low, high));
 318
 319         return(0);
 320
 321 }
 322
 323 DBT *
 324 GenData(int32 num)
 325 {
 326         int32 n;
 327         static DBT *data=0;
 328         int32 *int32_array;
 329         size_t size;
 330
 331         if(!data)
 332           {
 333                 data = (DBT*)malloc(sizeof(DBT));
 334                 data->size = 0;
 335                 data->data = 0;
 336           }
 337         else if(data->data)
 338           {
 339                 free(data->data);
 340           }
 341
 342         n = rand();
 343
 344         n = n % 512;  /* bound to a 2K size */
 345
 346
 347         size = sizeof(int32)*(n+1);
 348         int32_array = (int32 *) malloc(size);
 349
 350         memcpy(&int32_array[0], &n, sizeof(int32));
 351
 352         for(; n > 0; n--)
 353           {
 354                 memcpy(&int32_array[n], &num, sizeof(int32));
 355           }
 356
 357         data->data = (void*)int32_array;
 358         data->size = size;
 359
 360         return(data);
 361 }
 362
 363 #define ADD_RANGE 1
 364 #define DELETE_RANGE 2
 365
 366 int
 367 AddOrDelRange(int32 low, int32 high, int action, key_type_enum key_type)
 368 {
 369         DBT *key, *data;
 370 #if 0 /* only do this if your really analy checking the puts */
 371         DBT tmp_data;
 372 #endif
 373         int32 num;
 374         int status;
 375
 376         if(action != ADD_RANGE && action != DELETE_RANGE)
 377                 assert(0);
 378
 379         if(action == ADD_RANGE)
 380           {
 381                 TraceMe(1, ("Adding: %ld to %ld: %s keys", low, high,
 382                         key_type == USE_SMALL_KEY ? "SMALL" : "LARGE"));
 383           }
 384         else
 385           {
 386                 TraceMe(1, ("Deleting: %ld to %ld: %s keys", low, high,
 387                         key_type == USE_SMALL_KEY ? "SMALL" : "LARGE"));
 388           }
 389
 390         for(num = low; num <= high; num++)
 391           {
 392
 393                 key = GenKey(num, key_type);
 394
 395                 if(action == ADD_RANGE)
 396                   {
 397                         data = GenData(num);
 398                         status = (*database->put)(database, key, data, 0);
 399                   }
 400                 else
 401                   {
 402                         status = (*database->del)(database, key, 0);
 403                   }
 404
 405                 if(status < 0)
 406                   {
 407                         ReportError("Database error %s item: %ld",
 408                                                         action == ADD_RANGE ? "ADDING" : "DELETING",
 409                                                         num);
 410                   }
 411                 else if(status > 0)
 412                   {
 413                         ReportError("Could not %s item: %ld",
 414                                                         action == ADD_RANGE ? "ADD" : "DELETE",
 415                                                         num);
 416                   }
 417                 else if(action == ADD_RANGE)
 418                   {
 419 #define SYNC_EVERY_TIME
 420 #ifdef SYNC_EVERY_TIME
 421                         status = (*database->sync)(database, 0);
 422                         if(status != 0)
 423                                 ReportError("Database error syncing after add");
 424 #endif
 425
 426 #if 0 /* only do this if your really analy checking the puts */
 427
 428                         /* make sure we can still get it
 429                          */
 430                         status = (*database->get)(database, key, &tmp_data, 0);
 431
 432                         if(status != 0)
 433                           {
 434                                 ReportError("Database error checking item just added: %d",
 435                                                         num);
 436                           }
 437                         else
 438                           {
 439                                 /* now verify that none of the ones we already
 440                                  * put in have disappeared
 441                                  */
 442                                 VerifyRange(low, num, SHOULD_EXIST, key_type);
 443                           }
 444 #endif
 445
 446                   }
 447           }
 448
 449
 450         if(action == ADD_RANGE)
 451           {
 452                 TraceMe(1, ("Successfully added: %ld to %ld", low, high));
 453           }
 454         else
 455           {
 456                 TraceMe(1, ("Successfully deleted: %ld to %ld", low, high));
 457           }
 458
 459         return(0);
 460 }
 461
 462 int
 463 TestRange(int32 low, int32 range, key_type_enum key_type)
 464 {
 465         int status; int32 low_of_range1, high_of_range1; int32 low_of_range2, high_of_range2;
 466         int32 low_of_range3, high_of_range3;
 467
 468         status = AddOrDelRange(low, low+range, ADD_RANGE, key_type);
 469         status = VerifyRange(low, low+range, SHOULD_EXIST, key_type);
 470
 471         TraceMe(1, ("Finished with sub test 1"));
 472
 473         SeqDatabase();
 474
 475         low_of_range1 = low;
 476         high_of_range1 = low+(range/2);
 477         low_of_range2 = high_of_range1+1;
 478         high_of_range2 = low+range;
 479         status = AddOrDelRange(low_of_range1, high_of_range1, DELETE_RANGE, key_type);
 480         status = VerifyRange(low_of_range1, high_of_range1, SHOULD_NOT_EXIST, key_type);
 481         status = VerifyRange(low_of_range2, low_of_range2, SHOULD_EXIST, key_type);
 482
 483         TraceMe(1, ("Finished with sub test 2"));
 484
 485         SeqDatabase();
 486
 487         status = AddOrDelRange(low_of_range1, high_of_range1, ADD_RANGE, key_type);
 488         /* the whole thing should exist now */
 489         status = VerifyRange(low, low+range, SHOULD_EXIST, key_type);
 490
 491         TraceMe(1, ("Finished with sub test 3"));
 492
 493         SeqDatabase();
 494
 495         status = AddOrDelRange(low_of_range2, high_of_range2, DELETE_RANGE, key_type);
 496         status = VerifyRange(low_of_range1, high_of_range1, SHOULD_EXIST, key_type);
 497         status = VerifyRange(low_of_range2, high_of_range2, SHOULD_NOT_EXIST, key_type);
 498
 499         TraceMe(1, ("Finished with sub test 4"));
 500
 501         SeqDatabase();
 502
 503         status = AddOrDelRange(low_of_range2, high_of_range2, ADD_RANGE, key_type);
 504         /* the whole thing should exist now */
 505         status = VerifyRange(low, low+range, SHOULD_EXIST, key_type);
 506
 507         TraceMe(1, ("Finished with sub test 5"));
 508
 509         SeqDatabase();
 510
 511         low_of_range1 = low;
 512         high_of_range1 = low+(range/3);
 513         low_of_range2 = high_of_range1+1;
 514         high_of_range2 = high_of_range1+(range/3);
 515         low_of_range3 = high_of_range2+1;
 516         high_of_range3 = low+range;
 517         /* delete range 2 */
 518         status = AddOrDelRange(low_of_range2, high_of_range2, DELETE_RANGE, key_type);
 519         status = VerifyRange(low_of_range1, high_of_range1, SHOULD_EXIST, key_type);
 520         status = VerifyRange(low_of_range2, low_of_range2, SHOULD_NOT_EXIST, key_type);
 521         status = VerifyRange(low_of_range3, low_of_range2, SHOULD_EXIST, key_type);
 522
 523         TraceMe(1, ("Finished with sub test 6"));
 524
 525         SeqDatabase();
 526
 527         status = AddOrDelRange(low_of_range2, high_of_range2, ADD_RANGE, key_type);
 528         /* the whole thing should exist now */
 529         status = VerifyRange(low, low+range, SHOULD_EXIST, key_type);
 530
 531         TraceMe(1, ("Finished with sub test 7"));
 532
 533         return(0);
 534 }
 535
 536 #define START_RANGE 109876
 537 int
 538 main(int argc, char **argv)
 539 {
 540         int32 i, j=0;
 541     int quick_exit = 0;
 542     int large_keys = 0;
 543     HASHINFO hash_info = {
 544         16*1024,
 545         0,
 546         0,
 547         0,
 548         0,
 549         0};
 550
 551
 552     if(argc > 1)
 553       {
 554         while(argc > 1)
 555           {
 556             if(!strcmp(argv[argc-1], "-quick"))
 557                 quick_exit = 1;
 558             else if(!strcmp(argv[argc-1], "-large"))
 559                           {
 560                 large_keys = 1;
 561                           }
 562             argc--;
 563           }
 564       }
 565
 566         database = dbopen("test.db", O_RDWR | O_CREAT, 0644, DB_HASH, &hash_info);
 567
 568         if(!database)
 569           {
 570                 ReportError("Could not open database");
 571 #ifdef unix
 572                 perror("");
 573 #endif
 574                 exit(1);
 575           }
 576
 577         if(quick_exit)
 578           {
 579                 if(large_keys)
 580                         TestRange(START_RANGE, 200, USE_LARGE_KEY);
 581                 else
 582                         TestRange(START_RANGE, 200, USE_SMALL_KEY);
 583
 584                 (*database->sync)(database, 0);
 585                 (*database->close)(database);
 586         exit(0);
 587           }
 588
 589         for(i=100; i < 10000000; i+=200)
 590           {
 591                 if(1 || j)
 592                   {
 593                         TestRange(START_RANGE, i, USE_LARGE_KEY);
 594                         j = 0;
 595                   }
 596                 else
 597                   {
 598                         TestRange(START_RANGE, i, USE_SMALL_KEY);
 599                         j = 1;
 600                   }
 601
 602                 if(1 == rand() % 3)
 603                   {
 604                         (*database->sync)(database, 0);
 605                   }
 606
 607                 if(1 == rand() % 3)
 608                   {
 609                         /* close and reopen */
 610                         (*database->close)(database);
 611                         database = dbopen("test.db", O_RDWR | O_CREAT, 0644, DB_HASH, 0);
 612                         if(!database)
 613                         {
 614                                 ReportError("Could not reopen database");
 615 #ifdef unix
 616                                 perror("");
 617 #endif
 618                                 exit(1);
 619                         }
 620                   }
 621                 else
 622                   {
 623                         /* reopen database without closeing the other */
 624                         database = dbopen("test.db", O_RDWR | O_CREAT, 0644, DB_HASH, 0);
 625                         if(!database)
 626                         {
 627                                 ReportError("Could not reopen database "
 628                                                         "after not closing the other");
 629 #ifdef unix
 630                                 perror("");
 631 #endif
 632                                 exit(1);
 633                         }
 634                   }
 635           }
 636
 637         return(0);
 638 }