db_bench.cc 54.8 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 22
#include "util/random.h"
#include "util/testutil.h"
23
#include "hdfs/env_hdfs.h"
J
jorlow@chromium.org 已提交
24 25 26

// Comma-separated list of operations to run in the specified order
//   Actual benchmarks:
27 28 29 30 31
//      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 已提交
32 33
//      deleteseq     -- delete N keys in sequential order
//      deleterandom  -- delete N keys in random order
34 35 36
//      readseq       -- read N times sequentially
//      readreverse   -- read N times in reverse order
//      readrandom    -- read N times in random order
S
Sanjay Ghemawat 已提交
37
//      readmissing   -- read N missing keys in random order
38
//      readhot       -- read N times in random order from 1% section of DB
S
Sanjay Ghemawat 已提交
39
//      seekrandom    -- N random seeks
J
jorlow@chromium.org 已提交
40
//      crc32c        -- repeated crc32c of 4K of data
41
//      acquireload   -- load N*1000 times
J
jorlow@chromium.org 已提交
42 43
//   Meta operations:
//      compact     -- Compact the entire DB
44
//      stats       -- Print DB stats
S
Sanjay Ghemawat 已提交
45
//      sstables    -- Print sstable info
J
jorlow@chromium.org 已提交
46 47
//      heapprofile -- Dump a heap profile (if supported by this port)
static const char* FLAGS_benchmarks =
48
    "fillseq,"
J
jorlow@chromium.org 已提交
49
    "fillsync,"
50 51
    "fillrandom,"
    "overwrite,"
J
jorlow@chromium.org 已提交
52 53
    "readrandom,"
    "readrandom,"  // Extra run to allow previous compactions to quiesce
J
jorlow@chromium.org 已提交
54
    "readseq,"
J
jorlow@chromium.org 已提交
55
    "readreverse,"
J
jorlow@chromium.org 已提交
56
    "compact,"
J
jorlow@chromium.org 已提交
57
    "readrandom,"
J
jorlow@chromium.org 已提交
58
    "readseq,"
J
jorlow@chromium.org 已提交
59
    "readreverse,"
60
    "readrandomwriterandom," // mix reads and writes based on FLAGS_readwritepercent
61
    "randomwithverify," // random reads and writes with some verification
J
jorlow@chromium.org 已提交
62 63
    "fill100K,"
    "crc32c,"
64 65
    "snappycomp,"
    "snappyuncomp,"
66
    "acquireload,"
J
jorlow@chromium.org 已提交
67
    ;
J
jorlow@chromium.org 已提交
68 69

// Number of key/values to place in database
70
static long FLAGS_num = 1000000;
J
jorlow@chromium.org 已提交
71

72 73 74 75 76
// 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;

77
// Number of read operations to do.  If negative, do FLAGS_num reads.
78
static long FLAGS_reads = -1;
79

80 81 82 83 84 85
// 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;

86 87 88
// Number of concurrent threads to run.
static int FLAGS_threads = 1;

J
jorlow@chromium.org 已提交
89 90 91 92 93
// Size of each value
static int FLAGS_value_size = 100;

// Arrange to generate values that shrink to this fraction of
// their original size after compression
94
static double FLAGS_compression_ratio = 0.5;
J
jorlow@chromium.org 已提交
95 96 97 98 99

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

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

A
Abhishek Kona 已提交
103
// The number of in-memory memtables.
104 105 106 107 108 109 110 111 112
// 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;

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

117 118 119
// Number of bytes in a block.
static int FLAGS_block_size = 0;

120 121 122
// Maximum number of files to keep open at the same time (use default if == 0)
static int FLAGS_open_files = 0;

S
Sanjay Ghemawat 已提交
123 124 125 126
// Bloom filter bits per key.
// Negative means use default settings.
static int FLAGS_bloom_bits = -1;

127 128 129 130 131
// 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;

132
// Use the db with the following name.
133
static const char* FLAGS_db = nullptr;
134

135 136 137 138 139
// 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;

140 141 142
// Verify checksum for every block read from storage
static bool FLAGS_verify_checksum = false;

143 144
// Database statistics
static bool FLAGS_statistics = false;
145
static class leveldb::DBStatistics* dbstats = nullptr;
146

147 148 149
// Number of write operations to do.  If negative, do FLAGS_num reads.
static long FLAGS_writes = -1;

H
heyongqiang 已提交
150 151
// These default values might change if the hardcoded

152 153 154
// Sync all writes to disk
static bool FLAGS_sync = false;

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

158 159 160
// If true, issue fsync instead of fdatasync
static bool FLAGS_use_fsync = false;

H
heyongqiang 已提交
161 162 163
// If true, do not write WAL for write.
static bool FLAGS_disable_wal = false;

164
// The total number of levels
165
static unsigned int FLAGS_num_levels = 7;
166

H
heyongqiang 已提交
167 168 169 170 171 172
// 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;

173
// Max bytes for level-1
174
static uint64_t FLAGS_max_bytes_for_level_base = 10 * 1048576;
H
heyongqiang 已提交
175 176 177 178

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

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

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

185 186 187
// Number of files in level-0 when compactions start
static int FLAGS_level0_file_num_compaction_trigger = 4;

188 189 190 191 192
// 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;

193 194 195 196
// 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;

197 198 199
// Option to disable compation triggered by read.
static int FLAGS_disable_seek_compaction = false;

200 201 202 203 204
// 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;

205 206 207 208
// Algorithm to use to compress the database
static enum leveldb::CompressionType FLAGS_compression_type =
    leveldb::kSnappyCompression;

209 210
// Allows compression for levels 0 and 1 to be disabled when
// other levels are compressed
211
static int FLAGS_min_level_to_compress = -1;
212

213 214
static int FLAGS_table_cache_numshardbits = 4;

215 216 217
// posix or hdfs environment
static leveldb::Env* FLAGS_env = leveldb::Env::Default();

218 219 220 221
// 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;

222 223 224 225 226 227 228 229 230
// 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;

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

H
heyongqiang 已提交
235 236 237
// Run read only benchmarks.
static bool FLAGS_read_only = false;

238 239 240
// Do not auto trigger compactions
static bool FLAGS_disable_auto_compactions = false;

241 242 243 244
// Cap the size of data in levelK for a compaction run
// that compacts Levelk with LevelK+1
static int FLAGS_source_compaction_factor = 1;

245 246 247
// Set the TTL for the WAL Files.
static uint64_t FLAGS_WAL_ttl_seconds = 0;

248
extern bool useOsBuffer;
249
extern bool useFsReadAhead;
250
extern bool useMmapRead;
251
extern bool useMmapWrite;
252

J
jorlow@chromium.org 已提交
253 254
namespace leveldb {

255
// Helper for quickly generating random data.
J
jorlow@chromium.org 已提交
256 257 258
class RandomGenerator {
 private:
  std::string data_;
259
  unsigned int pos_;
J
jorlow@chromium.org 已提交
260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284

 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;
    while (data_.size() < 1048576) {
      // 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;
  }

  Slice Generate(int len) {
    if (pos_ + len > data_.size()) {
      pos_ = 0;
      assert(len < data_.size());
    }
    pos_ += len;
    return Slice(data_.data() + pos_ - len, len);
  }
285
};
286
static Slice TrimSpace(Slice s) {
287
  unsigned int start = 0;
288 289 290
  while (start < s.size() && isspace(s[start])) {
    start++;
  }
291
  unsigned int limit = s.size();
292 293 294 295 296 297
  while (limit > start && isspace(s[limit-1])) {
    limit--;
  }
  return Slice(s.data() + start, limit - start);
}

298 299 300 301 302 303 304 305 306 307
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:
308
  int id_;
309 310 311
  double start_;
  double finish_;
  double seconds_;
312
  long done_;
313
  long last_report_done_;
314 315 316
  int next_report_;
  int64_t bytes_;
  double last_op_finish_;
317
  double last_report_finish_;
318
  HistogramImpl hist_;
319 320 321
  std::string message_;

 public:
322
  Stats() { Start(-1); }
323

324 325 326
  void Start(int id) {
    id_ = id;
    next_report_ = FLAGS_stats_interval ? FLAGS_stats_interval : 100;
327 328 329
    last_op_finish_ = start_;
    hist_.Clear();
    done_ = 0;
330
    last_report_done_ = 0;
331 332
    bytes_ = 0;
    seconds_ = 0;
333
    start_ = FLAGS_env->NowMicros();
334
    finish_ = start_;
335
    last_report_finish_ = start_;
336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351
    message_.clear();
  }

  void Merge(const Stats& other) {
    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() {
352
    finish_ = FLAGS_env->NowMicros();
353 354 355 356 357 358 359
    seconds_ = (finish_ - start_) * 1e-6;
  }

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

360 361
  void SetId(int id) { id_ = id; }

M
Mark Callaghan 已提交
362
  void FinishedSingleOp(DB* db) {
363
    if (FLAGS_histogram) {
364
      double now = FLAGS_env->NowMicros();
365 366
      double micros = now - last_op_finish_;
      hist_.Add(micros);
367
      if (micros > 20000 && !FLAGS_stats_interval) {
368 369 370 371 372 373 374 375
        fprintf(stderr, "long op: %.1f micros%30s\r", micros, "");
        fflush(stderr);
      }
      last_op_finish_ = now;
    }

    done_++;
    if (done_ >= next_report_) {
376 377 378 379 380 381 382 383 384 385 386 387 388
      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,
389
                "%s ... thread %d: (%ld,%ld) ops and (%.1f,%.1f) ops/second in (%.6f,%.6f) seconds\n",
390
                FLAGS_env->TimeToString((uint64_t) now/1000000).c_str(),
391
                id_,
M
Mark Callaghan 已提交
392
                done_ - last_report_done_, done_,
393
                (done_ - last_report_done_) /
M
Mark Callaghan 已提交
394 395 396 397
                ((now - last_report_finish_) / 1000000.0),
                done_ / ((now - start_) / 1000000.0),
                (now - last_report_finish_) / 1000000.0,
                (now - start_) / 1000000.0);
M
Mark Callaghan 已提交
398

399 400 401
        if (FLAGS_stats_per_interval) {
          std::string stats;
          if (db && db->GetProperty("leveldb.stats", &stats))
402
            fprintf(stderr, "%s\n", stats.c_str());
403
        }
M
Mark Callaghan 已提交
404

405 406 407 408 409
        fflush(stderr);
        next_report_ += FLAGS_stats_interval;
        last_report_finish_ = now;
        last_report_done_ = done_;
      }
410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432
    }
  }

  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_);
433 434
    double elapsed = (finish_ - start_) * 1e-6;
    double throughput = (double)done_/elapsed;
435

D
Dhruba Borthakur 已提交
436
    fprintf(stdout, "%-12s : %11.3f micros/op %ld ops/sec;%s%s\n",
437 438
            name.ToString().c_str(),
            seconds_ * 1e6 / done_,
D
Dhruba Borthakur 已提交
439
            (long)throughput,
440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460
            (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

461 462
  long num_initialized;
  long num_done;
463 464 465 466 467 468 469 470 471 472
  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;
473
  SharedState* shared;
474

A
Abhishek Kona 已提交
475
  /* implicit */ ThreadState(int index)
476
      : tid(index),
477
        rand((FLAGS_seed ? FLAGS_seed : 1000) + index) {
478 479 480
  }
};

J
jorlow@chromium.org 已提交
481 482
class Benchmark {
 private:
483
  shared_ptr<Cache> cache_;
S
Sanjay Ghemawat 已提交
484
  const FilterPolicy* filter_policy_;
J
jorlow@chromium.org 已提交
485
  DB* db_;
486
  long num_;
487 488 489
  int value_size_;
  int entries_per_batch_;
  WriteOptions write_options_;
490
  long reads_;
491
  long writes_;
492
  long readwrites_;
J
jorlow@chromium.org 已提交
493 494
  int heap_counter_;

495 496 497 498 499 500 501
  void PrintHeader() {
    const int kKeySize = 16;
    PrintEnvironment();
    fprintf(stdout, "Keys:       %d bytes each\n", kKeySize);
    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));
502
    fprintf(stdout, "Entries:    %ld\n", num_);
503
    fprintf(stdout, "RawSize:    %.1f MB (estimated)\n",
504 505
            ((static_cast<int64_t>(kKeySize + FLAGS_value_size) * num_)
             / 1048576.0));
506 507 508
    fprintf(stdout, "FileSize:   %.1f MB (estimated)\n",
            (((kKeySize + FLAGS_value_size * FLAGS_compression_ratio) * num_)
             / 1048576.0));
509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524

    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;
    }

525 526 527 528 529 530 531 532 533 534 535 536 537 538
    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
539

540 541 542 543 544
    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;
545
      const char* name = nullptr;
546 547 548 549 550 551 552
      std::string compressed;

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

      switch (FLAGS_compression_type) {
        case kSnappyCompression:
553 554
          result = port::Snappy_Compress(Options().compression_opts, text,
                                         strlen(text), &compressed);
555 556 557
          name = "Snappy";
          break;
        case kZlibCompression:
558 559
          result = port::Zlib_Compress(Options().compression_opts, text,
                                       strlen(text), &compressed);
560 561 562
          name = "Zlib";
          break;
        case kBZip2Compression:
563 564
          result = port::BZip2_Compress(Options().compression_opts, text,
                                        strlen(text), &compressed);
565 566
          name = "BZip2";
          break;
567 568 569
        case kNoCompression:
          assert(false); // cannot happen
          break;
570 571 572 573 574 575 576 577 578
      }

      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);
579
    }
580 581 582 583 584 585 586
  }

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

#if defined(__linux)
587
    time_t now = time(nullptr);
588 589 590
    fprintf(stderr, "Date:       %s", ctime(&now));  // ctime() adds newline

    FILE* cpuinfo = fopen("/proc/cpuinfo", "r");
591
    if (cpuinfo != nullptr) {
592 593 594 595
      char line[1000];
      int num_cpus = 0;
      std::string cpu_type;
      std::string cache_size;
596
      while (fgets(line, sizeof(line), cpuinfo) != nullptr) {
597
        const char* sep = strchr(line, ':');
598
        if (sep == nullptr) {
599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616
          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
  }

617 618 619 620 621 622 623 624
  void PrintHistogram(Histograms histogram_type, std::string name) {
    HistogramData histogramData;
    dbstats->histogramData(histogram_type, &histogramData);
    fprintf(stdout, "%s statistics : \n", name.c_str());
    fprintf(stdout, "Median : %f\n",histogramData.median);
    fprintf(stdout, "99ile : %f\n", histogramData.percentile99);
  }

625 626
  void PrintStatistics() {
    if (FLAGS_statistics) {
A
Abhishek Kona 已提交
627
      fprintf(stdout, "File opened:%ld closed:%ld errors:%ld\n"
628 629 630
          "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 "
631
          "Compaction key_drop_user: %ld\n",
632 633 634
          dbstats->getNumFileOpens(),
          dbstats->getNumFileCloses(),
          dbstats->getNumFileErrors(),
A
Abhishek Kona 已提交
635
          dbstats->getTickerCount(BLOCK_CACHE_HIT),
636 637 638 639 640
          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));
641 642
      PrintHistogram(DB_GET, "DB_GET");
      PrintHistogram(DB_WRITE, "DB_WRITE");
643 644 645
    }
  }

J
jorlow@chromium.org 已提交
646
 public:
647
  Benchmark()
648 649 650
  : cache_(FLAGS_cache_size >= 0 ?
           (FLAGS_cache_numshardbits >= 1 ?
            NewLRUCache(FLAGS_cache_size, FLAGS_cache_numshardbits) :
651
            NewLRUCache(FLAGS_cache_size)) : nullptr),
S
Sanjay Ghemawat 已提交
652 653
    filter_policy_(FLAGS_bloom_bits >= 0
                   ? NewBloomFilterPolicy(FLAGS_bloom_bits)
654 655
                   : nullptr),
    db_(nullptr),
656
    num_(FLAGS_num),
657 658
    value_size_(FLAGS_value_size),
    entries_per_batch_(1),
659
    reads_(FLAGS_reads < 0 ? FLAGS_num : FLAGS_reads),
660
    writes_(FLAGS_writes < 0 ? FLAGS_num : FLAGS_writes),
661
    readwrites_((FLAGS_writes < 0  && FLAGS_reads < 0)? FLAGS_num :
662
                ((FLAGS_writes > FLAGS_reads) ? FLAGS_writes : FLAGS_reads)
663
               ),
664
    heap_counter_(0) {
J
jorlow@chromium.org 已提交
665
    std::vector<std::string> files;
666
    FLAGS_env->GetChildren(FLAGS_db, &files);
667
    for (unsigned int i = 0; i < files.size(); i++) {
J
jorlow@chromium.org 已提交
668
      if (Slice(files[i]).starts_with("heap-")) {
669
        FLAGS_env->DeleteFile(std::string(FLAGS_db) + "/" + files[i]);
J
jorlow@chromium.org 已提交
670 671
      }
    }
672
    if (!FLAGS_use_existing_db) {
673
      DestroyDB(FLAGS_db, Options());
674
    }
J
jorlow@chromium.org 已提交
675 676 677 678
  }

  ~Benchmark() {
    delete db_;
S
Sanjay Ghemawat 已提交
679
    delete filter_policy_;
J
jorlow@chromium.org 已提交
680 681 682
  }

  void Run() {
683 684
    PrintHeader();
    Open();
J
jorlow@chromium.org 已提交
685 686

    const char* benchmarks = FLAGS_benchmarks;
687
    while (benchmarks != nullptr) {
J
jorlow@chromium.org 已提交
688 689
      const char* sep = strchr(benchmarks, ',');
      Slice name;
690
      if (sep == nullptr) {
J
jorlow@chromium.org 已提交
691
        name = benchmarks;
692
        benchmarks = nullptr;
J
jorlow@chromium.org 已提交
693 694 695 696 697
      } else {
        name = Slice(benchmarks, sep - benchmarks);
        benchmarks = sep + 1;
      }

698 699
      // Reset parameters that may be overriddden bwlow
      num_ = FLAGS_num;
700
      reads_ = (FLAGS_reads < 0 ? FLAGS_num : FLAGS_reads);
701
      writes_ = (FLAGS_writes < 0 ? FLAGS_num : FLAGS_writes);
702 703 704
      value_size_ = FLAGS_value_size;
      entries_per_batch_ = 1;
      write_options_ = WriteOptions();
705 706 707
      if (FLAGS_sync) {
        write_options_.sync = true;
      }
708

H
heyongqiang 已提交
709 710
      write_options_.disableWAL = FLAGS_disable_wal;

711
      void (Benchmark::*method)(ThreadState*) = nullptr;
712
      bool fresh_db = false;
713
      int num_threads = FLAGS_threads;
714 715

      if (name == Slice("fillseq")) {
716 717
        fresh_db = true;
        method = &Benchmark::WriteSeq;
718
      } else if (name == Slice("fillbatch")) {
719 720 721
        fresh_db = true;
        entries_per_batch_ = 1000;
        method = &Benchmark::WriteSeq;
722
      } else if (name == Slice("fillrandom")) {
723 724
        fresh_db = true;
        method = &Benchmark::WriteRandom;
725
      } else if (name == Slice("overwrite")) {
726 727
        fresh_db = false;
        method = &Benchmark::WriteRandom;
728
      } else if (name == Slice("fillsync")) {
729 730 731 732
        fresh_db = true;
        num_ /= 1000;
        write_options_.sync = true;
        method = &Benchmark::WriteRandom;
733
      } else if (name == Slice("fill100K")) {
734 735 736 737
        fresh_db = true;
        num_ /= 1000;
        value_size_ = 100 * 1000;
        method = &Benchmark::WriteRandom;
J
jorlow@chromium.org 已提交
738
      } else if (name == Slice("readseq")) {
739
        method = &Benchmark::ReadSequential;
J
jorlow@chromium.org 已提交
740
      } else if (name == Slice("readreverse")) {
741
        method = &Benchmark::ReadReverse;
J
jorlow@chromium.org 已提交
742
      } else if (name == Slice("readrandom")) {
743
        method = &Benchmark::ReadRandom;
S
Sanjay Ghemawat 已提交
744 745 746 747
      } else if (name == Slice("readmissing")) {
        method = &Benchmark::ReadMissing;
      } else if (name == Slice("seekrandom")) {
        method = &Benchmark::SeekRandom;
748
      } else if (name == Slice("readhot")) {
749
        method = &Benchmark::ReadHot;
750
      } else if (name == Slice("readrandomsmall")) {
751
        reads_ /= 1000;
752
        method = &Benchmark::ReadRandom;
S
Sanjay Ghemawat 已提交
753 754 755 756
      } else if (name == Slice("deleteseq")) {
        method = &Benchmark::DeleteSeq;
      } else if (name == Slice("deleterandom")) {
        method = &Benchmark::DeleteRandom;
757 758 759
      } else if (name == Slice("readwhilewriting")) {
        num_threads++;  // Add extra thread for writing
        method = &Benchmark::ReadWhileWriting;
760 761
      } else if (name == Slice("readrandomwriterandom")) {
        method = &Benchmark::ReadRandomWriteRandom;
762 763
      } else if (name == Slice("randomwithverify")) {
        method = &Benchmark::RandomWithVerify;
J
jorlow@chromium.org 已提交
764
      } else if (name == Slice("compact")) {
765
        method = &Benchmark::Compact;
J
jorlow@chromium.org 已提交
766
      } else if (name == Slice("crc32c")) {
767
        method = &Benchmark::Crc32c;
768
      } else if (name == Slice("acquireload")) {
769
        method = &Benchmark::AcquireLoad;
770
      } else if (name == Slice("snappycomp")) {
771
        method = &Benchmark::SnappyCompress;
772
      } else if (name == Slice("snappyuncomp")) {
773
        method = &Benchmark::SnappyUncompress;
J
jorlow@chromium.org 已提交
774 775
      } else if (name == Slice("heapprofile")) {
        HeapProfile();
776
      } else if (name == Slice("stats")) {
S
Sanjay Ghemawat 已提交
777 778 779
        PrintStats("leveldb.stats");
      } else if (name == Slice("sstables")) {
        PrintStats("leveldb.sstables");
J
jorlow@chromium.org 已提交
780
      } else {
781 782 783 784
        if (name != Slice()) {  // No error message for empty name
          fprintf(stderr, "unknown benchmark '%s'\n", name.ToString().c_str());
        }
      }
785 786 787 788 789

      if (fresh_db) {
        if (FLAGS_use_existing_db) {
          fprintf(stdout, "%-12s : skipped (--use_existing_db is true)\n",
                  name.ToString().c_str());
790
          method = nullptr;
791 792
        } else {
          delete db_;
793
          db_ = nullptr;
794 795 796 797 798
          DestroyDB(FLAGS_db, Options());
          Open();
        }
      }

799
      if (method != nullptr) {
800
        RunBenchmark(num_threads, name, method);
J
jorlow@chromium.org 已提交
801 802
      }
    }
803
    PrintStatistics();
J
jorlow@chromium.org 已提交
804 805
  }

806
 private:
807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828
  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();
      }
    }

829
    thread->stats.Start(thread->tid);
830 831 832 833 834 835 836 837 838 839 840 841
    (arg->bm->*(arg->method))(thread);
    thread->stats.Stop();

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

842 843
  void RunBenchmark(int n, Slice name,
                    void (Benchmark::*method)(ThreadState*)) {
844 845 846 847 848 849 850 851 852 853 854 855
    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);
856
      arg[i].thread->shared = &shared;
857
      FLAGS_env->StartThread(ThreadBody, &arg[i]);
858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883
    }

    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();

    for (int i = 1; i < n; i++) {
      arg[0].thread->stats.Merge(arg[i].thread->stats);
    }
    arg[0].thread->stats.Report(name);

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

  void Crc32c(ThreadState* thread) {
J
jorlow@chromium.org 已提交
884
    // Checksum about 500MB of data total
885 886
    const int size = 4096;
    const char* label = "(4K per op)";
J
jorlow@chromium.org 已提交
887
    std::string data(size, 'x');
J
jorlow@chromium.org 已提交
888 889 890 891
    int64_t bytes = 0;
    uint32_t crc = 0;
    while (bytes < 500 * 1048576) {
      crc = crc32c::Value(data.data(), size);
892
      thread->stats.FinishedSingleOp(nullptr);
J
jorlow@chromium.org 已提交
893 894 895 896 897
      bytes += size;
    }
    // Print so result is not dead
    fprintf(stderr, "... crc=0x%x\r", static_cast<unsigned int>(crc));

898 899
    thread->stats.AddBytes(bytes);
    thread->stats.AddMessage(label);
J
jorlow@chromium.org 已提交
900 901
  }

902
  void AcquireLoad(ThreadState* thread) {
903 904 905
    int dummy;
    port::AtomicPointer ap(&dummy);
    int count = 0;
906
    void *ptr = nullptr;
907
    thread->stats.AddMessage("(each op is 1000 loads)");
908 909 910 911 912
    while (count < 100000) {
      for (int i = 0; i < 1000; i++) {
        ptr = ap.Acquire_Load();
      }
      count++;
913
      thread->stats.FinishedSingleOp(nullptr);
914
    }
915
    if (ptr == nullptr) exit(1); // Disable unused variable warning.
916 917
  }

918 919 920
  void SnappyCompress(ThreadState* thread) {
    RandomGenerator gen;
    Slice input = gen.Generate(Options().block_size);
921 922 923 924 925
    int64_t bytes = 0;
    int64_t produced = 0;
    bool ok = true;
    std::string compressed;
    while (ok && bytes < 1024 * 1048576) {  // Compress 1G
926 927
      ok = port::Snappy_Compress(Options().compression_opts, input.data(),
                                 input.size(), &compressed);
928 929
      produced += compressed.size();
      bytes += input.size();
930
      thread->stats.FinishedSingleOp(nullptr);
931 932 933
    }

    if (!ok) {
934
      thread->stats.AddMessage("(snappy failure)");
935 936 937 938
    } else {
      char buf[100];
      snprintf(buf, sizeof(buf), "(output: %.1f%%)",
               (produced * 100.0) / bytes);
939 940
      thread->stats.AddMessage(buf);
      thread->stats.AddBytes(bytes);
941 942 943
    }
  }

944 945 946
  void SnappyUncompress(ThreadState* thread) {
    RandomGenerator gen;
    Slice input = gen.Generate(Options().block_size);
947
    std::string compressed;
948 949
    bool ok = port::Snappy_Compress(Options().compression_opts, input.data(),
                                    input.size(), &compressed);
950
    int64_t bytes = 0;
951
    char* uncompressed = new char[input.size()];
952 953
    while (ok && bytes < 1024 * 1048576) {  // Compress 1G
      ok =  port::Snappy_Uncompress(compressed.data(), compressed.size(),
954 955
                                    uncompressed);
      bytes += input.size();
956
      thread->stats.FinishedSingleOp(nullptr);
957
    }
958
    delete[] uncompressed;
959 960

    if (!ok) {
961
      thread->stats.AddMessage("(snappy failure)");
962
    } else {
963
      thread->stats.AddBytes(bytes);
964 965 966
    }
  }

967
  void Open() {
968
    assert(db_ == nullptr);
969
    Options options;
970
    options.create_if_missing = !FLAGS_use_existing_db;
971
    options.block_cache = cache_;
972
    if (cache_ == nullptr) {
973 974
      options.no_block_cache = true;
    }
975
    options.write_buffer_size = FLAGS_write_buffer_size;
976 977
    options.max_write_buffer_number = FLAGS_max_write_buffer_number;
    options.max_background_compactions = FLAGS_max_background_compactions;
978
    options.block_size = FLAGS_block_size;
S
Sanjay Ghemawat 已提交
979
    options.filter_policy = filter_policy_;
980 981
    options.max_open_files = FLAGS_open_files;
    options.statistics = dbstats;
982
    options.env = FLAGS_env;
H
heyongqiang 已提交
983
    options.disableDataSync = FLAGS_disable_data_sync;
984
    options.use_fsync = FLAGS_use_fsync;
985
    options.num_levels = FLAGS_num_levels;
H
heyongqiang 已提交
986 987 988 989 990
    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;
H
heyongqiang 已提交
991
    options.level0_stop_writes_trigger = FLAGS_level0_stop_writes_trigger;
M
Mark Callaghan 已提交
992
    options.level0_file_num_compaction_trigger =
993
        FLAGS_level0_file_num_compaction_trigger;
H
heyongqiang 已提交
994 995
    options.level0_slowdown_writes_trigger =
      FLAGS_level0_slowdown_writes_trigger;
996
    options.compression = FLAGS_compression_type;
997
    options.WAL_ttl_seconds = FLAGS_WAL_ttl_seconds;
998 999
    if (FLAGS_min_level_to_compress >= 0) {
      assert(FLAGS_min_level_to_compress <= FLAGS_num_levels);
1000
      options.compression_per_level.resize(FLAGS_num_levels);
1001
      for (int i = 0; i < FLAGS_min_level_to_compress; i++) {
1002 1003
        options.compression_per_level[i] = kNoCompression;
      }
1004
      for (unsigned int i = FLAGS_min_level_to_compress;
1005 1006 1007 1008
           i < FLAGS_num_levels; i++) {
        options.compression_per_level[i] = FLAGS_compression_type;
      }
    }
1009
    options.disable_seek_compaction = FLAGS_disable_seek_compaction;
1010 1011
    options.delete_obsolete_files_period_micros =
      FLAGS_delete_obsolete_files_period_micros;
1012
    options.rate_limit = FLAGS_rate_limit;
1013
    options.table_cache_numshardbits = FLAGS_table_cache_numshardbits;
A
Abhishek Kona 已提交
1014
    options.max_grandparent_overlap_factor =
1015
      FLAGS_max_grandparent_overlap_factor;
1016
    options.disable_auto_compactions = FLAGS_disable_auto_compactions;
1017
    options.source_compaction_factor = FLAGS_source_compaction_factor;
H
heyongqiang 已提交
1018 1019 1020 1021 1022 1023
    Status s;
    if(FLAGS_read_only) {
      s = DB::OpenForReadOnly(options, FLAGS_db, &db_);
    } else {
      s = DB::Open(options, FLAGS_db, &db_);
    }
1024 1025 1026 1027
    if (!s.ok()) {
      fprintf(stderr, "open error: %s\n", s.ToString().c_str());
      exit(1);
    }
1028
    if (FLAGS_min_level_to_compress >= 0) {
1029
      options.compression_per_level.clear();
1030
    }
1031 1032
  }

1033 1034 1035
  void WriteSeq(ThreadState* thread) {
    DoWrite(thread, true);
  }
1036

1037 1038 1039 1040 1041 1042
  void WriteRandom(ThreadState* thread) {
    DoWrite(thread, false);
  }

  void DoWrite(ThreadState* thread, bool seq) {
    if (num_ != FLAGS_num) {
1043
      char msg[100];
1044
      snprintf(msg, sizeof(msg), "(%ld ops)", num_);
1045
      thread->stats.AddMessage(msg);
1046 1047
    }

1048
    RandomGenerator gen;
J
jorlow@chromium.org 已提交
1049 1050
    WriteBatch batch;
    Status s;
1051
    int64_t bytes = 0;
1052
    for (int i = 0; i < writes_; i += entries_per_batch_) {
J
jorlow@chromium.org 已提交
1053
      batch.Clear();
1054 1055
      for (int j = 0; j < entries_per_batch_; j++) {
        const int k = seq ? i+j : (thread->rand.Next() % FLAGS_num);
1056 1057
        char key[100];
        snprintf(key, sizeof(key), "%016d", k);
1058 1059
        batch.Put(key, gen.Generate(value_size_));
        bytes += value_size_ + strlen(key);
M
Mark Callaghan 已提交
1060
        thread->stats.FinishedSingleOp(db_);
1061
      }
1062
      s = db_->Write(write_options_, &batch);
J
jorlow@chromium.org 已提交
1063 1064 1065 1066 1067
      if (!s.ok()) {
        fprintf(stderr, "put error: %s\n", s.ToString().c_str());
        exit(1);
      }
    }
1068
    thread->stats.AddBytes(bytes);
J
jorlow@chromium.org 已提交
1069 1070
  }

1071
  void ReadSequential(ThreadState* thread) {
1072
    Iterator* iter = db_->NewIterator(ReadOptions(FLAGS_verify_checksum, true));
1073
    long i = 0;
1074
    int64_t bytes = 0;
1075
    for (iter->SeekToFirst(); i < reads_ && iter->Valid(); iter->Next()) {
1076
      bytes += iter->key().size() + iter->value().size();
M
Mark Callaghan 已提交
1077
      thread->stats.FinishedSingleOp(db_);
1078 1079 1080
      ++i;
    }
    delete iter;
1081
    thread->stats.AddBytes(bytes);
1082 1083
  }

1084
  void ReadReverse(ThreadState* thread) {
1085
    Iterator* iter = db_->NewIterator(ReadOptions(FLAGS_verify_checksum, true));
1086
    long i = 0;
1087
    int64_t bytes = 0;
1088
    for (iter->SeekToLast(); i < reads_ && iter->Valid(); iter->Prev()) {
1089
      bytes += iter->key().size() + iter->value().size();
M
Mark Callaghan 已提交
1090
      thread->stats.FinishedSingleOp(db_);
1091 1092 1093
      ++i;
    }
    delete iter;
1094
    thread->stats.AddBytes(bytes);
1095 1096
  }

1097
  void ReadRandom(ThreadState* thread) {
1098
    ReadOptions options(FLAGS_verify_checksum, true);
1099 1100
    Iterator* iter = db_->NewIterator(options);

1101
    std::string value;
1102
    long found = 0;
1103
    for (long i = 0; i < reads_; i++) {
1104
      char key[100];
1105
      const int k = thread->rand.Next() % FLAGS_num;
1106
      snprintf(key, sizeof(key), "%016d", k);
1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119

      if (FLAGS_read_range < 2) {
        if (db_->Get(options, key, &value).ok()) {
          found++;
        }
      } else {
        Slice skey(key);
        int count = 1;
        for (iter->Seek(skey);
             iter->Valid() && count <= FLAGS_read_range;
             ++count, iter->Next()) {
          found++;
        }
S
Sanjay Ghemawat 已提交
1120
      }
1121

M
Mark Callaghan 已提交
1122
      thread->stats.FinishedSingleOp(db_);
S
Sanjay Ghemawat 已提交
1123
    }
1124
    delete iter;
S
Sanjay Ghemawat 已提交
1125
    char msg[100];
1126
    snprintf(msg, sizeof(msg), "(%ld of %ld found)", found, num_);
S
Sanjay Ghemawat 已提交
1127 1128 1129 1130
    thread->stats.AddMessage(msg);
  }

  void ReadMissing(ThreadState* thread) {
1131
    ReadOptions options(FLAGS_verify_checksum, true);
S
Sanjay Ghemawat 已提交
1132
    std::string value;
1133
    for (long i = 0; i < reads_; i++) {
S
Sanjay Ghemawat 已提交
1134 1135 1136
      char key[100];
      const int k = thread->rand.Next() % FLAGS_num;
      snprintf(key, sizeof(key), "%016d.", k);
1137
      db_->Get(options, key, &value);
M
Mark Callaghan 已提交
1138
      thread->stats.FinishedSingleOp(db_);
J
jorlow@chromium.org 已提交
1139 1140 1141
    }
  }

1142
  void ReadHot(ThreadState* thread) {
1143
    ReadOptions options(FLAGS_verify_checksum, true);
1144
    std::string value;
1145 1146
    const long range = (FLAGS_num + 99) / 100;
    for (long i = 0; i < reads_; i++) {
1147
      char key[100];
1148
      const int k = thread->rand.Next() % range;
1149 1150
      snprintf(key, sizeof(key), "%016d", k);
      db_->Get(options, key, &value);
M
Mark Callaghan 已提交
1151
      thread->stats.FinishedSingleOp(db_);
1152 1153 1154
    }
  }

S
Sanjay Ghemawat 已提交
1155
  void SeekRandom(ThreadState* thread) {
1156
    ReadOptions options(FLAGS_verify_checksum, true);
S
Sanjay Ghemawat 已提交
1157
    std::string value;
1158
    long found = 0;
1159
    for (long i = 0; i < reads_; i++) {
S
Sanjay Ghemawat 已提交
1160 1161 1162 1163 1164 1165 1166
      Iterator* iter = db_->NewIterator(options);
      char key[100];
      const int k = thread->rand.Next() % FLAGS_num;
      snprintf(key, sizeof(key), "%016d", k);
      iter->Seek(key);
      if (iter->Valid() && iter->key() == key) found++;
      delete iter;
M
Mark Callaghan 已提交
1167
      thread->stats.FinishedSingleOp(db_);
S
Sanjay Ghemawat 已提交
1168 1169
    }
    char msg[100];
1170
    snprintf(msg, sizeof(msg), "(%ld of %ld found)", found, num_);
S
Sanjay Ghemawat 已提交
1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184
    thread->stats.AddMessage(msg);
  }

  void DoDelete(ThreadState* thread, bool seq) {
    RandomGenerator gen;
    WriteBatch batch;
    Status s;
    for (int i = 0; i < num_; i += entries_per_batch_) {
      batch.Clear();
      for (int j = 0; j < entries_per_batch_; j++) {
        const int k = seq ? i+j : (thread->rand.Next() % FLAGS_num);
        char key[100];
        snprintf(key, sizeof(key), "%016d", k);
        batch.Delete(key);
M
Mark Callaghan 已提交
1185
        thread->stats.FinishedSingleOp(db_);
S
Sanjay Ghemawat 已提交
1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202
      }
      s = db_->Write(write_options_, &batch);
      if (!s.ok()) {
        fprintf(stderr, "del error: %s\n", s.ToString().c_str());
        exit(1);
      }
    }
  }

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

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

1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228
  void ReadWhileWriting(ThreadState* thread) {
    if (thread->tid > 0) {
      ReadRandom(thread);
    } else {
      // Special thread that keeps writing until other threads are done.
      RandomGenerator gen;
      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;
        char key[100];
        snprintf(key, sizeof(key), "%016d", k);
        Status s = db_->Put(write_options_, key, gen.Generate(value_size_));
        if (!s.ok()) {
          fprintf(stderr, "put error: %s\n", s.ToString().c_str());
          exit(1);
        }
      }

      // Do not count any of the preceding work/delay in stats.
1229
      thread->stats.Start(thread->tid);
1230 1231 1232
    }
  }

1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377
  // 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++) {
      char key[100];
      const int k = thread->rand.Next() % (FLAGS_numdistinct);
      snprintf(key, sizeof(key), "%016d", k);
      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
        Status s = MultiGet(options, key, &value);
        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
        Status s = MultiPut(write_options_, key, gen.Generate(value_size_));
        if (!s.ok()) {
          fprintf(stderr, "multiput error: %s\n", s.ToString().c_str());
          exit(1);
        }
        put_weight--;
        puts_done++;
      } else if (delete_weight > 0) {
        Status s = MultiDelete(write_options_, key);
        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);
  }

1378 1379
  //
  // This is diffferent from ReadWhileWriting because it does not use
1380
  // an extra thread.
1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391
  //
  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;
    // the number of iterations is the larger of read_ or write_
1392
    for (long i = 0; i < readwrites_; i++) {
1393 1394 1395 1396 1397 1398 1399 1400 1401 1402
      char key[100];
      const int k = thread->rand.Next() % FLAGS_num;
      snprintf(key, sizeof(key), "%016d", k);
      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) {
        // do all the gets first
1403 1404 1405 1406 1407 1408 1409 1410 1411
        Status s = db_->Get(options, key, &value);
        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++;
        }

1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427
        if (db_->Get(options, key, &value).ok()) {
          found++;
        }
        get_weight--;
        reads_done++;
      } else  if (put_weight > 0) {
        // then do all the corresponding number of puts
        // for all the gets we have done earlier
        Status s = db_->Put(write_options_, key, gen.Generate(value_size_));
        if (!s.ok()) {
          fprintf(stderr, "put error: %s\n", s.ToString().c_str());
          exit(1);
        }
        put_weight--;
        writes_done++;
      }
M
Mark Callaghan 已提交
1428
      thread->stats.FinishedSingleOp(db_);
1429 1430
    }
    char msg[100];
1431 1432
    snprintf(msg, sizeof(msg), "( reads:%ld writes:%ld total:%ld found:%ld)",
             reads_done, writes_done, readwrites_, found);
1433 1434 1435
    thread->stats.AddMessage(msg);
  }

1436
  void Compact(ThreadState* thread) {
1437
    db_->CompactRange(nullptr, nullptr);
J
jorlow@chromium.org 已提交
1438 1439
  }

S
Sanjay Ghemawat 已提交
1440
  void PrintStats(const char* key) {
1441
    std::string stats;
S
Sanjay Ghemawat 已提交
1442
    if (!db_->GetProperty(key, &stats)) {
1443
      stats = "(failed)";
1444
    }
1445
    fprintf(stdout, "\n%s\n", stats.c_str());
1446 1447
  }

J
jorlow@chromium.org 已提交
1448 1449 1450 1451 1452 1453
  static void WriteToFile(void* arg, const char* buf, int n) {
    reinterpret_cast<WritableFile*>(arg)->Append(Slice(buf, n));
  }

  void HeapProfile() {
    char fname[100];
1454
    snprintf(fname, sizeof(fname), "%s/heap-%04d", FLAGS_db, ++heap_counter_);
1455
    unique_ptr<WritableFile> file;
1456
    Status s = FLAGS_env->NewWritableFile(fname, &file);
J
jorlow@chromium.org 已提交
1457
    if (!s.ok()) {
1458
      fprintf(stderr, "%s\n", s.ToString().c_str());
J
jorlow@chromium.org 已提交
1459 1460
      return;
    }
1461
    bool ok = port::GetHeapProfile(WriteToFile, file.get());
J
jorlow@chromium.org 已提交
1462
    if (!ok) {
1463
      fprintf(stderr, "heap profiling not supported\n");
1464
      FLAGS_env->DeleteFile(fname);
J
jorlow@chromium.org 已提交
1465 1466 1467 1468
    }
  }
};

H
Hans Wennborg 已提交
1469
}  // namespace leveldb
J
jorlow@chromium.org 已提交
1470 1471

int main(int argc, char** argv) {
1472
  FLAGS_write_buffer_size = leveldb::Options().write_buffer_size;
1473
  FLAGS_max_write_buffer_number = leveldb::Options().max_write_buffer_number;
1474
  FLAGS_open_files = leveldb::Options().max_open_files;
A
Abhishek Kona 已提交
1475
  FLAGS_max_background_compactions =
1476
    leveldb::Options().max_background_compactions;
1477 1478
  // Compression test code above refers to FLAGS_block_size
  FLAGS_block_size = leveldb::Options().block_size;
H
heyongqiang 已提交
1479
  std::string default_db_path;
1480

J
jorlow@chromium.org 已提交
1481 1482 1483
  for (int i = 1; i < argc; i++) {
    double d;
    int n;
1484
    long l;
J
jorlow@chromium.org 已提交
1485
    char junk;
1486
    char hdfsname[2048];
J
jorlow@chromium.org 已提交
1487 1488 1489 1490 1491 1492 1493
    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;
1494 1495 1496
    } else if (sscanf(argv[i], "--use_existing_db=%d%c", &n, &junk) == 1 &&
               (n == 0 || n == 1)) {
      FLAGS_use_existing_db = n;
1497 1498
    } else if (sscanf(argv[i], "--num=%ld%c", &l, &junk) == 1) {
      FLAGS_num = l;
1499 1500
    } else if (sscanf(argv[i], "--numdistinct=%ld%c", &l, &junk) == 1) {
      FLAGS_numdistinct = l;
1501 1502
    } else if (sscanf(argv[i], "--reads=%d%c", &n, &junk) == 1) {
      FLAGS_reads = n;
1503 1504 1505 1506
    } else if (sscanf(argv[i], "--read_range=%d%c", &n, &junk) == 1) {
      FLAGS_read_range = n;
    } else if (sscanf(argv[i], "--seed=%ld%c", &l, &junk) == 1) {
      FLAGS_seed = l;
1507 1508
    } else if (sscanf(argv[i], "--threads=%d%c", &n, &junk) == 1) {
      FLAGS_threads = n;
J
jorlow@chromium.org 已提交
1509 1510 1511 1512
    } else if (sscanf(argv[i], "--value_size=%d%c", &n, &junk) == 1) {
      FLAGS_value_size = n;
    } else if (sscanf(argv[i], "--write_buffer_size=%d%c", &n, &junk) == 1) {
      FLAGS_write_buffer_size = n;
1513 1514 1515 1516
    } 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;
1517 1518
    } else if (sscanf(argv[i], "--cache_size=%ld%c", &l, &junk) == 1) {
      FLAGS_cache_size = l;
1519 1520
    } else if (sscanf(argv[i], "--block_size=%d%c", &n, &junk) == 1) {
      FLAGS_block_size = n;
1521
    } else if (sscanf(argv[i], "--cache_numshardbits=%d%c", &n, &junk) == 1) {
1522 1523 1524 1525 1526 1527
      if (n < 20) {
        FLAGS_cache_numshardbits = n;
      } else {
        fprintf(stderr, "The cache cannot be sharded into 2**%d pieces\n", n);
        exit(1);
      }
1528
    } else if (sscanf(argv[i], "--table_cache_numshardbits=%d%c",
A
Abhishek Kona 已提交
1529
          &n, &junk) == 1) {
1530 1531 1532 1533 1534
      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 已提交
1535 1536
    } else if (sscanf(argv[i], "--bloom_bits=%d%c", &n, &junk) == 1) {
      FLAGS_bloom_bits = n;
1537 1538
    } else if (sscanf(argv[i], "--open_files=%d%c", &n, &junk) == 1) {
      FLAGS_open_files = n;
1539 1540
    } else if (strncmp(argv[i], "--db=", 5) == 0) {
      FLAGS_db = argv[i] + 5;
1541 1542 1543
    } else if (sscanf(argv[i], "--verify_checksum=%d%c", &n, &junk) == 1 &&
               (n == 0 || n == 1)) {
      FLAGS_verify_checksum = n;
1544 1545 1546
    } else if (sscanf(argv[i], "--bufferedio=%d%c", &n, &junk) == 1 &&
               (n == 0 || n == 1)) {
      useOsBuffer = n;
1547 1548 1549
    } else if (sscanf(argv[i], "--mmap_read=%d%c", &n, &junk) == 1 &&
               (n == 0 || n == 1)) {
      useMmapRead = n;
1550 1551 1552
    } else if (sscanf(argv[i], "--mmap_write=%d%c", &n, &junk) == 1 &&
               (n == 0 || n == 1)) {
      useMmapWrite = n;
1553
    } else if (sscanf(argv[i], "--readahead=%d%c", &n, &junk) == 1 &&
1554 1555
               (n == 0 || n == 1)) {
      useFsReadAhead = n;
1556 1557 1558 1559 1560 1561
    } else if (sscanf(argv[i], "--statistics=%d%c", &n, &junk) == 1 &&
               (n == 0 || n == 1)) {
      if (n == 1) {
        dbstats = new leveldb::DBStatistics();
        FLAGS_statistics = true;
      }
1562 1563 1564 1565 1566
    } else if (sscanf(argv[i], "--writes=%d%c", &n, &junk) == 1) {
      FLAGS_writes = n;
    } else if (sscanf(argv[i], "--sync=%d%c", &n, &junk) == 1 &&
               (n == 0 || n == 1)) {
      FLAGS_sync = n;
1567
    } else if (sscanf(argv[i], "--readwritepercent=%d%c", &n, &junk) == 1 &&
1568
               n > 0 && n < 100) {
1569
      FLAGS_readwritepercent = n;
1570 1571 1572
    } else if (sscanf(argv[i], "--deletepercent=%d%c", &n, &junk) == 1 &&
               n > 0 && n < 100) {
      FLAGS_deletepercent = n;
H
heyongqiang 已提交
1573 1574 1575
    } else if (sscanf(argv[i], "--disable_data_sync=%d%c", &n, &junk) == 1 &&
        (n == 0 || n == 1)) {
      FLAGS_disable_data_sync = n;
1576 1577 1578
    } else if (sscanf(argv[i], "--use_fsync=%d%c", &n, &junk) == 1 &&
        (n == 0 || n == 1)) {
      FLAGS_use_fsync = n;
H
heyongqiang 已提交
1579
    } else if (sscanf(argv[i], "--disable_wal=%d%c", &n, &junk) == 1 &&
1580
        (n == 0 || n == 1)) {
H
heyongqiang 已提交
1581
      FLAGS_disable_wal = n;
1582
    } else if (sscanf(argv[i], "--hdfs=%s", hdfsname) == 1) {
1583
      FLAGS_env  = new leveldb::HdfsEnv(hdfsname);
1584 1585 1586
    } else if (sscanf(argv[i], "--num_levels=%d%c",
        &n, &junk) == 1) {
      FLAGS_num_levels = n;
H
heyongqiang 已提交
1587 1588 1589 1590 1591 1592 1593
    } 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 (
1594 1595
        sscanf(argv[i], "--max_bytes_for_level_base=%ld%c", &l, &junk) == 1) {
      FLAGS_max_bytes_for_level_base = l;
H
heyongqiang 已提交
1596 1597 1598
    } else if (sscanf(argv[i], "--max_bytes_for_level_multiplier=%d%c",
        &n, &junk) == 1) {
      FLAGS_max_bytes_for_level_multiplier = n;
H
heyongqiang 已提交
1599 1600 1601 1602 1603 1604
    } else if (sscanf(argv[i],"--level0_stop_writes_trigger=%d%c",
        &n, &junk) == 1) {
      FLAGS_level0_stop_writes_trigger = n;
    } else if (sscanf(argv[i],"--level0_slowdown_writes_trigger=%d%c",
        &n, &junk) == 1) {
      FLAGS_level0_slowdown_writes_trigger = n;
1605 1606 1607
    } else if (sscanf(argv[i],"--level0_file_num_compaction_trigger=%d%c",
        &n, &junk) == 1) {
      FLAGS_level0_file_num_compaction_trigger = n;
1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620
    } 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]);
      }
1621 1622
    } else if (sscanf(argv[i], "--min_level_to_compress=%d%c", &n, &junk) == 1
        && n >= 0) {
1623
      FLAGS_min_level_to_compress = n;
1624 1625 1626
    } else if (sscanf(argv[i], "--disable_seek_compaction=%d%c", &n, &junk) == 1
        && (n == 0 || n == 1)) {
      FLAGS_disable_seek_compaction = n;
1627 1628
    } else if (sscanf(argv[i], "--delete_obsolete_files_period_micros=%ld%c",
                      &l, &junk) == 1) {
1629
      FLAGS_delete_obsolete_files_period_micros = l;
1630 1631 1632
    } else if (sscanf(argv[i], "--stats_interval=%d%c", &n, &junk) == 1 &&
               n >= 0 && n < 2000000000) {
      FLAGS_stats_interval = n;
1633 1634 1635 1636 1637 1638
    } 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;
H
heyongqiang 已提交
1639 1640 1641
    } else if (sscanf(argv[i], "--readonly=%d%c", &n, &junk) == 1 &&
        (n == 0 || n ==1 )) {
      FLAGS_read_only = n;
1642 1643 1644
    } else if (sscanf(argv[i], "--max_grandparent_overlap_factor=%d%c",
               &n, &junk) == 1) {
      FLAGS_max_grandparent_overlap_factor = n;
A
Abhishek Kona 已提交
1645
    } else if (sscanf(argv[i], "--disable_auto_compactions=%d%c",
1646 1647
               &n, &junk) == 1 && (n == 0 || n ==1)) {
      FLAGS_disable_auto_compactions = n;
A
Abhishek Kona 已提交
1648
    } else if (sscanf(argv[i], "--source_compaction_factor=%d%c",
1649 1650
               &n, &junk) == 1 && n > 0) {
      FLAGS_source_compaction_factor = n;
1651 1652
    } else if (sscanf(argv[i], "--wal_ttl=%d%c", &n, &junk) == 1) {
      FLAGS_WAL_ttl_seconds = static_cast<uint64_t>(n);
1653
    } else {
J
jorlow@chromium.org 已提交
1654 1655 1656 1657 1658
      fprintf(stderr, "Invalid flag '%s'\n", argv[i]);
      exit(1);
    }
  }

1659 1660 1661 1662
  // 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 已提交
1663
  // Choose a location for the test database if none given with --db=<path>
1664
  if (FLAGS_db == nullptr) {
H
heyongqiang 已提交
1665 1666 1667 1668 1669
      leveldb::Env::Default()->GetTestDirectory(&default_db_path);
      default_db_path += "/dbbench";
      FLAGS_db = default_db_path.c_str();
  }

J
jorlow@chromium.org 已提交
1670 1671 1672 1673
  leveldb::Benchmark benchmark;
  benchmark.Run();
  return 0;
}