db_bench.cc 64.6 KB
Newer Older
J
jorlow@chromium.org 已提交
1 2 3 4
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file. See the AUTHORS file for names of contributors.

5
#include <cstddef>
J
jorlow@chromium.org 已提交
6 7 8 9 10
#include <sys/types.h>
#include <stdio.h>
#include <stdlib.h>
#include "db/db_impl.h"
#include "db/version_set.h"
11
#include "db/db_statistics.h"
12 13 14 15
#include "leveldb/cache.h"
#include "leveldb/db.h"
#include "leveldb/env.h"
#include "leveldb/write_batch.h"
16
#include "leveldb/statistics.h"
J
jorlow@chromium.org 已提交
17 18
#include "port/port.h"
#include "util/crc32c.h"
J
jorlow@chromium.org 已提交
19
#include "util/histogram.h"
20
#include "util/mutexlock.h"
J
jorlow@chromium.org 已提交
21
#include "util/random.h"
22
#include "util/stack_trace.h"
23
#include "util/string_util.h"
J
jorlow@chromium.org 已提交
24
#include "util/testutil.h"
25
#include "hdfs/env_hdfs.h"
J
jorlow@chromium.org 已提交
26 27 28

// Comma-separated list of operations to run in the specified order
//   Actual benchmarks:
29 30 31 32 33
//      fillseq       -- write N values in sequential key order in async mode
//      fillrandom    -- write N values in random key order in async mode
//      overwrite     -- overwrite N values in random key order in async mode
//      fillsync      -- write N/100 values in random key order in sync mode
//      fill100K      -- write N/1000 100K values in random order in async mode
S
Sanjay Ghemawat 已提交
34 35
//      deleteseq     -- delete N keys in sequential order
//      deleterandom  -- delete N keys in random order
36 37 38
//      readseq       -- read N times sequentially
//      readreverse   -- read N times in reverse order
//      readrandom    -- read N times in random order
S
Sanjay Ghemawat 已提交
39
//      readmissing   -- read N missing keys in random order
40
//      readhot       -- read N times in random order from 1% section of DB
41 42 43
//      readwhilewriting -- 1 writer, N threads doing random reads
//      readrandomwriterandom - N threads doing random-read, random-write
//      updaterandom  -- N threads doing read-modify-write for random keys
S
Sanjay Ghemawat 已提交
44
//      seekrandom    -- N random seeks
J
jorlow@chromium.org 已提交
45
//      crc32c        -- repeated crc32c of 4K of data
46
//      acquireload   -- load N*1000 times
J
jorlow@chromium.org 已提交
47 48
//   Meta operations:
//      compact     -- Compact the entire DB
49
//      stats       -- Print DB stats
50
//      levelstats  -- Print the number of files and bytes per level
S
Sanjay Ghemawat 已提交
51
//      sstables    -- Print sstable info
J
jorlow@chromium.org 已提交
52 53
//      heapprofile -- Dump a heap profile (if supported by this port)
static const char* FLAGS_benchmarks =
54
    "fillseq,"
J
jorlow@chromium.org 已提交
55
    "fillsync,"
56 57
    "fillrandom,"
    "overwrite,"
J
jorlow@chromium.org 已提交
58 59
    "readrandom,"
    "readrandom,"  // Extra run to allow previous compactions to quiesce
J
jorlow@chromium.org 已提交
60
    "readseq,"
J
jorlow@chromium.org 已提交
61
    "readreverse,"
J
jorlow@chromium.org 已提交
62
    "compact,"
J
jorlow@chromium.org 已提交
63
    "readrandom,"
J
jorlow@chromium.org 已提交
64
    "readseq,"
J
jorlow@chromium.org 已提交
65
    "readreverse,"
66
    "readwhilewriting,"
67
    "readrandomwriterandom," // mix reads and writes based on FLAGS_readwritepercent
M
Mark Callaghan 已提交
68
    "updaterandom," // read-modify-write for random keys
69
    "randomwithverify," // random reads and writes with some verification
J
jorlow@chromium.org 已提交
70 71
    "fill100K,"
    "crc32c,"
72 73
    "snappycomp,"
    "snappyuncomp,"
74
    "acquireload,"
J
jorlow@chromium.org 已提交
75
    ;
76 77
// the maximum size of key in bytes
static const int MAX_KEY_SIZE = 128;
J
jorlow@chromium.org 已提交
78
// Number of key/values to place in database
79
static long FLAGS_num = 1000000;
J
jorlow@chromium.org 已提交
80

81 82 83 84 85
// Number of distinct keys to use. Used in RandomWithVerify to read/write
// on fewer keys so that gets are more likely to find the key and puts
// are more likely to update the same key
static long FLAGS_numdistinct = 1000;

86
// Number of read operations to do.  If negative, do FLAGS_num reads.
87
static long FLAGS_reads = -1;
88

89 90 91 92 93 94
// When ==1 reads use ::Get, when >1 reads use an iterator
static long FLAGS_read_range = 1;

// Seed base for random number generators. When 0 it is deterministic.
static long FLAGS_seed = 0;

95 96 97
// Number of concurrent threads to run.
static int FLAGS_threads = 1;

M
Mark Callaghan 已提交
98 99 100 101
// Time in seconds for the random-ops tests to run. When 0 then
// FLAGS_num & FLAGS_reads determine the test duration
static int FLAGS_duration = 0;

J
jorlow@chromium.org 已提交
102 103 104
// Size of each value
static int FLAGS_value_size = 100;

105 106 107
//size of each key
static int FLAGS_key_size = 16;

J
jorlow@chromium.org 已提交
108 109
// Arrange to generate values that shrink to this fraction of
// their original size after compression
110
static double FLAGS_compression_ratio = 0.5;
J
jorlow@chromium.org 已提交
111 112 113 114 115

// Print histogram of operation timings
static bool FLAGS_histogram = false;

// Number of bytes to buffer in memtable before compacting
116 117 118
// (initialized to default value by "main")
static int FLAGS_write_buffer_size = 0;

A
Abhishek Kona 已提交
119
// The number of in-memory memtables.
120 121 122 123 124 125 126 127 128
// Each memtable is of size FLAGS_write_buffer_size.
// This is initialized to default value of 2 in "main" function.
static int FLAGS_max_write_buffer_number = 0;

// The maximum number of concurrent background compactions
// that can occur in parallel.
// This is initialized to default value of 1 in "main" function.
static int FLAGS_max_background_compactions = 0;

129 130
// Number of bytes to use as a cache of uncompressed data.
// Negative means use default settings.
D
Dhruba Borthakur 已提交
131
static long FLAGS_cache_size = -1;
J
jorlow@chromium.org 已提交
132

133 134 135
// Number of bytes in a block.
static int FLAGS_block_size = 0;

136 137 138
// Maximum number of files to keep open at the same time (use default if == 0)
static int FLAGS_open_files = 0;

S
Sanjay Ghemawat 已提交
139 140 141 142
// Bloom filter bits per key.
// Negative means use default settings.
static int FLAGS_bloom_bits = -1;

143 144 145 146 147
// If true, do not destroy the existing database.  If you set this
// flag and also specify a benchmark that wants a fresh database, that
// benchmark will fail.
static bool FLAGS_use_existing_db = false;

148
// Use the db with the following name.
149
static const char* FLAGS_db = nullptr;
150

151 152 153 154 155
// Number of shards for the block cache is 2 ** FLAGS_cache_numshardbits.
// Negative means use default settings. This is applied only
// if FLAGS_cache_size is non-negative.
static int FLAGS_cache_numshardbits = -1;

156 157 158
// Verify checksum for every block read from storage
static bool FLAGS_verify_checksum = false;

159 160
// Database statistics
static bool FLAGS_statistics = false;
A
Abhishek Kona 已提交
161
static class std::shared_ptr<leveldb::Statistics> dbstats;
162

163 164 165
// Number of write operations to do.  If negative, do FLAGS_num reads.
static long FLAGS_writes = -1;

166 167 168 169
// Per-thread rate limit on writes per second. No limit when <= 0.
// Only for the readwhilewriting test.
static int FLAGS_writes_per_second = 0;

H
heyongqiang 已提交
170 171
// These default values might change if the hardcoded

172 173 174
// Sync all writes to disk
static bool FLAGS_sync = false;

H
heyongqiang 已提交
175 176 177
// If true, do not wait until data is synced to disk.
static bool FLAGS_disable_data_sync = false;

178 179 180
// If true, issue fsync instead of fdatasync
static bool FLAGS_use_fsync = false;

H
heyongqiang 已提交
181 182 183
// If true, do not write WAL for write.
static bool FLAGS_disable_wal = false;

M
Mark Callaghan 已提交
184 185 186 187 188 189 190
// If true, create a snapshot per query when randomread benchmark is used
static bool FLAGS_use_snapshot = false;

// If true, call GetApproximateSizes per query when FLAGS_read_range is > 1
// and randomread benchmark is used
static bool FLAGS_get_approx = false;

191
// The total number of levels
192
static int FLAGS_num_levels = 7;
193

H
heyongqiang 已提交
194 195 196 197 198 199
// Target level-0 file size for compaction
static int FLAGS_target_file_size_base = 2 * 1048576;

// A multiplier to compute targe level-N file size
static int FLAGS_target_file_size_multiplier = 1;

200
// Max bytes for level-1
201
static uint64_t FLAGS_max_bytes_for_level_base = 10 * 1048576;
H
heyongqiang 已提交
202 203 204 205

// A multiplier to compute max bytes for level-N
static int FLAGS_max_bytes_for_level_multiplier = 10;

206 207 208
// A vector that specifies additional fanout per level
static std::vector<int> FLAGS_max_bytes_for_level_multiplier_additional;

H
heyongqiang 已提交
209 210 211
// Number of files in level-0 that will trigger put stop.
static int FLAGS_level0_stop_writes_trigger = 12;

212 213
// Number of files in level-0 that will slow down writes.
static int FLAGS_level0_slowdown_writes_trigger = 8;
H
heyongqiang 已提交
214

215 216 217
// Number of files in level-0 when compactions start
static int FLAGS_level0_file_num_compaction_trigger = 4;

218 219 220 221 222
// Ratio of reads to writes (expressed as a percentage)
// for the ReadRandomWriteRandom workload. The default
// setting is 9 gets for every 1 put.
static int FLAGS_readwritepercent = 90;

223 224 225 226
// This percent of deletes are done (used in RandomWithVerify only)
// Must be smaller than total writepercent (i.e 100 - FLAGS_readwritepercent)
static int FLAGS_deletepercent = 2;

227 228 229
// Option to disable compation triggered by read.
static int FLAGS_disable_seek_compaction = false;

230 231 232 233 234
// Option to delete obsolete files periodically
// Default: 0 which means that obsolete files are
// deleted after every compaction run.
static uint64_t FLAGS_delete_obsolete_files_period_micros = 0;

235 236 237 238
// Algorithm to use to compress the database
static enum leveldb::CompressionType FLAGS_compression_type =
    leveldb::kSnappyCompression;

239 240
// Allows compression for levels 0 and 1 to be disabled when
// other levels are compressed
241
static int FLAGS_min_level_to_compress = -1;
242

243 244
static int FLAGS_table_cache_numshardbits = 4;

245 246 247
// posix or hdfs environment
static leveldb::Env* FLAGS_env = leveldb::Env::Default();

248 249 250 251
// Stats are reported every N operations when this is greater
// than zero. When 0 the interval grows over time.
static int FLAGS_stats_interval = 0;

252 253 254 255 256 257 258 259 260
// Reports additional stats per interval when this is greater
// than 0.
static int FLAGS_stats_per_interval = 0;

// When not equal to 0 this make threads sleep at each stats
// reporting interval until the compaction score for all levels is
// less than or equal to this value.
static double FLAGS_rate_limit = 0;

261 262 263
// When FLAGS_rate_limit is set then this is the max time a put will be stalled.
static int FLAGS_rate_limit_delay_milliseconds = 1000;

264 265
// Control maximum bytes of overlaps in grandparent (i.e., level+2) before we
// stop building a single file in a level->level+1 compaction.
266
static int FLAGS_max_grandparent_overlap_factor = 10;
267

H
heyongqiang 已提交
268 269 270
// Run read only benchmarks.
static bool FLAGS_read_only = false;

271 272 273
// Do not auto trigger compactions
static bool FLAGS_disable_auto_compactions = false;

274 275 276 277
// Cap the size of data in levelK for a compaction run
// that compacts Levelk with LevelK+1
static int FLAGS_source_compaction_factor = 1;

278 279 280
// Set the TTL for the WAL Files.
static uint64_t FLAGS_WAL_ttl_seconds = 0;

281 282 283 284 285 286 287 288 289 290 291 292 293 294
// Allow buffered io using OS buffers
static bool FLAGS_use_os_buffer;

// Allow filesystem to do read-aheads
static bool FLAGS_use_fsreadahead;

// Allow reads to occur via mmap-ing files
static bool FLAGS_use_mmap_reads;

// Allow writes to occur via mmap-ing files
static bool FLAGS_use_mmap_writes;

// Allow readaheads to occur for compactions
static bool FLAGS_use_readahead_compactions;
295

J
jorlow@chromium.org 已提交
296 297
namespace leveldb {

298
// Helper for quickly generating random data.
J
jorlow@chromium.org 已提交
299 300 301
class RandomGenerator {
 private:
  std::string data_;
302
  unsigned int pos_;
J
jorlow@chromium.org 已提交
303 304 305 306 307 308 309 310

 public:
  RandomGenerator() {
    // We use a limited amount of data over and over again and ensure
    // that it is larger than the compression window (32KB), and also
    // large enough to serve all typical value sizes we want to write.
    Random rnd(301);
    std::string piece;
311
    while (data_.size() < (unsigned)std::max(1048576, FLAGS_value_size)) {
J
jorlow@chromium.org 已提交
312 313 314 315 316 317 318 319
      // Add a short fragment that is as compressible as specified
      // by FLAGS_compression_ratio.
      test::CompressibleString(&rnd, FLAGS_compression_ratio, 100, &piece);
      data_.append(piece);
    }
    pos_ = 0;
  }

320
  Slice Generate(unsigned int len) {
J
jorlow@chromium.org 已提交
321 322 323 324 325 326 327
    if (pos_ + len > data_.size()) {
      pos_ = 0;
      assert(len < data_.size());
    }
    pos_ += len;
    return Slice(data_.data() + pos_ - len, len);
  }
328
};
329
static Slice TrimSpace(Slice s) {
330
  unsigned int start = 0;
331 332 333
  while (start < s.size() && isspace(s[start])) {
    start++;
  }
334
  unsigned int limit = s.size();
335 336 337 338 339 340
  while (limit > start && isspace(s[limit-1])) {
    limit--;
  }
  return Slice(s.data() + start, limit - start);
}

341 342 343 344 345 346 347 348 349 350
static void AppendWithSpace(std::string* str, Slice msg) {
  if (msg.empty()) return;
  if (!str->empty()) {
    str->push_back(' ');
  }
  str->append(msg.data(), msg.size());
}

class Stats {
 private:
351
  int id_;
352 353 354
  double start_;
  double finish_;
  double seconds_;
355
  long done_;
356
  long last_report_done_;
357 358 359
  int next_report_;
  int64_t bytes_;
  double last_op_finish_;
360
  double last_report_finish_;
361
  HistogramImpl hist_;
362
  std::string message_;
363
  bool exclude_from_merge_;
364 365

 public:
366
  Stats() { Start(-1); }
367

368 369 370
  void Start(int id) {
    id_ = id;
    next_report_ = FLAGS_stats_interval ? FLAGS_stats_interval : 100;
371 372 373
    last_op_finish_ = start_;
    hist_.Clear();
    done_ = 0;
374
    last_report_done_ = 0;
375 376
    bytes_ = 0;
    seconds_ = 0;
377
    start_ = FLAGS_env->NowMicros();
378
    finish_ = start_;
379
    last_report_finish_ = start_;
380
    message_.clear();
381 382
    // When set, stats from this thread won't be merged with others.
    exclude_from_merge_ = false;
383 384 385
  }

  void Merge(const Stats& other) {
386 387 388
    if (other.exclude_from_merge_)
      return;

389 390 391 392 393 394 395 396 397 398 399 400
    hist_.Merge(other.hist_);
    done_ += other.done_;
    bytes_ += other.bytes_;
    seconds_ += other.seconds_;
    if (other.start_ < start_) start_ = other.start_;
    if (other.finish_ > finish_) finish_ = other.finish_;

    // Just keep the messages from one thread
    if (message_.empty()) message_ = other.message_;
  }

  void Stop() {
401
    finish_ = FLAGS_env->NowMicros();
402 403 404 405 406 407 408
    seconds_ = (finish_ - start_) * 1e-6;
  }

  void AddMessage(Slice msg) {
    AppendWithSpace(&message_, msg);
  }

409
  void SetId(int id) { id_ = id; }
410
  void SetExcludeFromMerge() { exclude_from_merge_ = true; }
411

M
Mark Callaghan 已提交
412
  void FinishedSingleOp(DB* db) {
413
    if (FLAGS_histogram) {
414
      double now = FLAGS_env->NowMicros();
415 416
      double micros = now - last_op_finish_;
      hist_.Add(micros);
417
      if (micros > 20000 && !FLAGS_stats_interval) {
418 419 420 421 422 423 424 425
        fprintf(stderr, "long op: %.1f micros%30s\r", micros, "");
        fflush(stderr);
      }
      last_op_finish_ = now;
    }

    done_++;
    if (done_ >= next_report_) {
426 427 428 429 430 431 432 433 434 435 436 437 438
      if (!FLAGS_stats_interval) {
        if      (next_report_ < 1000)   next_report_ += 100;
        else if (next_report_ < 5000)   next_report_ += 500;
        else if (next_report_ < 10000)  next_report_ += 1000;
        else if (next_report_ < 50000)  next_report_ += 5000;
        else if (next_report_ < 100000) next_report_ += 10000;
        else if (next_report_ < 500000) next_report_ += 50000;
        else                            next_report_ += 100000;
        fprintf(stderr, "... finished %ld ops%30s\r", done_, "");
        fflush(stderr);
      } else {
        double now = FLAGS_env->NowMicros();
        fprintf(stderr,
439
                "%s ... thread %d: (%ld,%ld) ops and (%.1f,%.1f) ops/second in (%.6f,%.6f) seconds\n",
440
                FLAGS_env->TimeToString((uint64_t) now/1000000).c_str(),
441
                id_,
M
Mark Callaghan 已提交
442
                done_ - last_report_done_, done_,
443
                (done_ - last_report_done_) /
M
Mark Callaghan 已提交
444 445 446 447
                ((now - last_report_finish_) / 1000000.0),
                done_ / ((now - start_) / 1000000.0),
                (now - last_report_finish_) / 1000000.0,
                (now - start_) / 1000000.0);
M
Mark Callaghan 已提交
448

449 450 451
        if (FLAGS_stats_per_interval) {
          std::string stats;
          if (db && db->GetProperty("leveldb.stats", &stats))
452
            fprintf(stderr, "%s\n", stats.c_str());
453
        }
M
Mark Callaghan 已提交
454

455 456 457 458 459
        fflush(stderr);
        next_report_ += FLAGS_stats_interval;
        last_report_finish_ = now;
        last_report_done_ = done_;
      }
460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482
    }
  }

  void AddBytes(int64_t n) {
    bytes_ += n;
  }

  void Report(const Slice& name) {
    // Pretend at least one op was done in case we are running a benchmark
    // that does not call FinishedSingleOp().
    if (done_ < 1) done_ = 1;

    std::string extra;
    if (bytes_ > 0) {
      // Rate is computed on actual elapsed time, not the sum of per-thread
      // elapsed times.
      double elapsed = (finish_ - start_) * 1e-6;
      char rate[100];
      snprintf(rate, sizeof(rate), "%6.1f MB/s",
               (bytes_ / 1048576.0) / elapsed);
      extra = rate;
    }
    AppendWithSpace(&extra, message_);
483 484
    double elapsed = (finish_ - start_) * 1e-6;
    double throughput = (double)done_/elapsed;
485

D
Dhruba Borthakur 已提交
486
    fprintf(stdout, "%-12s : %11.3f micros/op %ld ops/sec;%s%s\n",
487 488
            name.ToString().c_str(),
            seconds_ * 1e6 / done_,
D
Dhruba Borthakur 已提交
489
            (long)throughput,
490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510
            (extra.empty() ? "" : " "),
            extra.c_str());
    if (FLAGS_histogram) {
      fprintf(stdout, "Microseconds per op:\n%s\n", hist_.ToString().c_str());
    }
    fflush(stdout);
  }
};

// State shared by all concurrent executions of the same benchmark.
struct SharedState {
  port::Mutex mu;
  port::CondVar cv;
  int total;

  // Each thread goes through the following states:
  //    (1) initializing
  //    (2) waiting for others to be initialized
  //    (3) running
  //    (4) done

511 512
  long num_initialized;
  long num_done;
513 514 515 516 517 518 519 520 521 522
  bool start;

  SharedState() : cv(&mu) { }
};

// Per-thread state for concurrent executions of the same benchmark.
struct ThreadState {
  int tid;             // 0..n-1 when running in n threads
  Random rand;         // Has different seeds for different threads
  Stats stats;
523
  SharedState* shared;
524

A
Abhishek Kona 已提交
525
  /* implicit */ ThreadState(int index)
526
      : tid(index),
527
        rand((FLAGS_seed ? FLAGS_seed : 1000) + index) {
528 529 530
  }
};

M
Mark Callaghan 已提交
531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561
class Duration {
 public:
  Duration(int max_seconds, long max_ops) {
    max_seconds_ = max_seconds;
    max_ops_= max_ops;
    ops_ = 0;
    start_at_ = FLAGS_env->NowMicros();
  }

  bool Done(int increment) {
    ops_ += increment;

    if (max_seconds_) {
      if (!(ops_ % 1000)) {
        double now = FLAGS_env->NowMicros();
        return ((now - start_at_) / 1000000.0) >= max_seconds_;
      } else {
        return false;
      }
    } else {
      return ops_ > max_ops_;
    }
  }

 private:
  int max_seconds_;
  long max_ops_;
  long ops_;
  double start_at_;
};

J
jorlow@chromium.org 已提交
562 563
class Benchmark {
 private:
564
  shared_ptr<Cache> cache_;
S
Sanjay Ghemawat 已提交
565
  const FilterPolicy* filter_policy_;
J
jorlow@chromium.org 已提交
566
  DB* db_;
567
  long num_;
568
  int value_size_;
569
  int key_size_;
570 571
  int entries_per_batch_;
  WriteOptions write_options_;
572
  long reads_;
573
  long writes_;
574
  long readwrites_;
J
jorlow@chromium.org 已提交
575
  int heap_counter_;
576
  char keyFormat_[100]; // this string will contain the format of key. e.g "%016d"
577 578
  void PrintHeader() {
    PrintEnvironment();
579
    fprintf(stdout, "Keys:       %d bytes each\n", FLAGS_key_size);
580 581 582
    fprintf(stdout, "Values:     %d bytes each (%d bytes after compression)\n",
            FLAGS_value_size,
            static_cast<int>(FLAGS_value_size * FLAGS_compression_ratio + 0.5));
583
    fprintf(stdout, "Entries:    %ld\n", num_);
584
    fprintf(stdout, "RawSize:    %.1f MB (estimated)\n",
585
            ((static_cast<int64_t>(FLAGS_key_size + FLAGS_value_size) * num_)
586
             / 1048576.0));
587
    fprintf(stdout, "FileSize:   %.1f MB (estimated)\n",
588
            (((FLAGS_key_size + FLAGS_value_size * FLAGS_compression_ratio) * num_)
589
             / 1048576.0));
590
    fprintf(stdout, "Write rate limit: %d\n", FLAGS_writes_per_second);
591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606

    switch (FLAGS_compression_type) {
      case leveldb::kNoCompression:
        fprintf(stdout, "Compression: none\n");
        break;
      case leveldb::kSnappyCompression:
        fprintf(stdout, "Compression: snappy\n");
        break;
      case leveldb::kZlibCompression:
        fprintf(stdout, "Compression: zlib\n");
        break;
      case leveldb::kBZip2Compression:
        fprintf(stdout, "Compression: bzip2\n");
        break;
    }

607 608 609 610 611 612 613 614 615 616 617 618 619 620
    PrintWarnings();
    fprintf(stdout, "------------------------------------------------\n");
  }

  void PrintWarnings() {
#if defined(__GNUC__) && !defined(__OPTIMIZE__)
    fprintf(stdout,
            "WARNING: Optimization is disabled: benchmarks unnecessarily slow\n"
            );
#endif
#ifndef NDEBUG
    fprintf(stdout,
            "WARNING: Assertions are enabled; benchmarks unnecessarily slow\n");
#endif
621

622 623 624 625 626
    if (FLAGS_compression_type != leveldb::kNoCompression) {
      // The test string should not be too small.
      const int len = FLAGS_block_size;
      char* text = (char*) malloc(len+1);
      bool result = true;
627
      const char* name = nullptr;
628 629 630 631 632 633 634
      std::string compressed;

      memset(text, (int) 'y', len);
      text[len] = '\0';

      switch (FLAGS_compression_type) {
        case kSnappyCompression:
635 636
          result = port::Snappy_Compress(Options().compression_opts, text,
                                         strlen(text), &compressed);
637 638 639
          name = "Snappy";
          break;
        case kZlibCompression:
640 641
          result = port::Zlib_Compress(Options().compression_opts, text,
                                       strlen(text), &compressed);
642 643 644
          name = "Zlib";
          break;
        case kBZip2Compression:
645 646
          result = port::BZip2_Compress(Options().compression_opts, text,
                                        strlen(text), &compressed);
647 648
          name = "BZip2";
          break;
649 650 651
        case kNoCompression:
          assert(false); // cannot happen
          break;
652 653 654 655 656 657 658 659 660
      }

      if (!result) {
        fprintf(stdout, "WARNING: %s compression is not enabled\n", name);
      } else if (name && compressed.size() >= strlen(text)) {
        fprintf(stdout, "WARNING: %s compression is not effective\n", name);
      }

      free(text);
661
    }
662 663 664 665 666 667 668
  }

  void PrintEnvironment() {
    fprintf(stderr, "LevelDB:    version %d.%d\n",
            kMajorVersion, kMinorVersion);

#if defined(__linux)
669
    time_t now = time(nullptr);
670 671 672
    fprintf(stderr, "Date:       %s", ctime(&now));  // ctime() adds newline

    FILE* cpuinfo = fopen("/proc/cpuinfo", "r");
673
    if (cpuinfo != nullptr) {
674 675 676 677
      char line[1000];
      int num_cpus = 0;
      std::string cpu_type;
      std::string cache_size;
678
      while (fgets(line, sizeof(line), cpuinfo) != nullptr) {
679
        const char* sep = strchr(line, ':');
680
        if (sep == nullptr) {
681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698
          continue;
        }
        Slice key = TrimSpace(Slice(line, sep - 1 - line));
        Slice val = TrimSpace(Slice(sep + 1));
        if (key == "model name") {
          ++num_cpus;
          cpu_type = val.ToString();
        } else if (key == "cache size") {
          cache_size = val.ToString();
        }
      }
      fclose(cpuinfo);
      fprintf(stderr, "CPU:        %d * %s\n", num_cpus, cpu_type.c_str());
      fprintf(stderr, "CPUCache:   %s\n", cache_size.c_str());
    }
#endif
  }

699 700 701
  void PrintHistogram(Histograms histogram_type, std::string name) {
    HistogramData histogramData;
    dbstats->histogramData(histogram_type, &histogramData);
702 703 704 705
    fprintf(stdout, "%s statistics Percentiles :", name.c_str());
    fprintf(stdout, "50 : %f ",histogramData.median);
    fprintf(stdout, "95 : %f ", histogramData.percentile95);
    fprintf(stdout, "99 : %f\n", histogramData.percentile99);
706 707
  }

708 709
  void PrintStatistics() {
    if (FLAGS_statistics) {
A
Abhishek Kona 已提交
710
      fprintf(stdout, "File opened:%ld closed:%ld errors:%ld\n"
711 712 713
          "Block Cache Hit Count:%ld Block Cache Miss Count:%ld\n"
          "Bloom Filter Useful: %ld \n"
          "Compaction key_drop_newer_entry: %ld key_drop_obsolete: %ld "
714
          "Compaction key_drop_user: %ld\n",
715 716 717
          dbstats->getTickerCount(NO_FILE_OPENS),
          dbstats->getTickerCount(NO_FILE_CLOSES),
          dbstats->getTickerCount(NO_FILE_ERRORS),
A
Abhishek Kona 已提交
718
          dbstats->getTickerCount(BLOCK_CACHE_HIT),
719 720 721 722 723
          dbstats->getTickerCount(BLOCK_CACHE_MISS),
          dbstats->getTickerCount(BLOOM_FILTER_USEFUL),
          dbstats->getTickerCount(COMPACTION_KEY_DROP_NEWER_ENTRY),
          dbstats->getTickerCount(COMPACTION_KEY_DROP_OBSOLETE),
          dbstats->getTickerCount(COMPACTION_KEY_DROP_USER));
724 725
      PrintHistogram(DB_GET, "DB_GET");
      PrintHistogram(DB_WRITE, "DB_WRITE");
726
      PrintHistogram(COMPACTION_TIME, "COMPACTION_TIME");
727 728 729
    }
  }

J
jorlow@chromium.org 已提交
730
 public:
731
  Benchmark()
732 733 734
  : cache_(FLAGS_cache_size >= 0 ?
           (FLAGS_cache_numshardbits >= 1 ?
            NewLRUCache(FLAGS_cache_size, FLAGS_cache_numshardbits) :
735
            NewLRUCache(FLAGS_cache_size)) : nullptr),
S
Sanjay Ghemawat 已提交
736 737
    filter_policy_(FLAGS_bloom_bits >= 0
                   ? NewBloomFilterPolicy(FLAGS_bloom_bits)
738 739
                   : nullptr),
    db_(nullptr),
740
    num_(FLAGS_num),
741
    value_size_(FLAGS_value_size),
742
    key_size_(FLAGS_key_size),
743
    entries_per_batch_(1),
744
    reads_(FLAGS_reads < 0 ? FLAGS_num : FLAGS_reads),
745
    writes_(FLAGS_writes < 0 ? FLAGS_num : FLAGS_writes),
746
    readwrites_((FLAGS_writes < 0  && FLAGS_reads < 0)? FLAGS_num :
747
                ((FLAGS_writes > FLAGS_reads) ? FLAGS_writes : FLAGS_reads)
748
               ),
749
    heap_counter_(0) {
J
jorlow@chromium.org 已提交
750
    std::vector<std::string> files;
751
    FLAGS_env->GetChildren(FLAGS_db, &files);
752
    for (unsigned int i = 0; i < files.size(); i++) {
J
jorlow@chromium.org 已提交
753
      if (Slice(files[i]).starts_with("heap-")) {
754
        FLAGS_env->DeleteFile(std::string(FLAGS_db) + "/" + files[i]);
J
jorlow@chromium.org 已提交
755 756
      }
    }
757
    if (!FLAGS_use_existing_db) {
758
      DestroyDB(FLAGS_db, Options());
759
    }
J
jorlow@chromium.org 已提交
760 761 762 763
  }

  ~Benchmark() {
    delete db_;
S
Sanjay Ghemawat 已提交
764
    delete filter_policy_;
J
jorlow@chromium.org 已提交
765
  }
766 767 768 769 770
//this function will construct string format for key. e.g "%016d"
void ConstructStrFormatForKey(char* str, int keySize)
{
  str[0] = '%';
  str[1] = '0';
771
  sprintf(str+2, "%dd%s", keySize, "%s");
772
}
J
jorlow@chromium.org 已提交
773

774
unique_ptr<char []> GenerateKeyFromInt(int v, const char* suffix = "")
775 776
{
  unique_ptr<char []> keyInStr(new char[MAX_KEY_SIZE]);
777
  snprintf(keyInStr.get(), MAX_KEY_SIZE, keyFormat_, v, suffix);
778 779
  return keyInStr;
}
J
jorlow@chromium.org 已提交
780
  void Run() {
781 782
    PrintHeader();
    Open();
J
jorlow@chromium.org 已提交
783 784

    const char* benchmarks = FLAGS_benchmarks;
785
    while (benchmarks != nullptr) {
J
jorlow@chromium.org 已提交
786 787
      const char* sep = strchr(benchmarks, ',');
      Slice name;
788
      if (sep == nullptr) {
J
jorlow@chromium.org 已提交
789
        name = benchmarks;
790
        benchmarks = nullptr;
J
jorlow@chromium.org 已提交
791 792 793 794 795
      } else {
        name = Slice(benchmarks, sep - benchmarks);
        benchmarks = sep + 1;
      }

796 797
      // Reset parameters that may be overriddden bwlow
      num_ = FLAGS_num;
798
      reads_ = (FLAGS_reads < 0 ? FLAGS_num : FLAGS_reads);
799
      writes_ = (FLAGS_writes < 0 ? FLAGS_num : FLAGS_writes);
800
      value_size_ = FLAGS_value_size;
801 802
      key_size_ = FLAGS_key_size;
      ConstructStrFormatForKey(keyFormat_, key_size_);
803 804
      entries_per_batch_ = 1;
      write_options_ = WriteOptions();
805 806 807
      if (FLAGS_sync) {
        write_options_.sync = true;
      }
H
heyongqiang 已提交
808 809
      write_options_.disableWAL = FLAGS_disable_wal;

810
      void (Benchmark::*method)(ThreadState*) = nullptr;
811
      bool fresh_db = false;
812
      int num_threads = FLAGS_threads;
813 814

      if (name == Slice("fillseq")) {
815 816
        fresh_db = true;
        method = &Benchmark::WriteSeq;
817
      } else if (name == Slice("fillbatch")) {
818 819 820
        fresh_db = true;
        entries_per_batch_ = 1000;
        method = &Benchmark::WriteSeq;
821
      } else if (name == Slice("fillrandom")) {
822 823
        fresh_db = true;
        method = &Benchmark::WriteRandom;
824
      } else if (name == Slice("overwrite")) {
825 826
        fresh_db = false;
        method = &Benchmark::WriteRandom;
827
      } else if (name == Slice("fillsync")) {
828 829 830 831
        fresh_db = true;
        num_ /= 1000;
        write_options_.sync = true;
        method = &Benchmark::WriteRandom;
832
      } else if (name == Slice("fill100K")) {
833 834 835 836
        fresh_db = true;
        num_ /= 1000;
        value_size_ = 100 * 1000;
        method = &Benchmark::WriteRandom;
J
jorlow@chromium.org 已提交
837
      } else if (name == Slice("readseq")) {
838
        method = &Benchmark::ReadSequential;
J
jorlow@chromium.org 已提交
839
      } else if (name == Slice("readreverse")) {
840
        method = &Benchmark::ReadReverse;
J
jorlow@chromium.org 已提交
841
      } else if (name == Slice("readrandom")) {
842
        method = &Benchmark::ReadRandom;
S
Sanjay Ghemawat 已提交
843 844 845 846
      } else if (name == Slice("readmissing")) {
        method = &Benchmark::ReadMissing;
      } else if (name == Slice("seekrandom")) {
        method = &Benchmark::SeekRandom;
847
      } else if (name == Slice("readhot")) {
848
        method = &Benchmark::ReadHot;
849
      } else if (name == Slice("readrandomsmall")) {
850
        reads_ /= 1000;
851
        method = &Benchmark::ReadRandom;
S
Sanjay Ghemawat 已提交
852 853 854 855
      } else if (name == Slice("deleteseq")) {
        method = &Benchmark::DeleteSeq;
      } else if (name == Slice("deleterandom")) {
        method = &Benchmark::DeleteRandom;
856 857 858
      } else if (name == Slice("readwhilewriting")) {
        num_threads++;  // Add extra thread for writing
        method = &Benchmark::ReadWhileWriting;
859 860
      } else if (name == Slice("readrandomwriterandom")) {
        method = &Benchmark::ReadRandomWriteRandom;
M
Mark Callaghan 已提交
861 862
      } else if (name == Slice("updaterandom")) {
        method = &Benchmark::UpdateRandom;
863 864
      } else if (name == Slice("randomwithverify")) {
        method = &Benchmark::RandomWithVerify;
J
jorlow@chromium.org 已提交
865
      } else if (name == Slice("compact")) {
866
        method = &Benchmark::Compact;
J
jorlow@chromium.org 已提交
867
      } else if (name == Slice("crc32c")) {
868
        method = &Benchmark::Crc32c;
869
      } else if (name == Slice("acquireload")) {
870
        method = &Benchmark::AcquireLoad;
871
      } else if (name == Slice("snappycomp")) {
872
        method = &Benchmark::SnappyCompress;
873
      } else if (name == Slice("snappyuncomp")) {
874
        method = &Benchmark::SnappyUncompress;
J
jorlow@chromium.org 已提交
875 876
      } else if (name == Slice("heapprofile")) {
        HeapProfile();
877
      } else if (name == Slice("stats")) {
S
Sanjay Ghemawat 已提交
878
        PrintStats("leveldb.stats");
879 880
      } else if (name == Slice("levelstats")) {
        PrintStats("leveldb.levelstats");
S
Sanjay Ghemawat 已提交
881 882
      } else if (name == Slice("sstables")) {
        PrintStats("leveldb.sstables");
J
jorlow@chromium.org 已提交
883
      } else {
884 885 886 887
        if (name != Slice()) {  // No error message for empty name
          fprintf(stderr, "unknown benchmark '%s'\n", name.ToString().c_str());
        }
      }
888 889 890 891 892

      if (fresh_db) {
        if (FLAGS_use_existing_db) {
          fprintf(stdout, "%-12s : skipped (--use_existing_db is true)\n",
                  name.ToString().c_str());
893
          method = nullptr;
894 895
        } else {
          delete db_;
896
          db_ = nullptr;
897 898 899 900 901
          DestroyDB(FLAGS_db, Options());
          Open();
        }
      }

902
      if (method != nullptr) {
903
        RunBenchmark(num_threads, name, method);
J
jorlow@chromium.org 已提交
904 905
      }
    }
906
    PrintStatistics();
J
jorlow@chromium.org 已提交
907 908
  }

909
 private:
910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931
  struct ThreadArg {
    Benchmark* bm;
    SharedState* shared;
    ThreadState* thread;
    void (Benchmark::*method)(ThreadState*);
  };

  static void ThreadBody(void* v) {
    ThreadArg* arg = reinterpret_cast<ThreadArg*>(v);
    SharedState* shared = arg->shared;
    ThreadState* thread = arg->thread;
    {
      MutexLock l(&shared->mu);
      shared->num_initialized++;
      if (shared->num_initialized >= shared->total) {
        shared->cv.SignalAll();
      }
      while (!shared->start) {
        shared->cv.Wait();
      }
    }

932
    thread->stats.Start(thread->tid);
933 934 935 936 937 938 939 940 941 942 943 944
    (arg->bm->*(arg->method))(thread);
    thread->stats.Stop();

    {
      MutexLock l(&shared->mu);
      shared->num_done++;
      if (shared->num_done >= shared->total) {
        shared->cv.SignalAll();
      }
    }
  }

945 946
  void RunBenchmark(int n, Slice name,
                    void (Benchmark::*method)(ThreadState*)) {
947 948 949 950 951 952 953 954 955 956 957 958
    SharedState shared;
    shared.total = n;
    shared.num_initialized = 0;
    shared.num_done = 0;
    shared.start = false;

    ThreadArg* arg = new ThreadArg[n];
    for (int i = 0; i < n; i++) {
      arg[i].bm = this;
      arg[i].method = method;
      arg[i].shared = &shared;
      arg[i].thread = new ThreadState(i);
959
      arg[i].thread->shared = &shared;
960
      FLAGS_env->StartThread(ThreadBody, &arg[i]);
961 962 963 964 965 966 967 968 969 970 971 972 973 974
    }

    shared.mu.Lock();
    while (shared.num_initialized < n) {
      shared.cv.Wait();
    }

    shared.start = true;
    shared.cv.SignalAll();
    while (shared.num_done < n) {
      shared.cv.Wait();
    }
    shared.mu.Unlock();

975 976 977 978
    // Stats for some threads can be excluded.
    Stats merge_stats;
    for (int i = 0; i < n; i++) {
      merge_stats.Merge(arg[i].thread->stats);
979
    }
980
    merge_stats.Report(name);
981 982 983 984 985 986 987 988

    for (int i = 0; i < n; i++) {
      delete arg[i].thread;
    }
    delete[] arg;
  }

  void Crc32c(ThreadState* thread) {
J
jorlow@chromium.org 已提交
989
    // Checksum about 500MB of data total
990 991
    const int size = 4096;
    const char* label = "(4K per op)";
J
jorlow@chromium.org 已提交
992
    std::string data(size, 'x');
J
jorlow@chromium.org 已提交
993 994 995 996
    int64_t bytes = 0;
    uint32_t crc = 0;
    while (bytes < 500 * 1048576) {
      crc = crc32c::Value(data.data(), size);
997
      thread->stats.FinishedSingleOp(nullptr);
J
jorlow@chromium.org 已提交
998 999 1000 1001 1002
      bytes += size;
    }
    // Print so result is not dead
    fprintf(stderr, "... crc=0x%x\r", static_cast<unsigned int>(crc));

1003 1004
    thread->stats.AddBytes(bytes);
    thread->stats.AddMessage(label);
J
jorlow@chromium.org 已提交
1005 1006
  }

1007
  void AcquireLoad(ThreadState* thread) {
1008 1009 1010
    int dummy;
    port::AtomicPointer ap(&dummy);
    int count = 0;
1011
    void *ptr = nullptr;
1012
    thread->stats.AddMessage("(each op is 1000 loads)");
1013 1014 1015 1016 1017
    while (count < 100000) {
      for (int i = 0; i < 1000; i++) {
        ptr = ap.Acquire_Load();
      }
      count++;
1018
      thread->stats.FinishedSingleOp(nullptr);
1019
    }
1020
    if (ptr == nullptr) exit(1); // Disable unused variable warning.
1021 1022
  }

1023 1024 1025
  void SnappyCompress(ThreadState* thread) {
    RandomGenerator gen;
    Slice input = gen.Generate(Options().block_size);
1026 1027 1028 1029 1030
    int64_t bytes = 0;
    int64_t produced = 0;
    bool ok = true;
    std::string compressed;
    while (ok && bytes < 1024 * 1048576) {  // Compress 1G
1031 1032
      ok = port::Snappy_Compress(Options().compression_opts, input.data(),
                                 input.size(), &compressed);
1033 1034
      produced += compressed.size();
      bytes += input.size();
1035
      thread->stats.FinishedSingleOp(nullptr);
1036 1037 1038
    }

    if (!ok) {
1039
      thread->stats.AddMessage("(snappy failure)");
1040 1041 1042 1043
    } else {
      char buf[100];
      snprintf(buf, sizeof(buf), "(output: %.1f%%)",
               (produced * 100.0) / bytes);
1044 1045
      thread->stats.AddMessage(buf);
      thread->stats.AddBytes(bytes);
1046 1047 1048
    }
  }

1049 1050 1051
  void SnappyUncompress(ThreadState* thread) {
    RandomGenerator gen;
    Slice input = gen.Generate(Options().block_size);
1052
    std::string compressed;
1053 1054
    bool ok = port::Snappy_Compress(Options().compression_opts, input.data(),
                                    input.size(), &compressed);
1055
    int64_t bytes = 0;
1056
    char* uncompressed = new char[input.size()];
1057 1058
    while (ok && bytes < 1024 * 1048576) {  // Compress 1G
      ok =  port::Snappy_Uncompress(compressed.data(), compressed.size(),
1059 1060
                                    uncompressed);
      bytes += input.size();
1061
      thread->stats.FinishedSingleOp(nullptr);
1062
    }
1063
    delete[] uncompressed;
1064 1065

    if (!ok) {
1066
      thread->stats.AddMessage("(snappy failure)");
1067
    } else {
1068
      thread->stats.AddBytes(bytes);
1069 1070 1071
    }
  }

1072
  void Open() {
1073
    assert(db_ == nullptr);
1074
    Options options;
1075
    options.create_if_missing = !FLAGS_use_existing_db;
1076
    options.block_cache = cache_;
1077
    if (cache_ == nullptr) {
1078 1079
      options.no_block_cache = true;
    }
1080
    options.write_buffer_size = FLAGS_write_buffer_size;
1081 1082
    options.max_write_buffer_number = FLAGS_max_write_buffer_number;
    options.max_background_compactions = FLAGS_max_background_compactions;
1083
    options.block_size = FLAGS_block_size;
S
Sanjay Ghemawat 已提交
1084
    options.filter_policy = filter_policy_;
1085 1086
    options.max_open_files = FLAGS_open_files;
    options.statistics = dbstats;
1087
    options.env = FLAGS_env;
H
heyongqiang 已提交
1088
    options.disableDataSync = FLAGS_disable_data_sync;
1089
    options.use_fsync = FLAGS_use_fsync;
1090
    options.num_levels = FLAGS_num_levels;
H
heyongqiang 已提交
1091 1092 1093 1094 1095
    options.target_file_size_base = FLAGS_target_file_size_base;
    options.target_file_size_multiplier = FLAGS_target_file_size_multiplier;
    options.max_bytes_for_level_base = FLAGS_max_bytes_for_level_base;
    options.max_bytes_for_level_multiplier =
        FLAGS_max_bytes_for_level_multiplier;
1096 1097 1098 1099 1100 1101 1102 1103 1104 1105
    if (FLAGS_max_bytes_for_level_multiplier_additional.size() > 0) {
      if (FLAGS_max_bytes_for_level_multiplier_additional.size() !=
          (unsigned int)FLAGS_num_levels) {
        fprintf(stderr, "Insufficient number of fanouts specified %d\n",
                (int)FLAGS_max_bytes_for_level_multiplier_additional.size());
        exit(1);
      }
      options.max_bytes_for_level_multiplier_additional =
        FLAGS_max_bytes_for_level_multiplier_additional;
    }
H
heyongqiang 已提交
1106
    options.level0_stop_writes_trigger = FLAGS_level0_stop_writes_trigger;
M
Mark Callaghan 已提交
1107
    options.level0_file_num_compaction_trigger =
1108
        FLAGS_level0_file_num_compaction_trigger;
H
heyongqiang 已提交
1109 1110
    options.level0_slowdown_writes_trigger =
      FLAGS_level0_slowdown_writes_trigger;
1111
    options.compression = FLAGS_compression_type;
1112
    options.WAL_ttl_seconds = FLAGS_WAL_ttl_seconds;
1113 1114
    if (FLAGS_min_level_to_compress >= 0) {
      assert(FLAGS_min_level_to_compress <= FLAGS_num_levels);
1115
      options.compression_per_level.resize(FLAGS_num_levels);
1116
      for (int i = 0; i < FLAGS_min_level_to_compress; i++) {
1117 1118
        options.compression_per_level[i] = kNoCompression;
      }
1119
      for (int i = FLAGS_min_level_to_compress;
1120 1121 1122 1123
           i < FLAGS_num_levels; i++) {
        options.compression_per_level[i] = FLAGS_compression_type;
      }
    }
1124
    options.disable_seek_compaction = FLAGS_disable_seek_compaction;
1125 1126
    options.delete_obsolete_files_period_micros =
      FLAGS_delete_obsolete_files_period_micros;
1127
    options.rate_limit = FLAGS_rate_limit;
1128
    options.rate_limit_delay_milliseconds = FLAGS_rate_limit_delay_milliseconds;
1129
    options.table_cache_numshardbits = FLAGS_table_cache_numshardbits;
A
Abhishek Kona 已提交
1130
    options.max_grandparent_overlap_factor =
1131
      FLAGS_max_grandparent_overlap_factor;
1132
    options.disable_auto_compactions = FLAGS_disable_auto_compactions;
1133
    options.source_compaction_factor = FLAGS_source_compaction_factor;
1134 1135 1136 1137 1138 1139 1140

    // fill storage options
    options.allow_os_buffer = FLAGS_use_os_buffer;
    options.allow_readahead = FLAGS_use_fsreadahead;
    options.allow_mmap_reads = FLAGS_use_mmap_reads;
    options.allow_mmap_writes = FLAGS_use_mmap_writes;
    options.allow_readahead_compactions = FLAGS_use_readahead_compactions;
H
heyongqiang 已提交
1141 1142 1143 1144 1145 1146
    Status s;
    if(FLAGS_read_only) {
      s = DB::OpenForReadOnly(options, FLAGS_db, &db_);
    } else {
      s = DB::Open(options, FLAGS_db, &db_);
    }
1147 1148 1149 1150
    if (!s.ok()) {
      fprintf(stderr, "open error: %s\n", s.ToString().c_str());
      exit(1);
    }
1151
    if (FLAGS_min_level_to_compress >= 0) {
1152
      options.compression_per_level.clear();
1153
    }
1154 1155
  }

1156 1157 1158
  void WriteSeq(ThreadState* thread) {
    DoWrite(thread, true);
  }
1159

1160 1161 1162 1163 1164
  void WriteRandom(ThreadState* thread) {
    DoWrite(thread, false);
  }

  void DoWrite(ThreadState* thread, bool seq) {
M
Mark Callaghan 已提交
1165 1166
    Duration duration(seq ? 0 : FLAGS_duration, writes_);

1167
    if (num_ != FLAGS_num) {
1168
      char msg[100];
1169
      snprintf(msg, sizeof(msg), "(%ld ops)", num_);
1170
      thread->stats.AddMessage(msg);
1171 1172
    }

1173
    RandomGenerator gen;
J
jorlow@chromium.org 已提交
1174 1175
    WriteBatch batch;
    Status s;
1176
    int64_t bytes = 0;
M
Mark Callaghan 已提交
1177 1178
    int i = 0;
    while (!duration.Done(entries_per_batch_)) {
J
jorlow@chromium.org 已提交
1179
      batch.Clear();
1180 1181
      for (int j = 0; j < entries_per_batch_; j++) {
        const int k = seq ? i+j : (thread->rand.Next() % FLAGS_num);
1182 1183 1184
        unique_ptr<char []> key = GenerateKeyFromInt(k);
        batch.Put(key.get(), gen.Generate(value_size_));
        bytes += value_size_ + strlen(key.get());
M
Mark Callaghan 已提交
1185
        thread->stats.FinishedSingleOp(db_);
1186
      }
1187
      s = db_->Write(write_options_, &batch);
J
jorlow@chromium.org 已提交
1188 1189 1190 1191
      if (!s.ok()) {
        fprintf(stderr, "put error: %s\n", s.ToString().c_str());
        exit(1);
      }
M
Mark Callaghan 已提交
1192
      i += entries_per_batch_;
J
jorlow@chromium.org 已提交
1193
    }
1194
    thread->stats.AddBytes(bytes);
J
jorlow@chromium.org 已提交
1195 1196
  }

1197
  void ReadSequential(ThreadState* thread) {
1198
    Iterator* iter = db_->NewIterator(ReadOptions(FLAGS_verify_checksum, true));
1199
    long i = 0;
1200
    int64_t bytes = 0;
1201
    for (iter->SeekToFirst(); i < reads_ && iter->Valid(); iter->Next()) {
1202
      bytes += iter->key().size() + iter->value().size();
M
Mark Callaghan 已提交
1203
      thread->stats.FinishedSingleOp(db_);
1204 1205 1206
      ++i;
    }
    delete iter;
1207
    thread->stats.AddBytes(bytes);
1208 1209
  }

1210
  void ReadReverse(ThreadState* thread) {
1211
    Iterator* iter = db_->NewIterator(ReadOptions(FLAGS_verify_checksum, true));
1212
    long i = 0;
1213
    int64_t bytes = 0;
1214
    for (iter->SeekToLast(); i < reads_ && iter->Valid(); iter->Prev()) {
1215
      bytes += iter->key().size() + iter->value().size();
M
Mark Callaghan 已提交
1216
      thread->stats.FinishedSingleOp(db_);
1217 1218 1219
      ++i;
    }
    delete iter;
1220
    thread->stats.AddBytes(bytes);
1221 1222
  }

1223
  void ReadRandom(ThreadState* thread) {
1224
    ReadOptions options(FLAGS_verify_checksum, true);
1225
    Iterator* iter = db_->NewIterator(options);
M
Mark Callaghan 已提交
1226
    Duration duration(FLAGS_duration, reads_);
1227

1228
    std::string value;
1229
    long found = 0;
M
Mark Callaghan 已提交
1230
    while (!duration.Done(1)) {
1231
      const int k = thread->rand.Next() % FLAGS_num;
1232
      unique_ptr<char []> key = GenerateKeyFromInt(k);
M
Mark Callaghan 已提交
1233 1234 1235 1236
      if (FLAGS_use_snapshot) {
        options.snapshot = db_->GetSnapshot();
      }

1237
      if (FLAGS_read_range < 2) {
1238
        if (db_->Get(options, key.get(), &value).ok()) {
1239 1240 1241
          found++;
        }
      } else {
1242
        Slice skey(key.get());
1243
        int count = 1;
M
Mark Callaghan 已提交
1244 1245 1246 1247 1248 1249 1250 1251 1252 1253

        if (FLAGS_get_approx) {
          unique_ptr<char []> key2 =
              GenerateKeyFromInt(k + (int) FLAGS_read_range);
          Slice skey2(key2.get());
          Range range(skey, skey2);
          uint64_t sizes;
          db_->GetApproximateSizes(&range, 1, &sizes);
        }

1254 1255 1256 1257 1258
        for (iter->Seek(skey);
             iter->Valid() && count <= FLAGS_read_range;
             ++count, iter->Next()) {
          found++;
        }
S
Sanjay Ghemawat 已提交
1259
      }
1260

M
Mark Callaghan 已提交
1261 1262 1263 1264 1265
      if (FLAGS_use_snapshot) {
        db_->ReleaseSnapshot(options.snapshot);
        options.snapshot = nullptr;
      }

M
Mark Callaghan 已提交
1266
      thread->stats.FinishedSingleOp(db_);
S
Sanjay Ghemawat 已提交
1267
    }
1268
    delete iter;
S
Sanjay Ghemawat 已提交
1269
    char msg[100];
1270
    snprintf(msg, sizeof(msg), "(%ld of %ld found)", found, num_);
S
Sanjay Ghemawat 已提交
1271 1272 1273 1274
    thread->stats.AddMessage(msg);
  }

  void ReadMissing(ThreadState* thread) {
M
Mark Callaghan 已提交
1275
    Duration duration(FLAGS_duration, reads_);
1276
    ReadOptions options(FLAGS_verify_checksum, true);
S
Sanjay Ghemawat 已提交
1277
    std::string value;
M
Mark Callaghan 已提交
1278
    while (!duration.Done(1)) {
S
Sanjay Ghemawat 已提交
1279
      const int k = thread->rand.Next() % FLAGS_num;
1280
      unique_ptr<char []> key = GenerateKeyFromInt(k, ".");
1281
      db_->Get(options, key.get(), &value);
M
Mark Callaghan 已提交
1282
      thread->stats.FinishedSingleOp(db_);
J
jorlow@chromium.org 已提交
1283 1284 1285
    }
  }

1286
  void ReadHot(ThreadState* thread) {
M
Mark Callaghan 已提交
1287
    Duration duration(FLAGS_duration, reads_);
1288
    ReadOptions options(FLAGS_verify_checksum, true);
1289
    std::string value;
1290
    const long range = (FLAGS_num + 99) / 100;
M
Mark Callaghan 已提交
1291
    while (!duration.Done(1)) {
1292
      const int k = thread->rand.Next() % range;
1293 1294
      unique_ptr<char []> key = GenerateKeyFromInt(k);
      db_->Get(options, key.get(), &value);
M
Mark Callaghan 已提交
1295
      thread->stats.FinishedSingleOp(db_);
1296 1297 1298
    }
  }

S
Sanjay Ghemawat 已提交
1299
  void SeekRandom(ThreadState* thread) {
M
Mark Callaghan 已提交
1300
    Duration duration(FLAGS_duration, reads_);
1301
    ReadOptions options(FLAGS_verify_checksum, true);
S
Sanjay Ghemawat 已提交
1302
    std::string value;
1303
    long found = 0;
M
Mark Callaghan 已提交
1304
    while (!duration.Done(1)) {
S
Sanjay Ghemawat 已提交
1305 1306
      Iterator* iter = db_->NewIterator(options);
      const int k = thread->rand.Next() % FLAGS_num;
1307 1308 1309
      unique_ptr<char []> key = GenerateKeyFromInt(k);
      iter->Seek(key.get());
      if (iter->Valid() && iter->key() == key.get()) found++;
S
Sanjay Ghemawat 已提交
1310
      delete iter;
M
Mark Callaghan 已提交
1311
      thread->stats.FinishedSingleOp(db_);
S
Sanjay Ghemawat 已提交
1312 1313
    }
    char msg[100];
1314
    snprintf(msg, sizeof(msg), "(%ld of %ld found)", found, num_);
S
Sanjay Ghemawat 已提交
1315 1316 1317 1318 1319 1320
    thread->stats.AddMessage(msg);
  }

  void DoDelete(ThreadState* thread, bool seq) {
    WriteBatch batch;
    Status s;
M
Mark Callaghan 已提交
1321 1322 1323
    Duration duration(seq ? 0 : FLAGS_duration, num_);
    long i = 0;
    while (!duration.Done(entries_per_batch_)) {
S
Sanjay Ghemawat 已提交
1324 1325 1326
      batch.Clear();
      for (int j = 0; j < entries_per_batch_; j++) {
        const int k = seq ? i+j : (thread->rand.Next() % FLAGS_num);
1327 1328
        unique_ptr<char []> key = GenerateKeyFromInt(k);
        batch.Delete(key.get());
M
Mark Callaghan 已提交
1329
        thread->stats.FinishedSingleOp(db_);
S
Sanjay Ghemawat 已提交
1330 1331 1332 1333 1334 1335
      }
      s = db_->Write(write_options_, &batch);
      if (!s.ok()) {
        fprintf(stderr, "del error: %s\n", s.ToString().c_str());
        exit(1);
      }
M
Mark Callaghan 已提交
1336
      ++i;
S
Sanjay Ghemawat 已提交
1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347
    }
  }

  void DeleteSeq(ThreadState* thread) {
    DoDelete(thread, true);
  }

  void DeleteRandom(ThreadState* thread) {
    DoDelete(thread, false);
  }

1348 1349 1350 1351 1352 1353
  void ReadWhileWriting(ThreadState* thread) {
    if (thread->tid > 0) {
      ReadRandom(thread);
    } else {
      // Special thread that keeps writing until other threads are done.
      RandomGenerator gen;
1354 1355 1356 1357 1358 1359 1360 1361 1362
      double last = FLAGS_env->NowMicros();
      int writes_per_second_by_10 = 0;
      int num_writes = 0;

      // --writes_per_second rate limit is enforced per 100 milliseconds
      // intervals to avoid a burst of writes at the start of each second.

      if (FLAGS_writes_per_second > 0)
        writes_per_second_by_10 = FLAGS_writes_per_second / 10;
1363 1364 1365 1366

      // Don't merge stats from this thread with the readers.
      thread->stats.SetExcludeFromMerge();

1367 1368 1369 1370 1371 1372 1373 1374 1375 1376
      while (true) {
        {
          MutexLock l(&thread->shared->mu);
          if (thread->shared->num_done + 1 >= thread->shared->num_initialized) {
            // Other threads have finished
            break;
          }
        }

        const int k = thread->rand.Next() % FLAGS_num;
1377 1378
        unique_ptr<char []> key = GenerateKeyFromInt(k);
        Status s = db_->Put(write_options_, key.get(), gen.Generate(value_size_));
1379 1380 1381 1382
        if (!s.ok()) {
          fprintf(stderr, "put error: %s\n", s.ToString().c_str());
          exit(1);
        }
1383
        thread->stats.FinishedSingleOp(db_);
1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397

        ++num_writes;
        if (writes_per_second_by_10 && num_writes >= writes_per_second_by_10) {
          double now = FLAGS_env->NowMicros();
          double usecs_since_last = now - last;

          num_writes = 0;
          last = now;

          if (usecs_since_last < 100000.0) {
            FLAGS_env->SleepForMicroseconds(100000.0 - usecs_since_last);
            last = FLAGS_env->NowMicros();
          }
        }
1398 1399 1400 1401
      }
    }
  }

1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498
  // Given a key K and value V, this puts (K+"0", V), (K+"1", V), (K+"2", V)
  // in DB atomically i.e in a single batch. Also refer MultiGet.
  Status MultiPut(const WriteOptions& writeoptions,
                  const Slice& key, const Slice& value) {
    std::string suffixes[3] = {"2", "1", "0"};
    std::string keys[3];

    WriteBatch batch;
    Status s;
    for (int i = 0; i < 3; i++) {
      keys[i] = key.ToString() + suffixes[i];
      batch.Put(keys[i], value);
    }

    s = db_->Write(writeoptions, &batch);
    return s;
  }


  // Given a key K, this deletes (K+"0", V), (K+"1", V), (K+"2", V)
  // in DB atomically i.e in a single batch. Also refer MultiGet.
  Status MultiDelete(const WriteOptions& writeoptions,
                  const Slice& key) {
    std::string suffixes[3] = {"1", "2", "0"};
    std::string keys[3];

    WriteBatch batch;
    Status s;
    for (int i = 0; i < 3; i++) {
      keys[i] = key.ToString() + suffixes[i];
      batch.Delete(keys[i]);
    }

    s = db_->Write(writeoptions, &batch);
    return s;
  }

  // Given a key K and value V, this gets values for K+"0", K+"1" and K+"2"
  // in the same snapshot, and verifies that all the values are identical.
  // ASSUMES that MultiPut was used to put (K, V) into the DB.
  Status MultiGet(const ReadOptions& readoptions,
                  const Slice& key, std::string* value) {
    std::string suffixes[3] = {"0", "1", "2"};
    std::string keys[3];
    Slice key_slices[3];
    std::string values[3];
    ReadOptions readoptionscopy = readoptions;
    readoptionscopy.snapshot = db_->GetSnapshot();
    Status s;
    for (int i = 0; i < 3; i++) {
      keys[i] = key.ToString() + suffixes[i];
      key_slices[i] = keys[i];
      s = db_->Get(readoptionscopy, key_slices[i], value);
      if (!s.ok() && !s.IsNotFound()) {
        fprintf(stderr, "get error: %s\n", s.ToString().c_str());
        values[i] = "";
        // we continue after error rather than exiting so that we can
        // find more errors if any
      } else if (s.IsNotFound()) {
        values[i] = "";
      } else {
        values[i] = *value;
      }
    }
    db_->ReleaseSnapshot(readoptionscopy.snapshot);

    if ((values[0] != values[1]) || (values[1] != values[2])) {
      fprintf(stderr, "inconsistent values for key %s: %s, %s, %s\n",
              key.ToString().c_str(), values[0].c_str(), values[1].c_str(),
              values[2].c_str());
      // we continue after error rather than exiting so that we can
      // find more errors if any
    }

    return s;
  }

  // Differs from readrandomwriterandom in the following ways:
  // (a) Uses MultiGet/MultiPut to read/write key values. Refer to those funcs.
  // (b) Does deletes as well (per FLAGS_deletepercent)
  // (c) In order to achieve high % of 'found' during lookups, and to do
  //     multiple writes (including puts and deletes) it uses upto
  //     FLAGS_numdistinct distinct keys instead of FLAGS_num distinct keys.
  void RandomWithVerify(ThreadState* thread) {
    ReadOptions options(FLAGS_verify_checksum, true);
    RandomGenerator gen;
    std::string value;
    long found = 0;
    int get_weight = 0;
    int put_weight = 0;
    int delete_weight = 0;
    long gets_done = 0;
    long puts_done = 0;
    long deletes_done = 0;
    // the number of iterations is the larger of read_ or write_
    for (long i = 0; i < readwrites_; i++) {
      const int k = thread->rand.Next() % (FLAGS_numdistinct);
1499
      unique_ptr<char []> key = GenerateKeyFromInt(k);
1500 1501 1502 1503 1504 1505 1506 1507
      if (get_weight == 0 && put_weight == 0 && delete_weight == 0) {
        // one batch complated, reinitialize for next batch
        get_weight = FLAGS_readwritepercent;
        delete_weight = FLAGS_deletepercent;
        put_weight = 100 - get_weight - delete_weight;
      }
      if (get_weight > 0) {
        // do all the gets first
1508
        Status s = MultiGet(options, key.get(), &value);
1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520
        if (!s.ok() && !s.IsNotFound()) {
          fprintf(stderr, "get error: %s\n", s.ToString().c_str());
          // we continue after error rather than exiting so that we can
          // find more errors if any
        } else if (!s.IsNotFound()) {
          found++;
        }
        get_weight--;
        gets_done++;
      } else if (put_weight > 0) {
        // then do all the corresponding number of puts
        // for all the gets we have done earlier
1521
        Status s = MultiPut(write_options_, key.get(), gen.Generate(value_size_));
1522 1523 1524 1525 1526 1527 1528
        if (!s.ok()) {
          fprintf(stderr, "multiput error: %s\n", s.ToString().c_str());
          exit(1);
        }
        put_weight--;
        puts_done++;
      } else if (delete_weight > 0) {
1529
        Status s = MultiDelete(write_options_, key.get());
1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545
        if (!s.ok()) {
          fprintf(stderr, "multidelete error: %s\n", s.ToString().c_str());
          exit(1);
        }
        delete_weight--;
        deletes_done++;
      }

      thread->stats.FinishedSingleOp(db_);
    }
    char msg[100];
    snprintf(msg, sizeof(msg), "( get:%ld put:%ld del:%ld total:%ld found:%ld)",
             gets_done, puts_done, deletes_done, readwrites_, found);
    thread->stats.AddMessage(msg);
  }

1546 1547
  //
  // This is diffferent from ReadWhileWriting because it does not use
1548
  // an extra thread.
1549 1550 1551 1552 1553 1554 1555 1556 1557 1558
  //
  void ReadRandomWriteRandom(ThreadState* thread) {
    ReadOptions options(FLAGS_verify_checksum, true);
    RandomGenerator gen;
    std::string value;
    long found = 0;
    int get_weight = 0;
    int put_weight = 0;
    long reads_done = 0;
    long writes_done = 0;
M
Mark Callaghan 已提交
1559 1560
    Duration duration(FLAGS_duration, readwrites_);

1561
    // the number of iterations is the larger of read_ or write_
M
Mark Callaghan 已提交
1562
    while (!duration.Done(1)) {
1563
      const int k = thread->rand.Next() % FLAGS_num;
1564
      unique_ptr<char []> key = GenerateKeyFromInt(k);
1565 1566 1567 1568 1569 1570
      if (get_weight == 0 && put_weight == 0) {
        // one batch complated, reinitialize for next batch
        get_weight = FLAGS_readwritepercent;
        put_weight = 100 - get_weight;
      }
      if (get_weight > 0) {
M
Mark Callaghan 已提交
1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585

        if (FLAGS_use_snapshot) {
          options.snapshot = db_->GetSnapshot();
        }

        if (FLAGS_get_approx) {
          char key2[100];
          snprintf(key2, sizeof(key2), "%016d", k + 1);
          Slice skey2(key2);
          Slice skey(key2);
          Range range(skey, skey2);
          uint64_t sizes;
          db_->GetApproximateSizes(&range, 1, &sizes);
        }

1586
        // do all the gets first
1587
        Status s = db_->Get(options, key.get(), &value);
1588 1589 1590 1591 1592 1593 1594 1595
        if (!s.ok() && !s.IsNotFound()) {
          fprintf(stderr, "get error: %s\n", s.ToString().c_str());
          // we continue after error rather than exiting so that we can
          // find more errors if any
        } else if (!s.IsNotFound()) {
          found++;
        }

1596
        if (db_->Get(options, key.get(), &value).ok()) {
1597 1598 1599 1600
          found++;
        }
        get_weight--;
        reads_done++;
M
Mark Callaghan 已提交
1601 1602 1603 1604 1605

        if (FLAGS_use_snapshot) {
          db_->ReleaseSnapshot(options.snapshot);
        }

1606 1607 1608
      } else  if (put_weight > 0) {
        // then do all the corresponding number of puts
        // for all the gets we have done earlier
1609
        Status s = db_->Put(write_options_, key.get(), gen.Generate(value_size_));
1610 1611 1612 1613 1614 1615 1616
        if (!s.ok()) {
          fprintf(stderr, "put error: %s\n", s.ToString().c_str());
          exit(1);
        }
        put_weight--;
        writes_done++;
      }
M
Mark Callaghan 已提交
1617
      thread->stats.FinishedSingleOp(db_);
1618 1619
    }
    char msg[100];
1620 1621
    snprintf(msg, sizeof(msg), "( reads:%ld writes:%ld total:%ld found:%ld)",
             reads_done, writes_done, readwrites_, found);
1622 1623 1624
    thread->stats.AddMessage(msg);
  }

M
Mark Callaghan 已提交
1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673
  //
  // Read-modify-write for random keys
  //
  void UpdateRandom(ThreadState* thread) {
    ReadOptions options(FLAGS_verify_checksum, true);
    RandomGenerator gen;
    std::string value;
    long found = 0;
    Duration duration(FLAGS_duration, readwrites_);

    // the number of iterations is the larger of read_ or write_
    while (!duration.Done(1)) {
      const int k = thread->rand.Next() % FLAGS_num;
      unique_ptr<char []> key = GenerateKeyFromInt(k);

      if (FLAGS_use_snapshot) {
        options.snapshot = db_->GetSnapshot();
      }

      if (FLAGS_get_approx) {
        char key2[100];
        snprintf(key2, sizeof(key2), "%016d", k + 1);
        Slice skey2(key2);
        Slice skey(key2);
        Range range(skey, skey2);
        uint64_t sizes;
        db_->GetApproximateSizes(&range, 1, &sizes);
      }

      if (db_->Get(options, key.get(), &value).ok()) {
        found++;
      }

      if (FLAGS_use_snapshot) {
        db_->ReleaseSnapshot(options.snapshot);
      }

      Status s = db_->Put(write_options_, key.get(), gen.Generate(value_size_));
      if (!s.ok()) {
        fprintf(stderr, "put error: %s\n", s.ToString().c_str());
        exit(1);
      }
      thread->stats.FinishedSingleOp(db_);
    }
    char msg[100];
    snprintf(msg, sizeof(msg), "( updates:%ld found:%ld)", readwrites_, found);
    thread->stats.AddMessage(msg);
  }

1674
  void Compact(ThreadState* thread) {
1675
    db_->CompactRange(nullptr, nullptr);
J
jorlow@chromium.org 已提交
1676 1677
  }

S
Sanjay Ghemawat 已提交
1678
  void PrintStats(const char* key) {
1679
    std::string stats;
S
Sanjay Ghemawat 已提交
1680
    if (!db_->GetProperty(key, &stats)) {
1681
      stats = "(failed)";
1682
    }
1683
    fprintf(stdout, "\n%s\n", stats.c_str());
1684 1685
  }

J
jorlow@chromium.org 已提交
1686 1687 1688 1689 1690 1691
  static void WriteToFile(void* arg, const char* buf, int n) {
    reinterpret_cast<WritableFile*>(arg)->Append(Slice(buf, n));
  }

  void HeapProfile() {
    char fname[100];
1692
    StorageOptions soptions;
1693
    snprintf(fname, sizeof(fname), "%s/heap-%04d", FLAGS_db, ++heap_counter_);
1694
    unique_ptr<WritableFile> file;
1695
    Status s = FLAGS_env->NewWritableFile(fname, &file, soptions);
J
jorlow@chromium.org 已提交
1696
    if (!s.ok()) {
1697
      fprintf(stderr, "%s\n", s.ToString().c_str());
J
jorlow@chromium.org 已提交
1698 1699
      return;
    }
1700
    bool ok = port::GetHeapProfile(WriteToFile, file.get());
J
jorlow@chromium.org 已提交
1701
    if (!ok) {
1702
      fprintf(stderr, "heap profiling not supported\n");
1703
      FLAGS_env->DeleteFile(fname);
J
jorlow@chromium.org 已提交
1704 1705 1706 1707
    }
  }
};

H
Hans Wennborg 已提交
1708
}  // namespace leveldb
J
jorlow@chromium.org 已提交
1709 1710

int main(int argc, char** argv) {
1711 1712
  leveldb::InstallStackTraceHandler();

1713
  FLAGS_write_buffer_size = leveldb::Options().write_buffer_size;
1714
  FLAGS_max_write_buffer_number = leveldb::Options().max_write_buffer_number;
1715
  FLAGS_open_files = leveldb::Options().max_open_files;
A
Abhishek Kona 已提交
1716
  FLAGS_max_background_compactions =
1717
    leveldb::Options().max_background_compactions;
1718 1719
  // Compression test code above refers to FLAGS_block_size
  FLAGS_block_size = leveldb::Options().block_size;
1720 1721 1722 1723 1724 1725 1726
  FLAGS_use_os_buffer = leveldb::StorageOptions().UseOsBuffer();
  FLAGS_use_fsreadahead = leveldb::StorageOptions().UseReadahead();
  FLAGS_use_mmap_reads = leveldb::StorageOptions().UseMmapReads();
  FLAGS_use_mmap_writes = leveldb::StorageOptions().UseMmapWrites();
  FLAGS_use_readahead_compactions =
    leveldb::StorageOptions().UseReadaheadCompactions();

H
heyongqiang 已提交
1727
  std::string default_db_path;
1728

J
jorlow@chromium.org 已提交
1729 1730 1731
  for (int i = 1; i < argc; i++) {
    double d;
    int n;
1732
    long l;
J
jorlow@chromium.org 已提交
1733
    char junk;
1734
    char hdfsname[2048];
1735
    char str[512];
J
jorlow@chromium.org 已提交
1736 1737 1738 1739 1740 1741 1742
    if (leveldb::Slice(argv[i]).starts_with("--benchmarks=")) {
      FLAGS_benchmarks = argv[i] + strlen("--benchmarks=");
    } else if (sscanf(argv[i], "--compression_ratio=%lf%c", &d, &junk) == 1) {
      FLAGS_compression_ratio = d;
    } else if (sscanf(argv[i], "--histogram=%d%c", &n, &junk) == 1 &&
               (n == 0 || n == 1)) {
      FLAGS_histogram = n;
1743 1744 1745
    } else if (sscanf(argv[i], "--use_existing_db=%d%c", &n, &junk) == 1 &&
               (n == 0 || n == 1)) {
      FLAGS_use_existing_db = n;
1746 1747
    } else if (sscanf(argv[i], "--num=%ld%c", &l, &junk) == 1) {
      FLAGS_num = l;
1748 1749
    } else if (sscanf(argv[i], "--numdistinct=%ld%c", &l, &junk) == 1) {
      FLAGS_numdistinct = l;
1750 1751
    } else if (sscanf(argv[i], "--reads=%d%c", &n, &junk) == 1) {
      FLAGS_reads = n;
1752 1753
    } else if (sscanf(argv[i], "--read_range=%d%c", &n, &junk) == 1) {
      FLAGS_read_range = n;
M
Mark Callaghan 已提交
1754 1755
    } else if (sscanf(argv[i], "--duration=%d%c", &n, &junk) == 1) {
      FLAGS_duration = n;
1756 1757
    } else if (sscanf(argv[i], "--seed=%ld%c", &l, &junk) == 1) {
      FLAGS_seed = l;
1758 1759
    } else if (sscanf(argv[i], "--threads=%d%c", &n, &junk) == 1) {
      FLAGS_threads = n;
J
jorlow@chromium.org 已提交
1760 1761
    } else if (sscanf(argv[i], "--value_size=%d%c", &n, &junk) == 1) {
      FLAGS_value_size = n;
1762 1763 1764 1765 1766 1767 1768
    } else if (sscanf(argv[i], "--key_size=%d%c", &n, &junk) == 1) {
      if (MAX_KEY_SIZE < n) {
         fprintf(stderr, "key_size should not be larger than %d\n", MAX_KEY_SIZE);
         exit(1);
      } else {
        FLAGS_key_size = n;
      }
J
jorlow@chromium.org 已提交
1769 1770
    } else if (sscanf(argv[i], "--write_buffer_size=%d%c", &n, &junk) == 1) {
      FLAGS_write_buffer_size = n;
1771 1772 1773 1774
    } else if (sscanf(argv[i], "--max_write_buffer_number=%d%c", &n, &junk) == 1) {
      FLAGS_max_write_buffer_number = n;
    } else if (sscanf(argv[i], "--max_background_compactions=%d%c", &n, &junk) == 1) {
      FLAGS_max_background_compactions = n;
1775 1776
    } else if (sscanf(argv[i], "--cache_size=%ld%c", &l, &junk) == 1) {
      FLAGS_cache_size = l;
1777 1778
    } else if (sscanf(argv[i], "--block_size=%d%c", &n, &junk) == 1) {
      FLAGS_block_size = n;
1779
    } else if (sscanf(argv[i], "--cache_numshardbits=%d%c", &n, &junk) == 1) {
1780 1781 1782 1783 1784 1785
      if (n < 20) {
        FLAGS_cache_numshardbits = n;
      } else {
        fprintf(stderr, "The cache cannot be sharded into 2**%d pieces\n", n);
        exit(1);
      }
1786
    } else if (sscanf(argv[i], "--table_cache_numshardbits=%d%c",
A
Abhishek Kona 已提交
1787
          &n, &junk) == 1) {
1788 1789 1790 1791 1792
      if (n <= 0 || n > 20) {
        fprintf(stderr, "The cache cannot be sharded into 2**%d pieces\n", n);
        exit(1);
      }
      FLAGS_table_cache_numshardbits = n;
S
Sanjay Ghemawat 已提交
1793 1794
    } else if (sscanf(argv[i], "--bloom_bits=%d%c", &n, &junk) == 1) {
      FLAGS_bloom_bits = n;
1795 1796
    } else if (sscanf(argv[i], "--open_files=%d%c", &n, &junk) == 1) {
      FLAGS_open_files = n;
1797 1798
    } else if (strncmp(argv[i], "--db=", 5) == 0) {
      FLAGS_db = argv[i] + 5;
1799 1800 1801
    } else if (sscanf(argv[i], "--verify_checksum=%d%c", &n, &junk) == 1 &&
               (n == 0 || n == 1)) {
      FLAGS_verify_checksum = n;
1802 1803
    } else if (sscanf(argv[i], "--bufferedio=%d%c", &n, &junk) == 1 &&
               (n == 0 || n == 1)) {
1804
      FLAGS_use_os_buffer = n;
1805 1806
    } else if (sscanf(argv[i], "--mmap_read=%d%c", &n, &junk) == 1 &&
               (n == 0 || n == 1)) {
1807
      FLAGS_use_mmap_reads = n;
1808 1809
    } else if (sscanf(argv[i], "--mmap_write=%d%c", &n, &junk) == 1 &&
               (n == 0 || n == 1)) {
1810
      FLAGS_use_mmap_writes = n;
1811
    } else if (sscanf(argv[i], "--readahead=%d%c", &n, &junk) == 1 &&
1812
               (n == 0 || n == 1)) {
1813 1814 1815 1816
      FLAGS_use_fsreadahead = n;
    } else if (sscanf(argv[i], "--readahead_compactions=%d%c", &n, &junk) == 1&&
               (n == 0 || n == 1)) {
      FLAGS_use_readahead_compactions = n;
1817 1818 1819
    } else if (sscanf(argv[i], "--statistics=%d%c", &n, &junk) == 1 &&
               (n == 0 || n == 1)) {
      if (n == 1) {
A
Abhishek Kona 已提交
1820
        dbstats.reset(new leveldb::DBStatistics());
1821 1822
        FLAGS_statistics = true;
      }
1823 1824
    } else if (sscanf(argv[i], "--writes=%d%c", &n, &junk) == 1) {
      FLAGS_writes = n;
1825 1826
    } else if (sscanf(argv[i], "--writes_per_second=%d%c", &n, &junk) == 1) {
      FLAGS_writes_per_second = n;
1827 1828 1829
    } else if (sscanf(argv[i], "--sync=%d%c", &n, &junk) == 1 &&
               (n == 0 || n == 1)) {
      FLAGS_sync = n;
1830
    } else if (sscanf(argv[i], "--readwritepercent=%d%c", &n, &junk) == 1 &&
1831
               n > 0 && n < 100) {
1832
      FLAGS_readwritepercent = n;
1833 1834 1835
    } else if (sscanf(argv[i], "--deletepercent=%d%c", &n, &junk) == 1 &&
               n > 0 && n < 100) {
      FLAGS_deletepercent = n;
H
heyongqiang 已提交
1836 1837 1838
    } else if (sscanf(argv[i], "--disable_data_sync=%d%c", &n, &junk) == 1 &&
        (n == 0 || n == 1)) {
      FLAGS_disable_data_sync = n;
1839 1840 1841
    } else if (sscanf(argv[i], "--use_fsync=%d%c", &n, &junk) == 1 &&
        (n == 0 || n == 1)) {
      FLAGS_use_fsync = n;
H
heyongqiang 已提交
1842
    } else if (sscanf(argv[i], "--disable_wal=%d%c", &n, &junk) == 1 &&
1843
        (n == 0 || n == 1)) {
H
heyongqiang 已提交
1844
      FLAGS_disable_wal = n;
M
Mark Callaghan 已提交
1845 1846 1847 1848 1849 1850
    } else if (sscanf(argv[i], "--use_snapshot=%d%c", &n, &junk) == 1 &&
        (n == 0 || n == 1)) {
      FLAGS_use_snapshot = n;
    } else if (sscanf(argv[i], "--get_approx=%d%c", &n, &junk) == 1 &&
        (n == 0 || n == 1)) {
      FLAGS_get_approx = n;
1851
    } else if (sscanf(argv[i], "--hdfs=%s", hdfsname) == 1) {
1852
      FLAGS_env  = new leveldb::HdfsEnv(hdfsname);
1853 1854 1855
    } else if (sscanf(argv[i], "--num_levels=%d%c",
        &n, &junk) == 1) {
      FLAGS_num_levels = n;
H
heyongqiang 已提交
1856 1857 1858 1859 1860 1861 1862
    } else if (sscanf(argv[i], "--target_file_size_base=%d%c",
        &n, &junk) == 1) {
      FLAGS_target_file_size_base = n;
    } else if ( sscanf(argv[i], "--target_file_size_multiplier=%d%c",
        &n, &junk) == 1) {
      FLAGS_target_file_size_multiplier = n;
    } else if (
1863 1864
        sscanf(argv[i], "--max_bytes_for_level_base=%ld%c", &l, &junk) == 1) {
      FLAGS_max_bytes_for_level_base = l;
H
heyongqiang 已提交
1865 1866 1867
    } else if (sscanf(argv[i], "--max_bytes_for_level_multiplier=%d%c",
        &n, &junk) == 1) {
      FLAGS_max_bytes_for_level_multiplier = n;
H
heyongqiang 已提交
1868 1869 1870
    } else if (sscanf(argv[i],"--level0_stop_writes_trigger=%d%c",
        &n, &junk) == 1) {
      FLAGS_level0_stop_writes_trigger = n;
1871 1872 1873 1874 1875 1876 1877 1878
    } else if (sscanf(argv[i],
                "--max_bytes_for_level_multiplier_additional=%s%c",
                str, &junk) == 1) {
      std::vector<std::string> fanout = leveldb::stringSplit(str, ',');
      for (unsigned int j= 0; j < fanout.size(); j++) {
        FLAGS_max_bytes_for_level_multiplier_additional.push_back(
          std::stoi(fanout[j]));
      }
H
heyongqiang 已提交
1879 1880 1881
    } else if (sscanf(argv[i],"--level0_slowdown_writes_trigger=%d%c",
        &n, &junk) == 1) {
      FLAGS_level0_slowdown_writes_trigger = n;
1882 1883 1884
    } else if (sscanf(argv[i],"--level0_file_num_compaction_trigger=%d%c",
        &n, &junk) == 1) {
      FLAGS_level0_file_num_compaction_trigger = n;
1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897
    } else if (strncmp(argv[i], "--compression_type=", 19) == 0) {
      const char* ctype = argv[i] + 19;
      if (!strcasecmp(ctype, "none"))
        FLAGS_compression_type = leveldb::kNoCompression;
      else if (!strcasecmp(ctype, "snappy"))
        FLAGS_compression_type = leveldb::kSnappyCompression;
      else if (!strcasecmp(ctype, "zlib"))
        FLAGS_compression_type = leveldb::kZlibCompression;
      else if (!strcasecmp(ctype, "bzip2"))
        FLAGS_compression_type = leveldb::kBZip2Compression;
      else {
        fprintf(stdout, "Cannot parse %s\n", argv[i]);
      }
1898 1899
    } else if (sscanf(argv[i], "--min_level_to_compress=%d%c", &n, &junk) == 1
        && n >= 0) {
1900
      FLAGS_min_level_to_compress = n;
1901 1902 1903
    } else if (sscanf(argv[i], "--disable_seek_compaction=%d%c", &n, &junk) == 1
        && (n == 0 || n == 1)) {
      FLAGS_disable_seek_compaction = n;
1904 1905
    } else if (sscanf(argv[i], "--delete_obsolete_files_period_micros=%ld%c",
                      &l, &junk) == 1) {
1906
      FLAGS_delete_obsolete_files_period_micros = l;
1907 1908 1909
    } else if (sscanf(argv[i], "--stats_interval=%d%c", &n, &junk) == 1 &&
               n >= 0 && n < 2000000000) {
      FLAGS_stats_interval = n;
1910 1911 1912 1913 1914 1915
    } else if (sscanf(argv[i], "--stats_per_interval=%d%c", &n, &junk) == 1
        && (n == 0 || n == 1)) {
      FLAGS_stats_per_interval = n;
    } else if (sscanf(argv[i], "--rate_limit=%lf%c", &d, &junk) == 1 &&
               d > 1.0) {
      FLAGS_rate_limit = d;
1916 1917 1918 1919
    } else if (sscanf(argv[i],
               "--rate_limit_delay_milliseconds=%d%c", &n, &junk) == 1
        && n > 0) {
      FLAGS_rate_limit_delay_milliseconds = n;
H
heyongqiang 已提交
1920 1921 1922
    } else if (sscanf(argv[i], "--readonly=%d%c", &n, &junk) == 1 &&
        (n == 0 || n ==1 )) {
      FLAGS_read_only = n;
1923 1924 1925
    } else if (sscanf(argv[i], "--max_grandparent_overlap_factor=%d%c",
               &n, &junk) == 1) {
      FLAGS_max_grandparent_overlap_factor = n;
A
Abhishek Kona 已提交
1926
    } else if (sscanf(argv[i], "--disable_auto_compactions=%d%c",
1927 1928
               &n, &junk) == 1 && (n == 0 || n ==1)) {
      FLAGS_disable_auto_compactions = n;
A
Abhishek Kona 已提交
1929
    } else if (sscanf(argv[i], "--source_compaction_factor=%d%c",
1930 1931
               &n, &junk) == 1 && n > 0) {
      FLAGS_source_compaction_factor = n;
1932 1933
    } else if (sscanf(argv[i], "--wal_ttl=%d%c", &n, &junk) == 1) {
      FLAGS_WAL_ttl_seconds = static_cast<uint64_t>(n);
1934
    } else {
J
jorlow@chromium.org 已提交
1935 1936 1937 1938 1939
      fprintf(stderr, "Invalid flag '%s'\n", argv[i]);
      exit(1);
    }
  }

1940 1941 1942 1943
  // The number of background threads should be at least as much the
  // max number of concurrent compactions.
  FLAGS_env->SetBackgroundThreads(FLAGS_max_background_compactions);

H
heyongqiang 已提交
1944
  // Choose a location for the test database if none given with --db=<path>
1945
  if (FLAGS_db == nullptr) {
H
heyongqiang 已提交
1946 1947 1948 1949 1950
      leveldb::Env::Default()->GetTestDirectory(&default_db_path);
      default_db_path += "/dbbench";
      FLAGS_db = default_db_path.c_str();
  }

J
jorlow@chromium.org 已提交
1951 1952 1953 1954
  leveldb::Benchmark benchmark;
  benchmark.Run();
  return 0;
}