2016-02-10 00:12:00 +01:00
|
|
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
2017-07-16 01:03:42 +02:00
|
|
|
// This source code is licensed under both the GPLv2 (found in the
|
|
|
|
// COPYING file in the root directory) and Apache 2.0 License
|
|
|
|
// (found in the LICENSE.Apache file in the root directory).
|
2013-10-16 23:59:46 +02:00
|
|
|
//
|
2012-10-03 18:58:45 +02:00
|
|
|
// 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.
|
2013-02-23 20:11:16 +01:00
|
|
|
//
|
2013-08-13 22:58:02 +02:00
|
|
|
// The test uses an array to compare against values written to the database.
|
|
|
|
// Keys written to the array are in 1:1 correspondence to the actual values in
|
|
|
|
// the database according to the formula in the function GenerateValue.
|
|
|
|
|
|
|
|
// Space is reserved in the array from 0 to FLAGS_max_key and values are
|
|
|
|
// randomly written/deleted/read from those positions. During verification we
|
|
|
|
// compare all the positions in the array. To shorten/elongate the running
|
|
|
|
// time, you could change the settings: FLAGS_max_key, FLAGS_ops_per_thread,
|
|
|
|
// (sometimes also FLAGS_threads).
|
|
|
|
//
|
|
|
|
// NOTE that if FLAGS_test_batches_snapshots is set, the test will have
|
|
|
|
// different behavior. See comment of the flag for details.
|
2013-02-21 02:37:13 +01:00
|
|
|
|
2014-05-09 02:25:13 +02:00
|
|
|
#ifndef GFLAGS
|
|
|
|
#include <cstdio>
|
|
|
|
int main() {
|
|
|
|
fprintf(stderr, "Please install gflags to run rocksdb tools\n");
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
#else
|
|
|
|
|
2018-02-09 23:01:10 +01:00
|
|
|
#ifndef __STDC_FORMAT_MACROS
|
2014-12-04 20:59:29 +01:00
|
|
|
#define __STDC_FORMAT_MACROS
|
2018-02-09 23:01:10 +01:00
|
|
|
#endif // __STDC_FORMAT_MACROS
|
|
|
|
|
2017-05-23 03:40:41 +02:00
|
|
|
#include <fcntl.h>
|
2014-12-04 20:59:29 +01:00
|
|
|
#include <inttypes.h>
|
2012-10-03 18:58:45 +02:00
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
2015-05-29 22:17:49 +02:00
|
|
|
#include <sys/types.h>
|
2016-04-19 23:36:09 +02:00
|
|
|
#include <algorithm>
|
2015-05-29 22:17:49 +02:00
|
|
|
#include <chrono>
|
2014-09-02 22:21:59 +02:00
|
|
|
#include <exception>
|
2018-03-02 05:33:41 +01:00
|
|
|
#include <queue>
|
2015-05-29 22:17:49 +02:00
|
|
|
#include <thread>
|
|
|
|
|
2012-10-03 18:58:45 +02:00
|
|
|
#include "db/db_impl.h"
|
|
|
|
#include "db/version_set.h"
|
2015-08-11 20:46:15 +02:00
|
|
|
#include "hdfs/env_hdfs.h"
|
2017-04-06 04:02:00 +02:00
|
|
|
#include "monitoring/histogram.h"
|
2017-08-24 04:31:40 +02:00
|
|
|
#include "options/options_helper.h"
|
2015-08-11 20:46:15 +02:00
|
|
|
#include "port/port.h"
|
2013-08-23 17:38:13 +02:00
|
|
|
#include "rocksdb/cache.h"
|
|
|
|
#include "rocksdb/env.h"
|
2014-01-25 01:15:05 +01:00
|
|
|
#include "rocksdb/slice.h"
|
|
|
|
#include "rocksdb/slice_transform.h"
|
2015-08-11 20:46:15 +02:00
|
|
|
#include "rocksdb/statistics.h"
|
2018-06-19 04:23:42 +02:00
|
|
|
#include "rocksdb/utilities/backupable_db.h"
|
|
|
|
#include "rocksdb/utilities/checkpoint.h"
|
2015-08-11 20:46:15 +02:00
|
|
|
#include "rocksdb/utilities/db_ttl.h"
|
2018-04-27 03:38:45 +02:00
|
|
|
#include "rocksdb/utilities/options_util.h"
|
2017-12-13 20:51:12 +01:00
|
|
|
#include "rocksdb/utilities/transaction.h"
|
|
|
|
#include "rocksdb/utilities/transaction_db.h"
|
2015-08-11 20:46:15 +02:00
|
|
|
#include "rocksdb/write_batch.h"
|
2013-08-15 01:58:36 +02:00
|
|
|
#include "util/coding.h"
|
2015-08-11 20:46:15 +02:00
|
|
|
#include "util/compression.h"
|
2012-10-03 18:58:45 +02:00
|
|
|
#include "util/crc32c.h"
|
2017-12-01 19:40:45 +01:00
|
|
|
#include "util/gflags_compat.h"
|
2015-08-11 20:46:15 +02:00
|
|
|
#include "util/logging.h"
|
2012-10-03 18:58:45 +02:00
|
|
|
#include "util/mutexlock.h"
|
|
|
|
#include "util/random.h"
|
2015-08-11 20:46:15 +02:00
|
|
|
#include "util/string_util.h"
|
2017-05-23 03:40:41 +02:00
|
|
|
// SyncPoint is not supported in Released Windows Mode.
|
|
|
|
#if !(defined NDEBUG) || !defined(OS_WIN)
|
|
|
|
#include "util/sync_point.h"
|
|
|
|
#endif // !(defined NDEBUG) || !defined(OS_WIN)
|
2012-10-03 18:58:45 +02:00
|
|
|
#include "util/testutil.h"
|
2017-05-23 03:40:41 +02:00
|
|
|
|
Benchmarking for Merge Operator
Summary:
Updated db_bench and utilities/merge_operators.h to allow for dynamic benchmarking
of merge operators in db_bench. Added a new test (--benchmarks=mergerandom), which performs
a bunch of random Merge() operations over random keys. Also added a "--merge_operator=" flag
so that the tester can easily benchmark different merge operators. Currently supports
the PutOperator and UInt64Add operator. Support for stringappend or list append may come later.
Test Plan:
1. make db_bench
2. Test the PutOperator (simulating Put) as follows:
./db_bench --benchmarks=fillrandom,readrandom,updaterandom,readrandom,mergerandom,readrandom --merge_operator=put
--threads=2
3. Test the UInt64AddOperator (simulating numeric addition) similarly:
./db_bench --value_size=8 --benchmarks=fillrandom,readrandom,updaterandom,readrandom,mergerandom,readrandom
--merge_operator=uint64add --threads=2
Reviewers: haobo, dhruba, zshao, MarkCallaghan
Reviewed By: haobo
CC: leveldb
Differential Revision: https://reviews.facebook.net/D11535
2013-08-16 02:13:07 +02:00
|
|
|
#include "utilities/merge_operators.h"
|
2012-10-03 18:58:45 +02:00
|
|
|
|
2017-12-01 19:40:45 +01:00
|
|
|
using GFLAGS_NAMESPACE::ParseCommandLineFlags;
|
|
|
|
using GFLAGS_NAMESPACE::RegisterFlagValidator;
|
|
|
|
using GFLAGS_NAMESPACE::SetUsageMessage;
|
2012-10-03 18:58:45 +02:00
|
|
|
|
2014-05-09 02:25:13 +02:00
|
|
|
static const long KB = 1024;
|
2017-08-17 04:03:18 +02:00
|
|
|
static const int kRandomValueMaxFactor = 3;
|
|
|
|
static const int kValueMaxLen = 100;
|
2012-10-03 18:58:45 +02:00
|
|
|
|
2013-10-24 16:43:14 +02:00
|
|
|
static bool ValidateUint32Range(const char* flagname, uint64_t value) {
|
|
|
|
if (value > std::numeric_limits<uint32_t>::max()) {
|
2013-11-17 08:44:39 +01:00
|
|
|
fprintf(stderr,
|
|
|
|
"Invalid value for --%s: %lu, overflow\n",
|
|
|
|
flagname,
|
|
|
|
(unsigned long)value);
|
2013-10-24 16:43:14 +02:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
hints for narrowing down FindFile range and avoiding checking unrelevant L0 files
Summary:
The file tree structure in Version is prebuilt and the range of each file is known.
On the Get() code path, we do binary search in FindFile() by comparing
target key with each file's largest key and also check the range for each L0 file.
With some pre-calculated knowledge, each key comparision that has been done can serve
as a hint to narrow down further searches:
(1) If a key falls within a L0 file's range, we can safely skip the next
file if its range does not overlap with the current one.
(2) If a key falls within a file's range in level L0 - Ln-1, we should only
need to binary search in the next level for files that overlap with the current one.
(1) will be able to skip some files depending one the key distribution.
(2) can greatly reduce the range of binary search, especially for bottom
levels, given that one file most likely only overlaps with N files from
the level below (where N is max_bytes_for_level_multiplier). So on level
L, we will only look at ~N files instead of N^L files.
Some inital results: measured with 500M key DB, when write is light (10k/s = 1.2M/s), this
improves QPS ~7% on top of blocked bloom. When write is heavier (80k/s =
9.6M/s), it gives us ~13% improvement.
Test Plan: make all check
Reviewers: haobo, igor, dhruba, sdong, yhchiang
Reviewed By: haobo
CC: leveldb
Differential Revision: https://reviews.facebook.net/D17205
2014-04-21 18:10:12 +02:00
|
|
|
|
2013-10-24 16:43:14 +02:00
|
|
|
DEFINE_uint64(seed, 2341234, "Seed for PRNG");
|
2018-02-02 21:14:42 +01:00
|
|
|
static const bool FLAGS_seed_dummy __attribute__((__unused__)) =
|
2014-05-09 02:25:13 +02:00
|
|
|
RegisterFlagValidator(&FLAGS_seed, &ValidateUint32Range);
|
2012-10-03 18:58:45 +02:00
|
|
|
|
2019-01-03 02:38:27 +01:00
|
|
|
DEFINE_bool(read_only, false, "True if open DB in read-only mode during tests");
|
|
|
|
|
2014-02-27 21:13:48 +01:00
|
|
|
DEFINE_int64(max_key, 1 * KB* KB,
|
2013-10-24 16:43:14 +02:00
|
|
|
"Max number of key/values to place in database");
|
2013-04-08 21:35:40 +02:00
|
|
|
|
2014-02-27 21:13:48 +01:00
|
|
|
DEFINE_int32(column_families, 10, "Number of column families");
|
|
|
|
|
2018-04-27 03:38:45 +02:00
|
|
|
DEFINE_string(
|
|
|
|
options_file, "",
|
|
|
|
"The path to a RocksDB options file. If specified, then db_stress will "
|
|
|
|
"run with the RocksDB options in the default column family of the "
|
|
|
|
"specified options file. Note that, when an options file is provided, "
|
|
|
|
"db_stress will ignore the flag values for all options that may be passed "
|
|
|
|
"via options file.");
|
|
|
|
|
2017-08-15 20:53:00 +02:00
|
|
|
DEFINE_int64(
|
|
|
|
active_width, 0,
|
|
|
|
"Number of keys in active span of the key-range at any given time. The "
|
|
|
|
"span begins with its left endpoint at key 0, gradually moves rightwards, "
|
|
|
|
"and ends with its right endpoint at max_key. If set to 0, active_width "
|
|
|
|
"will be sanitized to be equal to max_key.");
|
|
|
|
|
Support for SingleDelete()
Summary:
This patch fixes #7460559. It introduces SingleDelete as a new database
operation. This operation can be used to delete keys that were never
overwritten (no put following another put of the same key). If an overwritten
key is single deleted the behavior is undefined. Single deletion of a
non-existent key has no effect but multiple consecutive single deletions are
not allowed (see limitations).
In contrast to the conventional Delete() operation, the deletion entry is
removed along with the value when the two are lined up in a compaction. Note:
The semantics are similar to @igor's prototype that allowed to have this
behavior on the granularity of a column family (
https://reviews.facebook.net/D42093 ). This new patch, however, is more
aggressive when it comes to removing tombstones: It removes the SingleDelete
together with the value whenever there is no snapshot between them while the
older patch only did this when the sequence number of the deletion was older
than the earliest snapshot.
Most of the complex additions are in the Compaction Iterator, all other changes
should be relatively straightforward. The patch also includes basic support for
single deletions in db_stress and db_bench.
Limitations:
- Not compatible with cuckoo hash tables
- Single deletions cannot be used in combination with merges and normal
deletions on the same key (other keys are not affected by this)
- Consecutive single deletions are currently not allowed (and older version of
this patch supported this so it could be resurrected if needed)
Test Plan: make all check
Reviewers: yhchiang, sdong, rven, anthony, yoshinorim, igor
Reviewed By: igor
Subscribers: maykov, dhruba, leveldb
Differential Revision: https://reviews.facebook.net/D43179
2015-09-17 20:42:56 +02:00
|
|
|
// TODO(noetzli) Add support for single deletes
|
2013-10-24 16:43:14 +02:00
|
|
|
DEFINE_bool(test_batches_snapshots, false,
|
2015-07-31 23:11:43 +02:00
|
|
|
"If set, the test uses MultiGet(), MultiPut() and MultiDelete()"
|
2013-10-24 16:43:14 +02:00
|
|
|
" which read/write/delete multiple keys in a batch. In this mode,"
|
|
|
|
" we do not verify db content by comparing the content with the "
|
|
|
|
"pre-allocated array. Instead, we do partial verification inside"
|
|
|
|
" MultiGet() by checking various values in a batch. Benefit of"
|
|
|
|
" this mode:\n"
|
|
|
|
"\t(a) No need to acquire mutexes during writes (less cache "
|
|
|
|
"flushes in multi-core leading to speed up)\n"
|
|
|
|
"\t(b) No long validation at the end (more speed up)\n"
|
|
|
|
"\t(c) Test snapshot and atomicity of batch writes");
|
2012-10-03 18:58:45 +02:00
|
|
|
|
2018-12-14 07:05:59 +01:00
|
|
|
DEFINE_bool(atomic_flush, false,
|
|
|
|
"If set, enables atomic flush in the options.\n");
|
|
|
|
|
|
|
|
DEFINE_bool(test_atomic_flush, false,
|
|
|
|
"If set, runs the stress test dedicated to verifying atomic flush "
|
|
|
|
"functionality. Setting this implies `atomic_flush=true`.\n");
|
2018-10-27 00:06:44 +02:00
|
|
|
|
2013-10-24 16:43:14 +02:00
|
|
|
DEFINE_int32(threads, 32, "Number of concurrent threads to run.");
|
2012-10-03 18:58:45 +02:00
|
|
|
|
2013-10-24 16:43:14 +02:00
|
|
|
DEFINE_int32(ttl, -1,
|
|
|
|
"Opens the db with this ttl value if this is not -1. "
|
|
|
|
"Carefully specify a large value such that verifications on "
|
|
|
|
"deleted values don't fail");
|
2012-10-19 23:00:53 +02:00
|
|
|
|
2013-10-24 16:43:14 +02:00
|
|
|
DEFINE_int32(value_size_mult, 8,
|
|
|
|
"Size of value will be this number times rand_int(1,3) bytes");
|
2013-09-10 01:06:10 +02:00
|
|
|
|
2017-02-23 20:21:23 +01:00
|
|
|
DEFINE_int32(compaction_readahead_size, 0, "Compaction readahead size");
|
|
|
|
|
2018-06-19 17:56:43 +02:00
|
|
|
DEFINE_bool(enable_pipelined_write, false, "Pipeline WAL/memtable writes");
|
|
|
|
|
2013-10-24 16:43:14 +02:00
|
|
|
DEFINE_bool(verify_before_write, false, "Verify before write");
|
2012-10-19 23:00:53 +02:00
|
|
|
|
2013-10-24 16:43:14 +02:00
|
|
|
DEFINE_bool(histogram, false, "Print histogram of operation timings");
|
2013-06-14 07:09:08 +02:00
|
|
|
|
2013-10-24 16:43:14 +02:00
|
|
|
DEFINE_bool(destroy_db_initially, true,
|
|
|
|
"Destroys the database dir before start if this is true");
|
2013-09-10 01:06:10 +02:00
|
|
|
|
2014-03-19 17:58:41 +01:00
|
|
|
DEFINE_bool(verbose, false, "Verbose");
|
|
|
|
|
|
|
|
DEFINE_bool(progress_reports, true,
|
|
|
|
"If true, db_stress will report number of finished operations");
|
2013-09-10 01:06:10 +02:00
|
|
|
|
2014-12-02 21:09:20 +01:00
|
|
|
DEFINE_uint64(db_write_buffer_size, rocksdb::Options().db_write_buffer_size,
|
|
|
|
"Number of bytes to buffer in all memtables before compacting");
|
|
|
|
|
2014-11-11 22:47:22 +01:00
|
|
|
DEFINE_int32(write_buffer_size,
|
|
|
|
static_cast<int32_t>(rocksdb::Options().write_buffer_size),
|
2013-10-24 16:43:14 +02:00
|
|
|
"Number of bytes to buffer in memtable before compacting");
|
2013-09-10 01:06:10 +02:00
|
|
|
|
2013-10-24 16:43:14 +02:00
|
|
|
DEFINE_int32(max_write_buffer_number,
|
|
|
|
rocksdb::Options().max_write_buffer_number,
|
|
|
|
"The number of in-memory memtables. "
|
|
|
|
"Each memtable is of size FLAGS_write_buffer_size.");
|
2013-09-10 01:06:10 +02:00
|
|
|
|
2013-10-24 16:43:14 +02:00
|
|
|
DEFINE_int32(min_write_buffer_number_to_merge,
|
|
|
|
rocksdb::Options().min_write_buffer_number_to_merge,
|
|
|
|
"The minimum number of write buffers that will be merged together "
|
|
|
|
"before writing to storage. This is cheap because it is an "
|
|
|
|
"in-memory merge. If this feature is not enabled, then all these "
|
|
|
|
"write buffers are flushed to L0 as separate files and this "
|
|
|
|
"increases read amplification because a get request has to check "
|
|
|
|
"in all of these files. Also, an in-memory merge may result in "
|
|
|
|
"writing less data to storage if there are duplicate records in"
|
|
|
|
" each of these individual write buffers.");
|
2012-10-03 18:58:45 +02:00
|
|
|
|
Support saving history in memtable_list
Summary:
For transactions, we are using the memtables to validate that there are no write conflicts. But after flushing, we don't have any memtables, and transactions could fail to commit. So we want to someone keep around some extra history to use for conflict checking. In addition, we want to provide a way to increase the size of this history if too many transactions fail to commit.
After chatting with people, it seems like everyone prefers just using Memtables to store this history (instead of a separate history structure). It seems like the best place for this is abstracted inside the memtable_list. I decide to create a separate list in MemtableListVersion as using the same list complicated the flush/installalflushresults logic too much.
This diff adds a new parameter to control how much memtable history to keep around after flushing. However, it sounds like people aren't too fond of adding new parameters. So I am making the default size of flushed+not-flushed memtables be set to max_write_buffers. This should not change the maximum amount of memory used, but make it more likely we're using closer the the limit. (We are now postponing deleting flushed memtables until the max_write_buffer limit is reached). So while we might use more memory on average, we are still obeying the limit set (and you could argue it's better to go ahead and use up memory now instead of waiting for a write stall to happen to test this limit).
However, if people are opposed to this default behavior, we can easily set it to 0 and require this parameter be set in order to use transactions.
Test Plan: Added a xfunc test to play around with setting different values of this parameter in all tests. Added testing in memtablelist_test and planning on adding more testing here.
Reviewers: sdong, rven, igor
Reviewed By: igor
Subscribers: dhruba, leveldb
Differential Revision: https://reviews.facebook.net/D37443
2015-05-29 01:34:24 +02:00
|
|
|
DEFINE_int32(max_write_buffer_number_to_maintain,
|
|
|
|
rocksdb::Options().max_write_buffer_number_to_maintain,
|
|
|
|
"The total maximum number of write buffers to maintain in memory "
|
|
|
|
"including copies of buffers that have already been flushed. "
|
|
|
|
"Unlike max_write_buffer_number, this parameter does not affect "
|
|
|
|
"flushing. This controls the minimum amount of write history "
|
|
|
|
"that will be available in memory for conflict checking when "
|
|
|
|
"Transactions are used. If this value is too low, some "
|
|
|
|
"transactions may fail at commit time due to not being able to "
|
|
|
|
"determine whether there were any write conflicts. Setting this "
|
|
|
|
"value to 0 will cause write buffers to be freed immediately "
|
|
|
|
"after they are flushed. If this value is set to -1, "
|
|
|
|
"'max_write_buffer_number' will be used.");
|
|
|
|
|
2017-08-17 04:03:18 +02:00
|
|
|
DEFINE_double(memtable_prefix_bloom_size_ratio,
|
|
|
|
rocksdb::Options().memtable_prefix_bloom_size_ratio,
|
|
|
|
"creates prefix blooms for memtables, each with size "
|
|
|
|
"`write_buffer_size * memtable_prefix_bloom_size_ratio`.");
|
|
|
|
|
2019-02-19 21:12:25 +01:00
|
|
|
DEFINE_bool(memtable_whole_key_filtering,
|
|
|
|
rocksdb::Options().memtable_whole_key_filtering,
|
|
|
|
"Enable whole key filtering in memtables.");
|
|
|
|
|
2013-10-24 16:43:14 +02:00
|
|
|
DEFINE_int32(open_files, rocksdb::Options().max_open_files,
|
|
|
|
"Maximum number of files to keep open at the same time "
|
|
|
|
"(use default if == 0)");
|
2012-10-03 18:58:45 +02:00
|
|
|
|
2013-09-02 08:23:40 +02:00
|
|
|
DEFINE_int64(compressed_cache_size, -1,
|
|
|
|
"Number of bytes to use as a cache of compressed data."
|
|
|
|
" Negative means use default settings.");
|
|
|
|
|
2013-10-24 16:43:14 +02:00
|
|
|
DEFINE_int32(compaction_style, rocksdb::Options().compaction_style, "");
|
2012-11-09 22:04:12 +01:00
|
|
|
|
2013-10-24 16:43:14 +02:00
|
|
|
DEFINE_int32(level0_file_num_compaction_trigger,
|
|
|
|
rocksdb::Options().level0_file_num_compaction_trigger,
|
|
|
|
"Level0 compaction start trigger");
|
2012-10-03 18:58:45 +02:00
|
|
|
|
2013-10-24 16:43:14 +02:00
|
|
|
DEFINE_int32(level0_slowdown_writes_trigger,
|
|
|
|
rocksdb::Options().level0_slowdown_writes_trigger,
|
|
|
|
"Number of files in level-0 that will slow down writes");
|
2012-10-03 18:58:45 +02:00
|
|
|
|
2013-10-24 16:43:14 +02:00
|
|
|
DEFINE_int32(level0_stop_writes_trigger,
|
|
|
|
rocksdb::Options().level0_stop_writes_trigger,
|
|
|
|
"Number of files in level-0 that will trigger put stop.");
|
2012-10-03 18:58:45 +02:00
|
|
|
|
2018-06-05 21:51:05 +02:00
|
|
|
DEFINE_int32(block_size,
|
|
|
|
static_cast<int32_t>(rocksdb::BlockBasedTableOptions().block_size),
|
2013-10-24 16:43:14 +02:00
|
|
|
"Number of bytes in a block.");
|
2012-10-03 18:58:45 +02:00
|
|
|
|
2018-06-05 04:59:44 +02:00
|
|
|
DEFINE_int32(
|
|
|
|
format_version,
|
|
|
|
static_cast<int32_t>(rocksdb::BlockBasedTableOptions().format_version),
|
|
|
|
"Format version of SST files.");
|
|
|
|
|
2018-09-19 00:41:27 +02:00
|
|
|
DEFINE_int32(index_block_restart_interval,
|
|
|
|
rocksdb::BlockBasedTableOptions().index_block_restart_interval,
|
|
|
|
"Number of keys between restart points "
|
|
|
|
"for delta encoding of keys in index block.");
|
|
|
|
|
2013-10-24 16:43:14 +02:00
|
|
|
DEFINE_int32(max_background_compactions,
|
|
|
|
rocksdb::Options().max_background_compactions,
|
|
|
|
"The maximum number of concurrent background compactions "
|
|
|
|
"that can occur in parallel.");
|
2013-06-18 01:13:32 +02:00
|
|
|
|
2017-08-17 04:03:18 +02:00
|
|
|
DEFINE_int32(num_bottom_pri_threads, 0,
|
|
|
|
"The number of threads in the bottom-priority thread pool (used "
|
|
|
|
"by universal compaction only).");
|
|
|
|
|
2014-06-02 19:12:41 +02:00
|
|
|
DEFINE_int32(compaction_thread_pool_adjust_interval, 0,
|
|
|
|
"The interval (in milliseconds) to adjust compaction thread pool "
|
|
|
|
"size. Don't change it periodically if the value is 0.");
|
|
|
|
|
2015-04-25 11:14:27 +02:00
|
|
|
DEFINE_int32(compaction_thread_pool_variations, 2,
|
2015-07-31 23:11:43 +02:00
|
|
|
"Range of background thread pool size variations when adjusted "
|
2014-06-02 19:12:41 +02:00
|
|
|
"periodically.");
|
|
|
|
|
2014-02-27 21:13:48 +01:00
|
|
|
DEFINE_int32(max_background_flushes, rocksdb::Options().max_background_flushes,
|
|
|
|
"The maximum number of concurrent background flushes "
|
|
|
|
"that can occur in parallel.");
|
|
|
|
|
2013-10-24 16:43:14 +02:00
|
|
|
DEFINE_int32(universal_size_ratio, 0, "The ratio of file sizes that trigger"
|
|
|
|
" compaction in universal style");
|
2012-10-03 18:58:45 +02:00
|
|
|
|
2013-10-24 16:43:14 +02:00
|
|
|
DEFINE_int32(universal_min_merge_width, 0, "The minimum number of files to "
|
|
|
|
"compact in universal style compaction");
|
2012-10-03 18:58:45 +02:00
|
|
|
|
2013-10-24 16:43:14 +02:00
|
|
|
DEFINE_int32(universal_max_merge_width, 0, "The max number of files to compact"
|
|
|
|
" in universal style compaction");
|
2012-10-03 18:58:45 +02:00
|
|
|
|
2013-10-24 16:43:14 +02:00
|
|
|
DEFINE_int32(universal_max_size_amplification_percent, 0,
|
|
|
|
"The max size amplification for universal style compaction");
|
2012-10-03 18:58:45 +02:00
|
|
|
|
2014-02-27 21:13:48 +01:00
|
|
|
DEFINE_int32(clear_column_family_one_in, 1000000,
|
|
|
|
"With a chance of 1/N, delete a column family and then recreate "
|
|
|
|
"it again. If N == 0, never drop/create column families. "
|
|
|
|
"When test_batches_snapshots is true, this flag has no effect");
|
|
|
|
|
2014-10-27 20:11:16 +01:00
|
|
|
DEFINE_int32(set_options_one_in, 0,
|
|
|
|
"With a chance of 1/N, change some random options");
|
|
|
|
|
2014-10-31 20:02:14 +01:00
|
|
|
DEFINE_int32(set_in_place_one_in, 0,
|
|
|
|
"With a chance of 1/N, toggle in place support option");
|
|
|
|
|
2015-09-15 13:41:00 +02:00
|
|
|
DEFINE_int64(cache_size, 2LL * KB * KB * KB,
|
2013-10-24 16:43:14 +02:00
|
|
|
"Number of bytes to use as a cache of uncompressed data.");
|
2013-04-05 08:49:43 +02:00
|
|
|
|
2019-04-30 18:46:40 +02:00
|
|
|
DEFINE_bool(cache_index_and_filter_blocks, false,
|
|
|
|
"True if indexes/filters should be cached in block cache.");
|
|
|
|
|
2016-08-19 21:28:19 +02:00
|
|
|
DEFINE_bool(use_clock_cache, false,
|
|
|
|
"Replace default LRU block cache with clock cache.");
|
|
|
|
|
2015-08-18 20:06:23 +02:00
|
|
|
DEFINE_uint64(subcompactions, 1,
|
2016-04-18 23:43:33 +02:00
|
|
|
"Maximum number of subcompactions to divide L0-L1 compactions "
|
|
|
|
"into.");
|
2016-02-05 00:21:32 +01:00
|
|
|
|
2017-06-13 23:51:22 +02:00
|
|
|
DEFINE_bool(allow_concurrent_memtable_write, false,
|
2016-02-05 00:21:32 +01:00
|
|
|
"Allow multi-writers to update mem tables in parallel.");
|
|
|
|
|
|
|
|
DEFINE_bool(enable_write_thread_adaptive_yield, true,
|
|
|
|
"Use a yielding spin loop for brief writer thread waits.");
|
|
|
|
|
2018-02-02 21:14:42 +01:00
|
|
|
static const bool FLAGS_subcompactions_dummy __attribute__((__unused__)) =
|
2015-08-18 20:06:23 +02:00
|
|
|
RegisterFlagValidator(&FLAGS_subcompactions, &ValidateUint32Range);
|
|
|
|
|
2013-10-24 16:43:14 +02:00
|
|
|
static bool ValidateInt32Positive(const char* flagname, int32_t value) {
|
|
|
|
if (value < 0) {
|
|
|
|
fprintf(stderr, "Invalid value for --%s: %d, must be >=0\n",
|
|
|
|
flagname, value);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
DEFINE_int32(reopen, 10, "Number of times database reopens");
|
2018-02-02 21:14:42 +01:00
|
|
|
static const bool FLAGS_reopen_dummy __attribute__((__unused__)) =
|
2014-05-09 02:25:13 +02:00
|
|
|
RegisterFlagValidator(&FLAGS_reopen, &ValidateInt32Positive);
|
2012-10-03 18:58:45 +02:00
|
|
|
|
2013-10-24 16:43:14 +02:00
|
|
|
DEFINE_int32(bloom_bits, 10, "Bloom filter bits per key. "
|
|
|
|
"Negative means use default settings.");
|
2012-10-03 18:58:45 +02:00
|
|
|
|
2014-09-08 19:37:05 +02:00
|
|
|
DEFINE_bool(use_block_based_filter, false, "use block based filter"
|
|
|
|
"instead of full filter for block based table");
|
|
|
|
|
2013-10-24 16:43:14 +02:00
|
|
|
DEFINE_string(db, "", "Use the db with the following name.");
|
2012-10-03 18:58:45 +02:00
|
|
|
|
2018-04-30 21:23:45 +02:00
|
|
|
DEFINE_string(
|
|
|
|
expected_values_path, "",
|
|
|
|
"File where the array of expected uint32_t values will be stored. If "
|
|
|
|
"provided and non-empty, the DB state will be verified against these "
|
|
|
|
"values after recovery. --max_key and --column_family must be kept the "
|
|
|
|
"same across invocations of this program that use the same "
|
|
|
|
"--expected_values_path.");
|
|
|
|
|
2013-10-24 16:43:14 +02:00
|
|
|
DEFINE_bool(verify_checksum, false,
|
|
|
|
"Verify checksum for every block read from storage");
|
2012-10-03 18:58:45 +02:00
|
|
|
|
2017-04-13 22:07:33 +02:00
|
|
|
DEFINE_bool(mmap_read, rocksdb::Options().allow_mmap_reads,
|
2013-10-24 16:43:14 +02:00
|
|
|
"Allow reads to occur via mmap-ing files");
|
2012-10-03 18:58:45 +02:00
|
|
|
|
2017-04-13 22:07:33 +02:00
|
|
|
DEFINE_bool(mmap_write, rocksdb::Options().allow_mmap_writes,
|
2017-02-23 20:21:23 +01:00
|
|
|
"Allow writes to occur via mmap-ing files");
|
|
|
|
|
2017-04-13 22:07:33 +02:00
|
|
|
DEFINE_bool(use_direct_reads, rocksdb::Options().use_direct_reads,
|
2017-02-23 20:21:23 +01:00
|
|
|
"Use O_DIRECT for reading data");
|
|
|
|
|
2017-04-13 22:07:33 +02:00
|
|
|
DEFINE_bool(use_direct_io_for_flush_and_compaction,
|
|
|
|
rocksdb::Options().use_direct_io_for_flush_and_compaction,
|
2017-02-23 20:21:23 +01:00
|
|
|
"Use O_DIRECT for writing data");
|
|
|
|
|
2013-10-24 16:43:14 +02:00
|
|
|
// Database statistics
|
|
|
|
static std::shared_ptr<rocksdb::Statistics> dbstats;
|
|
|
|
DEFINE_bool(statistics, false, "Create database statistics");
|
2012-10-03 18:58:45 +02:00
|
|
|
|
2013-10-24 16:43:14 +02:00
|
|
|
DEFINE_bool(sync, false, "Sync all writes to disk");
|
2012-10-03 18:58:45 +02:00
|
|
|
|
2013-10-24 16:43:14 +02:00
|
|
|
DEFINE_bool(use_fsync, false, "If true, issue fsync instead of fdatasync");
|
2013-08-15 01:58:36 +02:00
|
|
|
|
2013-10-24 16:43:14 +02:00
|
|
|
DEFINE_int32(kill_random_test, 0,
|
|
|
|
"If non-zero, kill at various points in source code with "
|
|
|
|
"probability 1/this");
|
2018-02-02 21:14:42 +01:00
|
|
|
static const bool FLAGS_kill_random_test_dummy __attribute__((__unused__)) =
|
2014-05-09 02:25:13 +02:00
|
|
|
RegisterFlagValidator(&FLAGS_kill_random_test, &ValidateInt32Positive);
|
2013-10-24 16:43:14 +02:00
|
|
|
extern int rocksdb_kill_odds;
|
2013-08-15 01:58:36 +02:00
|
|
|
|
2015-10-14 23:08:50 +02:00
|
|
|
DEFINE_string(kill_prefix_blacklist, "",
|
|
|
|
"If non-empty, kill points with prefix in the list given will be"
|
|
|
|
" skipped. Items are comma-separated.");
|
|
|
|
extern std::vector<std::string> rocksdb_kill_prefix_blacklist;
|
|
|
|
|
2013-10-24 16:43:14 +02:00
|
|
|
DEFINE_bool(disable_wal, false, "If true, do not write WAL for write.");
|
2012-10-03 18:58:45 +02:00
|
|
|
|
2019-03-15 19:58:37 +01:00
|
|
|
DEFINE_uint64(recycle_log_file_num, rocksdb::Options().recycle_log_file_num,
|
|
|
|
"Number of old WAL files to keep around for later recycling");
|
|
|
|
|
2017-08-18 02:53:45 +02:00
|
|
|
DEFINE_int64(target_file_size_base, rocksdb::Options().target_file_size_base,
|
2013-10-24 16:43:14 +02:00
|
|
|
"Target level-1 file size for compaction");
|
2013-09-20 01:47:24 +02:00
|
|
|
|
2013-10-24 16:43:14 +02:00
|
|
|
DEFINE_int32(target_file_size_multiplier, 1,
|
2015-07-31 23:11:43 +02:00
|
|
|
"A multiplier to compute target level-N file size (N >= 2)");
|
2013-09-20 01:47:24 +02:00
|
|
|
|
2017-08-17 04:03:18 +02:00
|
|
|
DEFINE_uint64(max_bytes_for_level_base,
|
|
|
|
rocksdb::Options().max_bytes_for_level_base,
|
|
|
|
"Max bytes for level-1");
|
2012-10-03 18:58:45 +02:00
|
|
|
|
2016-11-02 05:05:32 +01:00
|
|
|
DEFINE_double(max_bytes_for_level_multiplier, 2,
|
|
|
|
"A multiplier to compute max bytes for level-N (N >= 2)");
|
2012-10-19 23:00:53 +02:00
|
|
|
|
2016-12-07 21:59:59 +01:00
|
|
|
DEFINE_int32(range_deletion_width, 10,
|
|
|
|
"The width of the range deletion intervals.");
|
|
|
|
|
2017-06-13 23:51:22 +02:00
|
|
|
DEFINE_uint64(rate_limiter_bytes_per_sec, 0, "Set options.rate_limiter value.");
|
|
|
|
|
|
|
|
DEFINE_bool(rate_limit_bg_reads, false,
|
|
|
|
"Use options.rate_limiter on compaction reads");
|
|
|
|
|
2017-12-13 20:51:12 +01:00
|
|
|
DEFINE_bool(use_txn, false,
|
|
|
|
"Use TransactionDB. Currently the default write policy is "
|
|
|
|
"TxnDBWritePolicy::WRITE_PREPARED");
|
|
|
|
|
2018-06-19 04:23:42 +02:00
|
|
|
DEFINE_int32(backup_one_in, 0,
|
|
|
|
"If non-zero, then CreateNewBackup() will be called once for "
|
|
|
|
"every N operations on average. 0 indicates CreateNewBackup() "
|
|
|
|
"is disabled.");
|
|
|
|
|
|
|
|
DEFINE_int32(checkpoint_one_in, 0,
|
|
|
|
"If non-zero, then CreateCheckpoint() will be called once for "
|
|
|
|
"every N operations on average. 0 indicates CreateCheckpoint() "
|
|
|
|
"is disabled.");
|
|
|
|
|
2018-06-21 07:14:12 +02:00
|
|
|
DEFINE_int32(ingest_external_file_one_in, 0,
|
|
|
|
"If non-zero, then IngestExternalFile() will be called once for "
|
|
|
|
"every N operations on average. 0 indicates IngestExternalFile() "
|
|
|
|
"is disabled.");
|
|
|
|
|
|
|
|
DEFINE_int32(ingest_external_file_width, 1000,
|
|
|
|
"The width of the ingested external files.");
|
|
|
|
|
2016-04-28 01:50:51 +02:00
|
|
|
DEFINE_int32(compact_files_one_in, 0,
|
2018-06-14 01:39:03 +02:00
|
|
|
"If non-zero, then CompactFiles() will be called once for every N "
|
|
|
|
"operations on average. 0 indicates CompactFiles() is disabled.");
|
|
|
|
|
|
|
|
DEFINE_int32(compact_range_one_in, 0,
|
|
|
|
"If non-zero, then CompactRange() will be called once for every N "
|
|
|
|
"operations on average. 0 indicates CompactRange() is disabled.");
|
|
|
|
|
2018-09-17 21:23:38 +02:00
|
|
|
DEFINE_int32(flush_one_in, 0,
|
|
|
|
"If non-zero, then Flush() will be called once for every N ops "
|
|
|
|
"on average. 0 indicates calls to Flush() are disabled.");
|
|
|
|
|
2018-06-14 01:39:03 +02:00
|
|
|
DEFINE_int32(compact_range_width, 10000,
|
|
|
|
"The width of the ranges passed to CompactRange().");
|
2016-04-19 23:36:09 +02:00
|
|
|
|
2017-10-21 00:17:03 +02:00
|
|
|
DEFINE_int32(acquire_snapshot_one_in, 0,
|
|
|
|
"If non-zero, then acquires a snapshot once every N operations on "
|
|
|
|
"average.");
|
|
|
|
|
2018-08-24 23:57:37 +02:00
|
|
|
DEFINE_bool(compare_full_db_state_snapshot, false,
|
|
|
|
"If set we compare state of entire db (in one of the threads) with"
|
|
|
|
"each snapshot.");
|
|
|
|
|
2017-10-21 00:17:03 +02:00
|
|
|
DEFINE_uint64(snapshot_hold_ops, 0,
|
|
|
|
"If non-zero, then releases snapshots N operations after they're "
|
|
|
|
"acquired.");
|
|
|
|
|
2013-10-24 16:43:14 +02:00
|
|
|
static bool ValidateInt32Percent(const char* flagname, int32_t value) {
|
|
|
|
if (value < 0 || value>100) {
|
|
|
|
fprintf(stderr, "Invalid value for --%s: %d, 0<= pct <=100 \n",
|
|
|
|
flagname, value);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
2016-04-19 23:36:09 +02:00
|
|
|
|
2013-10-24 16:43:14 +02:00
|
|
|
DEFINE_int32(readpercent, 10,
|
|
|
|
"Ratio of reads to total workload (expressed as a percentage)");
|
2018-02-02 21:14:42 +01:00
|
|
|
static const bool FLAGS_readpercent_dummy __attribute__((__unused__)) =
|
2014-05-09 02:25:13 +02:00
|
|
|
RegisterFlagValidator(&FLAGS_readpercent, &ValidateInt32Percent);
|
2013-10-24 16:43:14 +02:00
|
|
|
|
|
|
|
DEFINE_int32(prefixpercent, 20,
|
|
|
|
"Ratio of prefix iterators to total workload (expressed as a"
|
|
|
|
" percentage)");
|
2018-02-02 21:14:42 +01:00
|
|
|
static const bool FLAGS_prefixpercent_dummy __attribute__((__unused__)) =
|
2014-05-09 02:25:13 +02:00
|
|
|
RegisterFlagValidator(&FLAGS_prefixpercent, &ValidateInt32Percent);
|
2013-10-24 16:43:14 +02:00
|
|
|
|
|
|
|
DEFINE_int32(writepercent, 45,
|
2015-07-31 23:11:43 +02:00
|
|
|
"Ratio of writes to total workload (expressed as a percentage)");
|
2018-02-02 21:14:42 +01:00
|
|
|
static const bool FLAGS_writepercent_dummy __attribute__((__unused__)) =
|
2014-05-09 02:25:13 +02:00
|
|
|
RegisterFlagValidator(&FLAGS_writepercent, &ValidateInt32Percent);
|
2013-10-24 16:43:14 +02:00
|
|
|
|
|
|
|
DEFINE_int32(delpercent, 15,
|
|
|
|
"Ratio of deletes to total workload (expressed as a percentage)");
|
2018-02-02 21:14:42 +01:00
|
|
|
static const bool FLAGS_delpercent_dummy __attribute__((__unused__)) =
|
2014-05-09 02:25:13 +02:00
|
|
|
RegisterFlagValidator(&FLAGS_delpercent, &ValidateInt32Percent);
|
2013-10-24 16:43:14 +02:00
|
|
|
|
2016-12-07 21:59:59 +01:00
|
|
|
DEFINE_int32(delrangepercent, 0,
|
|
|
|
"Ratio of range deletions to total workload (expressed as a "
|
|
|
|
"percentage). Cannot be used with test_batches_snapshots");
|
2018-02-02 21:14:42 +01:00
|
|
|
static const bool FLAGS_delrangepercent_dummy __attribute__((__unused__)) =
|
2016-12-07 21:59:59 +01:00
|
|
|
RegisterFlagValidator(&FLAGS_delrangepercent, &ValidateInt32Percent);
|
|
|
|
|
Support for SingleDelete()
Summary:
This patch fixes #7460559. It introduces SingleDelete as a new database
operation. This operation can be used to delete keys that were never
overwritten (no put following another put of the same key). If an overwritten
key is single deleted the behavior is undefined. Single deletion of a
non-existent key has no effect but multiple consecutive single deletions are
not allowed (see limitations).
In contrast to the conventional Delete() operation, the deletion entry is
removed along with the value when the two are lined up in a compaction. Note:
The semantics are similar to @igor's prototype that allowed to have this
behavior on the granularity of a column family (
https://reviews.facebook.net/D42093 ). This new patch, however, is more
aggressive when it comes to removing tombstones: It removes the SingleDelete
together with the value whenever there is no snapshot between them while the
older patch only did this when the sequence number of the deletion was older
than the earliest snapshot.
Most of the complex additions are in the Compaction Iterator, all other changes
should be relatively straightforward. The patch also includes basic support for
single deletions in db_stress and db_bench.
Limitations:
- Not compatible with cuckoo hash tables
- Single deletions cannot be used in combination with merges and normal
deletions on the same key (other keys are not affected by this)
- Consecutive single deletions are currently not allowed (and older version of
this patch supported this so it could be resurrected if needed)
Test Plan: make all check
Reviewers: yhchiang, sdong, rven, anthony, yoshinorim, igor
Reviewed By: igor
Subscribers: maykov, dhruba, leveldb
Differential Revision: https://reviews.facebook.net/D43179
2015-09-17 20:42:56 +02:00
|
|
|
DEFINE_int32(nooverwritepercent, 60,
|
|
|
|
"Ratio of keys without overwrite to total workload (expressed as "
|
|
|
|
" a percentage)");
|
|
|
|
static const bool FLAGS_nooverwritepercent_dummy __attribute__((__unused__)) =
|
|
|
|
RegisterFlagValidator(&FLAGS_nooverwritepercent, &ValidateInt32Percent);
|
|
|
|
|
2013-10-24 16:43:14 +02:00
|
|
|
DEFINE_int32(iterpercent, 10, "Ratio of iterations to total workload"
|
|
|
|
" (expressed as a percentage)");
|
2018-02-02 21:14:42 +01:00
|
|
|
static const bool FLAGS_iterpercent_dummy __attribute__((__unused__)) =
|
2014-05-09 02:25:13 +02:00
|
|
|
RegisterFlagValidator(&FLAGS_iterpercent, &ValidateInt32Percent);
|
2013-10-24 16:43:14 +02:00
|
|
|
|
|
|
|
DEFINE_uint64(num_iterations, 10, "Number of iterations per MultiIterate run");
|
2018-02-02 21:14:42 +01:00
|
|
|
static const bool FLAGS_num_iterations_dummy __attribute__((__unused__)) =
|
2014-05-09 02:25:13 +02:00
|
|
|
RegisterFlagValidator(&FLAGS_num_iterations, &ValidateUint32Range);
|
2013-10-24 16:43:14 +02:00
|
|
|
|
2014-04-10 06:17:14 +02:00
|
|
|
namespace {
|
2013-10-24 16:43:14 +02:00
|
|
|
enum rocksdb::CompressionType StringToCompressionType(const char* ctype) {
|
|
|
|
assert(ctype);
|
|
|
|
|
|
|
|
if (!strcasecmp(ctype, "none"))
|
|
|
|
return rocksdb::kNoCompression;
|
|
|
|
else if (!strcasecmp(ctype, "snappy"))
|
|
|
|
return rocksdb::kSnappyCompression;
|
|
|
|
else if (!strcasecmp(ctype, "zlib"))
|
|
|
|
return rocksdb::kZlibCompression;
|
|
|
|
else if (!strcasecmp(ctype, "bzip2"))
|
|
|
|
return rocksdb::kBZip2Compression;
|
2014-02-08 03:12:30 +01:00
|
|
|
else if (!strcasecmp(ctype, "lz4"))
|
|
|
|
return rocksdb::kLZ4Compression;
|
|
|
|
else if (!strcasecmp(ctype, "lz4hc"))
|
|
|
|
return rocksdb::kLZ4HCCompression;
|
2016-04-20 07:54:24 +02:00
|
|
|
else if (!strcasecmp(ctype, "xpress"))
|
|
|
|
return rocksdb::kXpressCompression;
|
2015-08-28 00:40:42 +02:00
|
|
|
else if (!strcasecmp(ctype, "zstd"))
|
2016-09-02 00:28:40 +02:00
|
|
|
return rocksdb::kZSTD;
|
2013-10-24 16:43:14 +02:00
|
|
|
|
2017-08-24 04:31:40 +02:00
|
|
|
fprintf(stderr, "Cannot parse compression type '%s'\n", ctype);
|
2013-10-24 16:43:14 +02:00
|
|
|
return rocksdb::kSnappyCompression; //default value
|
|
|
|
}
|
2015-10-14 23:08:50 +02:00
|
|
|
|
2017-08-24 04:31:40 +02:00
|
|
|
enum rocksdb::ChecksumType StringToChecksumType(const char* ctype) {
|
|
|
|
assert(ctype);
|
|
|
|
auto iter = rocksdb::checksum_type_string_map.find(ctype);
|
|
|
|
if (iter != rocksdb::checksum_type_string_map.end()) {
|
|
|
|
return iter->second;
|
|
|
|
}
|
|
|
|
fprintf(stderr, "Cannot parse checksum type '%s'\n", ctype);
|
|
|
|
return rocksdb::kCRC32c;
|
|
|
|
}
|
|
|
|
|
|
|
|
std::string ChecksumTypeToString(rocksdb::ChecksumType ctype) {
|
|
|
|
auto iter = std::find_if(
|
|
|
|
rocksdb::checksum_type_string_map.begin(),
|
|
|
|
rocksdb::checksum_type_string_map.end(),
|
|
|
|
[&](const std::pair<std::string, rocksdb::ChecksumType>&
|
|
|
|
name_and_enum_val) { return name_and_enum_val.second == ctype; });
|
|
|
|
assert(iter != rocksdb::checksum_type_string_map.end());
|
|
|
|
return iter->first;
|
|
|
|
}
|
|
|
|
|
2015-10-14 23:08:50 +02:00
|
|
|
std::vector<std::string> SplitString(std::string src) {
|
|
|
|
std::vector<std::string> ret;
|
|
|
|
if (src.empty()) {
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
size_t pos = 0;
|
|
|
|
size_t pos_comma;
|
|
|
|
while ((pos_comma = src.find(',', pos)) != std::string::npos) {
|
|
|
|
ret.push_back(src.substr(pos, pos_comma - pos));
|
|
|
|
pos = pos_comma + 1;
|
|
|
|
}
|
|
|
|
ret.push_back(src.substr(pos, src.length()));
|
|
|
|
return ret;
|
|
|
|
}
|
2014-04-10 06:17:14 +02:00
|
|
|
} // namespace
|
|
|
|
|
2013-10-24 16:43:14 +02:00
|
|
|
DEFINE_string(compression_type, "snappy",
|
|
|
|
"Algorithm to use to compress the database");
|
|
|
|
static enum rocksdb::CompressionType FLAGS_compression_type_e =
|
2013-10-04 06:49:15 +02:00
|
|
|
rocksdb::kSnappyCompression;
|
2012-10-03 18:58:45 +02:00
|
|
|
|
2018-08-07 00:23:03 +02:00
|
|
|
DEFINE_int32(compression_max_dict_bytes, 0,
|
|
|
|
"Maximum size of dictionary used to prime the compression "
|
|
|
|
"library.");
|
|
|
|
|
|
|
|
DEFINE_int32(compression_zstd_max_train_bytes, 0,
|
|
|
|
"Maximum size of training data passed to zstd's dictionary "
|
|
|
|
"trainer.");
|
|
|
|
|
2017-08-24 04:31:40 +02:00
|
|
|
DEFINE_string(checksum_type, "kCRC32c", "Algorithm to use to checksum blocks");
|
|
|
|
static enum rocksdb::ChecksumType FLAGS_checksum_type_e = rocksdb::kCRC32c;
|
|
|
|
|
2013-10-24 16:43:14 +02:00
|
|
|
DEFINE_string(hdfs, "", "Name of hdfs environment");
|
2012-10-03 18:58:45 +02:00
|
|
|
// posix or hdfs environment
|
2013-10-04 06:49:15 +02:00
|
|
|
static rocksdb::Env* FLAGS_env = rocksdb::Env::Default();
|
2012-10-03 18:58:45 +02:00
|
|
|
|
2014-02-27 21:13:48 +01:00
|
|
|
DEFINE_uint64(ops_per_thread, 1200000, "Number of operations per thread.");
|
2018-02-02 21:14:42 +01:00
|
|
|
static const bool FLAGS_ops_per_thread_dummy __attribute__((__unused__)) =
|
2014-05-09 02:25:13 +02:00
|
|
|
RegisterFlagValidator(&FLAGS_ops_per_thread, &ValidateUint32Range);
|
2012-10-03 18:58:45 +02:00
|
|
|
|
2013-10-24 16:43:14 +02:00
|
|
|
DEFINE_uint64(log2_keys_per_lock, 2, "Log2 of number of keys per lock");
|
2018-02-02 21:14:42 +01:00
|
|
|
static const bool FLAGS_log2_keys_per_lock_dummy __attribute__((__unused__)) =
|
2014-05-09 02:25:13 +02:00
|
|
|
RegisterFlagValidator(&FLAGS_log2_keys_per_lock, &ValidateUint32Range);
|
2013-03-06 21:54:55 +01:00
|
|
|
|
2018-05-18 16:58:59 +02:00
|
|
|
DEFINE_uint64(max_manifest_file_size, 16384, "Maximum size of a MANIFEST file");
|
|
|
|
|
2014-10-31 20:02:14 +01:00
|
|
|
DEFINE_bool(in_place_update, false, "On true, does inplace update in memtable");
|
|
|
|
|
2013-08-23 08:10:02 +02:00
|
|
|
enum RepFactory {
|
|
|
|
kSkipList,
|
2013-12-03 21:42:15 +01:00
|
|
|
kHashSkipList,
|
2013-08-23 08:10:02 +02:00
|
|
|
kVectorRep
|
|
|
|
};
|
2014-04-10 06:17:14 +02:00
|
|
|
|
|
|
|
namespace {
|
2013-10-24 16:43:14 +02:00
|
|
|
enum RepFactory StringToRepFactory(const char* ctype) {
|
|
|
|
assert(ctype);
|
|
|
|
|
|
|
|
if (!strcasecmp(ctype, "skip_list"))
|
|
|
|
return kSkipList;
|
|
|
|
else if (!strcasecmp(ctype, "prefix_hash"))
|
2013-12-03 21:42:15 +01:00
|
|
|
return kHashSkipList;
|
2013-10-24 16:43:14 +02:00
|
|
|
else if (!strcasecmp(ctype, "vector"))
|
|
|
|
return kVectorRep;
|
|
|
|
|
|
|
|
fprintf(stdout, "Cannot parse memreptable %s\n", ctype);
|
|
|
|
return kSkipList;
|
|
|
|
}
|
2018-07-23 19:40:40 +02:00
|
|
|
|
2018-08-09 23:21:35 +02:00
|
|
|
#ifdef _MSC_VER
|
|
|
|
#pragma warning(push)
|
|
|
|
// truncation of constant value on static_cast
|
2018-08-23 19:04:10 +02:00
|
|
|
#pragma warning(disable : 4309)
|
2018-08-09 23:21:35 +02:00
|
|
|
#endif
|
2018-07-23 19:40:40 +02:00
|
|
|
bool GetNextPrefix(const rocksdb::Slice& src, std::string* v) {
|
|
|
|
std::string ret = src.ToString();
|
|
|
|
for (int i = static_cast<int>(ret.size()) - 1; i >= 0; i--) {
|
|
|
|
if (ret[i] != static_cast<char>(255)) {
|
|
|
|
ret[i] = ret[i] + 1;
|
|
|
|
break;
|
|
|
|
} else if (i != 0) {
|
|
|
|
ret[i] = 0;
|
|
|
|
} else {
|
|
|
|
// all FF. No next prefix
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
*v = ret;
|
|
|
|
return true;
|
|
|
|
}
|
2018-08-09 23:21:35 +02:00
|
|
|
#ifdef _MSC_VER
|
|
|
|
#pragma warning(pop)
|
|
|
|
#endif
|
2014-04-10 06:17:14 +02:00
|
|
|
} // namespace
|
|
|
|
|
2013-08-23 08:10:02 +02:00
|
|
|
static enum RepFactory FLAGS_rep_factory;
|
2014-03-11 21:44:33 +01:00
|
|
|
DEFINE_string(memtablerep, "prefix_hash", "");
|
2013-08-23 08:10:02 +02:00
|
|
|
|
2013-10-24 16:43:14 +02:00
|
|
|
static bool ValidatePrefixSize(const char* flagname, int32_t value) {
|
2014-03-11 21:44:33 +01:00
|
|
|
if (value < 0 || value > 8) {
|
|
|
|
fprintf(stderr, "Invalid value for --%s: %d. 0 <= PrefixSize <= 8\n",
|
2013-10-24 16:43:14 +02:00
|
|
|
flagname, value);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
2014-03-12 17:31:06 +01:00
|
|
|
DEFINE_int32(prefix_size, 7, "Control the prefix size for HashSkipListRep");
|
2018-02-02 21:14:42 +01:00
|
|
|
static const bool FLAGS_prefix_size_dummy __attribute__((__unused__)) =
|
2014-05-09 02:25:13 +02:00
|
|
|
RegisterFlagValidator(&FLAGS_prefix_size, &ValidatePrefixSize);
|
2013-10-24 16:43:14 +02:00
|
|
|
|
|
|
|
DEFINE_bool(use_merge, false, "On true, replaces all writes with a Merge "
|
|
|
|
"that behaves like a Put");
|
2013-08-23 08:10:02 +02:00
|
|
|
|
Introduce FullMergeV2 (eliminate memcpy from merge operators)
Summary:
This diff update the code to pin the merge operator operands while the merge operation is done, so that we can eliminate the memcpy cost, to do that we need a new public API for FullMerge that replace the std::deque<std::string> with std::vector<Slice>
This diff is stacked on top of D56493 and D56511
In this diff we
- Update FullMergeV2 arguments to be encapsulated in MergeOperationInput and MergeOperationOutput which will make it easier to add new arguments in the future
- Replace std::deque<std::string> with std::vector<Slice> to pass operands
- Replace MergeContext std::deque with std::vector (based on a simple benchmark I ran https://gist.github.com/IslamAbdelRahman/78fc86c9ab9f52b1df791e58943fb187)
- Allow FullMergeV2 output to be an existing operand
```
[Everything in Memtable | 10K operands | 10 KB each | 1 operand per key]
DEBUG_LEVEL=0 make db_bench -j64 && ./db_bench --benchmarks="mergerandom,readseq,readseq,readseq,readseq,readseq" --merge_operator="max" --merge_keys=10000 --num=10000 --disable_auto_compactions --value_size=10240 --write_buffer_size=1000000000
[FullMergeV2]
readseq : 0.607 micros/op 1648235 ops/sec; 16121.2 MB/s
readseq : 0.478 micros/op 2091546 ops/sec; 20457.2 MB/s
readseq : 0.252 micros/op 3972081 ops/sec; 38850.5 MB/s
readseq : 0.237 micros/op 4218328 ops/sec; 41259.0 MB/s
readseq : 0.247 micros/op 4043927 ops/sec; 39553.2 MB/s
[master]
readseq : 3.935 micros/op 254140 ops/sec; 2485.7 MB/s
readseq : 3.722 micros/op 268657 ops/sec; 2627.7 MB/s
readseq : 3.149 micros/op 317605 ops/sec; 3106.5 MB/s
readseq : 3.125 micros/op 320024 ops/sec; 3130.1 MB/s
readseq : 4.075 micros/op 245374 ops/sec; 2400.0 MB/s
```
```
[Everything in Memtable | 10K operands | 10 KB each | 10 operand per key]
DEBUG_LEVEL=0 make db_bench -j64 && ./db_bench --benchmarks="mergerandom,readseq,readseq,readseq,readseq,readseq" --merge_operator="max" --merge_keys=1000 --num=10000 --disable_auto_compactions --value_size=10240 --write_buffer_size=1000000000
[FullMergeV2]
readseq : 3.472 micros/op 288018 ops/sec; 2817.1 MB/s
readseq : 2.304 micros/op 434027 ops/sec; 4245.2 MB/s
readseq : 1.163 micros/op 859845 ops/sec; 8410.0 MB/s
readseq : 1.192 micros/op 838926 ops/sec; 8205.4 MB/s
readseq : 1.250 micros/op 800000 ops/sec; 7824.7 MB/s
[master]
readseq : 24.025 micros/op 41623 ops/sec; 407.1 MB/s
readseq : 18.489 micros/op 54086 ops/sec; 529.0 MB/s
readseq : 18.693 micros/op 53495 ops/sec; 523.2 MB/s
readseq : 23.621 micros/op 42335 ops/sec; 414.1 MB/s
readseq : 18.775 micros/op 53262 ops/sec; 521.0 MB/s
```
```
[Everything in Block cache | 10K operands | 10 KB each | 1 operand per key]
[FullMergeV2]
$ DEBUG_LEVEL=0 make db_bench -j64 && ./db_bench --benchmarks="readseq,readseq,readseq,readseq,readseq" --merge_operator="max" --num=100000 --db="/dev/shm/merge-random-10K-10KB" --cache_size=1000000000 --use_existing_db --disable_auto_compactions
readseq : 14.741 micros/op 67837 ops/sec; 663.5 MB/s
readseq : 1.029 micros/op 971446 ops/sec; 9501.6 MB/s
readseq : 0.974 micros/op 1026229 ops/sec; 10037.4 MB/s
readseq : 0.965 micros/op 1036080 ops/sec; 10133.8 MB/s
readseq : 0.943 micros/op 1060657 ops/sec; 10374.2 MB/s
[master]
readseq : 16.735 micros/op 59755 ops/sec; 584.5 MB/s
readseq : 3.029 micros/op 330151 ops/sec; 3229.2 MB/s
readseq : 3.136 micros/op 318883 ops/sec; 3119.0 MB/s
readseq : 3.065 micros/op 326245 ops/sec; 3191.0 MB/s
readseq : 3.014 micros/op 331813 ops/sec; 3245.4 MB/s
```
```
[Everything in Block cache | 10K operands | 10 KB each | 10 operand per key]
DEBUG_LEVEL=0 make db_bench -j64 && ./db_bench --benchmarks="readseq,readseq,readseq,readseq,readseq" --merge_operator="max" --num=100000 --db="/dev/shm/merge-random-10-operands-10K-10KB" --cache_size=1000000000 --use_existing_db --disable_auto_compactions
[FullMergeV2]
readseq : 24.325 micros/op 41109 ops/sec; 402.1 MB/s
readseq : 1.470 micros/op 680272 ops/sec; 6653.7 MB/s
readseq : 1.231 micros/op 812347 ops/sec; 7945.5 MB/s
readseq : 1.091 micros/op 916590 ops/sec; 8965.1 MB/s
readseq : 1.109 micros/op 901713 ops/sec; 8819.6 MB/s
[master]
readseq : 27.257 micros/op 36687 ops/sec; 358.8 MB/s
readseq : 4.443 micros/op 225073 ops/sec; 2201.4 MB/s
readseq : 5.830 micros/op 171526 ops/sec; 1677.7 MB/s
readseq : 4.173 micros/op 239635 ops/sec; 2343.8 MB/s
readseq : 4.150 micros/op 240963 ops/sec; 2356.8 MB/s
```
Test Plan: COMPILE_WITH_ASAN=1 make check -j64
Reviewers: yhchiang, andrewkr, sdong
Reviewed By: sdong
Subscribers: lovro, andrewkr, dhruba
Differential Revision: https://reviews.facebook.net/D57075
2016-07-20 18:49:03 +02:00
|
|
|
DEFINE_bool(use_full_merge_v1, false,
|
|
|
|
"On true, use a merge operator that implement the deprecated "
|
|
|
|
"version of FullMerge");
|
Benchmarking for Merge Operator
Summary:
Updated db_bench and utilities/merge_operators.h to allow for dynamic benchmarking
of merge operators in db_bench. Added a new test (--benchmarks=mergerandom), which performs
a bunch of random Merge() operations over random keys. Also added a "--merge_operator=" flag
so that the tester can easily benchmark different merge operators. Currently supports
the PutOperator and UInt64Add operator. Support for stringappend or list append may come later.
Test Plan:
1. make db_bench
2. Test the PutOperator (simulating Put) as follows:
./db_bench --benchmarks=fillrandom,readrandom,updaterandom,readrandom,mergerandom,readrandom --merge_operator=put
--threads=2
3. Test the UInt64AddOperator (simulating numeric addition) similarly:
./db_bench --value_size=8 --benchmarks=fillrandom,readrandom,updaterandom,readrandom,mergerandom,readrandom
--merge_operator=uint64add --threads=2
Reviewers: haobo, dhruba, zshao, MarkCallaghan
Reviewed By: haobo
CC: leveldb
Differential Revision: https://reviews.facebook.net/D11535
2013-08-16 02:13:07 +02:00
|
|
|
|
2013-10-04 06:49:15 +02:00
|
|
|
namespace rocksdb {
|
2012-10-03 18:58:45 +02:00
|
|
|
|
2013-08-15 01:58:36 +02:00
|
|
|
// convert long to a big-endian slice key
|
2015-11-19 20:47:12 +01:00
|
|
|
static std::string Key(int64_t val) {
|
2013-08-15 01:58:36 +02:00
|
|
|
std::string little_endian_key;
|
|
|
|
std::string big_endian_key;
|
|
|
|
PutFixed64(&little_endian_key, val);
|
|
|
|
assert(little_endian_key.size() == sizeof(val));
|
|
|
|
big_endian_key.resize(sizeof(val));
|
2015-11-19 20:47:12 +01:00
|
|
|
for (size_t i = 0 ; i < sizeof(val); ++i) {
|
2013-08-15 01:58:36 +02:00
|
|
|
big_endian_key[i] = little_endian_key[sizeof(val) - 1 - i];
|
|
|
|
}
|
|
|
|
return big_endian_key;
|
|
|
|
}
|
|
|
|
|
2018-08-24 23:57:37 +02:00
|
|
|
static bool GetIntVal(std::string big_endian_key, uint64_t *key_p) {
|
|
|
|
unsigned int size_key = sizeof(*key_p);
|
|
|
|
assert(big_endian_key.size() == size_key);
|
|
|
|
std::string little_endian_key;
|
|
|
|
little_endian_key.resize(size_key);
|
|
|
|
for (size_t i = 0 ; i < size_key; ++i) {
|
|
|
|
little_endian_key[i] = big_endian_key[size_key - 1 - i];
|
|
|
|
}
|
|
|
|
Slice little_endian_slice = Slice(little_endian_key);
|
|
|
|
return GetFixed64(&little_endian_slice, key_p);
|
|
|
|
}
|
|
|
|
|
hints for narrowing down FindFile range and avoiding checking unrelevant L0 files
Summary:
The file tree structure in Version is prebuilt and the range of each file is known.
On the Get() code path, we do binary search in FindFile() by comparing
target key with each file's largest key and also check the range for each L0 file.
With some pre-calculated knowledge, each key comparision that has been done can serve
as a hint to narrow down further searches:
(1) If a key falls within a L0 file's range, we can safely skip the next
file if its range does not overlap with the current one.
(2) If a key falls within a file's range in level L0 - Ln-1, we should only
need to binary search in the next level for files that overlap with the current one.
(1) will be able to skip some files depending one the key distribution.
(2) can greatly reduce the range of binary search, especially for bottom
levels, given that one file most likely only overlaps with N files from
the level below (where N is max_bytes_for_level_multiplier). So on level
L, we will only look at ~N files instead of N^L files.
Some inital results: measured with 500M key DB, when write is light (10k/s = 1.2M/s), this
improves QPS ~7% on top of blocked bloom. When write is heavier (80k/s =
9.6M/s), it gives us ~13% improvement.
Test Plan: make all check
Reviewers: haobo, igor, dhruba, sdong, yhchiang
Reviewed By: haobo
CC: leveldb
Differential Revision: https://reviews.facebook.net/D17205
2014-04-21 18:10:12 +02:00
|
|
|
static std::string StringToHex(const std::string& str) {
|
|
|
|
std::string result = "0x";
|
2016-03-30 06:25:12 +02:00
|
|
|
result.append(Slice(str).ToString(true));
|
hints for narrowing down FindFile range and avoiding checking unrelevant L0 files
Summary:
The file tree structure in Version is prebuilt and the range of each file is known.
On the Get() code path, we do binary search in FindFile() by comparing
target key with each file's largest key and also check the range for each L0 file.
With some pre-calculated knowledge, each key comparision that has been done can serve
as a hint to narrow down further searches:
(1) If a key falls within a L0 file's range, we can safely skip the next
file if its range does not overlap with the current one.
(2) If a key falls within a file's range in level L0 - Ln-1, we should only
need to binary search in the next level for files that overlap with the current one.
(1) will be able to skip some files depending one the key distribution.
(2) can greatly reduce the range of binary search, especially for bottom
levels, given that one file most likely only overlaps with N files from
the level below (where N is max_bytes_for_level_multiplier). So on level
L, we will only look at ~N files instead of N^L files.
Some inital results: measured with 500M key DB, when write is light (10k/s = 1.2M/s), this
improves QPS ~7% on top of blocked bloom. When write is heavier (80k/s =
9.6M/s), it gives us ~13% improvement.
Test Plan: make all check
Reviewers: haobo, igor, dhruba, sdong, yhchiang
Reviewed By: haobo
CC: leveldb
Differential Revision: https://reviews.facebook.net/D17205
2014-04-21 18:10:12 +02:00
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2012-10-03 18:58:45 +02:00
|
|
|
class StressTest;
|
|
|
|
namespace {
|
|
|
|
|
|
|
|
class Stats {
|
|
|
|
private:
|
2015-11-19 20:47:12 +01:00
|
|
|
uint64_t start_;
|
|
|
|
uint64_t finish_;
|
|
|
|
double seconds_;
|
2012-10-03 18:58:45 +02:00
|
|
|
long done_;
|
2013-08-15 01:58:36 +02:00
|
|
|
long gets_;
|
|
|
|
long prefixes_;
|
2012-10-03 18:58:45 +02:00
|
|
|
long writes_;
|
2012-11-08 00:35:08 +01:00
|
|
|
long deletes_;
|
Support for SingleDelete()
Summary:
This patch fixes #7460559. It introduces SingleDelete as a new database
operation. This operation can be used to delete keys that were never
overwritten (no put following another put of the same key). If an overwritten
key is single deleted the behavior is undefined. Single deletion of a
non-existent key has no effect but multiple consecutive single deletions are
not allowed (see limitations).
In contrast to the conventional Delete() operation, the deletion entry is
removed along with the value when the two are lined up in a compaction. Note:
The semantics are similar to @igor's prototype that allowed to have this
behavior on the granularity of a column family (
https://reviews.facebook.net/D42093 ). This new patch, however, is more
aggressive when it comes to removing tombstones: It removes the SingleDelete
together with the value whenever there is no snapshot between them while the
older patch only did this when the sequence number of the deletion was older
than the earliest snapshot.
Most of the complex additions are in the Compaction Iterator, all other changes
should be relatively straightforward. The patch also includes basic support for
single deletions in db_stress and db_bench.
Limitations:
- Not compatible with cuckoo hash tables
- Single deletions cannot be used in combination with merges and normal
deletions on the same key (other keys are not affected by this)
- Consecutive single deletions are currently not allowed (and older version of
this patch supported this so it could be resurrected if needed)
Test Plan: make all check
Reviewers: yhchiang, sdong, rven, anthony, yoshinorim, igor
Reviewed By: igor
Subscribers: maykov, dhruba, leveldb
Differential Revision: https://reviews.facebook.net/D43179
2015-09-17 20:42:56 +02:00
|
|
|
size_t single_deletes_;
|
2013-08-15 01:58:36 +02:00
|
|
|
long iterator_size_sums_;
|
2013-02-21 00:57:27 +01:00
|
|
|
long founds_;
|
2013-09-20 01:47:24 +02:00
|
|
|
long iterations_;
|
2016-12-07 21:59:59 +01:00
|
|
|
long range_deletions_;
|
|
|
|
long covered_by_range_deletions_;
|
2013-02-21 00:57:27 +01:00
|
|
|
long errors_;
|
2016-04-19 23:36:09 +02:00
|
|
|
long num_compact_files_succeed_;
|
|
|
|
long num_compact_files_failed_;
|
2012-10-03 18:58:45 +02:00
|
|
|
int next_report_;
|
|
|
|
size_t bytes_;
|
2015-11-19 20:47:12 +01:00
|
|
|
uint64_t last_op_finish_;
|
2013-02-15 20:53:17 +01:00
|
|
|
HistogramImpl hist_;
|
2012-10-03 18:58:45 +02:00
|
|
|
|
|
|
|
public:
|
|
|
|
Stats() { }
|
|
|
|
|
|
|
|
void Start() {
|
|
|
|
next_report_ = 100;
|
|
|
|
hist_.Clear();
|
|
|
|
done_ = 0;
|
2013-08-15 01:58:36 +02:00
|
|
|
gets_ = 0;
|
|
|
|
prefixes_ = 0;
|
2012-10-03 18:58:45 +02:00
|
|
|
writes_ = 0;
|
2012-11-08 00:35:08 +01:00
|
|
|
deletes_ = 0;
|
Support for SingleDelete()
Summary:
This patch fixes #7460559. It introduces SingleDelete as a new database
operation. This operation can be used to delete keys that were never
overwritten (no put following another put of the same key). If an overwritten
key is single deleted the behavior is undefined. Single deletion of a
non-existent key has no effect but multiple consecutive single deletions are
not allowed (see limitations).
In contrast to the conventional Delete() operation, the deletion entry is
removed along with the value when the two are lined up in a compaction. Note:
The semantics are similar to @igor's prototype that allowed to have this
behavior on the granularity of a column family (
https://reviews.facebook.net/D42093 ). This new patch, however, is more
aggressive when it comes to removing tombstones: It removes the SingleDelete
together with the value whenever there is no snapshot between them while the
older patch only did this when the sequence number of the deletion was older
than the earliest snapshot.
Most of the complex additions are in the Compaction Iterator, all other changes
should be relatively straightforward. The patch also includes basic support for
single deletions in db_stress and db_bench.
Limitations:
- Not compatible with cuckoo hash tables
- Single deletions cannot be used in combination with merges and normal
deletions on the same key (other keys are not affected by this)
- Consecutive single deletions are currently not allowed (and older version of
this patch supported this so it could be resurrected if needed)
Test Plan: make all check
Reviewers: yhchiang, sdong, rven, anthony, yoshinorim, igor
Reviewed By: igor
Subscribers: maykov, dhruba, leveldb
Differential Revision: https://reviews.facebook.net/D43179
2015-09-17 20:42:56 +02:00
|
|
|
single_deletes_ = 0;
|
2013-08-15 01:58:36 +02:00
|
|
|
iterator_size_sums_ = 0;
|
2013-02-21 00:57:27 +01:00
|
|
|
founds_ = 0;
|
2013-09-20 01:47:24 +02:00
|
|
|
iterations_ = 0;
|
2016-12-07 21:59:59 +01:00
|
|
|
range_deletions_ = 0;
|
|
|
|
covered_by_range_deletions_ = 0;
|
2013-02-21 00:57:27 +01:00
|
|
|
errors_ = 0;
|
2012-10-03 18:58:45 +02:00
|
|
|
bytes_ = 0;
|
|
|
|
seconds_ = 0;
|
2016-04-19 23:36:09 +02:00
|
|
|
num_compact_files_succeed_ = 0;
|
|
|
|
num_compact_files_failed_ = 0;
|
2012-10-03 18:58:45 +02:00
|
|
|
start_ = FLAGS_env->NowMicros();
|
|
|
|
last_op_finish_ = start_;
|
|
|
|
finish_ = start_;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Merge(const Stats& other) {
|
|
|
|
hist_.Merge(other.hist_);
|
|
|
|
done_ += other.done_;
|
2013-08-15 01:58:36 +02:00
|
|
|
gets_ += other.gets_;
|
|
|
|
prefixes_ += other.prefixes_;
|
2012-10-03 18:58:45 +02:00
|
|
|
writes_ += other.writes_;
|
2012-11-08 00:35:08 +01:00
|
|
|
deletes_ += other.deletes_;
|
Support for SingleDelete()
Summary:
This patch fixes #7460559. It introduces SingleDelete as a new database
operation. This operation can be used to delete keys that were never
overwritten (no put following another put of the same key). If an overwritten
key is single deleted the behavior is undefined. Single deletion of a
non-existent key has no effect but multiple consecutive single deletions are
not allowed (see limitations).
In contrast to the conventional Delete() operation, the deletion entry is
removed along with the value when the two are lined up in a compaction. Note:
The semantics are similar to @igor's prototype that allowed to have this
behavior on the granularity of a column family (
https://reviews.facebook.net/D42093 ). This new patch, however, is more
aggressive when it comes to removing tombstones: It removes the SingleDelete
together with the value whenever there is no snapshot between them while the
older patch only did this when the sequence number of the deletion was older
than the earliest snapshot.
Most of the complex additions are in the Compaction Iterator, all other changes
should be relatively straightforward. The patch also includes basic support for
single deletions in db_stress and db_bench.
Limitations:
- Not compatible with cuckoo hash tables
- Single deletions cannot be used in combination with merges and normal
deletions on the same key (other keys are not affected by this)
- Consecutive single deletions are currently not allowed (and older version of
this patch supported this so it could be resurrected if needed)
Test Plan: make all check
Reviewers: yhchiang, sdong, rven, anthony, yoshinorim, igor
Reviewed By: igor
Subscribers: maykov, dhruba, leveldb
Differential Revision: https://reviews.facebook.net/D43179
2015-09-17 20:42:56 +02:00
|
|
|
single_deletes_ += other.single_deletes_;
|
2013-08-15 01:58:36 +02:00
|
|
|
iterator_size_sums_ += other.iterator_size_sums_;
|
2013-02-23 20:11:16 +01:00
|
|
|
founds_ += other.founds_;
|
2013-09-20 01:47:24 +02:00
|
|
|
iterations_ += other.iterations_;
|
2016-12-07 21:59:59 +01:00
|
|
|
range_deletions_ += other.range_deletions_;
|
|
|
|
covered_by_range_deletions_ = other.covered_by_range_deletions_;
|
2013-02-23 20:11:16 +01:00
|
|
|
errors_ += other.errors_;
|
2012-10-03 18:58:45 +02:00
|
|
|
bytes_ += other.bytes_;
|
|
|
|
seconds_ += other.seconds_;
|
2016-04-19 23:36:09 +02:00
|
|
|
num_compact_files_succeed_ += other.num_compact_files_succeed_;
|
|
|
|
num_compact_files_failed_ += other.num_compact_files_failed_;
|
2012-10-03 18:58:45 +02:00
|
|
|
if (other.start_ < start_) start_ = other.start_;
|
|
|
|
if (other.finish_ > finish_) finish_ = other.finish_;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Stop() {
|
|
|
|
finish_ = FLAGS_env->NowMicros();
|
|
|
|
seconds_ = (finish_ - start_) * 1e-6;
|
|
|
|
}
|
|
|
|
|
|
|
|
void FinishedSingleOp() {
|
|
|
|
if (FLAGS_histogram) {
|
2015-11-19 20:47:12 +01:00
|
|
|
auto now = FLAGS_env->NowMicros();
|
|
|
|
auto micros = now - last_op_finish_;
|
2012-10-03 18:58:45 +02:00
|
|
|
hist_.Add(micros);
|
|
|
|
if (micros > 20000) {
|
2015-11-19 20:47:12 +01:00
|
|
|
fprintf(stdout, "long op: %" PRIu64 " micros%30s\r", micros, "");
|
2012-10-03 18:58:45 +02:00
|
|
|
}
|
|
|
|
last_op_finish_ = now;
|
|
|
|
}
|
|
|
|
|
2014-03-19 17:58:41 +01:00
|
|
|
done_++;
|
2014-03-21 00:52:59 +01:00
|
|
|
if (FLAGS_progress_reports) {
|
2014-03-19 17:58:41 +01:00
|
|
|
if (done_ >= next_report_) {
|
|
|
|
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(stdout, "... finished %ld ops%30s\r", done_, "");
|
|
|
|
}
|
2012-10-03 18:58:45 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-10-29 17:52:54 +01:00
|
|
|
void AddBytesForWrites(long nwrites, size_t nbytes) {
|
2013-02-21 00:57:27 +01:00
|
|
|
writes_ += nwrites;
|
|
|
|
bytes_ += nbytes;
|
|
|
|
}
|
|
|
|
|
2018-10-29 17:52:54 +01:00
|
|
|
void AddGets(long ngets, long nfounds) {
|
2013-02-23 20:11:16 +01:00
|
|
|
founds_ += nfounds;
|
|
|
|
gets_ += ngets;
|
2012-10-03 18:58:45 +02:00
|
|
|
}
|
|
|
|
|
2018-10-29 17:52:54 +01:00
|
|
|
void AddPrefixes(long nprefixes, long count) {
|
2013-08-15 01:58:36 +02:00
|
|
|
prefixes_ += nprefixes;
|
|
|
|
iterator_size_sums_ += count;
|
|
|
|
}
|
|
|
|
|
2018-10-29 17:52:54 +01:00
|
|
|
void AddIterations(long n) { iterations_ += n; }
|
2013-09-20 01:47:24 +02:00
|
|
|
|
2018-10-29 17:52:54 +01:00
|
|
|
void AddDeletes(long n) { deletes_ += n; }
|
2013-08-15 01:58:36 +02:00
|
|
|
|
Support for SingleDelete()
Summary:
This patch fixes #7460559. It introduces SingleDelete as a new database
operation. This operation can be used to delete keys that were never
overwritten (no put following another put of the same key). If an overwritten
key is single deleted the behavior is undefined. Single deletion of a
non-existent key has no effect but multiple consecutive single deletions are
not allowed (see limitations).
In contrast to the conventional Delete() operation, the deletion entry is
removed along with the value when the two are lined up in a compaction. Note:
The semantics are similar to @igor's prototype that allowed to have this
behavior on the granularity of a column family (
https://reviews.facebook.net/D42093 ). This new patch, however, is more
aggressive when it comes to removing tombstones: It removes the SingleDelete
together with the value whenever there is no snapshot between them while the
older patch only did this when the sequence number of the deletion was older
than the earliest snapshot.
Most of the complex additions are in the Compaction Iterator, all other changes
should be relatively straightforward. The patch also includes basic support for
single deletions in db_stress and db_bench.
Limitations:
- Not compatible with cuckoo hash tables
- Single deletions cannot be used in combination with merges and normal
deletions on the same key (other keys are not affected by this)
- Consecutive single deletions are currently not allowed (and older version of
this patch supported this so it could be resurrected if needed)
Test Plan: make all check
Reviewers: yhchiang, sdong, rven, anthony, yoshinorim, igor
Reviewed By: igor
Subscribers: maykov, dhruba, leveldb
Differential Revision: https://reviews.facebook.net/D43179
2015-09-17 20:42:56 +02:00
|
|
|
void AddSingleDeletes(size_t n) { single_deletes_ += n; }
|
|
|
|
|
2018-10-29 17:52:54 +01:00
|
|
|
void AddRangeDeletions(long n) { range_deletions_ += n; }
|
2016-12-07 21:59:59 +01:00
|
|
|
|
2018-10-29 17:52:54 +01:00
|
|
|
void AddCoveredByRangeDeletions(long n) { covered_by_range_deletions_ += n; }
|
2016-12-07 21:59:59 +01:00
|
|
|
|
2018-10-29 17:52:54 +01:00
|
|
|
void AddErrors(long n) { errors_ += n; }
|
2012-11-08 00:35:08 +01:00
|
|
|
|
2018-10-29 17:52:54 +01:00
|
|
|
void AddNumCompactFilesSucceed(long n) { num_compact_files_succeed_ += n; }
|
2016-04-19 23:36:09 +02:00
|
|
|
|
2018-10-29 17:52:54 +01:00
|
|
|
void AddNumCompactFilesFailed(long n) { num_compact_files_failed_ += n; }
|
2016-04-19 23:36:09 +02:00
|
|
|
|
2012-10-03 18:58:45 +02:00
|
|
|
void Report(const char* name) {
|
|
|
|
std::string extra;
|
|
|
|
if (bytes_ < 1 || done_ < 1) {
|
|
|
|
fprintf(stderr, "No writes or ops?\n");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
double elapsed = (finish_ - start_) * 1e-6;
|
|
|
|
double bytes_mb = bytes_ / 1048576.0;
|
|
|
|
double rate = bytes_mb / elapsed;
|
|
|
|
double throughput = (double)done_/elapsed;
|
|
|
|
|
|
|
|
fprintf(stdout, "%-12s: ", name);
|
|
|
|
fprintf(stdout, "%.3f micros/op %ld ops/sec\n",
|
|
|
|
seconds_ * 1e6 / done_, (long)throughput);
|
|
|
|
fprintf(stdout, "%-12s: Wrote %.2f MB (%.2f MB/sec) (%ld%% of %ld ops)\n",
|
|
|
|
"", bytes_mb, rate, (100*writes_)/done_, done_);
|
2013-02-23 20:11:16 +01:00
|
|
|
fprintf(stdout, "%-12s: Wrote %ld times\n", "", writes_);
|
2012-11-08 00:35:08 +01:00
|
|
|
fprintf(stdout, "%-12s: Deleted %ld times\n", "", deletes_);
|
2015-12-08 17:38:21 +01:00
|
|
|
fprintf(stdout, "%-12s: Single deleted %" ROCKSDB_PRIszt " times\n", "",
|
|
|
|
single_deletes_);
|
2013-08-13 22:58:02 +02:00
|
|
|
fprintf(stdout, "%-12s: %ld read and %ld found the key\n", "",
|
|
|
|
gets_, founds_);
|
2013-08-15 01:58:36 +02:00
|
|
|
fprintf(stdout, "%-12s: Prefix scanned %ld times\n", "", prefixes_);
|
|
|
|
fprintf(stdout, "%-12s: Iterator size sum is %ld\n", "",
|
|
|
|
iterator_size_sums_);
|
2013-09-20 01:47:24 +02:00
|
|
|
fprintf(stdout, "%-12s: Iterated %ld times\n", "", iterations_);
|
2016-12-07 21:59:59 +01:00
|
|
|
fprintf(stdout, "%-12s: Deleted %ld key-ranges\n", "", range_deletions_);
|
|
|
|
fprintf(stdout, "%-12s: Range deletions covered %ld keys\n", "",
|
|
|
|
covered_by_range_deletions_);
|
|
|
|
|
2013-02-21 00:57:27 +01:00
|
|
|
fprintf(stdout, "%-12s: Got errors %ld times\n", "", errors_);
|
2016-04-19 23:36:09 +02:00
|
|
|
fprintf(stdout, "%-12s: %ld CompactFiles() succeed\n", "",
|
|
|
|
num_compact_files_succeed_);
|
2016-04-29 00:59:33 +02:00
|
|
|
fprintf(stdout, "%-12s: %ld CompactFiles() did not succeed\n", "",
|
2016-04-19 23:36:09 +02:00
|
|
|
num_compact_files_failed_);
|
2012-10-03 18:58:45 +02:00
|
|
|
|
|
|
|
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.
|
|
|
|
class SharedState {
|
|
|
|
public:
|
2018-04-30 21:23:45 +02:00
|
|
|
// indicates a key may have any value (or not be present) as an operation on
|
|
|
|
// it is incomplete.
|
|
|
|
static const uint32_t UNKNOWN_SENTINEL;
|
|
|
|
// indicates a key should definitely be deleted
|
|
|
|
static const uint32_t DELETION_SENTINEL;
|
2012-10-03 18:58:45 +02:00
|
|
|
|
2014-04-24 15:46:50 +02:00
|
|
|
explicit SharedState(StressTest* stress_test)
|
|
|
|
: cv_(&mu_),
|
2014-11-11 22:47:22 +01:00
|
|
|
seed_(static_cast<uint32_t>(FLAGS_seed)),
|
2014-04-24 15:46:50 +02:00
|
|
|
max_key_(FLAGS_max_key),
|
2014-11-11 22:47:22 +01:00
|
|
|
log2_keys_per_lock_(static_cast<uint32_t>(FLAGS_log2_keys_per_lock)),
|
2014-04-24 15:46:50 +02:00
|
|
|
num_threads_(FLAGS_threads),
|
|
|
|
num_initialized_(0),
|
|
|
|
num_populated_(0),
|
|
|
|
vote_reopen_(0),
|
|
|
|
num_done_(0),
|
|
|
|
start_(false),
|
|
|
|
start_verify_(false),
|
2014-06-02 19:12:41 +02:00
|
|
|
should_stop_bg_thread_(false),
|
|
|
|
bg_thread_finished_(false),
|
2014-04-24 15:46:50 +02:00
|
|
|
stress_test_(stress_test),
|
Support for SingleDelete()
Summary:
This patch fixes #7460559. It introduces SingleDelete as a new database
operation. This operation can be used to delete keys that were never
overwritten (no put following another put of the same key). If an overwritten
key is single deleted the behavior is undefined. Single deletion of a
non-existent key has no effect but multiple consecutive single deletions are
not allowed (see limitations).
In contrast to the conventional Delete() operation, the deletion entry is
removed along with the value when the two are lined up in a compaction. Note:
The semantics are similar to @igor's prototype that allowed to have this
behavior on the granularity of a column family (
https://reviews.facebook.net/D42093 ). This new patch, however, is more
aggressive when it comes to removing tombstones: It removes the SingleDelete
together with the value whenever there is no snapshot between them while the
older patch only did this when the sequence number of the deletion was older
than the earliest snapshot.
Most of the complex additions are in the Compaction Iterator, all other changes
should be relatively straightforward. The patch also includes basic support for
single deletions in db_stress and db_bench.
Limitations:
- Not compatible with cuckoo hash tables
- Single deletions cannot be used in combination with merges and normal
deletions on the same key (other keys are not affected by this)
- Consecutive single deletions are currently not allowed (and older version of
this patch supported this so it could be resurrected if needed)
Test Plan: make all check
Reviewers: yhchiang, sdong, rven, anthony, yoshinorim, igor
Reviewed By: igor
Subscribers: maykov, dhruba, leveldb
Differential Revision: https://reviews.facebook.net/D43179
2015-09-17 20:42:56 +02:00
|
|
|
verification_failure_(false),
|
2018-04-30 21:23:45 +02:00
|
|
|
no_overwrite_ids_(FLAGS_column_families),
|
|
|
|
values_(nullptr) {
|
Support for SingleDelete()
Summary:
This patch fixes #7460559. It introduces SingleDelete as a new database
operation. This operation can be used to delete keys that were never
overwritten (no put following another put of the same key). If an overwritten
key is single deleted the behavior is undefined. Single deletion of a
non-existent key has no effect but multiple consecutive single deletions are
not allowed (see limitations).
In contrast to the conventional Delete() operation, the deletion entry is
removed along with the value when the two are lined up in a compaction. Note:
The semantics are similar to @igor's prototype that allowed to have this
behavior on the granularity of a column family (
https://reviews.facebook.net/D42093 ). This new patch, however, is more
aggressive when it comes to removing tombstones: It removes the SingleDelete
together with the value whenever there is no snapshot between them while the
older patch only did this when the sequence number of the deletion was older
than the earliest snapshot.
Most of the complex additions are in the Compaction Iterator, all other changes
should be relatively straightforward. The patch also includes basic support for
single deletions in db_stress and db_bench.
Limitations:
- Not compatible with cuckoo hash tables
- Single deletions cannot be used in combination with merges and normal
deletions on the same key (other keys are not affected by this)
- Consecutive single deletions are currently not allowed (and older version of
this patch supported this so it could be resurrected if needed)
Test Plan: make all check
Reviewers: yhchiang, sdong, rven, anthony, yoshinorim, igor
Reviewed By: igor
Subscribers: maykov, dhruba, leveldb
Differential Revision: https://reviews.facebook.net/D43179
2015-09-17 20:42:56 +02:00
|
|
|
// Pick random keys in each column family that will not experience
|
|
|
|
// overwrite
|
|
|
|
|
|
|
|
printf("Choosing random keys with no overwrite\n");
|
2018-04-14 07:10:00 +02:00
|
|
|
Random64 rnd(seed_);
|
|
|
|
// Start with the identity permutation. Subsequent iterations of
|
|
|
|
// for loop below will start with perm of previous for loop
|
|
|
|
int64_t *permutation = new int64_t[max_key_];
|
|
|
|
for (int64_t i = 0; i < max_key_; i++) {
|
|
|
|
permutation[i] = i;
|
|
|
|
}
|
2018-06-13 22:37:21 +02:00
|
|
|
// Now do the Knuth shuffle
|
|
|
|
int64_t num_no_overwrite_keys = (max_key_ * FLAGS_nooverwritepercent) / 100;
|
|
|
|
// Only need to figure out first num_no_overwrite_keys of permutation
|
|
|
|
no_overwrite_ids_.reserve(num_no_overwrite_keys);
|
|
|
|
for (int64_t i = 0; i < num_no_overwrite_keys; i++) {
|
|
|
|
int64_t rand_index = i + rnd.Next() % (max_key_ - i);
|
|
|
|
// Swap i and rand_index;
|
|
|
|
int64_t temp = permutation[i];
|
|
|
|
permutation[i] = permutation[rand_index];
|
|
|
|
permutation[rand_index] = temp;
|
|
|
|
// Fill no_overwrite_ids_ with the first num_no_overwrite_keys of
|
|
|
|
// permutation
|
|
|
|
no_overwrite_ids_.insert(permutation[i]);
|
Support for SingleDelete()
Summary:
This patch fixes #7460559. It introduces SingleDelete as a new database
operation. This operation can be used to delete keys that were never
overwritten (no put following another put of the same key). If an overwritten
key is single deleted the behavior is undefined. Single deletion of a
non-existent key has no effect but multiple consecutive single deletions are
not allowed (see limitations).
In contrast to the conventional Delete() operation, the deletion entry is
removed along with the value when the two are lined up in a compaction. Note:
The semantics are similar to @igor's prototype that allowed to have this
behavior on the granularity of a column family (
https://reviews.facebook.net/D42093 ). This new patch, however, is more
aggressive when it comes to removing tombstones: It removes the SingleDelete
together with the value whenever there is no snapshot between them while the
older patch only did this when the sequence number of the deletion was older
than the earliest snapshot.
Most of the complex additions are in the Compaction Iterator, all other changes
should be relatively straightforward. The patch also includes basic support for
single deletions in db_stress and db_bench.
Limitations:
- Not compatible with cuckoo hash tables
- Single deletions cannot be used in combination with merges and normal
deletions on the same key (other keys are not affected by this)
- Consecutive single deletions are currently not allowed (and older version of
this patch supported this so it could be resurrected if needed)
Test Plan: make all check
Reviewers: yhchiang, sdong, rven, anthony, yoshinorim, igor
Reviewed By: igor
Subscribers: maykov, dhruba, leveldb
Differential Revision: https://reviews.facebook.net/D43179
2015-09-17 20:42:56 +02:00
|
|
|
}
|
2018-04-16 08:44:08 +02:00
|
|
|
delete[] permutation;
|
Support for SingleDelete()
Summary:
This patch fixes #7460559. It introduces SingleDelete as a new database
operation. This operation can be used to delete keys that were never
overwritten (no put following another put of the same key). If an overwritten
key is single deleted the behavior is undefined. Single deletion of a
non-existent key has no effect but multiple consecutive single deletions are
not allowed (see limitations).
In contrast to the conventional Delete() operation, the deletion entry is
removed along with the value when the two are lined up in a compaction. Note:
The semantics are similar to @igor's prototype that allowed to have this
behavior on the granularity of a column family (
https://reviews.facebook.net/D42093 ). This new patch, however, is more
aggressive when it comes to removing tombstones: It removes the SingleDelete
together with the value whenever there is no snapshot between them while the
older patch only did this when the sequence number of the deletion was older
than the earliest snapshot.
Most of the complex additions are in the Compaction Iterator, all other changes
should be relatively straightforward. The patch also includes basic support for
single deletions in db_stress and db_bench.
Limitations:
- Not compatible with cuckoo hash tables
- Single deletions cannot be used in combination with merges and normal
deletions on the same key (other keys are not affected by this)
- Consecutive single deletions are currently not allowed (and older version of
this patch supported this so it could be resurrected if needed)
Test Plan: make all check
Reviewers: yhchiang, sdong, rven, anthony, yoshinorim, igor
Reviewed By: igor
Subscribers: maykov, dhruba, leveldb
Differential Revision: https://reviews.facebook.net/D43179
2015-09-17 20:42:56 +02:00
|
|
|
|
2018-04-30 21:23:45 +02:00
|
|
|
size_t expected_values_size =
|
|
|
|
sizeof(std::atomic<uint32_t>) * FLAGS_column_families * max_key_;
|
|
|
|
bool values_init_needed = false;
|
|
|
|
Status status;
|
|
|
|
if (!FLAGS_expected_values_path.empty()) {
|
|
|
|
if (!std::atomic<uint32_t>{}.is_lock_free()) {
|
|
|
|
status = Status::InvalidArgument(
|
|
|
|
"Cannot use --expected_values_path on platforms without lock-free "
|
|
|
|
"std::atomic<uint32_t>");
|
|
|
|
}
|
|
|
|
if (status.ok() && FLAGS_clear_column_family_one_in > 0) {
|
|
|
|
status = Status::InvalidArgument(
|
|
|
|
"Cannot use --expected_values_path on when "
|
|
|
|
"--clear_column_family_one_in is greater than zero.");
|
|
|
|
}
|
2018-05-14 20:01:41 +02:00
|
|
|
uint64_t size = 0;
|
2018-04-30 21:23:45 +02:00
|
|
|
if (status.ok()) {
|
|
|
|
status = FLAGS_env->GetFileSize(FLAGS_expected_values_path, &size);
|
|
|
|
}
|
2018-11-09 20:17:34 +01:00
|
|
|
std::unique_ptr<WritableFile> wfile;
|
2018-04-30 21:23:45 +02:00
|
|
|
if (status.ok() && size == 0) {
|
|
|
|
const EnvOptions soptions;
|
|
|
|
status = FLAGS_env->NewWritableFile(FLAGS_expected_values_path, &wfile,
|
|
|
|
soptions);
|
|
|
|
}
|
|
|
|
if (status.ok() && size == 0) {
|
|
|
|
std::string buf(expected_values_size, '\0');
|
|
|
|
status = wfile->Append(buf);
|
|
|
|
values_init_needed = true;
|
|
|
|
}
|
|
|
|
if (status.ok()) {
|
|
|
|
status = FLAGS_env->NewMemoryMappedFileBuffer(
|
|
|
|
FLAGS_expected_values_path, &expected_mmap_buffer_);
|
|
|
|
}
|
|
|
|
if (status.ok()) {
|
2018-05-25 00:05:00 +02:00
|
|
|
assert(expected_mmap_buffer_->GetLen() == expected_values_size);
|
2018-04-30 21:23:45 +02:00
|
|
|
values_ =
|
2018-05-25 00:05:00 +02:00
|
|
|
static_cast<std::atomic<uint32_t>*>(expected_mmap_buffer_->GetBase());
|
2018-04-30 21:23:45 +02:00
|
|
|
assert(values_ != nullptr);
|
|
|
|
} else {
|
|
|
|
fprintf(stderr, "Failed opening shared file '%s' with error: %s\n",
|
|
|
|
FLAGS_expected_values_path.c_str(), status.ToString().c_str());
|
|
|
|
assert(values_ == nullptr);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (values_ == nullptr) {
|
2018-05-05 01:33:38 +02:00
|
|
|
values_allocation_.reset(
|
|
|
|
new std::atomic<uint32_t>[FLAGS_column_families * max_key_]);
|
|
|
|
values_ = &values_allocation_[0];
|
2018-04-30 21:23:45 +02:00
|
|
|
values_init_needed = true;
|
|
|
|
}
|
|
|
|
assert(values_ != nullptr);
|
|
|
|
if (values_init_needed) {
|
|
|
|
for (int i = 0; i < FLAGS_column_families; ++i) {
|
|
|
|
for (int j = 0; j < max_key_; ++j) {
|
|
|
|
Delete(i, j, false /* pending */);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-02-21 00:57:27 +01:00
|
|
|
if (FLAGS_test_batches_snapshots) {
|
|
|
|
fprintf(stdout, "No lock creation because test_batches_snapshots set\n");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2015-11-19 20:47:12 +01:00
|
|
|
long num_locks = static_cast<long>(max_key_ >> log2_keys_per_lock_);
|
2012-10-03 18:58:45 +02:00
|
|
|
if (max_key_ & ((1 << log2_keys_per_lock_) - 1)) {
|
2014-02-27 21:13:48 +01:00
|
|
|
num_locks++;
|
|
|
|
}
|
|
|
|
fprintf(stdout, "Creating %ld locks\n", num_locks * FLAGS_column_families);
|
|
|
|
key_locks_.resize(FLAGS_column_families);
|
2015-07-02 01:13:49 +02:00
|
|
|
|
2014-02-27 21:13:48 +01:00
|
|
|
for (int i = 0; i < FLAGS_column_families; ++i) {
|
2015-07-02 01:13:49 +02:00
|
|
|
key_locks_[i].resize(num_locks);
|
|
|
|
for (auto& ptr : key_locks_[i]) {
|
|
|
|
ptr.reset(new port::Mutex);
|
|
|
|
}
|
2012-10-03 18:58:45 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-02-27 21:13:48 +01:00
|
|
|
~SharedState() {}
|
2012-10-03 18:58:45 +02:00
|
|
|
|
|
|
|
port::Mutex* GetMutex() {
|
|
|
|
return &mu_;
|
|
|
|
}
|
|
|
|
|
|
|
|
port::CondVar* GetCondVar() {
|
|
|
|
return &cv_;
|
|
|
|
}
|
|
|
|
|
|
|
|
StressTest* GetStressTest() const {
|
|
|
|
return stress_test_;
|
|
|
|
}
|
|
|
|
|
2015-11-19 20:47:12 +01:00
|
|
|
int64_t GetMaxKey() const {
|
2012-10-03 18:58:45 +02:00
|
|
|
return max_key_;
|
|
|
|
}
|
|
|
|
|
|
|
|
uint32_t GetNumThreads() const {
|
|
|
|
return num_threads_;
|
|
|
|
}
|
|
|
|
|
|
|
|
void IncInitialized() {
|
|
|
|
num_initialized_++;
|
|
|
|
}
|
|
|
|
|
2012-11-08 00:35:08 +01:00
|
|
|
void IncOperated() {
|
2012-10-03 18:58:45 +02:00
|
|
|
num_populated_++;
|
|
|
|
}
|
|
|
|
|
|
|
|
void IncDone() {
|
|
|
|
num_done_++;
|
|
|
|
}
|
|
|
|
|
2012-11-09 22:04:12 +01:00
|
|
|
void IncVotedReopen() {
|
|
|
|
vote_reopen_ = (vote_reopen_ + 1) % num_threads_;
|
|
|
|
}
|
|
|
|
|
2012-10-03 18:58:45 +02:00
|
|
|
bool AllInitialized() const {
|
|
|
|
return num_initialized_ >= num_threads_;
|
|
|
|
}
|
|
|
|
|
2012-11-08 00:35:08 +01:00
|
|
|
bool AllOperated() const {
|
2012-10-03 18:58:45 +02:00
|
|
|
return num_populated_ >= num_threads_;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool AllDone() const {
|
|
|
|
return num_done_ >= num_threads_;
|
|
|
|
}
|
|
|
|
|
2012-11-09 22:04:12 +01:00
|
|
|
bool AllVotedReopen() {
|
|
|
|
return (vote_reopen_ == 0);
|
|
|
|
}
|
|
|
|
|
2012-10-03 18:58:45 +02:00
|
|
|
void SetStart() {
|
|
|
|
start_ = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
void SetStartVerify() {
|
|
|
|
start_verify_ = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool Started() const {
|
|
|
|
return start_;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool VerifyStarted() const {
|
|
|
|
return start_verify_;
|
|
|
|
}
|
|
|
|
|
2014-04-24 15:22:58 +02:00
|
|
|
void SetVerificationFailure() { verification_failure_.store(true); }
|
|
|
|
|
|
|
|
bool HasVerificationFailedYet() { return verification_failure_.load(); }
|
|
|
|
|
2017-08-31 19:18:58 +02:00
|
|
|
port::Mutex* GetMutexForKey(int cf, int64_t key) {
|
2015-07-02 01:13:49 +02:00
|
|
|
return key_locks_[cf][key >> log2_keys_per_lock_].get();
|
2012-10-03 18:58:45 +02:00
|
|
|
}
|
|
|
|
|
2014-02-27 21:13:48 +01:00
|
|
|
void LockColumnFamily(int cf) {
|
|
|
|
for (auto& mutex : key_locks_[cf]) {
|
2015-07-02 01:13:49 +02:00
|
|
|
mutex->Lock();
|
2014-02-27 21:13:48 +01:00
|
|
|
}
|
2012-10-03 18:58:45 +02:00
|
|
|
}
|
|
|
|
|
2014-02-27 21:13:48 +01:00
|
|
|
void UnlockColumnFamily(int cf) {
|
|
|
|
for (auto& mutex : key_locks_[cf]) {
|
2015-07-02 01:13:49 +02:00
|
|
|
mutex->Unlock();
|
2014-02-27 21:13:48 +01:00
|
|
|
}
|
2012-10-03 18:58:45 +02:00
|
|
|
}
|
|
|
|
|
2018-04-30 21:23:45 +02:00
|
|
|
std::atomic<uint32_t>& Value(int cf, int64_t key) const {
|
|
|
|
return values_[cf * max_key_ + key];
|
|
|
|
}
|
|
|
|
|
2014-02-27 21:13:48 +01:00
|
|
|
void ClearColumnFamily(int cf) {
|
2018-04-30 21:23:45 +02:00
|
|
|
std::fill(&Value(cf, 0 /* key */), &Value(cf + 1, 0 /* key */),
|
|
|
|
DELETION_SENTINEL);
|
2012-11-08 00:35:08 +01:00
|
|
|
}
|
|
|
|
|
2018-04-30 21:23:45 +02:00
|
|
|
// @param pending True if the update may have started but is not yet
|
|
|
|
// guaranteed finished. This is useful for crash-recovery testing when the
|
|
|
|
// process may crash before updating the expected values array.
|
|
|
|
void Put(int cf, int64_t key, uint32_t value_base, bool pending) {
|
|
|
|
if (!pending) {
|
|
|
|
// prevent expected-value update from reordering before Write
|
|
|
|
std::atomic_thread_fence(std::memory_order_release);
|
|
|
|
}
|
|
|
|
Value(cf, key).store(pending ? UNKNOWN_SENTINEL : value_base,
|
|
|
|
std::memory_order_relaxed);
|
|
|
|
if (pending) {
|
|
|
|
// prevent Write from reordering before expected-value update
|
|
|
|
std::atomic_thread_fence(std::memory_order_release);
|
|
|
|
}
|
2012-10-03 18:58:45 +02:00
|
|
|
}
|
|
|
|
|
2018-04-30 21:23:45 +02:00
|
|
|
uint32_t Get(int cf, int64_t key) const { return Value(cf, key); }
|
2014-02-27 21:13:48 +01:00
|
|
|
|
2018-04-30 21:23:45 +02:00
|
|
|
// @param pending See comment above Put()
|
|
|
|
// Returns true if the key was not yet deleted.
|
|
|
|
bool Delete(int cf, int64_t key, bool pending) {
|
|
|
|
if (Value(cf, key) == DELETION_SENTINEL) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
Put(cf, key, DELETION_SENTINEL, pending);
|
|
|
|
return true;
|
|
|
|
}
|
2014-02-27 21:13:48 +01:00
|
|
|
|
2018-04-30 21:23:45 +02:00
|
|
|
// @param pending See comment above Put()
|
|
|
|
// Returns true if the key was not yet deleted.
|
|
|
|
bool SingleDelete(int cf, int64_t key, bool pending) {
|
|
|
|
return Delete(cf, key, pending);
|
|
|
|
}
|
Support for SingleDelete()
Summary:
This patch fixes #7460559. It introduces SingleDelete as a new database
operation. This operation can be used to delete keys that were never
overwritten (no put following another put of the same key). If an overwritten
key is single deleted the behavior is undefined. Single deletion of a
non-existent key has no effect but multiple consecutive single deletions are
not allowed (see limitations).
In contrast to the conventional Delete() operation, the deletion entry is
removed along with the value when the two are lined up in a compaction. Note:
The semantics are similar to @igor's prototype that allowed to have this
behavior on the granularity of a column family (
https://reviews.facebook.net/D42093 ). This new patch, however, is more
aggressive when it comes to removing tombstones: It removes the SingleDelete
together with the value whenever there is no snapshot between them while the
older patch only did this when the sequence number of the deletion was older
than the earliest snapshot.
Most of the complex additions are in the Compaction Iterator, all other changes
should be relatively straightforward. The patch also includes basic support for
single deletions in db_stress and db_bench.
Limitations:
- Not compatible with cuckoo hash tables
- Single deletions cannot be used in combination with merges and normal
deletions on the same key (other keys are not affected by this)
- Consecutive single deletions are currently not allowed (and older version of
this patch supported this so it could be resurrected if needed)
Test Plan: make all check
Reviewers: yhchiang, sdong, rven, anthony, yoshinorim, igor
Reviewed By: igor
Subscribers: maykov, dhruba, leveldb
Differential Revision: https://reviews.facebook.net/D43179
2015-09-17 20:42:56 +02:00
|
|
|
|
2018-04-30 21:23:45 +02:00
|
|
|
// @param pending See comment above Put()
|
|
|
|
// Returns number of keys deleted by the call.
|
|
|
|
int DeleteRange(int cf, int64_t begin_key, int64_t end_key, bool pending) {
|
2016-12-07 21:59:59 +01:00
|
|
|
int covered = 0;
|
|
|
|
for (int64_t key = begin_key; key < end_key; ++key) {
|
2018-04-30 21:23:45 +02:00
|
|
|
if (Delete(cf, key, pending)) {
|
2016-12-07 21:59:59 +01:00
|
|
|
++covered;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return covered;
|
|
|
|
}
|
|
|
|
|
2018-06-13 22:37:21 +02:00
|
|
|
bool AllowsOverwrite(int64_t key) {
|
|
|
|
return no_overwrite_ids_.find(key) == no_overwrite_ids_.end();
|
Support for SingleDelete()
Summary:
This patch fixes #7460559. It introduces SingleDelete as a new database
operation. This operation can be used to delete keys that were never
overwritten (no put following another put of the same key). If an overwritten
key is single deleted the behavior is undefined. Single deletion of a
non-existent key has no effect but multiple consecutive single deletions are
not allowed (see limitations).
In contrast to the conventional Delete() operation, the deletion entry is
removed along with the value when the two are lined up in a compaction. Note:
The semantics are similar to @igor's prototype that allowed to have this
behavior on the granularity of a column family (
https://reviews.facebook.net/D42093 ). This new patch, however, is more
aggressive when it comes to removing tombstones: It removes the SingleDelete
together with the value whenever there is no snapshot between them while the
older patch only did this when the sequence number of the deletion was older
than the earliest snapshot.
Most of the complex additions are in the Compaction Iterator, all other changes
should be relatively straightforward. The patch also includes basic support for
single deletions in db_stress and db_bench.
Limitations:
- Not compatible with cuckoo hash tables
- Single deletions cannot be used in combination with merges and normal
deletions on the same key (other keys are not affected by this)
- Consecutive single deletions are currently not allowed (and older version of
this patch supported this so it could be resurrected if needed)
Test Plan: make all check
Reviewers: yhchiang, sdong, rven, anthony, yoshinorim, igor
Reviewed By: igor
Subscribers: maykov, dhruba, leveldb
Differential Revision: https://reviews.facebook.net/D43179
2015-09-17 20:42:56 +02:00
|
|
|
}
|
|
|
|
|
2018-04-30 21:23:45 +02:00
|
|
|
bool Exists(int cf, int64_t key) {
|
|
|
|
// UNKNOWN_SENTINEL counts as exists. That assures a key for which overwrite
|
|
|
|
// is disallowed can't be accidentally added a second time, in which case
|
|
|
|
// SingleDelete wouldn't be able to properly delete the key. It does allow
|
|
|
|
// the case where a SingleDelete might be added which covers nothing, but
|
|
|
|
// that's not a correctness issue.
|
|
|
|
uint32_t expected_value = Value(cf, key).load();
|
|
|
|
return expected_value != DELETION_SENTINEL;
|
|
|
|
}
|
Support for SingleDelete()
Summary:
This patch fixes #7460559. It introduces SingleDelete as a new database
operation. This operation can be used to delete keys that were never
overwritten (no put following another put of the same key). If an overwritten
key is single deleted the behavior is undefined. Single deletion of a
non-existent key has no effect but multiple consecutive single deletions are
not allowed (see limitations).
In contrast to the conventional Delete() operation, the deletion entry is
removed along with the value when the two are lined up in a compaction. Note:
The semantics are similar to @igor's prototype that allowed to have this
behavior on the granularity of a column family (
https://reviews.facebook.net/D42093 ). This new patch, however, is more
aggressive when it comes to removing tombstones: It removes the SingleDelete
together with the value whenever there is no snapshot between them while the
older patch only did this when the sequence number of the deletion was older
than the earliest snapshot.
Most of the complex additions are in the Compaction Iterator, all other changes
should be relatively straightforward. The patch also includes basic support for
single deletions in db_stress and db_bench.
Limitations:
- Not compatible with cuckoo hash tables
- Single deletions cannot be used in combination with merges and normal
deletions on the same key (other keys are not affected by this)
- Consecutive single deletions are currently not allowed (and older version of
this patch supported this so it could be resurrected if needed)
Test Plan: make all check
Reviewers: yhchiang, sdong, rven, anthony, yoshinorim, igor
Reviewed By: igor
Subscribers: maykov, dhruba, leveldb
Differential Revision: https://reviews.facebook.net/D43179
2015-09-17 20:42:56 +02:00
|
|
|
|
2014-02-27 21:13:48 +01:00
|
|
|
uint32_t GetSeed() const { return seed_; }
|
|
|
|
|
2014-06-02 19:12:41 +02:00
|
|
|
void SetShouldStopBgThread() { should_stop_bg_thread_ = true; }
|
|
|
|
|
|
|
|
bool ShoudStopBgThread() { return should_stop_bg_thread_; }
|
|
|
|
|
|
|
|
void SetBgThreadFinish() { bg_thread_finished_ = true; }
|
|
|
|
|
|
|
|
bool BgThreadFinished() const { return bg_thread_finished_; }
|
|
|
|
|
2018-04-30 21:23:45 +02:00
|
|
|
bool ShouldVerifyAtBeginning() const {
|
|
|
|
return expected_mmap_buffer_.get() != nullptr;
|
|
|
|
}
|
|
|
|
|
2012-10-03 18:58:45 +02:00
|
|
|
private:
|
|
|
|
port::Mutex mu_;
|
|
|
|
port::CondVar cv_;
|
|
|
|
const uint32_t seed_;
|
2015-11-19 20:47:12 +01:00
|
|
|
const int64_t max_key_;
|
2012-10-03 18:58:45 +02:00
|
|
|
const uint32_t log2_keys_per_lock_;
|
|
|
|
const int num_threads_;
|
|
|
|
long num_initialized_;
|
|
|
|
long num_populated_;
|
2012-11-09 22:04:12 +01:00
|
|
|
long vote_reopen_;
|
2012-10-03 18:58:45 +02:00
|
|
|
long num_done_;
|
|
|
|
bool start_;
|
|
|
|
bool start_verify_;
|
2014-06-02 19:12:41 +02:00
|
|
|
bool should_stop_bg_thread_;
|
|
|
|
bool bg_thread_finished_;
|
2012-10-03 18:58:45 +02:00
|
|
|
StressTest* stress_test_;
|
2014-04-24 15:22:58 +02:00
|
|
|
std::atomic<bool> verification_failure_;
|
2012-10-03 18:58:45 +02:00
|
|
|
|
Support for SingleDelete()
Summary:
This patch fixes #7460559. It introduces SingleDelete as a new database
operation. This operation can be used to delete keys that were never
overwritten (no put following another put of the same key). If an overwritten
key is single deleted the behavior is undefined. Single deletion of a
non-existent key has no effect but multiple consecutive single deletions are
not allowed (see limitations).
In contrast to the conventional Delete() operation, the deletion entry is
removed along with the value when the two are lined up in a compaction. Note:
The semantics are similar to @igor's prototype that allowed to have this
behavior on the granularity of a column family (
https://reviews.facebook.net/D42093 ). This new patch, however, is more
aggressive when it comes to removing tombstones: It removes the SingleDelete
together with the value whenever there is no snapshot between them while the
older patch only did this when the sequence number of the deletion was older
than the earliest snapshot.
Most of the complex additions are in the Compaction Iterator, all other changes
should be relatively straightforward. The patch also includes basic support for
single deletions in db_stress and db_bench.
Limitations:
- Not compatible with cuckoo hash tables
- Single deletions cannot be used in combination with merges and normal
deletions on the same key (other keys are not affected by this)
- Consecutive single deletions are currently not allowed (and older version of
this patch supported this so it could be resurrected if needed)
Test Plan: make all check
Reviewers: yhchiang, sdong, rven, anthony, yoshinorim, igor
Reviewed By: igor
Subscribers: maykov, dhruba, leveldb
Differential Revision: https://reviews.facebook.net/D43179
2015-09-17 20:42:56 +02:00
|
|
|
// Keys that should not be overwritten
|
2018-06-13 22:37:21 +02:00
|
|
|
std::unordered_set<size_t> no_overwrite_ids_;
|
Support for SingleDelete()
Summary:
This patch fixes #7460559. It introduces SingleDelete as a new database
operation. This operation can be used to delete keys that were never
overwritten (no put following another put of the same key). If an overwritten
key is single deleted the behavior is undefined. Single deletion of a
non-existent key has no effect but multiple consecutive single deletions are
not allowed (see limitations).
In contrast to the conventional Delete() operation, the deletion entry is
removed along with the value when the two are lined up in a compaction. Note:
The semantics are similar to @igor's prototype that allowed to have this
behavior on the granularity of a column family (
https://reviews.facebook.net/D42093 ). This new patch, however, is more
aggressive when it comes to removing tombstones: It removes the SingleDelete
together with the value whenever there is no snapshot between them while the
older patch only did this when the sequence number of the deletion was older
than the earliest snapshot.
Most of the complex additions are in the Compaction Iterator, all other changes
should be relatively straightforward. The patch also includes basic support for
single deletions in db_stress and db_bench.
Limitations:
- Not compatible with cuckoo hash tables
- Single deletions cannot be used in combination with merges and normal
deletions on the same key (other keys are not affected by this)
- Consecutive single deletions are currently not allowed (and older version of
this patch supported this so it could be resurrected if needed)
Test Plan: make all check
Reviewers: yhchiang, sdong, rven, anthony, yoshinorim, igor
Reviewed By: igor
Subscribers: maykov, dhruba, leveldb
Differential Revision: https://reviews.facebook.net/D43179
2015-09-17 20:42:56 +02:00
|
|
|
|
2018-04-30 21:23:45 +02:00
|
|
|
std::atomic<uint32_t>* values_;
|
2018-05-05 01:33:38 +02:00
|
|
|
std::unique_ptr<std::atomic<uint32_t>[]> values_allocation_;
|
2015-07-02 01:13:49 +02:00
|
|
|
// Has to make it owned by a smart ptr as port::Mutex is not copyable
|
|
|
|
// and storing it in the container may require copying depending on the impl.
|
2015-07-13 21:11:05 +02:00
|
|
|
std::vector<std::vector<std::unique_ptr<port::Mutex> > > key_locks_;
|
2018-04-30 21:23:45 +02:00
|
|
|
std::unique_ptr<MemoryMappedFileBuffer> expected_mmap_buffer_;
|
2012-10-03 18:58:45 +02:00
|
|
|
};
|
|
|
|
|
2018-04-30 21:23:45 +02:00
|
|
|
const uint32_t SharedState::UNKNOWN_SENTINEL = 0xfffffffe;
|
|
|
|
const uint32_t SharedState::DELETION_SENTINEL = 0xffffffff;
|
2014-03-11 21:08:48 +01:00
|
|
|
|
2012-10-03 18:58:45 +02:00
|
|
|
// Per-thread state for concurrent executions of the same benchmark.
|
|
|
|
struct ThreadState {
|
2017-12-13 20:51:12 +01:00
|
|
|
uint32_t tid; // 0..n-1
|
|
|
|
Random rand; // Has different seeds for different threads
|
2012-10-03 18:58:45 +02:00
|
|
|
SharedState* shared;
|
|
|
|
Stats stats;
|
2017-12-13 20:51:12 +01:00
|
|
|
struct SnapshotState {
|
|
|
|
const Snapshot* snapshot;
|
2018-03-08 19:18:34 +01:00
|
|
|
// The cf from which we did a Get at this snapshot
|
2017-12-13 20:51:12 +01:00
|
|
|
int cf_at;
|
2018-03-08 19:18:34 +01:00
|
|
|
// The name of the cf at the time that we did a read
|
2017-12-16 01:15:58 +01:00
|
|
|
std::string cf_at_name;
|
2018-03-08 19:18:34 +01:00
|
|
|
// The key with which we did a Get at this snapshot
|
2017-12-13 20:51:12 +01:00
|
|
|
std::string key;
|
|
|
|
// The status of the Get
|
|
|
|
Status status;
|
|
|
|
// The value of the Get
|
|
|
|
std::string value;
|
2018-08-24 23:57:37 +02:00
|
|
|
// optional state of all keys in the db
|
|
|
|
std::vector<bool> *key_vec;
|
2017-12-13 20:51:12 +01:00
|
|
|
};
|
|
|
|
std::queue<std::pair<uint64_t, SnapshotState> > snapshot_queue;
|
2012-10-03 18:58:45 +02:00
|
|
|
|
2014-11-08 00:04:30 +01:00
|
|
|
ThreadState(uint32_t index, SharedState* _shared)
|
2014-11-08 22:01:31 +01:00
|
|
|
: tid(index), rand(1000 + index + _shared->GetSeed()), shared(_shared) {}
|
2012-10-03 18:58:45 +02:00
|
|
|
};
|
|
|
|
|
2015-05-29 22:17:49 +02:00
|
|
|
class DbStressListener : public EventListener {
|
|
|
|
public:
|
2017-05-25 19:41:00 +02:00
|
|
|
DbStressListener(const std::string& db_name,
|
2018-04-06 04:49:06 +02:00
|
|
|
const std::vector<DbPath>& db_paths,
|
|
|
|
const std::vector<ColumnFamilyDescriptor>& column_families)
|
2018-09-11 01:45:59 +02:00
|
|
|
: db_name_(db_name),
|
|
|
|
db_paths_(db_paths),
|
2018-08-31 21:18:11 +02:00
|
|
|
column_families_(column_families),
|
|
|
|
num_pending_file_creations_(0) {}
|
2018-08-24 03:22:55 +02:00
|
|
|
virtual ~DbStressListener() {
|
|
|
|
assert(num_pending_file_creations_ == 0);
|
|
|
|
}
|
2015-05-29 22:17:49 +02:00
|
|
|
#ifndef ROCKSDB_LITE
|
2018-04-16 02:19:57 +02:00
|
|
|
virtual void OnFlushCompleted(DB* /*db*/, const FlushJobInfo& info) override {
|
2015-06-05 21:28:51 +02:00
|
|
|
assert(IsValidColumnFamilyName(info.cf_name));
|
|
|
|
VerifyFilePath(info.file_path);
|
2015-05-29 22:17:49 +02:00
|
|
|
// pretending doing some work here
|
|
|
|
std::this_thread::sleep_for(
|
2017-05-25 19:41:00 +02:00
|
|
|
std::chrono::microseconds(Random::GetTLSInstance()->Uniform(5000)));
|
2015-05-29 22:17:49 +02:00
|
|
|
}
|
|
|
|
|
2018-04-16 02:19:57 +02:00
|
|
|
virtual void OnCompactionCompleted(DB* /*db*/,
|
2017-05-25 19:41:00 +02:00
|
|
|
const CompactionJobInfo& ci) override {
|
2015-05-29 22:17:49 +02:00
|
|
|
assert(IsValidColumnFamilyName(ci.cf_name));
|
|
|
|
assert(ci.input_files.size() + ci.output_files.size() > 0U);
|
|
|
|
for (const auto& file_path : ci.input_files) {
|
|
|
|
VerifyFilePath(file_path);
|
|
|
|
}
|
|
|
|
for (const auto& file_path : ci.output_files) {
|
|
|
|
VerifyFilePath(file_path);
|
|
|
|
}
|
|
|
|
// pretending doing some work here
|
|
|
|
std::this_thread::sleep_for(
|
2017-05-25 19:41:00 +02:00
|
|
|
std::chrono::microseconds(Random::GetTLSInstance()->Uniform(5000)));
|
2015-05-29 22:17:49 +02:00
|
|
|
}
|
|
|
|
|
2018-08-24 03:22:55 +02:00
|
|
|
virtual void OnTableFileCreationStarted(
|
2018-08-24 06:44:18 +02:00
|
|
|
const TableFileCreationBriefInfo& /*info*/) override {
|
2018-08-24 03:22:55 +02:00
|
|
|
++num_pending_file_creations_;
|
|
|
|
}
|
2017-05-25 19:41:00 +02:00
|
|
|
virtual void OnTableFileCreated(const TableFileCreationInfo& info) override {
|
2015-06-02 23:12:23 +02:00
|
|
|
assert(info.db_name == db_name_);
|
|
|
|
assert(IsValidColumnFamilyName(info.cf_name));
|
2018-08-24 03:22:55 +02:00
|
|
|
if (info.file_size) {
|
|
|
|
VerifyFilePath(info.file_path);
|
|
|
|
}
|
2016-04-19 23:36:09 +02:00
|
|
|
assert(info.job_id > 0 || FLAGS_compact_files_one_in > 0);
|
2018-08-14 23:56:21 +02:00
|
|
|
if (info.status.ok() && info.file_size > 0) {
|
2019-01-03 00:05:41 +01:00
|
|
|
assert(info.table_properties.data_size > 0 ||
|
|
|
|
info.table_properties.num_range_deletions > 0);
|
2016-07-25 21:27:06 +02:00
|
|
|
assert(info.table_properties.raw_key_size > 0);
|
|
|
|
assert(info.table_properties.num_entries > 0);
|
|
|
|
}
|
2018-08-24 03:22:55 +02:00
|
|
|
--num_pending_file_creations_;
|
2015-06-02 23:12:23 +02:00
|
|
|
}
|
|
|
|
|
2015-05-29 22:17:49 +02:00
|
|
|
protected:
|
|
|
|
bool IsValidColumnFamilyName(const std::string& cf_name) const {
|
|
|
|
if (cf_name == kDefaultColumnFamilyName) {
|
|
|
|
return true;
|
|
|
|
}
|
2015-05-30 22:00:23 +02:00
|
|
|
// The column family names in the stress tests are numbers.
|
|
|
|
for (size_t i = 0; i < cf_name.size(); ++i) {
|
|
|
|
if (cf_name[i] < '0' || cf_name[i] > '9') {
|
|
|
|
return false;
|
2015-05-29 22:17:49 +02:00
|
|
|
}
|
|
|
|
}
|
2015-05-30 22:00:23 +02:00
|
|
|
return true;
|
2015-05-29 22:17:49 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void VerifyFileDir(const std::string& file_dir) {
|
2015-05-29 23:51:21 +02:00
|
|
|
#ifndef NDEBUG
|
2015-05-29 22:17:49 +02:00
|
|
|
if (db_name_ == file_dir) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
for (const auto& db_path : db_paths_) {
|
|
|
|
if (db_path.path == file_dir) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
2018-04-06 04:49:06 +02:00
|
|
|
for (auto& cf : column_families_) {
|
|
|
|
for (const auto& cf_path : cf.options.cf_paths) {
|
|
|
|
if (cf_path.path == file_dir) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2015-05-29 22:17:49 +02:00
|
|
|
assert(false);
|
2018-04-16 02:19:57 +02:00
|
|
|
#else
|
|
|
|
(void)file_dir;
|
2015-05-29 23:51:21 +02:00
|
|
|
#endif // !NDEBUG
|
2015-05-29 22:17:49 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void VerifyFileName(const std::string& file_name) {
|
2015-05-29 23:51:21 +02:00
|
|
|
#ifndef NDEBUG
|
2015-05-29 22:17:49 +02:00
|
|
|
uint64_t file_number;
|
|
|
|
FileType file_type;
|
|
|
|
bool result = ParseFileName(file_name, &file_number, &file_type);
|
|
|
|
assert(result);
|
|
|
|
assert(file_type == kTableFile);
|
2018-04-16 02:19:57 +02:00
|
|
|
#else
|
|
|
|
(void)file_name;
|
2015-05-29 23:51:21 +02:00
|
|
|
#endif // !NDEBUG
|
2015-05-29 22:17:49 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void VerifyFilePath(const std::string& file_path) {
|
2015-05-29 23:51:21 +02:00
|
|
|
#ifndef NDEBUG
|
2015-05-29 22:17:49 +02:00
|
|
|
size_t pos = file_path.find_last_of("/");
|
|
|
|
if (pos == std::string::npos) {
|
|
|
|
VerifyFileName(file_path);
|
|
|
|
} else {
|
|
|
|
if (pos > 0) {
|
|
|
|
VerifyFileDir(file_path.substr(0, pos));
|
|
|
|
}
|
|
|
|
VerifyFileName(file_path.substr(pos));
|
|
|
|
}
|
2018-04-16 02:19:57 +02:00
|
|
|
#else
|
|
|
|
(void)file_path;
|
2015-05-29 23:51:21 +02:00
|
|
|
#endif // !NDEBUG
|
2015-05-29 22:17:49 +02:00
|
|
|
}
|
|
|
|
#endif // !ROCKSDB_LITE
|
|
|
|
|
|
|
|
private:
|
|
|
|
std::string db_name_;
|
|
|
|
std::vector<DbPath> db_paths_;
|
2018-04-06 04:49:06 +02:00
|
|
|
std::vector<ColumnFamilyDescriptor> column_families_;
|
2018-08-24 03:22:55 +02:00
|
|
|
std::atomic<int> num_pending_file_creations_;
|
2015-05-29 22:17:49 +02:00
|
|
|
};
|
|
|
|
|
2012-10-03 18:58:45 +02:00
|
|
|
} // namespace
|
|
|
|
|
|
|
|
class StressTest {
|
|
|
|
public:
|
|
|
|
StressTest()
|
2016-08-19 21:28:19 +02:00
|
|
|
: cache_(NewCache(FLAGS_cache_size)),
|
|
|
|
compressed_cache_(NewLRUCache(FLAGS_compressed_cache_size)),
|
2012-10-03 18:58:45 +02:00
|
|
|
filter_policy_(FLAGS_bloom_bits >= 0
|
2016-08-19 21:28:19 +02:00
|
|
|
? FLAGS_use_block_based_filter
|
|
|
|
? NewBloomFilterPolicy(FLAGS_bloom_bits, true)
|
|
|
|
: NewBloomFilterPolicy(FLAGS_bloom_bits, false)
|
|
|
|
: nullptr),
|
2013-02-15 20:53:17 +01:00
|
|
|
db_(nullptr),
|
2017-12-13 20:51:12 +01:00
|
|
|
#ifndef ROCKSDB_LITE
|
|
|
|
txn_db_(nullptr),
|
|
|
|
#endif
|
2014-09-02 22:21:59 +02:00
|
|
|
new_column_family_name_(1),
|
2019-01-03 02:38:27 +01:00
|
|
|
num_times_reopened_(0),
|
|
|
|
db_preload_finished_(false) {
|
2013-04-08 21:35:40 +02:00
|
|
|
if (FLAGS_destroy_db_initially) {
|
|
|
|
std::vector<std::string> files;
|
|
|
|
FLAGS_env->GetChildren(FLAGS_db, &files);
|
|
|
|
for (unsigned int i = 0; i < files.size(); i++) {
|
|
|
|
if (Slice(files[i]).starts_with("heap-")) {
|
2013-10-24 16:43:14 +02:00
|
|
|
FLAGS_env->DeleteFile(FLAGS_db + "/" + files[i]);
|
2013-04-08 21:35:40 +02:00
|
|
|
}
|
2012-10-03 18:58:45 +02:00
|
|
|
}
|
2019-03-29 03:16:58 +01:00
|
|
|
Options options;
|
|
|
|
options.env = FLAGS_env;
|
|
|
|
Status s = DestroyDB(FLAGS_db, options);
|
|
|
|
if (!s.ok()) {
|
|
|
|
fprintf(stderr, "Cannot destroy original db: %s\n",
|
|
|
|
s.ToString().c_str());
|
|
|
|
exit(1);
|
|
|
|
}
|
2012-10-03 18:58:45 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-06-07 19:34:56 +02:00
|
|
|
virtual ~StressTest() {
|
2014-02-27 21:13:48 +01:00
|
|
|
for (auto cf : column_families_) {
|
|
|
|
delete cf;
|
|
|
|
}
|
|
|
|
column_families_.clear();
|
2012-10-03 18:58:45 +02:00
|
|
|
delete db_;
|
|
|
|
}
|
|
|
|
|
2016-08-19 21:28:19 +02:00
|
|
|
std::shared_ptr<Cache> NewCache(size_t capacity) {
|
|
|
|
if (capacity <= 0) {
|
|
|
|
return nullptr;
|
|
|
|
}
|
|
|
|
if (FLAGS_use_clock_cache) {
|
|
|
|
auto cache = NewClockCache((size_t)capacity);
|
|
|
|
if (!cache) {
|
|
|
|
fprintf(stderr, "Clock cache not supported.");
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
return cache;
|
|
|
|
} else {
|
|
|
|
return NewLRUCache((size_t)capacity);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-10-27 20:11:16 +01:00
|
|
|
bool BuildOptionsTable() {
|
|
|
|
if (FLAGS_set_options_one_in <= 0) {
|
|
|
|
return true;
|
|
|
|
}
|
2015-07-02 01:13:49 +02:00
|
|
|
|
2015-07-13 21:11:05 +02:00
|
|
|
std::unordered_map<std::string, std::vector<std::string> > options_tbl = {
|
|
|
|
{"write_buffer_size",
|
2018-04-27 03:38:45 +02:00
|
|
|
{ToString(options_.write_buffer_size),
|
|
|
|
ToString(options_.write_buffer_size * 2),
|
|
|
|
ToString(options_.write_buffer_size * 4)}},
|
2015-07-13 21:11:05 +02:00
|
|
|
{"max_write_buffer_number",
|
2018-04-27 03:38:45 +02:00
|
|
|
{ToString(options_.max_write_buffer_number),
|
|
|
|
ToString(options_.max_write_buffer_number * 2),
|
|
|
|
ToString(options_.max_write_buffer_number * 4)}},
|
2015-07-13 21:11:05 +02:00
|
|
|
{"arena_block_size",
|
|
|
|
{
|
2018-04-27 03:38:45 +02:00
|
|
|
ToString(options_.arena_block_size),
|
|
|
|
ToString(options_.write_buffer_size / 4),
|
|
|
|
ToString(options_.write_buffer_size / 8),
|
2015-07-13 21:11:05 +02:00
|
|
|
}},
|
2016-07-27 03:05:30 +02:00
|
|
|
{"memtable_huge_page_size", {"0", ToString(2 * 1024 * 1024)}},
|
2015-07-13 21:11:05 +02:00
|
|
|
{"max_successive_merges", {"0", "2", "4"}},
|
|
|
|
{"inplace_update_num_locks", {"100", "200", "300"}},
|
|
|
|
// TODO(ljin): enable test for this option
|
|
|
|
// {"disable_auto_compactions", {"100", "200", "300"}},
|
|
|
|
{"soft_rate_limit", {"0", "0.5", "0.9"}},
|
|
|
|
{"hard_rate_limit", {"0", "1.1", "2.0"}},
|
|
|
|
{"level0_file_num_compaction_trigger",
|
|
|
|
{
|
2018-04-27 03:38:45 +02:00
|
|
|
ToString(options_.level0_file_num_compaction_trigger),
|
|
|
|
ToString(options_.level0_file_num_compaction_trigger + 2),
|
|
|
|
ToString(options_.level0_file_num_compaction_trigger + 4),
|
2015-07-13 21:11:05 +02:00
|
|
|
}},
|
|
|
|
{"level0_slowdown_writes_trigger",
|
|
|
|
{
|
2018-04-27 03:38:45 +02:00
|
|
|
ToString(options_.level0_slowdown_writes_trigger),
|
|
|
|
ToString(options_.level0_slowdown_writes_trigger + 2),
|
|
|
|
ToString(options_.level0_slowdown_writes_trigger + 4),
|
2015-07-13 21:11:05 +02:00
|
|
|
}},
|
|
|
|
{"level0_stop_writes_trigger",
|
|
|
|
{
|
2018-04-27 03:38:45 +02:00
|
|
|
ToString(options_.level0_stop_writes_trigger),
|
|
|
|
ToString(options_.level0_stop_writes_trigger + 2),
|
|
|
|
ToString(options_.level0_stop_writes_trigger + 4),
|
2015-07-13 21:11:05 +02:00
|
|
|
}},
|
2016-06-17 01:02:52 +02:00
|
|
|
{"max_compaction_bytes",
|
2015-07-13 21:11:05 +02:00
|
|
|
{
|
2018-04-27 03:38:45 +02:00
|
|
|
ToString(options_.target_file_size_base * 5),
|
|
|
|
ToString(options_.target_file_size_base * 15),
|
|
|
|
ToString(options_.target_file_size_base * 100),
|
2015-07-13 21:11:05 +02:00
|
|
|
}},
|
|
|
|
{"target_file_size_base",
|
|
|
|
{
|
2018-04-27 03:38:45 +02:00
|
|
|
ToString(options_.target_file_size_base),
|
|
|
|
ToString(options_.target_file_size_base * 2),
|
|
|
|
ToString(options_.target_file_size_base * 4),
|
2015-07-13 21:11:05 +02:00
|
|
|
}},
|
|
|
|
{"target_file_size_multiplier",
|
|
|
|
{
|
2018-04-27 03:38:45 +02:00
|
|
|
ToString(options_.target_file_size_multiplier), "1", "2",
|
2015-07-13 21:11:05 +02:00
|
|
|
}},
|
|
|
|
{"max_bytes_for_level_base",
|
|
|
|
{
|
2018-04-27 03:38:45 +02:00
|
|
|
ToString(options_.max_bytes_for_level_base / 2),
|
|
|
|
ToString(options_.max_bytes_for_level_base),
|
|
|
|
ToString(options_.max_bytes_for_level_base * 2),
|
2015-07-13 21:11:05 +02:00
|
|
|
}},
|
|
|
|
{"max_bytes_for_level_multiplier",
|
|
|
|
{
|
2018-04-27 03:38:45 +02:00
|
|
|
ToString(options_.max_bytes_for_level_multiplier), "1", "2",
|
2015-07-13 21:11:05 +02:00
|
|
|
}},
|
|
|
|
{"max_sequential_skip_in_iterations", {"4", "8", "12"}},
|
2014-10-27 20:11:16 +01:00
|
|
|
};
|
2015-07-02 01:13:49 +02:00
|
|
|
|
|
|
|
options_table_ = std::move(options_tbl);
|
|
|
|
|
2014-10-27 20:11:16 +01:00
|
|
|
for (const auto& iter : options_table_) {
|
|
|
|
options_index_.push_back(iter.first);
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2014-04-24 15:22:58 +02:00
|
|
|
bool Run() {
|
2018-06-13 22:37:21 +02:00
|
|
|
uint64_t now = FLAGS_env->NowMicros();
|
|
|
|
fprintf(stdout, "%s Initializing db_stress\n",
|
|
|
|
FLAGS_env->TimeToString(now / 1000000).c_str());
|
2012-10-03 18:58:45 +02:00
|
|
|
PrintEnv();
|
|
|
|
Open();
|
2018-04-27 03:38:45 +02:00
|
|
|
BuildOptionsTable();
|
2012-10-03 18:58:45 +02:00
|
|
|
SharedState shared(this);
|
2019-01-03 02:38:27 +01:00
|
|
|
|
|
|
|
if (FLAGS_read_only) {
|
|
|
|
now = FLAGS_env->NowMicros();
|
|
|
|
fprintf(stdout, "%s Preloading db with %" PRIu64 " KVs\n",
|
|
|
|
FLAGS_env->TimeToString(now / 1000000).c_str(), FLAGS_max_key);
|
|
|
|
PreloadDbAndReopenAsReadOnly(FLAGS_max_key, &shared);
|
|
|
|
}
|
2012-10-03 18:58:45 +02:00
|
|
|
uint32_t n = shared.GetNumThreads();
|
|
|
|
|
2018-06-13 22:37:21 +02:00
|
|
|
now = FLAGS_env->NowMicros();
|
|
|
|
fprintf(stdout, "%s Initializing worker threads\n",
|
|
|
|
FLAGS_env->TimeToString(now / 1000000).c_str());
|
2012-10-03 18:58:45 +02:00
|
|
|
std::vector<ThreadState*> threads(n);
|
|
|
|
for (uint32_t i = 0; i < n; i++) {
|
|
|
|
threads[i] = new ThreadState(i, &shared);
|
|
|
|
FLAGS_env->StartThread(ThreadBody, threads[i]);
|
|
|
|
}
|
2014-06-02 19:12:41 +02:00
|
|
|
ThreadState bg_thread(0, &shared);
|
|
|
|
if (FLAGS_compaction_thread_pool_adjust_interval > 0) {
|
|
|
|
FLAGS_env->StartThread(PoolSizeChangeThread, &bg_thread);
|
|
|
|
}
|
|
|
|
|
2012-10-03 18:58:45 +02:00
|
|
|
// Each thread goes through the following states:
|
2012-11-08 00:35:08 +01:00
|
|
|
// initializing -> wait for others to init -> read/populate/depopulate
|
|
|
|
// wait for others to operate -> verify -> done
|
2012-10-03 18:58:45 +02:00
|
|
|
|
|
|
|
{
|
|
|
|
MutexLock l(shared.GetMutex());
|
|
|
|
while (!shared.AllInitialized()) {
|
|
|
|
shared.GetCondVar()->Wait();
|
|
|
|
}
|
2018-04-30 21:23:45 +02:00
|
|
|
if (shared.ShouldVerifyAtBeginning()) {
|
|
|
|
if (shared.HasVerificationFailedYet()) {
|
|
|
|
printf("Crash-recovery verification failed :(\n");
|
|
|
|
} else {
|
|
|
|
printf("Crash-recovery verification passed :)\n");
|
|
|
|
}
|
|
|
|
}
|
2012-10-03 18:58:45 +02:00
|
|
|
|
2018-06-13 22:37:21 +02:00
|
|
|
now = FLAGS_env->NowMicros();
|
2012-11-17 00:28:14 +01:00
|
|
|
fprintf(stdout, "%s Starting database operations\n",
|
2015-11-19 20:47:12 +01:00
|
|
|
FLAGS_env->TimeToString(now/1000000).c_str());
|
2012-11-08 00:35:08 +01:00
|
|
|
|
2012-10-03 18:58:45 +02:00
|
|
|
shared.SetStart();
|
|
|
|
shared.GetCondVar()->SignalAll();
|
2012-11-08 00:35:08 +01:00
|
|
|
while (!shared.AllOperated()) {
|
2012-10-03 18:58:45 +02:00
|
|
|
shared.GetCondVar()->Wait();
|
|
|
|
}
|
|
|
|
|
2012-11-17 00:28:14 +01:00
|
|
|
now = FLAGS_env->NowMicros();
|
2013-02-23 20:11:16 +01:00
|
|
|
if (FLAGS_test_batches_snapshots) {
|
|
|
|
fprintf(stdout, "%s Limited verification already done during gets\n",
|
|
|
|
FLAGS_env->TimeToString((uint64_t) now/1000000).c_str());
|
|
|
|
} else {
|
|
|
|
fprintf(stdout, "%s Starting verification\n",
|
|
|
|
FLAGS_env->TimeToString((uint64_t) now/1000000).c_str());
|
|
|
|
}
|
2012-11-17 00:28:14 +01:00
|
|
|
|
2012-10-03 18:58:45 +02:00
|
|
|
shared.SetStartVerify();
|
|
|
|
shared.GetCondVar()->SignalAll();
|
|
|
|
while (!shared.AllDone()) {
|
|
|
|
shared.GetCondVar()->Wait();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-11-06 21:02:18 +01:00
|
|
|
for (unsigned int i = 1; i < n; i++) {
|
2012-10-03 18:58:45 +02:00
|
|
|
threads[0]->stats.Merge(threads[i]->stats);
|
|
|
|
}
|
|
|
|
threads[0]->stats.Report("Stress Test");
|
|
|
|
|
2012-11-06 21:02:18 +01:00
|
|
|
for (unsigned int i = 0; i < n; i++) {
|
2012-10-03 18:58:45 +02:00
|
|
|
delete threads[i];
|
2013-02-15 20:53:17 +01:00
|
|
|
threads[i] = nullptr;
|
2012-10-03 18:58:45 +02:00
|
|
|
}
|
2018-06-13 22:37:21 +02:00
|
|
|
now = FLAGS_env->NowMicros();
|
2017-08-17 04:03:18 +02:00
|
|
|
if (!FLAGS_test_batches_snapshots && !shared.HasVerificationFailedYet()) {
|
2013-02-23 20:11:16 +01:00
|
|
|
fprintf(stdout, "%s Verification successful\n",
|
2015-11-19 20:47:12 +01:00
|
|
|
FLAGS_env->TimeToString(now/1000000).c_str());
|
2013-02-23 20:11:16 +01:00
|
|
|
}
|
2012-10-03 18:58:45 +02:00
|
|
|
PrintStatistics();
|
2014-04-24 15:22:58 +02:00
|
|
|
|
2014-06-02 19:12:41 +02:00
|
|
|
if (FLAGS_compaction_thread_pool_adjust_interval > 0) {
|
|
|
|
MutexLock l(shared.GetMutex());
|
|
|
|
shared.SetShouldStopBgThread();
|
|
|
|
while (!shared.BgThreadFinished()) {
|
|
|
|
shared.GetCondVar()->Wait();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-04-24 15:22:58 +02:00
|
|
|
if (shared.HasVerificationFailedYet()) {
|
|
|
|
printf("Verification failed :(\n");
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
2012-10-03 18:58:45 +02:00
|
|
|
}
|
|
|
|
|
2018-06-07 19:34:56 +02:00
|
|
|
protected:
|
2012-10-03 18:58:45 +02:00
|
|
|
static void ThreadBody(void* v) {
|
|
|
|
ThreadState* thread = reinterpret_cast<ThreadState*>(v);
|
|
|
|
SharedState* shared = thread->shared;
|
|
|
|
|
2018-04-30 21:23:45 +02:00
|
|
|
if (shared->ShouldVerifyAtBeginning()) {
|
|
|
|
thread->shared->GetStressTest()->VerifyDb(thread);
|
|
|
|
}
|
2012-10-03 18:58:45 +02:00
|
|
|
{
|
|
|
|
MutexLock l(shared->GetMutex());
|
|
|
|
shared->IncInitialized();
|
|
|
|
if (shared->AllInitialized()) {
|
|
|
|
shared->GetCondVar()->SignalAll();
|
|
|
|
}
|
|
|
|
while (!shared->Started()) {
|
|
|
|
shared->GetCondVar()->Wait();
|
|
|
|
}
|
|
|
|
}
|
2012-11-08 00:35:08 +01:00
|
|
|
thread->shared->GetStressTest()->OperateDb(thread);
|
2012-10-03 18:58:45 +02:00
|
|
|
|
|
|
|
{
|
|
|
|
MutexLock l(shared->GetMutex());
|
2012-11-08 00:35:08 +01:00
|
|
|
shared->IncOperated();
|
|
|
|
if (shared->AllOperated()) {
|
2012-10-03 18:58:45 +02:00
|
|
|
shared->GetCondVar()->SignalAll();
|
|
|
|
}
|
|
|
|
while (!shared->VerifyStarted()) {
|
|
|
|
shared->GetCondVar()->Wait();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-06-07 19:34:56 +02:00
|
|
|
thread->shared->GetStressTest()->VerifyDb(thread);
|
2012-10-03 18:58:45 +02:00
|
|
|
|
|
|
|
{
|
|
|
|
MutexLock l(shared->GetMutex());
|
|
|
|
shared->IncDone();
|
|
|
|
if (shared->AllDone()) {
|
|
|
|
shared->GetCondVar()->SignalAll();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-06-02 19:12:41 +02:00
|
|
|
static void PoolSizeChangeThread(void* v) {
|
|
|
|
assert(FLAGS_compaction_thread_pool_adjust_interval > 0);
|
|
|
|
ThreadState* thread = reinterpret_cast<ThreadState*>(v);
|
|
|
|
SharedState* shared = thread->shared;
|
|
|
|
|
|
|
|
while (true) {
|
|
|
|
{
|
|
|
|
MutexLock l(shared->GetMutex());
|
|
|
|
if (shared->ShoudStopBgThread()) {
|
|
|
|
shared->SetBgThreadFinish();
|
|
|
|
shared->GetCondVar()->SignalAll();
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
auto thread_pool_size_base = FLAGS_max_background_compactions;
|
2015-04-26 06:09:45 +02:00
|
|
|
auto thread_pool_size_var = FLAGS_compaction_thread_pool_variations;
|
2014-06-02 19:12:41 +02:00
|
|
|
int new_thread_pool_size =
|
|
|
|
thread_pool_size_base - thread_pool_size_var +
|
|
|
|
thread->rand.Next() % (thread_pool_size_var * 2 + 1);
|
|
|
|
if (new_thread_pool_size < 1) {
|
|
|
|
new_thread_pool_size = 1;
|
|
|
|
}
|
|
|
|
FLAGS_env->SetBackgroundThreads(new_thread_pool_size);
|
|
|
|
// Sleep up to 3 seconds
|
|
|
|
FLAGS_env->SleepForMicroseconds(
|
|
|
|
thread->rand.Next() % FLAGS_compaction_thread_pool_adjust_interval *
|
|
|
|
1000 +
|
|
|
|
1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-06-07 19:34:56 +02:00
|
|
|
static void PrintKeyValue(int cf, uint64_t key, const char* value,
|
|
|
|
size_t sz) {
|
|
|
|
if (!FLAGS_verbose) {
|
|
|
|
return;
|
2013-02-21 00:57:27 +01:00
|
|
|
}
|
2018-07-27 23:02:07 +02:00
|
|
|
std::string tmp;
|
|
|
|
tmp.reserve(sz * 2 + 16);
|
|
|
|
char buf[4];
|
2018-06-07 19:34:56 +02:00
|
|
|
for (size_t i = 0; i < sz; i++) {
|
2018-07-27 23:02:07 +02:00
|
|
|
snprintf(buf, 4, "%X", value[i]);
|
|
|
|
tmp.append(buf);
|
2013-02-21 00:57:27 +01:00
|
|
|
}
|
2018-07-28 01:00:26 +02:00
|
|
|
fprintf(stdout, "[CF %d] %" PRIi64 " == > (%" ROCKSDB_PRIszt ") %s\n", cf,
|
|
|
|
key, sz, tmp.c_str());
|
2018-06-07 19:34:56 +02:00
|
|
|
}
|
2013-02-21 00:57:27 +01:00
|
|
|
|
2018-06-07 19:34:56 +02:00
|
|
|
static int64_t GenerateOneKey(ThreadState* thread, uint64_t iteration) {
|
|
|
|
const double completed_ratio =
|
|
|
|
static_cast<double>(iteration) / FLAGS_ops_per_thread;
|
|
|
|
const int64_t base_key = static_cast<int64_t>(
|
|
|
|
completed_ratio * (FLAGS_max_key - FLAGS_active_width));
|
|
|
|
return base_key + thread->rand.Next() % FLAGS_active_width;
|
2013-02-21 00:57:27 +01:00
|
|
|
}
|
|
|
|
|
2018-06-07 19:34:56 +02:00
|
|
|
static size_t GenerateValue(uint32_t rand, char *v, size_t max_sz) {
|
|
|
|
size_t value_sz =
|
|
|
|
((rand % kRandomValueMaxFactor) + 1) * FLAGS_value_size_mult;
|
|
|
|
assert(value_sz <= max_sz && value_sz >= sizeof(uint32_t));
|
|
|
|
(void) max_sz;
|
|
|
|
*((uint32_t*)v) = rand;
|
|
|
|
for (size_t i=sizeof(uint32_t); i < value_sz; i++) {
|
|
|
|
v[i] = (char)(rand ^ i);
|
|
|
|
}
|
|
|
|
v[value_sz] = '\0';
|
|
|
|
return value_sz; // the size of the value set.
|
|
|
|
}
|
2013-02-21 00:57:27 +01:00
|
|
|
|
2018-06-07 19:34:56 +02:00
|
|
|
Status AssertSame(DB* db, ColumnFamilyHandle* cf,
|
|
|
|
ThreadState::SnapshotState& snap_state) {
|
2013-02-21 00:57:27 +01:00
|
|
|
Status s;
|
2018-06-07 19:34:56 +02:00
|
|
|
if (cf->GetName() != snap_state.cf_at_name) {
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
ReadOptions ropt;
|
|
|
|
ropt.snapshot = snap_state.snapshot;
|
|
|
|
PinnableSlice exp_v(&snap_state.value);
|
|
|
|
exp_v.PinSelf();
|
|
|
|
PinnableSlice v;
|
|
|
|
s = db->Get(ropt, cf, snap_state.key, &v);
|
|
|
|
if (!s.ok() && !s.IsNotFound()) {
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
if (snap_state.status != s) {
|
|
|
|
return Status::Corruption(
|
|
|
|
"The snapshot gave inconsistent results for key " +
|
|
|
|
ToString(Hash(snap_state.key.c_str(), snap_state.key.size(), 0)) +
|
|
|
|
" in cf " + cf->GetName() + ": (" + snap_state.status.ToString() +
|
|
|
|
") vs. (" + s.ToString() + ")");
|
|
|
|
}
|
|
|
|
if (s.ok()) {
|
|
|
|
if (exp_v != v) {
|
|
|
|
return Status::Corruption("The snapshot gave inconsistent values: (" +
|
|
|
|
exp_v.ToString() + ") vs. (" + v.ToString() +
|
|
|
|
")");
|
|
|
|
}
|
2013-02-21 00:57:27 +01:00
|
|
|
}
|
2018-08-24 23:57:37 +02:00
|
|
|
if (snap_state.key_vec != nullptr) {
|
2018-11-09 00:13:28 +01:00
|
|
|
// When `prefix_extractor` is set, seeking to beginning and scanning
|
|
|
|
// across prefixes are only supported with `total_order_seek` set.
|
|
|
|
ropt.total_order_seek = true;
|
2018-08-24 23:57:37 +02:00
|
|
|
std::unique_ptr<Iterator> iterator(db->NewIterator(ropt));
|
|
|
|
std::unique_ptr<std::vector<bool>> tmp_bitvec(new std::vector<bool>(FLAGS_max_key));
|
|
|
|
for (iterator->SeekToFirst(); iterator->Valid(); iterator->Next()) {
|
|
|
|
uint64_t key_val;
|
|
|
|
if (GetIntVal(iterator->key().ToString(), &key_val)) {
|
|
|
|
(*tmp_bitvec.get())[key_val] = true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (!std::equal(snap_state.key_vec->begin(),
|
|
|
|
snap_state.key_vec->end(),
|
|
|
|
tmp_bitvec.get()->begin())) {
|
|
|
|
return Status::Corruption("Found inconsistent keys at this snapshot");
|
|
|
|
}
|
|
|
|
}
|
2018-06-07 19:34:56 +02:00
|
|
|
return Status::OK();
|
|
|
|
}
|
2013-02-21 00:57:27 +01:00
|
|
|
|
2019-01-03 02:38:27 +01:00
|
|
|
// Currently PreloadDb has to be single-threaded.
|
|
|
|
void PreloadDbAndReopenAsReadOnly(int64_t number_of_keys,
|
|
|
|
SharedState* shared) {
|
|
|
|
WriteOptions write_opts;
|
|
|
|
write_opts.disableWAL = FLAGS_disable_wal;
|
|
|
|
if (FLAGS_sync) {
|
|
|
|
write_opts.sync = true;
|
|
|
|
}
|
|
|
|
char value[100];
|
|
|
|
int cf_idx = 0;
|
|
|
|
Status s;
|
|
|
|
for (auto cfh : column_families_) {
|
|
|
|
for (int64_t k = 0; k != number_of_keys; ++k) {
|
|
|
|
std::string key_str = Key(k);
|
|
|
|
Slice key = key_str;
|
|
|
|
size_t sz = GenerateValue(0 /*value_base*/, value, sizeof(value));
|
|
|
|
Slice v(value, sz);
|
|
|
|
shared->Put(cf_idx, k, 0, true /* pending */);
|
|
|
|
|
|
|
|
if (FLAGS_use_merge) {
|
|
|
|
if (!FLAGS_use_txn) {
|
|
|
|
s = db_->Merge(write_opts, cfh, key, v);
|
|
|
|
} else {
|
|
|
|
#ifndef ROCKSDB_LITE
|
|
|
|
Transaction* txn;
|
|
|
|
s = NewTxn(write_opts, &txn);
|
|
|
|
if (s.ok()) {
|
|
|
|
s = txn->Merge(cfh, key, v);
|
|
|
|
if (s.ok()) {
|
|
|
|
s = CommitTxn(txn);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
if (!FLAGS_use_txn) {
|
|
|
|
s = db_->Put(write_opts, cfh, key, v);
|
|
|
|
} else {
|
|
|
|
#ifndef ROCKSDB_LITE
|
|
|
|
Transaction* txn;
|
|
|
|
s = NewTxn(write_opts, &txn);
|
|
|
|
if (s.ok()) {
|
|
|
|
s = txn->Put(cfh, key, v);
|
|
|
|
if (s.ok()) {
|
|
|
|
s = CommitTxn(txn);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
shared->Put(cf_idx, k, 0, false /* pending */);
|
|
|
|
if (!s.ok()) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (!s.ok()) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
++cf_idx;
|
|
|
|
}
|
|
|
|
if (s.ok()) {
|
|
|
|
s = db_->Flush(FlushOptions(), column_families_);
|
|
|
|
}
|
|
|
|
if (s.ok()) {
|
|
|
|
for (auto cf : column_families_) {
|
|
|
|
delete cf;
|
|
|
|
}
|
|
|
|
column_families_.clear();
|
|
|
|
delete db_;
|
|
|
|
db_ = nullptr;
|
|
|
|
#ifndef ROCKSDB_LITE
|
|
|
|
txn_db_ = nullptr;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
db_preload_finished_.store(true);
|
|
|
|
auto now = FLAGS_env->NowMicros();
|
|
|
|
fprintf(stdout, "%s Reopening database in read-only\n",
|
|
|
|
FLAGS_env->TimeToString(now / 1000000).c_str());
|
|
|
|
// Reopen as read-only, can ignore all options related to updates
|
|
|
|
Open();
|
|
|
|
} else {
|
|
|
|
fprintf(stderr, "Failed to preload db");
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-06-07 19:34:56 +02:00
|
|
|
Status SetOptions(ThreadState* thread) {
|
|
|
|
assert(FLAGS_set_options_one_in > 0);
|
|
|
|
std::unordered_map<std::string, std::string> opts;
|
|
|
|
std::string name = options_index_[
|
|
|
|
thread->rand.Next() % options_index_.size()];
|
|
|
|
int value_idx = thread->rand.Next() % options_table_[name].size();
|
|
|
|
if (name == "soft_rate_limit" || name == "hard_rate_limit") {
|
|
|
|
opts["soft_rate_limit"] = options_table_["soft_rate_limit"][value_idx];
|
|
|
|
opts["hard_rate_limit"] = options_table_["hard_rate_limit"][value_idx];
|
|
|
|
} else if (name == "level0_file_num_compaction_trigger" ||
|
|
|
|
name == "level0_slowdown_writes_trigger" ||
|
|
|
|
name == "level0_stop_writes_trigger") {
|
|
|
|
opts["level0_file_num_compaction_trigger"] =
|
|
|
|
options_table_["level0_file_num_compaction_trigger"][value_idx];
|
|
|
|
opts["level0_slowdown_writes_trigger"] =
|
|
|
|
options_table_["level0_slowdown_writes_trigger"][value_idx];
|
|
|
|
opts["level0_stop_writes_trigger"] =
|
|
|
|
options_table_["level0_stop_writes_trigger"][value_idx];
|
2013-02-21 00:57:27 +01:00
|
|
|
} else {
|
2018-06-07 19:34:56 +02:00
|
|
|
opts[name] = options_table_[name][value_idx];
|
2013-02-21 00:57:27 +01:00
|
|
|
}
|
|
|
|
|
2018-06-07 19:34:56 +02:00
|
|
|
int rand_cf_idx = thread->rand.Next() % FLAGS_column_families;
|
|
|
|
auto cfh = column_families_[rand_cf_idx];
|
|
|
|
return db_->SetOptions(cfh, opts);
|
2013-02-21 00:57:27 +01:00
|
|
|
}
|
|
|
|
|
2018-06-07 19:34:56 +02:00
|
|
|
#ifndef ROCKSDB_LITE
|
|
|
|
Status NewTxn(WriteOptions& write_opts, Transaction** txn) {
|
|
|
|
if (!FLAGS_use_txn) {
|
|
|
|
return Status::InvalidArgument("NewTxn when FLAGS_use_txn is not set");
|
2013-02-21 00:57:27 +01:00
|
|
|
}
|
2018-06-07 19:34:56 +02:00
|
|
|
static std::atomic<uint64_t> txn_id = {0};
|
|
|
|
TransactionOptions txn_options;
|
|
|
|
*txn = txn_db_->BeginTransaction(write_opts, txn_options);
|
|
|
|
auto istr = std::to_string(txn_id.fetch_add(1));
|
|
|
|
Status s = (*txn)->SetName("xid" + istr);
|
|
|
|
return s;
|
|
|
|
}
|
2013-02-21 00:57:27 +01:00
|
|
|
|
2018-06-07 19:34:56 +02:00
|
|
|
Status CommitTxn(Transaction* txn) {
|
|
|
|
if (!FLAGS_use_txn) {
|
|
|
|
return Status::InvalidArgument("CommitTxn when FLAGS_use_txn is not set");
|
2013-02-21 00:57:27 +01:00
|
|
|
}
|
2018-06-07 19:34:56 +02:00
|
|
|
Status s = txn->Prepare();
|
|
|
|
if (s.ok()) {
|
|
|
|
s = txn->Commit();
|
|
|
|
}
|
|
|
|
delete txn;
|
2013-02-21 00:57:27 +01:00
|
|
|
return s;
|
|
|
|
}
|
2018-06-07 19:34:56 +02:00
|
|
|
#endif
|
2013-02-21 00:57:27 +01:00
|
|
|
|
2018-06-07 19:34:56 +02:00
|
|
|
virtual void OperateDb(ThreadState* thread) {
|
|
|
|
ReadOptions read_opts(FLAGS_verify_checksum, true);
|
|
|
|
WriteOptions write_opts;
|
|
|
|
auto shared = thread->shared;
|
|
|
|
char value[100];
|
|
|
|
std::string from_db;
|
|
|
|
if (FLAGS_sync) {
|
|
|
|
write_opts.sync = true;
|
2013-08-15 01:58:36 +02:00
|
|
|
}
|
2018-06-07 19:34:56 +02:00
|
|
|
write_opts.disableWAL = FLAGS_disable_wal;
|
|
|
|
const int prefixBound = (int)FLAGS_readpercent + (int)FLAGS_prefixpercent;
|
|
|
|
const int writeBound = prefixBound + (int)FLAGS_writepercent;
|
|
|
|
const int delBound = writeBound + (int)FLAGS_delpercent;
|
|
|
|
const int delRangeBound = delBound + (int)FLAGS_delrangepercent;
|
2012-10-03 18:58:45 +02:00
|
|
|
|
|
|
|
thread->stats.Start();
|
2013-10-24 16:43:14 +02:00
|
|
|
for (uint64_t i = 0; i < FLAGS_ops_per_thread; i++) {
|
2014-04-24 15:22:58 +02:00
|
|
|
if (thread->shared->HasVerificationFailedYet()) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (i != 0 && (i % (FLAGS_ops_per_thread / (FLAGS_reopen + 1))) == 0) {
|
2012-11-09 22:04:12 +01:00
|
|
|
{
|
2012-11-17 00:28:14 +01:00
|
|
|
thread->stats.FinishedSingleOp();
|
2012-11-09 22:04:12 +01:00
|
|
|
MutexLock l(thread->shared->GetMutex());
|
2017-10-31 09:22:51 +01:00
|
|
|
while (!thread->snapshot_queue.empty()) {
|
2017-12-13 20:51:12 +01:00
|
|
|
db_->ReleaseSnapshot(
|
|
|
|
thread->snapshot_queue.front().second.snapshot);
|
2018-08-24 23:57:37 +02:00
|
|
|
delete thread->snapshot_queue.front().second.key_vec;
|
2017-10-31 09:22:51 +01:00
|
|
|
thread->snapshot_queue.pop();
|
|
|
|
}
|
2012-11-09 22:04:12 +01:00
|
|
|
thread->shared->IncVotedReopen();
|
|
|
|
if (thread->shared->AllVotedReopen()) {
|
|
|
|
thread->shared->GetStressTest()->Reopen();
|
|
|
|
thread->shared->GetCondVar()->SignalAll();
|
2019-01-03 02:38:27 +01:00
|
|
|
} else {
|
2012-11-09 22:04:12 +01:00
|
|
|
thread->shared->GetCondVar()->Wait();
|
|
|
|
}
|
2013-02-23 20:11:16 +01:00
|
|
|
// Commenting this out as we don't want to reset stats on each open.
|
|
|
|
// thread->stats.Start();
|
2012-11-09 22:04:12 +01:00
|
|
|
}
|
|
|
|
}
|
2013-02-21 00:57:27 +01:00
|
|
|
|
2014-10-27 20:11:16 +01:00
|
|
|
// Change Options
|
|
|
|
if (FLAGS_set_options_one_in > 0 &&
|
|
|
|
thread->rand.OneIn(FLAGS_set_options_one_in)) {
|
|
|
|
SetOptions(thread);
|
|
|
|
}
|
|
|
|
|
2014-10-31 20:02:14 +01:00
|
|
|
if (FLAGS_set_in_place_one_in > 0 &&
|
|
|
|
thread->rand.OneIn(FLAGS_set_in_place_one_in)) {
|
|
|
|
options_.inplace_update_support ^= options_.inplace_update_support;
|
|
|
|
}
|
|
|
|
|
2018-06-07 19:34:56 +02:00
|
|
|
MaybeClearOneColumnFamily(thread);
|
2014-02-27 21:13:48 +01:00
|
|
|
|
2018-06-19 04:23:42 +02:00
|
|
|
#ifndef ROCKSDB_LITE
|
2016-04-19 23:36:09 +02:00
|
|
|
if (FLAGS_compact_files_one_in > 0 &&
|
|
|
|
thread->rand.Uniform(FLAGS_compact_files_one_in) == 0) {
|
|
|
|
auto* random_cf =
|
|
|
|
column_families_[thread->rand.Next() % FLAGS_column_families];
|
|
|
|
rocksdb::ColumnFamilyMetaData cf_meta_data;
|
|
|
|
db_->GetColumnFamilyMetaData(random_cf, &cf_meta_data);
|
|
|
|
|
|
|
|
// Randomly compact up to three consecutive files from a level
|
|
|
|
const int kMaxRetry = 3;
|
|
|
|
for (int attempt = 0; attempt < kMaxRetry; ++attempt) {
|
|
|
|
size_t random_level = thread->rand.Uniform(
|
|
|
|
static_cast<int>(cf_meta_data.levels.size()));
|
|
|
|
|
|
|
|
const auto& files = cf_meta_data.levels[random_level].files;
|
|
|
|
if (files.size() > 0) {
|
|
|
|
size_t random_file_index =
|
|
|
|
thread->rand.Uniform(static_cast<int>(files.size()));
|
|
|
|
if (files[random_file_index].being_compacted) {
|
|
|
|
// Retry as the selected file is currently being compacted
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
std::vector<std::string> input_files;
|
|
|
|
input_files.push_back(files[random_file_index].name);
|
|
|
|
if (random_file_index > 0 &&
|
|
|
|
!files[random_file_index - 1].being_compacted) {
|
|
|
|
input_files.push_back(files[random_file_index - 1].name);
|
|
|
|
}
|
|
|
|
if (random_file_index + 1 < files.size() &&
|
|
|
|
!files[random_file_index + 1].being_compacted) {
|
|
|
|
input_files.push_back(files[random_file_index + 1].name);
|
|
|
|
}
|
|
|
|
|
|
|
|
size_t output_level =
|
|
|
|
std::min(random_level + 1, cf_meta_data.levels.size() - 1);
|
|
|
|
auto s =
|
|
|
|
db_->CompactFiles(CompactionOptions(), random_cf, input_files,
|
|
|
|
static_cast<int>(output_level));
|
|
|
|
if (!s.ok()) {
|
2018-09-17 21:23:38 +02:00
|
|
|
fprintf(stdout, "Unable to perform CompactFiles(): %s\n",
|
|
|
|
s.ToString().c_str());
|
2016-04-19 23:36:09 +02:00
|
|
|
thread->stats.AddNumCompactFilesFailed(1);
|
|
|
|
} else {
|
|
|
|
thread->stats.AddNumCompactFilesSucceed(1);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2016-04-21 23:47:23 +02:00
|
|
|
#endif // !ROCKSDB_LITE
|
2018-06-07 19:34:56 +02:00
|
|
|
int64_t rand_key = GenerateOneKey(thread, i);
|
2014-02-27 21:13:48 +01:00
|
|
|
int rand_column_family = thread->rand.Next() % FLAGS_column_families;
|
2013-08-15 01:58:36 +02:00
|
|
|
std::string keystr = Key(rand_key);
|
|
|
|
Slice key = keystr;
|
2018-06-07 19:34:56 +02:00
|
|
|
std::unique_ptr<MutexLock> lock;
|
|
|
|
if (ShouldAcquireMutexOnKey()) {
|
|
|
|
lock.reset(new MutexLock(
|
Support for SingleDelete()
Summary:
This patch fixes #7460559. It introduces SingleDelete as a new database
operation. This operation can be used to delete keys that were never
overwritten (no put following another put of the same key). If an overwritten
key is single deleted the behavior is undefined. Single deletion of a
non-existent key has no effect but multiple consecutive single deletions are
not allowed (see limitations).
In contrast to the conventional Delete() operation, the deletion entry is
removed along with the value when the two are lined up in a compaction. Note:
The semantics are similar to @igor's prototype that allowed to have this
behavior on the granularity of a column family (
https://reviews.facebook.net/D42093 ). This new patch, however, is more
aggressive when it comes to removing tombstones: It removes the SingleDelete
together with the value whenever there is no snapshot between them while the
older patch only did this when the sequence number of the deletion was older
than the earliest snapshot.
Most of the complex additions are in the Compaction Iterator, all other changes
should be relatively straightforward. The patch also includes basic support for
single deletions in db_stress and db_bench.
Limitations:
- Not compatible with cuckoo hash tables
- Single deletions cannot be used in combination with merges and normal
deletions on the same key (other keys are not affected by this)
- Consecutive single deletions are currently not allowed (and older version of
this patch supported this so it could be resurrected if needed)
Test Plan: make all check
Reviewers: yhchiang, sdong, rven, anthony, yoshinorim, igor
Reviewed By: igor
Subscribers: maykov, dhruba, leveldb
Differential Revision: https://reviews.facebook.net/D43179
2015-09-17 20:42:56 +02:00
|
|
|
shared->GetMutexForKey(rand_column_family, rand_key)));
|
2014-02-27 21:13:48 +01:00
|
|
|
}
|
2017-12-13 20:51:12 +01:00
|
|
|
|
2014-02-27 21:13:48 +01:00
|
|
|
auto column_family = column_families_[rand_column_family];
|
2013-08-15 01:58:36 +02:00
|
|
|
|
2018-06-14 01:39:03 +02:00
|
|
|
if (FLAGS_compact_range_one_in > 0 &&
|
|
|
|
thread->rand.Uniform(FLAGS_compact_range_one_in) == 0) {
|
|
|
|
int64_t end_key_num;
|
|
|
|
if (port::kMaxInt64 - rand_key < FLAGS_compact_range_width) {
|
|
|
|
end_key_num = port::kMaxInt64;
|
|
|
|
} else {
|
|
|
|
end_key_num = FLAGS_compact_range_width + rand_key;
|
|
|
|
}
|
|
|
|
std::string end_key_buf = Key(end_key_num);
|
|
|
|
Slice end_key(end_key_buf);
|
|
|
|
|
|
|
|
CompactRangeOptions cro;
|
|
|
|
cro.exclusive_manual_compaction =
|
|
|
|
static_cast<bool>(thread->rand.Next() % 2);
|
|
|
|
Status status = db_->CompactRange(cro, column_family, &key, &end_key);
|
|
|
|
if (!status.ok()) {
|
|
|
|
printf("Unable to perform CompactRange(): %s\n",
|
|
|
|
status.ToString().c_str());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-07-31 02:35:29 +02:00
|
|
|
std::vector<int> rand_column_families =
|
|
|
|
GenerateColumnFamilies(FLAGS_column_families, rand_column_family);
|
2018-10-31 01:27:57 +01:00
|
|
|
|
|
|
|
if (FLAGS_flush_one_in > 0 &&
|
|
|
|
thread->rand.Uniform(FLAGS_flush_one_in) == 0) {
|
|
|
|
FlushOptions flush_opts;
|
|
|
|
std::vector<ColumnFamilyHandle*> cfhs;
|
|
|
|
std::for_each(
|
|
|
|
rand_column_families.begin(), rand_column_families.end(),
|
|
|
|
[this, &cfhs](int k) { cfhs.push_back(column_families_[k]); });
|
|
|
|
Status status = db_->Flush(flush_opts, cfhs);
|
|
|
|
if (!status.ok()) {
|
|
|
|
fprintf(stdout, "Unable to perform Flush(): %s\n",
|
|
|
|
status.ToString().c_str());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-07-31 02:35:29 +02:00
|
|
|
std::vector<int64_t> rand_keys = GenerateKeys(rand_key);
|
|
|
|
|
2018-06-21 07:14:12 +02:00
|
|
|
if (FLAGS_ingest_external_file_one_in > 0 &&
|
|
|
|
thread->rand.Uniform(FLAGS_ingest_external_file_one_in) == 0) {
|
2018-07-31 02:35:29 +02:00
|
|
|
TestIngestExternalFile(thread, rand_column_families, rand_keys, lock);
|
2018-06-21 07:14:12 +02:00
|
|
|
}
|
|
|
|
|
2018-11-09 00:13:28 +01:00
|
|
|
if (FLAGS_backup_one_in > 0 &&
|
|
|
|
thread->rand.Uniform(FLAGS_backup_one_in) == 0) {
|
|
|
|
Status s = TestBackupRestore(thread, rand_column_families, rand_keys);
|
|
|
|
if (!s.ok()) {
|
|
|
|
VerificationAbort(shared, "Backup/restore gave inconsistent state",
|
|
|
|
s);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-01-03 02:38:27 +01:00
|
|
|
if (FLAGS_checkpoint_one_in > 0 &&
|
|
|
|
thread->rand.Uniform(FLAGS_checkpoint_one_in) == 0) {
|
|
|
|
Status s = TestCheckpoint(thread, rand_column_families, rand_keys);
|
|
|
|
if (!s.ok()) {
|
|
|
|
VerificationAbort(shared, "Checkpoint gave inconsistent state", s);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-12-13 20:51:12 +01:00
|
|
|
if (FLAGS_acquire_snapshot_one_in > 0 &&
|
|
|
|
thread->rand.Uniform(FLAGS_acquire_snapshot_one_in) == 0) {
|
|
|
|
auto snapshot = db_->GetSnapshot();
|
|
|
|
ReadOptions ropt;
|
|
|
|
ropt.snapshot = snapshot;
|
|
|
|
std::string value_at;
|
|
|
|
// When taking a snapshot, we also read a key from that snapshot. We
|
|
|
|
// will later read the same key before releasing the snapshot and verify
|
|
|
|
// that the results are the same.
|
|
|
|
auto status_at = db_->Get(ropt, column_family, key, &value_at);
|
2018-08-24 23:57:37 +02:00
|
|
|
std::vector<bool> *key_vec = nullptr;
|
|
|
|
|
|
|
|
if (FLAGS_compare_full_db_state_snapshot &&
|
|
|
|
(thread->tid == 0)) {
|
|
|
|
key_vec = new std::vector<bool>(FLAGS_max_key);
|
2018-11-09 00:13:28 +01:00
|
|
|
// When `prefix_extractor` is set, seeking to beginning and scanning
|
|
|
|
// across prefixes are only supported with `total_order_seek` set.
|
|
|
|
ropt.total_order_seek = true;
|
2018-08-24 23:57:37 +02:00
|
|
|
std::unique_ptr<Iterator> iterator(db_->NewIterator(ropt));
|
|
|
|
for (iterator->SeekToFirst(); iterator->Valid(); iterator->Next()) {
|
|
|
|
uint64_t key_val;
|
|
|
|
if (GetIntVal(iterator->key().ToString(), &key_val)) {
|
|
|
|
(*key_vec)[key_val] = true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-12-16 01:15:58 +01:00
|
|
|
ThreadState::SnapshotState snap_state = {
|
|
|
|
snapshot, rand_column_family, column_family->GetName(),
|
2018-08-24 23:57:37 +02:00
|
|
|
keystr, status_at, value_at, key_vec};
|
2017-12-13 20:51:12 +01:00
|
|
|
thread->snapshot_queue.emplace(
|
|
|
|
std::min(FLAGS_ops_per_thread - 1, i + FLAGS_snapshot_hold_ops),
|
|
|
|
snap_state);
|
|
|
|
}
|
|
|
|
while (!thread->snapshot_queue.empty() &&
|
2018-06-07 19:34:56 +02:00
|
|
|
i == thread->snapshot_queue.front().first) {
|
2017-12-13 20:51:12 +01:00
|
|
|
auto snap_state = thread->snapshot_queue.front().second;
|
|
|
|
assert(snap_state.snapshot);
|
2018-04-19 01:25:33 +02:00
|
|
|
// Note: this is unsafe as the cf might be dropped concurrently. But it
|
|
|
|
// is ok since unclean cf drop is cunnrently not supported by write
|
|
|
|
// prepared transactions.
|
2017-12-13 20:51:12 +01:00
|
|
|
Status s =
|
|
|
|
AssertSame(db_, column_families_[snap_state.cf_at], snap_state);
|
|
|
|
if (!s.ok()) {
|
|
|
|
VerificationAbort(shared, "Snapshot gave inconsistent state", s);
|
|
|
|
}
|
|
|
|
db_->ReleaseSnapshot(snap_state.snapshot);
|
2018-08-24 23:57:37 +02:00
|
|
|
delete snap_state.key_vec;
|
2017-12-13 20:51:12 +01:00
|
|
|
thread->snapshot_queue.pop();
|
|
|
|
}
|
|
|
|
|
Support for SingleDelete()
Summary:
This patch fixes #7460559. It introduces SingleDelete as a new database
operation. This operation can be used to delete keys that were never
overwritten (no put following another put of the same key). If an overwritten
key is single deleted the behavior is undefined. Single deletion of a
non-existent key has no effect but multiple consecutive single deletions are
not allowed (see limitations).
In contrast to the conventional Delete() operation, the deletion entry is
removed along with the value when the two are lined up in a compaction. Note:
The semantics are similar to @igor's prototype that allowed to have this
behavior on the granularity of a column family (
https://reviews.facebook.net/D42093 ). This new patch, however, is more
aggressive when it comes to removing tombstones: It removes the SingleDelete
together with the value whenever there is no snapshot between them while the
older patch only did this when the sequence number of the deletion was older
than the earliest snapshot.
Most of the complex additions are in the Compaction Iterator, all other changes
should be relatively straightforward. The patch also includes basic support for
single deletions in db_stress and db_bench.
Limitations:
- Not compatible with cuckoo hash tables
- Single deletions cannot be used in combination with merges and normal
deletions on the same key (other keys are not affected by this)
- Consecutive single deletions are currently not allowed (and older version of
this patch supported this so it could be resurrected if needed)
Test Plan: make all check
Reviewers: yhchiang, sdong, rven, anthony, yoshinorim, igor
Reviewed By: igor
Subscribers: maykov, dhruba, leveldb
Differential Revision: https://reviews.facebook.net/D43179
2015-09-17 20:42:56 +02:00
|
|
|
int prob_op = thread->rand.Uniform(100);
|
2013-08-15 01:58:36 +02:00
|
|
|
if (prob_op >= 0 && prob_op < (int)FLAGS_readpercent) {
|
2013-09-20 01:47:24 +02:00
|
|
|
// OPERATION read
|
2018-07-31 02:35:29 +02:00
|
|
|
TestGet(thread, read_opts, rand_column_families, rand_keys);
|
2013-09-20 01:47:24 +02:00
|
|
|
} else if ((int)FLAGS_readpercent <= prob_op && prob_op < prefixBound) {
|
|
|
|
// OPERATION prefix scan
|
2014-03-12 00:33:42 +01:00
|
|
|
// keys are 8 bytes long, prefix size is FLAGS_prefix_size. There are
|
|
|
|
// (8 - FLAGS_prefix_size) bytes besides the prefix. So there will
|
2014-03-12 17:31:06 +01:00
|
|
|
// be 2 ^ ((8 - FLAGS_prefix_size) * 8) possible keys with the same
|
|
|
|
// prefix
|
2018-07-31 02:35:29 +02:00
|
|
|
TestPrefixScan(thread, read_opts, rand_column_families, rand_keys);
|
2013-09-20 01:47:24 +02:00
|
|
|
} else if (prefixBound <= prob_op && prob_op < writeBound) {
|
|
|
|
// OPERATION write
|
2018-07-31 02:35:29 +02:00
|
|
|
TestPut(thread, write_opts, read_opts, rand_column_families, rand_keys,
|
2018-08-23 19:04:10 +02:00
|
|
|
value, lock);
|
2013-09-20 01:47:24 +02:00
|
|
|
} else if (writeBound <= prob_op && prob_op < delBound) {
|
|
|
|
// OPERATION delete
|
2018-07-31 02:35:29 +02:00
|
|
|
TestDelete(thread, write_opts, rand_column_families, rand_keys, lock);
|
2016-12-07 21:59:59 +01:00
|
|
|
} else if (delBound <= prob_op && prob_op < delRangeBound) {
|
|
|
|
// OPERATION delete range
|
2018-07-31 02:35:29 +02:00
|
|
|
TestDeleteRange(thread, write_opts, rand_column_families, rand_keys,
|
2018-08-23 19:04:10 +02:00
|
|
|
lock);
|
2013-09-20 01:47:24 +02:00
|
|
|
} else {
|
|
|
|
// OPERATION iterate
|
2018-07-31 02:35:29 +02:00
|
|
|
TestIterate(thread, read_opts, rand_column_families, rand_keys);
|
2013-08-15 01:58:36 +02:00
|
|
|
}
|
2012-10-03 18:58:45 +02:00
|
|
|
thread->stats.FinishedSingleOp();
|
|
|
|
}
|
2013-09-20 01:47:24 +02:00
|
|
|
|
2012-10-03 18:58:45 +02:00
|
|
|
thread->stats.Stop();
|
|
|
|
}
|
|
|
|
|
2018-06-07 19:34:56 +02:00
|
|
|
virtual void VerifyDb(ThreadState* thread) const = 0;
|
|
|
|
|
|
|
|
virtual void MaybeClearOneColumnFamily(ThreadState* /* thread */) {}
|
|
|
|
|
|
|
|
virtual bool ShouldAcquireMutexOnKey() const { return false; }
|
|
|
|
|
2018-07-31 02:35:29 +02:00
|
|
|
virtual std::vector<int> GenerateColumnFamilies(
|
2018-08-23 19:04:10 +02:00
|
|
|
const int /* num_column_families */, int rand_column_family) const {
|
2018-07-31 02:35:29 +02:00
|
|
|
return {rand_column_family};
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual std::vector<int64_t> GenerateKeys(int64_t rand_key) const {
|
|
|
|
return {rand_key};
|
|
|
|
}
|
|
|
|
|
2018-06-07 19:34:56 +02:00
|
|
|
virtual Status TestGet(ThreadState* thread,
|
|
|
|
const ReadOptions& read_opts,
|
|
|
|
const std::vector<int>& rand_column_families,
|
|
|
|
const std::vector<int64_t>& rand_keys) = 0;
|
|
|
|
|
|
|
|
virtual Status TestPrefixScan(ThreadState* thread,
|
|
|
|
const ReadOptions& read_opts,
|
|
|
|
const std::vector<int>& rand_column_families,
|
|
|
|
const std::vector<int64_t>& rand_keys) = 0;
|
|
|
|
|
|
|
|
virtual Status TestPut(ThreadState* thread,
|
|
|
|
WriteOptions& write_opts, const ReadOptions& read_opts,
|
|
|
|
const std::vector<int>& cf_ids, const std::vector<int64_t>& keys,
|
|
|
|
char (&value)[100], std::unique_ptr<MutexLock>& lock) = 0;
|
|
|
|
|
|
|
|
virtual Status TestDelete(ThreadState* thread, WriteOptions& write_opts,
|
|
|
|
const std::vector<int>& rand_column_families,
|
|
|
|
const std::vector<int64_t>& rand_keys,
|
|
|
|
std::unique_ptr<MutexLock>& lock) = 0;
|
|
|
|
|
|
|
|
virtual Status TestDeleteRange(ThreadState* thread,
|
|
|
|
WriteOptions& write_opts,
|
|
|
|
const std::vector<int>& rand_column_families,
|
|
|
|
const std::vector<int64_t>& rand_keys,
|
|
|
|
std::unique_ptr<MutexLock>& lock) = 0;
|
|
|
|
|
2018-06-21 07:14:12 +02:00
|
|
|
virtual void TestIngestExternalFile(
|
|
|
|
ThreadState* thread, const std::vector<int>& rand_column_families,
|
|
|
|
const std::vector<int64_t>& rand_keys,
|
|
|
|
std::unique_ptr<MutexLock>& lock) = 0;
|
|
|
|
|
2018-06-07 19:34:56 +02:00
|
|
|
// Given a key K, this creates an iterator which scans to K and then
|
|
|
|
// does a random sequence of Next/Prev operations.
|
|
|
|
virtual Status TestIterate(ThreadState* thread,
|
|
|
|
const ReadOptions& read_opts,
|
|
|
|
const std::vector<int>& rand_column_families,
|
|
|
|
const std::vector<int64_t>& rand_keys) {
|
|
|
|
Status s;
|
|
|
|
const Snapshot* snapshot = db_->GetSnapshot();
|
|
|
|
ReadOptions readoptionscopy = read_opts;
|
|
|
|
readoptionscopy.snapshot = snapshot;
|
2018-07-23 19:40:40 +02:00
|
|
|
|
|
|
|
std::string upper_bound_str;
|
|
|
|
Slice upper_bound;
|
|
|
|
if (thread->rand.OneIn(16)) {
|
|
|
|
// in 1/16 chance, set a iterator upper bound
|
|
|
|
int64_t rand_upper_key = GenerateOneKey(thread, FLAGS_ops_per_thread);
|
|
|
|
upper_bound_str = Key(rand_upper_key);
|
|
|
|
upper_bound = Slice(upper_bound_str);
|
|
|
|
// uppder_bound can be smaller than seek key, but the query itself
|
|
|
|
// should not crash either.
|
|
|
|
readoptionscopy.iterate_upper_bound = &upper_bound;
|
|
|
|
}
|
|
|
|
std::string lower_bound_str;
|
|
|
|
Slice lower_bound;
|
|
|
|
if (thread->rand.OneIn(16)) {
|
|
|
|
// in 1/16 chance, set a iterator lower bound
|
|
|
|
int64_t rand_lower_key = GenerateOneKey(thread, FLAGS_ops_per_thread);
|
|
|
|
lower_bound_str = Key(rand_lower_key);
|
|
|
|
lower_bound = Slice(lower_bound_str);
|
|
|
|
// uppder_bound can be smaller than seek key, but the query itself
|
|
|
|
// should not crash either.
|
|
|
|
readoptionscopy.iterate_lower_bound = &lower_bound;
|
|
|
|
}
|
|
|
|
|
2018-06-07 19:34:56 +02:00
|
|
|
auto cfh = column_families_[rand_column_families[0]];
|
|
|
|
std::unique_ptr<Iterator> iter(db_->NewIterator(readoptionscopy, cfh));
|
|
|
|
|
|
|
|
std::string key_str = Key(rand_keys[0]);
|
|
|
|
Slice key = key_str;
|
|
|
|
iter->Seek(key);
|
|
|
|
for (uint64_t i = 0; i < FLAGS_num_iterations && iter->Valid(); i++) {
|
|
|
|
if (thread->rand.OneIn(2)) {
|
|
|
|
iter->Next();
|
|
|
|
} else {
|
|
|
|
iter->Prev();
|
2012-10-03 18:58:45 +02:00
|
|
|
}
|
|
|
|
}
|
2018-06-07 19:34:56 +02:00
|
|
|
|
|
|
|
if (s.ok()) {
|
|
|
|
thread->stats.AddIterations(1);
|
|
|
|
} else {
|
|
|
|
thread->stats.AddErrors(1);
|
|
|
|
}
|
|
|
|
|
|
|
|
db_->ReleaseSnapshot(snapshot);
|
|
|
|
|
|
|
|
return s;
|
2012-10-03 18:58:45 +02:00
|
|
|
}
|
|
|
|
|
2018-11-09 00:13:28 +01:00
|
|
|
#ifdef ROCKSDB_LITE
|
|
|
|
virtual Status TestBackupRestore(
|
|
|
|
ThreadState* /* thread */,
|
|
|
|
const std::vector<int>& /* rand_column_families */,
|
|
|
|
const std::vector<int64_t>& /* rand_keys */) {
|
|
|
|
assert(false);
|
|
|
|
fprintf(stderr,
|
|
|
|
"RocksDB lite does not support "
|
|
|
|
"TestBackupRestore\n");
|
|
|
|
std::terminate();
|
|
|
|
}
|
2019-01-03 02:38:27 +01:00
|
|
|
|
|
|
|
virtual Status TestCheckpoint(
|
|
|
|
ThreadState* /* thread */,
|
|
|
|
const std::vector<int>& /* rand_column_families */,
|
|
|
|
const std::vector<int64_t>& /* rand_keys */) {
|
|
|
|
assert(false);
|
|
|
|
fprintf(stderr,
|
|
|
|
"RocksDB lite does not support "
|
|
|
|
"TestCheckpoint\n");
|
|
|
|
std::terminate();
|
|
|
|
}
|
2018-11-09 00:13:28 +01:00
|
|
|
#else // ROCKSDB_LITE
|
|
|
|
virtual Status TestBackupRestore(ThreadState* thread,
|
|
|
|
const std::vector<int>& rand_column_families,
|
|
|
|
const std::vector<int64_t>& rand_keys) {
|
|
|
|
// Note the column families chosen by `rand_column_families` cannot be
|
|
|
|
// dropped while the locks for `rand_keys` are held. So we should not have
|
|
|
|
// to worry about accessing those column families throughout this function.
|
|
|
|
assert(rand_column_families.size() == rand_keys.size());
|
|
|
|
std::string backup_dir = FLAGS_db + "/.backup" + ToString(thread->tid);
|
|
|
|
std::string restore_dir = FLAGS_db + "/.restore" + ToString(thread->tid);
|
|
|
|
BackupableDBOptions backup_opts(backup_dir);
|
|
|
|
BackupEngine* backup_engine = nullptr;
|
|
|
|
Status s = BackupEngine::Open(FLAGS_env, backup_opts, &backup_engine);
|
|
|
|
if (s.ok()) {
|
|
|
|
s = backup_engine->CreateNewBackup(db_);
|
|
|
|
}
|
|
|
|
if (s.ok()) {
|
|
|
|
delete backup_engine;
|
|
|
|
backup_engine = nullptr;
|
|
|
|
s = BackupEngine::Open(FLAGS_env, backup_opts, &backup_engine);
|
|
|
|
}
|
|
|
|
if (s.ok()) {
|
|
|
|
s = backup_engine->RestoreDBFromLatestBackup(restore_dir /* db_dir */,
|
|
|
|
restore_dir /* wal_dir */);
|
|
|
|
}
|
|
|
|
if (s.ok()) {
|
|
|
|
s = backup_engine->PurgeOldBackups(0 /* num_backups_to_keep */);
|
|
|
|
}
|
|
|
|
DB* restored_db = nullptr;
|
|
|
|
std::vector<ColumnFamilyHandle*> restored_cf_handles;
|
|
|
|
if (s.ok()) {
|
|
|
|
Options restore_options(options_);
|
|
|
|
restore_options.listeners.clear();
|
|
|
|
std::vector<ColumnFamilyDescriptor> cf_descriptors;
|
|
|
|
// TODO(ajkr): `column_family_names_` is not safe to access here when
|
|
|
|
// `clear_column_family_one_in != 0`. But we can't easily switch to
|
|
|
|
// `ListColumnFamilies` to get names because it won't necessarily give
|
|
|
|
// the same order as `column_family_names_`.
|
|
|
|
assert(FLAGS_clear_column_family_one_in == 0);
|
|
|
|
for (auto name : column_family_names_) {
|
|
|
|
cf_descriptors.emplace_back(name, ColumnFamilyOptions(restore_options));
|
|
|
|
}
|
|
|
|
s = DB::Open(DBOptions(restore_options), restore_dir, cf_descriptors,
|
|
|
|
&restored_cf_handles, &restored_db);
|
|
|
|
}
|
|
|
|
// for simplicity, currently only verifies existence/non-existence of a few
|
|
|
|
// keys
|
|
|
|
for (size_t i = 0; s.ok() && i < rand_column_families.size(); ++i) {
|
|
|
|
std::string key_str = Key(rand_keys[i]);
|
|
|
|
Slice key = key_str;
|
|
|
|
std::string restored_value;
|
|
|
|
Status get_status = restored_db->Get(
|
|
|
|
ReadOptions(), restored_cf_handles[rand_column_families[i]], key,
|
|
|
|
&restored_value);
|
|
|
|
bool exists =
|
|
|
|
thread->shared->Exists(rand_column_families[i], rand_keys[i]);
|
|
|
|
if (get_status.ok()) {
|
|
|
|
if (!exists) {
|
|
|
|
s = Status::Corruption(
|
|
|
|
"key exists in restore but not in original db");
|
|
|
|
}
|
|
|
|
} else if (get_status.IsNotFound()) {
|
|
|
|
if (exists) {
|
|
|
|
s = Status::Corruption(
|
|
|
|
"key exists in original db but not in restore");
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
s = get_status;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (backup_engine != nullptr) {
|
|
|
|
delete backup_engine;
|
|
|
|
backup_engine = nullptr;
|
|
|
|
}
|
|
|
|
if (restored_db != nullptr) {
|
|
|
|
for (auto* cf_handle : restored_cf_handles) {
|
|
|
|
restored_db->DestroyColumnFamilyHandle(cf_handle);
|
|
|
|
}
|
|
|
|
delete restored_db;
|
|
|
|
restored_db = nullptr;
|
|
|
|
}
|
|
|
|
if (!s.ok()) {
|
|
|
|
printf("A backup/restore operation failed with: %s\n",
|
|
|
|
s.ToString().c_str());
|
|
|
|
}
|
|
|
|
return s;
|
|
|
|
}
|
2019-01-03 02:38:27 +01:00
|
|
|
|
|
|
|
virtual Status TestCheckpoint(ThreadState* thread,
|
|
|
|
const std::vector<int>& rand_column_families,
|
|
|
|
const std::vector<int64_t>& rand_keys) {
|
|
|
|
// Note the column families chosen by `rand_column_families` cannot be
|
|
|
|
// dropped while the locks for `rand_keys` are held. So we should not have
|
|
|
|
// to worry about accessing those column families throughout this function.
|
|
|
|
assert(rand_column_families.size() == rand_keys.size());
|
|
|
|
std::string checkpoint_dir =
|
|
|
|
FLAGS_db + "/.checkpoint" + ToString(thread->tid);
|
|
|
|
DestroyDB(checkpoint_dir, Options());
|
|
|
|
Checkpoint* checkpoint = nullptr;
|
|
|
|
Status s = Checkpoint::Create(db_, &checkpoint);
|
|
|
|
if (s.ok()) {
|
|
|
|
s = checkpoint->CreateCheckpoint(checkpoint_dir);
|
|
|
|
}
|
|
|
|
std::vector<ColumnFamilyHandle*> cf_handles;
|
|
|
|
DB* checkpoint_db = nullptr;
|
|
|
|
if (s.ok()) {
|
|
|
|
delete checkpoint;
|
|
|
|
checkpoint = nullptr;
|
|
|
|
Options options(options_);
|
|
|
|
options.listeners.clear();
|
|
|
|
std::vector<ColumnFamilyDescriptor> cf_descs;
|
|
|
|
// TODO(ajkr): `column_family_names_` is not safe to access here when
|
|
|
|
// `clear_column_family_one_in != 0`. But we can't easily switch to
|
|
|
|
// `ListColumnFamilies` to get names because it won't necessarily give
|
|
|
|
// the same order as `column_family_names_`.
|
|
|
|
if (FLAGS_clear_column_family_one_in == 0) {
|
|
|
|
for (const auto& name : column_family_names_) {
|
|
|
|
cf_descs.emplace_back(name, ColumnFamilyOptions(options));
|
|
|
|
}
|
|
|
|
s = DB::OpenForReadOnly(DBOptions(options), checkpoint_dir, cf_descs,
|
|
|
|
&cf_handles, &checkpoint_db);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (checkpoint_db != nullptr) {
|
|
|
|
for (size_t i = 0; s.ok() && i < rand_column_families.size(); ++i) {
|
|
|
|
std::string key_str = Key(rand_keys[i]);
|
|
|
|
Slice key = key_str;
|
|
|
|
std::string value;
|
|
|
|
Status get_status = checkpoint_db->Get(
|
|
|
|
ReadOptions(), cf_handles[rand_column_families[i]], key, &value);
|
|
|
|
bool exists =
|
|
|
|
thread->shared->Exists(rand_column_families[i], rand_keys[i]);
|
|
|
|
if (get_status.ok()) {
|
|
|
|
if (!exists) {
|
|
|
|
s = Status::Corruption(
|
|
|
|
"key exists in checkpoint but not in original db");
|
|
|
|
}
|
|
|
|
} else if (get_status.IsNotFound()) {
|
|
|
|
if (exists) {
|
|
|
|
s = Status::Corruption(
|
|
|
|
"key exists in original db but not in checkpoint");
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
s = get_status;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
for (auto cfh : cf_handles) {
|
|
|
|
delete cfh;
|
|
|
|
}
|
|
|
|
cf_handles.clear();
|
|
|
|
delete checkpoint_db;
|
|
|
|
checkpoint_db = nullptr;
|
|
|
|
}
|
|
|
|
DestroyDB(checkpoint_dir, Options());
|
|
|
|
if (!s.ok()) {
|
|
|
|
fprintf(stderr, "A checkpoint operation failed with: %s\n",
|
|
|
|
s.ToString().c_str());
|
|
|
|
}
|
|
|
|
return s;
|
|
|
|
}
|
2018-11-09 00:13:28 +01:00
|
|
|
#endif // ROCKSDB_LITE
|
|
|
|
|
2017-12-13 20:51:12 +01:00
|
|
|
void VerificationAbort(SharedState* shared, std::string msg, Status s) const {
|
|
|
|
printf("Verification failed: %s. Status is %s\n", msg.c_str(),
|
|
|
|
s.ToString().c_str());
|
|
|
|
shared->SetVerificationFailure();
|
|
|
|
}
|
|
|
|
|
2014-04-24 15:22:58 +02:00
|
|
|
void VerificationAbort(SharedState* shared, std::string msg, int cf,
|
2015-11-19 20:47:12 +01:00
|
|
|
int64_t key) const {
|
|
|
|
printf("Verification failed for column family %d key %" PRIi64 ": %s\n", cf, key,
|
2014-04-24 15:22:58 +02:00
|
|
|
msg.c_str());
|
|
|
|
shared->SetVerificationFailure();
|
2012-10-13 02:00:25 +02:00
|
|
|
}
|
|
|
|
|
2012-10-03 18:58:45 +02:00
|
|
|
void PrintEnv() const {
|
Support for SingleDelete()
Summary:
This patch fixes #7460559. It introduces SingleDelete as a new database
operation. This operation can be used to delete keys that were never
overwritten (no put following another put of the same key). If an overwritten
key is single deleted the behavior is undefined. Single deletion of a
non-existent key has no effect but multiple consecutive single deletions are
not allowed (see limitations).
In contrast to the conventional Delete() operation, the deletion entry is
removed along with the value when the two are lined up in a compaction. Note:
The semantics are similar to @igor's prototype that allowed to have this
behavior on the granularity of a column family (
https://reviews.facebook.net/D42093 ). This new patch, however, is more
aggressive when it comes to removing tombstones: It removes the SingleDelete
together with the value whenever there is no snapshot between them while the
older patch only did this when the sequence number of the deletion was older
than the earliest snapshot.
Most of the complex additions are in the Compaction Iterator, all other changes
should be relatively straightforward. The patch also includes basic support for
single deletions in db_stress and db_bench.
Limitations:
- Not compatible with cuckoo hash tables
- Single deletions cannot be used in combination with merges and normal
deletions on the same key (other keys are not affected by this)
- Consecutive single deletions are currently not allowed (and older version of
this patch supported this so it could be resurrected if needed)
Test Plan: make all check
Reviewers: yhchiang, sdong, rven, anthony, yoshinorim, igor
Reviewed By: igor
Subscribers: maykov, dhruba, leveldb
Differential Revision: https://reviews.facebook.net/D43179
2015-09-17 20:42:56 +02:00
|
|
|
fprintf(stdout, "RocksDB version : %d.%d\n", kMajorVersion,
|
2014-02-27 21:13:48 +01:00
|
|
|
kMinorVersion);
|
2018-06-05 04:59:44 +02:00
|
|
|
fprintf(stdout, "Format version : %d\n", FLAGS_format_version);
|
2017-12-13 20:51:12 +01:00
|
|
|
fprintf(stdout, "TransactionDB : %s\n",
|
|
|
|
FLAGS_use_txn ? "true" : "false");
|
2019-01-03 02:38:27 +01:00
|
|
|
fprintf(stdout, "Read only mode : %s\n",
|
|
|
|
FLAGS_read_only ? "true" : "false");
|
2018-10-27 00:06:44 +02:00
|
|
|
fprintf(stdout, "Atomic flush : %s\n",
|
|
|
|
FLAGS_atomic_flush ? "true" : "false");
|
Support for SingleDelete()
Summary:
This patch fixes #7460559. It introduces SingleDelete as a new database
operation. This operation can be used to delete keys that were never
overwritten (no put following another put of the same key). If an overwritten
key is single deleted the behavior is undefined. Single deletion of a
non-existent key has no effect but multiple consecutive single deletions are
not allowed (see limitations).
In contrast to the conventional Delete() operation, the deletion entry is
removed along with the value when the two are lined up in a compaction. Note:
The semantics are similar to @igor's prototype that allowed to have this
behavior on the granularity of a column family (
https://reviews.facebook.net/D42093 ). This new patch, however, is more
aggressive when it comes to removing tombstones: It removes the SingleDelete
together with the value whenever there is no snapshot between them while the
older patch only did this when the sequence number of the deletion was older
than the earliest snapshot.
Most of the complex additions are in the Compaction Iterator, all other changes
should be relatively straightforward. The patch also includes basic support for
single deletions in db_stress and db_bench.
Limitations:
- Not compatible with cuckoo hash tables
- Single deletions cannot be used in combination with merges and normal
deletions on the same key (other keys are not affected by this)
- Consecutive single deletions are currently not allowed (and older version of
this patch supported this so it could be resurrected if needed)
Test Plan: make all check
Reviewers: yhchiang, sdong, rven, anthony, yoshinorim, igor
Reviewed By: igor
Subscribers: maykov, dhruba, leveldb
Differential Revision: https://reviews.facebook.net/D43179
2015-09-17 20:42:56 +02:00
|
|
|
fprintf(stdout, "Column families : %d\n", FLAGS_column_families);
|
2014-02-27 21:13:48 +01:00
|
|
|
if (!FLAGS_test_batches_snapshots) {
|
Support for SingleDelete()
Summary:
This patch fixes #7460559. It introduces SingleDelete as a new database
operation. This operation can be used to delete keys that were never
overwritten (no put following another put of the same key). If an overwritten
key is single deleted the behavior is undefined. Single deletion of a
non-existent key has no effect but multiple consecutive single deletions are
not allowed (see limitations).
In contrast to the conventional Delete() operation, the deletion entry is
removed along with the value when the two are lined up in a compaction. Note:
The semantics are similar to @igor's prototype that allowed to have this
behavior on the granularity of a column family (
https://reviews.facebook.net/D42093 ). This new patch, however, is more
aggressive when it comes to removing tombstones: It removes the SingleDelete
together with the value whenever there is no snapshot between them while the
older patch only did this when the sequence number of the deletion was older
than the earliest snapshot.
Most of the complex additions are in the Compaction Iterator, all other changes
should be relatively straightforward. The patch also includes basic support for
single deletions in db_stress and db_bench.
Limitations:
- Not compatible with cuckoo hash tables
- Single deletions cannot be used in combination with merges and normal
deletions on the same key (other keys are not affected by this)
- Consecutive single deletions are currently not allowed (and older version of
this patch supported this so it could be resurrected if needed)
Test Plan: make all check
Reviewers: yhchiang, sdong, rven, anthony, yoshinorim, igor
Reviewed By: igor
Subscribers: maykov, dhruba, leveldb
Differential Revision: https://reviews.facebook.net/D43179
2015-09-17 20:42:56 +02:00
|
|
|
fprintf(stdout, "Clear CFs one in : %d\n",
|
2014-02-27 21:13:48 +01:00
|
|
|
FLAGS_clear_column_family_one_in);
|
|
|
|
}
|
Support for SingleDelete()
Summary:
This patch fixes #7460559. It introduces SingleDelete as a new database
operation. This operation can be used to delete keys that were never
overwritten (no put following another put of the same key). If an overwritten
key is single deleted the behavior is undefined. Single deletion of a
non-existent key has no effect but multiple consecutive single deletions are
not allowed (see limitations).
In contrast to the conventional Delete() operation, the deletion entry is
removed along with the value when the two are lined up in a compaction. Note:
The semantics are similar to @igor's prototype that allowed to have this
behavior on the granularity of a column family (
https://reviews.facebook.net/D42093 ). This new patch, however, is more
aggressive when it comes to removing tombstones: It removes the SingleDelete
together with the value whenever there is no snapshot between them while the
older patch only did this when the sequence number of the deletion was older
than the earliest snapshot.
Most of the complex additions are in the Compaction Iterator, all other changes
should be relatively straightforward. The patch also includes basic support for
single deletions in db_stress and db_bench.
Limitations:
- Not compatible with cuckoo hash tables
- Single deletions cannot be used in combination with merges and normal
deletions on the same key (other keys are not affected by this)
- Consecutive single deletions are currently not allowed (and older version of
this patch supported this so it could be resurrected if needed)
Test Plan: make all check
Reviewers: yhchiang, sdong, rven, anthony, yoshinorim, igor
Reviewed By: igor
Subscribers: maykov, dhruba, leveldb
Differential Revision: https://reviews.facebook.net/D43179
2015-09-17 20:42:56 +02:00
|
|
|
fprintf(stdout, "Number of threads : %d\n", FLAGS_threads);
|
|
|
|
fprintf(stdout, "Ops per thread : %lu\n",
|
2013-11-17 08:44:39 +01:00
|
|
|
(unsigned long)FLAGS_ops_per_thread);
|
Timestamp and TTL Wrapper for rocksdb
Summary:
When opened with DBTimestamp::Open call, timestamps are prepended to and stripped from the value during subsequent Put and Get calls respectively. The Timestamp is used to discard values in Get and custom compaction filter which have exceeded their TTL which is specified during Open.
Have made a temporary change to Makefile to let us test with the temporary file TestTime.cc. Have also changed the private members of db_impl.h to protected to let them be inherited by the new class DBTimestamp
Test Plan: make db_timestamp; TestTime.cc(will not check it in) shows how to use the apis currently, but I will write unit-tests shortly
Reviewers: dhruba, vamsi, haobo, sheki, heyongqiang, vkrest
Reviewed By: vamsi
CC: zshao, xjin, vkrest, MarkCallaghan
Differential Revision: https://reviews.facebook.net/D10311
2013-04-15 22:33:13 +02:00
|
|
|
std::string ttl_state("unused");
|
|
|
|
if (FLAGS_ttl > 0) {
|
|
|
|
ttl_state = NumberToString(FLAGS_ttl);
|
|
|
|
}
|
Support for SingleDelete()
Summary:
This patch fixes #7460559. It introduces SingleDelete as a new database
operation. This operation can be used to delete keys that were never
overwritten (no put following another put of the same key). If an overwritten
key is single deleted the behavior is undefined. Single deletion of a
non-existent key has no effect but multiple consecutive single deletions are
not allowed (see limitations).
In contrast to the conventional Delete() operation, the deletion entry is
removed along with the value when the two are lined up in a compaction. Note:
The semantics are similar to @igor's prototype that allowed to have this
behavior on the granularity of a column family (
https://reviews.facebook.net/D42093 ). This new patch, however, is more
aggressive when it comes to removing tombstones: It removes the SingleDelete
together with the value whenever there is no snapshot between them while the
older patch only did this when the sequence number of the deletion was older
than the earliest snapshot.
Most of the complex additions are in the Compaction Iterator, all other changes
should be relatively straightforward. The patch also includes basic support for
single deletions in db_stress and db_bench.
Limitations:
- Not compatible with cuckoo hash tables
- Single deletions cannot be used in combination with merges and normal
deletions on the same key (other keys are not affected by this)
- Consecutive single deletions are currently not allowed (and older version of
this patch supported this so it could be resurrected if needed)
Test Plan: make all check
Reviewers: yhchiang, sdong, rven, anthony, yoshinorim, igor
Reviewed By: igor
Subscribers: maykov, dhruba, leveldb
Differential Revision: https://reviews.facebook.net/D43179
2015-09-17 20:42:56 +02:00
|
|
|
fprintf(stdout, "Time to live(sec) : %s\n", ttl_state.c_str());
|
|
|
|
fprintf(stdout, "Read percentage : %d%%\n", FLAGS_readpercent);
|
|
|
|
fprintf(stdout, "Prefix percentage : %d%%\n", FLAGS_prefixpercent);
|
|
|
|
fprintf(stdout, "Write percentage : %d%%\n", FLAGS_writepercent);
|
|
|
|
fprintf(stdout, "Delete percentage : %d%%\n", FLAGS_delpercent);
|
2016-12-07 21:59:59 +01:00
|
|
|
fprintf(stdout, "Delete range percentage : %d%%\n", FLAGS_delrangepercent);
|
Support for SingleDelete()
Summary:
This patch fixes #7460559. It introduces SingleDelete as a new database
operation. This operation can be used to delete keys that were never
overwritten (no put following another put of the same key). If an overwritten
key is single deleted the behavior is undefined. Single deletion of a
non-existent key has no effect but multiple consecutive single deletions are
not allowed (see limitations).
In contrast to the conventional Delete() operation, the deletion entry is
removed along with the value when the two are lined up in a compaction. Note:
The semantics are similar to @igor's prototype that allowed to have this
behavior on the granularity of a column family (
https://reviews.facebook.net/D42093 ). This new patch, however, is more
aggressive when it comes to removing tombstones: It removes the SingleDelete
together with the value whenever there is no snapshot between them while the
older patch only did this when the sequence number of the deletion was older
than the earliest snapshot.
Most of the complex additions are in the Compaction Iterator, all other changes
should be relatively straightforward. The patch also includes basic support for
single deletions in db_stress and db_bench.
Limitations:
- Not compatible with cuckoo hash tables
- Single deletions cannot be used in combination with merges and normal
deletions on the same key (other keys are not affected by this)
- Consecutive single deletions are currently not allowed (and older version of
this patch supported this so it could be resurrected if needed)
Test Plan: make all check
Reviewers: yhchiang, sdong, rven, anthony, yoshinorim, igor
Reviewed By: igor
Subscribers: maykov, dhruba, leveldb
Differential Revision: https://reviews.facebook.net/D43179
2015-09-17 20:42:56 +02:00
|
|
|
fprintf(stdout, "No overwrite percentage : %d%%\n",
|
|
|
|
FLAGS_nooverwritepercent);
|
|
|
|
fprintf(stdout, "Iterate percentage : %d%%\n", FLAGS_iterpercent);
|
|
|
|
fprintf(stdout, "DB-write-buffer-size : %" PRIu64 "\n",
|
|
|
|
FLAGS_db_write_buffer_size);
|
|
|
|
fprintf(stdout, "Write-buffer-size : %d\n",
|
|
|
|
FLAGS_write_buffer_size);
|
|
|
|
fprintf(stdout, "Iterations : %lu\n",
|
2013-11-17 08:44:39 +01:00
|
|
|
(unsigned long)FLAGS_num_iterations);
|
Support for SingleDelete()
Summary:
This patch fixes #7460559. It introduces SingleDelete as a new database
operation. This operation can be used to delete keys that were never
overwritten (no put following another put of the same key). If an overwritten
key is single deleted the behavior is undefined. Single deletion of a
non-existent key has no effect but multiple consecutive single deletions are
not allowed (see limitations).
In contrast to the conventional Delete() operation, the deletion entry is
removed along with the value when the two are lined up in a compaction. Note:
The semantics are similar to @igor's prototype that allowed to have this
behavior on the granularity of a column family (
https://reviews.facebook.net/D42093 ). This new patch, however, is more
aggressive when it comes to removing tombstones: It removes the SingleDelete
together with the value whenever there is no snapshot between them while the
older patch only did this when the sequence number of the deletion was older
than the earliest snapshot.
Most of the complex additions are in the Compaction Iterator, all other changes
should be relatively straightforward. The patch also includes basic support for
single deletions in db_stress and db_bench.
Limitations:
- Not compatible with cuckoo hash tables
- Single deletions cannot be used in combination with merges and normal
deletions on the same key (other keys are not affected by this)
- Consecutive single deletions are currently not allowed (and older version of
this patch supported this so it could be resurrected if needed)
Test Plan: make all check
Reviewers: yhchiang, sdong, rven, anthony, yoshinorim, igor
Reviewed By: igor
Subscribers: maykov, dhruba, leveldb
Differential Revision: https://reviews.facebook.net/D43179
2015-09-17 20:42:56 +02:00
|
|
|
fprintf(stdout, "Max key : %lu\n",
|
2013-11-17 08:44:39 +01:00
|
|
|
(unsigned long)FLAGS_max_key);
|
Support for SingleDelete()
Summary:
This patch fixes #7460559. It introduces SingleDelete as a new database
operation. This operation can be used to delete keys that were never
overwritten (no put following another put of the same key). If an overwritten
key is single deleted the behavior is undefined. Single deletion of a
non-existent key has no effect but multiple consecutive single deletions are
not allowed (see limitations).
In contrast to the conventional Delete() operation, the deletion entry is
removed along with the value when the two are lined up in a compaction. Note:
The semantics are similar to @igor's prototype that allowed to have this
behavior on the granularity of a column family (
https://reviews.facebook.net/D42093 ). This new patch, however, is more
aggressive when it comes to removing tombstones: It removes the SingleDelete
together with the value whenever there is no snapshot between them while the
older patch only did this when the sequence number of the deletion was older
than the earliest snapshot.
Most of the complex additions are in the Compaction Iterator, all other changes
should be relatively straightforward. The patch also includes basic support for
single deletions in db_stress and db_bench.
Limitations:
- Not compatible with cuckoo hash tables
- Single deletions cannot be used in combination with merges and normal
deletions on the same key (other keys are not affected by this)
- Consecutive single deletions are currently not allowed (and older version of
this patch supported this so it could be resurrected if needed)
Test Plan: make all check
Reviewers: yhchiang, sdong, rven, anthony, yoshinorim, igor
Reviewed By: igor
Subscribers: maykov, dhruba, leveldb
Differential Revision: https://reviews.facebook.net/D43179
2015-09-17 20:42:56 +02:00
|
|
|
fprintf(stdout, "Ratio #ops/#keys : %f\n",
|
|
|
|
(1.0 * FLAGS_ops_per_thread * FLAGS_threads) / FLAGS_max_key);
|
|
|
|
fprintf(stdout, "Num times DB reopens : %d\n", FLAGS_reopen);
|
|
|
|
fprintf(stdout, "Batches/snapshots : %d\n",
|
2013-02-21 00:57:27 +01:00
|
|
|
FLAGS_test_batches_snapshots);
|
Support for SingleDelete()
Summary:
This patch fixes #7460559. It introduces SingleDelete as a new database
operation. This operation can be used to delete keys that were never
overwritten (no put following another put of the same key). If an overwritten
key is single deleted the behavior is undefined. Single deletion of a
non-existent key has no effect but multiple consecutive single deletions are
not allowed (see limitations).
In contrast to the conventional Delete() operation, the deletion entry is
removed along with the value when the two are lined up in a compaction. Note:
The semantics are similar to @igor's prototype that allowed to have this
behavior on the granularity of a column family (
https://reviews.facebook.net/D42093 ). This new patch, however, is more
aggressive when it comes to removing tombstones: It removes the SingleDelete
together with the value whenever there is no snapshot between them while the
older patch only did this when the sequence number of the deletion was older
than the earliest snapshot.
Most of the complex additions are in the Compaction Iterator, all other changes
should be relatively straightforward. The patch also includes basic support for
single deletions in db_stress and db_bench.
Limitations:
- Not compatible with cuckoo hash tables
- Single deletions cannot be used in combination with merges and normal
deletions on the same key (other keys are not affected by this)
- Consecutive single deletions are currently not allowed (and older version of
this patch supported this so it could be resurrected if needed)
Test Plan: make all check
Reviewers: yhchiang, sdong, rven, anthony, yoshinorim, igor
Reviewed By: igor
Subscribers: maykov, dhruba, leveldb
Differential Revision: https://reviews.facebook.net/D43179
2015-09-17 20:42:56 +02:00
|
|
|
fprintf(stdout, "Do update in place : %d\n", FLAGS_in_place_update);
|
|
|
|
fprintf(stdout, "Num keys per lock : %d\n",
|
2012-10-03 18:58:45 +02:00
|
|
|
1 << FLAGS_log2_keys_per_lock);
|
2015-08-11 20:46:15 +02:00
|
|
|
std::string compression = CompressionTypeToString(FLAGS_compression_type_e);
|
Support for SingleDelete()
Summary:
This patch fixes #7460559. It introduces SingleDelete as a new database
operation. This operation can be used to delete keys that were never
overwritten (no put following another put of the same key). If an overwritten
key is single deleted the behavior is undefined. Single deletion of a
non-existent key has no effect but multiple consecutive single deletions are
not allowed (see limitations).
In contrast to the conventional Delete() operation, the deletion entry is
removed along with the value when the two are lined up in a compaction. Note:
The semantics are similar to @igor's prototype that allowed to have this
behavior on the granularity of a column family (
https://reviews.facebook.net/D42093 ). This new patch, however, is more
aggressive when it comes to removing tombstones: It removes the SingleDelete
together with the value whenever there is no snapshot between them while the
older patch only did this when the sequence number of the deletion was older
than the earliest snapshot.
Most of the complex additions are in the Compaction Iterator, all other changes
should be relatively straightforward. The patch also includes basic support for
single deletions in db_stress and db_bench.
Limitations:
- Not compatible with cuckoo hash tables
- Single deletions cannot be used in combination with merges and normal
deletions on the same key (other keys are not affected by this)
- Consecutive single deletions are currently not allowed (and older version of
this patch supported this so it could be resurrected if needed)
Test Plan: make all check
Reviewers: yhchiang, sdong, rven, anthony, yoshinorim, igor
Reviewed By: igor
Subscribers: maykov, dhruba, leveldb
Differential Revision: https://reviews.facebook.net/D43179
2015-09-17 20:42:56 +02:00
|
|
|
fprintf(stdout, "Compression : %s\n", compression.c_str());
|
2017-08-24 04:31:40 +02:00
|
|
|
std::string checksum = ChecksumTypeToString(FLAGS_checksum_type_e);
|
|
|
|
fprintf(stdout, "Checksum type : %s\n", checksum.c_str());
|
2016-04-18 23:43:33 +02:00
|
|
|
fprintf(stdout, "Max subcompactions : %" PRIu64 "\n",
|
|
|
|
FLAGS_subcompactions);
|
2013-08-23 08:10:02 +02:00
|
|
|
|
|
|
|
const char* memtablerep = "";
|
|
|
|
switch (FLAGS_rep_factory) {
|
|
|
|
case kSkipList:
|
|
|
|
memtablerep = "skip_list";
|
|
|
|
break;
|
2013-12-03 21:42:15 +01:00
|
|
|
case kHashSkipList:
|
2013-08-23 08:10:02 +02:00
|
|
|
memtablerep = "prefix_hash";
|
|
|
|
break;
|
|
|
|
case kVectorRep:
|
|
|
|
memtablerep = "vector";
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
Support for SingleDelete()
Summary:
This patch fixes #7460559. It introduces SingleDelete as a new database
operation. This operation can be used to delete keys that were never
overwritten (no put following another put of the same key). If an overwritten
key is single deleted the behavior is undefined. Single deletion of a
non-existent key has no effect but multiple consecutive single deletions are
not allowed (see limitations).
In contrast to the conventional Delete() operation, the deletion entry is
removed along with the value when the two are lined up in a compaction. Note:
The semantics are similar to @igor's prototype that allowed to have this
behavior on the granularity of a column family (
https://reviews.facebook.net/D42093 ). This new patch, however, is more
aggressive when it comes to removing tombstones: It removes the SingleDelete
together with the value whenever there is no snapshot between them while the
older patch only did this when the sequence number of the deletion was older
than the earliest snapshot.
Most of the complex additions are in the Compaction Iterator, all other changes
should be relatively straightforward. The patch also includes basic support for
single deletions in db_stress and db_bench.
Limitations:
- Not compatible with cuckoo hash tables
- Single deletions cannot be used in combination with merges and normal
deletions on the same key (other keys are not affected by this)
- Consecutive single deletions are currently not allowed (and older version of
this patch supported this so it could be resurrected if needed)
Test Plan: make all check
Reviewers: yhchiang, sdong, rven, anthony, yoshinorim, igor
Reviewed By: igor
Subscribers: maykov, dhruba, leveldb
Differential Revision: https://reviews.facebook.net/D43179
2015-09-17 20:42:56 +02:00
|
|
|
fprintf(stdout, "Memtablerep : %s\n", memtablerep);
|
2013-08-23 08:10:02 +02:00
|
|
|
|
2015-10-14 23:08:50 +02:00
|
|
|
fprintf(stdout, "Test kill odd : %d\n", rocksdb_kill_odds);
|
|
|
|
if (!rocksdb_kill_prefix_blacklist.empty()) {
|
|
|
|
fprintf(stdout, "Skipping kill points prefixes:\n");
|
|
|
|
for (auto& p : rocksdb_kill_prefix_blacklist) {
|
|
|
|
fprintf(stdout, " %s\n", p.c_str());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-10-03 18:58:45 +02:00
|
|
|
fprintf(stdout, "------------------------------------------------\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
void Open() {
|
2013-02-15 20:53:17 +01:00
|
|
|
assert(db_ == nullptr);
|
2017-12-13 20:51:12 +01:00
|
|
|
#ifndef ROCKSDB_LITE
|
|
|
|
assert(txn_db_ == nullptr);
|
|
|
|
#endif
|
2018-04-27 03:38:45 +02:00
|
|
|
if (FLAGS_options_file.empty()) {
|
|
|
|
BlockBasedTableOptions block_based_options;
|
|
|
|
block_based_options.block_cache = cache_;
|
2019-04-30 18:46:40 +02:00
|
|
|
block_based_options.cache_index_and_filter_blocks =
|
|
|
|
FLAGS_cache_index_and_filter_blocks;
|
2018-04-27 03:38:45 +02:00
|
|
|
block_based_options.block_cache_compressed = compressed_cache_;
|
|
|
|
block_based_options.checksum = FLAGS_checksum_type_e;
|
|
|
|
block_based_options.block_size = FLAGS_block_size;
|
2018-06-05 04:59:44 +02:00
|
|
|
block_based_options.format_version =
|
|
|
|
static_cast<uint32_t>(FLAGS_format_version);
|
2018-09-19 00:41:27 +02:00
|
|
|
block_based_options.index_block_restart_interval =
|
|
|
|
static_cast<int32_t>(FLAGS_index_block_restart_interval);
|
2018-04-27 03:38:45 +02:00
|
|
|
block_based_options.filter_policy = filter_policy_;
|
|
|
|
options_.table_factory.reset(
|
|
|
|
NewBlockBasedTableFactory(block_based_options));
|
|
|
|
options_.db_write_buffer_size = FLAGS_db_write_buffer_size;
|
|
|
|
options_.write_buffer_size = FLAGS_write_buffer_size;
|
|
|
|
options_.max_write_buffer_number = FLAGS_max_write_buffer_number;
|
|
|
|
options_.min_write_buffer_number_to_merge =
|
|
|
|
FLAGS_min_write_buffer_number_to_merge;
|
|
|
|
options_.max_write_buffer_number_to_maintain =
|
|
|
|
FLAGS_max_write_buffer_number_to_maintain;
|
|
|
|
options_.memtable_prefix_bloom_size_ratio =
|
|
|
|
FLAGS_memtable_prefix_bloom_size_ratio;
|
2019-02-19 21:12:25 +01:00
|
|
|
options_.memtable_whole_key_filtering =
|
|
|
|
FLAGS_memtable_whole_key_filtering;
|
2018-04-27 03:38:45 +02:00
|
|
|
options_.max_background_compactions = FLAGS_max_background_compactions;
|
|
|
|
options_.max_background_flushes = FLAGS_max_background_flushes;
|
|
|
|
options_.compaction_style =
|
|
|
|
static_cast<rocksdb::CompactionStyle>(FLAGS_compaction_style);
|
|
|
|
options_.prefix_extractor.reset(
|
|
|
|
NewFixedPrefixTransform(FLAGS_prefix_size));
|
|
|
|
options_.max_open_files = FLAGS_open_files;
|
|
|
|
options_.statistics = dbstats;
|
|
|
|
options_.env = FLAGS_env;
|
|
|
|
options_.use_fsync = FLAGS_use_fsync;
|
|
|
|
options_.compaction_readahead_size = FLAGS_compaction_readahead_size;
|
|
|
|
options_.allow_mmap_reads = FLAGS_mmap_read;
|
|
|
|
options_.allow_mmap_writes = FLAGS_mmap_write;
|
|
|
|
options_.use_direct_reads = FLAGS_use_direct_reads;
|
|
|
|
options_.use_direct_io_for_flush_and_compaction =
|
|
|
|
FLAGS_use_direct_io_for_flush_and_compaction;
|
2019-03-15 19:58:37 +01:00
|
|
|
options_.recycle_log_file_num =
|
|
|
|
static_cast<size_t>(FLAGS_recycle_log_file_num);
|
2018-04-27 03:38:45 +02:00
|
|
|
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;
|
|
|
|
options_.level0_stop_writes_trigger = FLAGS_level0_stop_writes_trigger;
|
|
|
|
options_.level0_slowdown_writes_trigger =
|
|
|
|
FLAGS_level0_slowdown_writes_trigger;
|
|
|
|
options_.level0_file_num_compaction_trigger =
|
|
|
|
FLAGS_level0_file_num_compaction_trigger;
|
|
|
|
options_.compression = FLAGS_compression_type_e;
|
2018-08-07 00:23:03 +02:00
|
|
|
options_.compression_opts.max_dict_bytes =
|
|
|
|
FLAGS_compression_max_dict_bytes;
|
|
|
|
options_.compression_opts.zstd_max_train_bytes =
|
|
|
|
FLAGS_compression_zstd_max_train_bytes;
|
2018-04-27 03:38:45 +02:00
|
|
|
options_.create_if_missing = true;
|
2018-05-18 16:58:59 +02:00
|
|
|
options_.max_manifest_file_size = FLAGS_max_manifest_file_size;
|
2018-04-27 03:38:45 +02:00
|
|
|
options_.inplace_update_support = FLAGS_in_place_update;
|
|
|
|
options_.max_subcompactions = static_cast<uint32_t>(FLAGS_subcompactions);
|
|
|
|
options_.allow_concurrent_memtable_write =
|
|
|
|
FLAGS_allow_concurrent_memtable_write;
|
2018-06-19 17:56:43 +02:00
|
|
|
options_.enable_pipelined_write = FLAGS_enable_pipelined_write;
|
2018-04-27 03:38:45 +02:00
|
|
|
options_.enable_write_thread_adaptive_yield =
|
|
|
|
FLAGS_enable_write_thread_adaptive_yield;
|
|
|
|
options_.compaction_options_universal.size_ratio =
|
|
|
|
FLAGS_universal_size_ratio;
|
|
|
|
options_.compaction_options_universal.min_merge_width =
|
|
|
|
FLAGS_universal_min_merge_width;
|
|
|
|
options_.compaction_options_universal.max_merge_width =
|
|
|
|
FLAGS_universal_max_merge_width;
|
|
|
|
options_.compaction_options_universal.max_size_amplification_percent =
|
|
|
|
FLAGS_universal_max_size_amplification_percent;
|
2018-10-27 00:06:44 +02:00
|
|
|
options_.atomic_flush = FLAGS_atomic_flush;
|
2018-04-27 03:38:45 +02:00
|
|
|
} else {
|
|
|
|
#ifdef ROCKSDB_LITE
|
|
|
|
fprintf(stderr, "--options_file not supported in lite mode\n");
|
|
|
|
exit(1);
|
|
|
|
#else
|
|
|
|
DBOptions db_options;
|
|
|
|
std::vector<ColumnFamilyDescriptor> cf_descriptors;
|
|
|
|
Status s = LoadOptionsFromFile(FLAGS_options_file, Env::Default(),
|
|
|
|
&db_options, &cf_descriptors);
|
|
|
|
if (!s.ok()) {
|
|
|
|
fprintf(stderr, "Unable to load options file %s --- %s\n",
|
|
|
|
FLAGS_options_file.c_str(), s.ToString().c_str());
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
options_ = Options(db_options, cf_descriptors[0].options);
|
|
|
|
#endif // ROCKSDB_LITE
|
|
|
|
}
|
|
|
|
|
2017-06-13 23:51:22 +02:00
|
|
|
if (FLAGS_rate_limiter_bytes_per_sec > 0) {
|
|
|
|
options_.rate_limiter.reset(NewGenericRateLimiter(
|
|
|
|
FLAGS_rate_limiter_bytes_per_sec, 1000 /* refill_period_us */,
|
|
|
|
10 /* fairness */,
|
|
|
|
FLAGS_rate_limit_bg_reads ? RateLimiter::Mode::kReadsOnly
|
|
|
|
: RateLimiter::Mode::kWritesOnly));
|
|
|
|
if (FLAGS_rate_limit_bg_reads) {
|
|
|
|
options_.new_table_reader_for_compaction_inputs = true;
|
|
|
|
}
|
|
|
|
}
|
2016-02-05 23:30:18 +01:00
|
|
|
|
|
|
|
if (FLAGS_prefix_size == 0 && FLAGS_rep_factory == kHashSkipList) {
|
2013-08-23 08:10:02 +02:00
|
|
|
fprintf(stderr,
|
2016-02-05 23:30:18 +01:00
|
|
|
"prefeix_size cannot be zero if memtablerep == prefix_hash\n");
|
2013-08-23 08:10:02 +02:00
|
|
|
exit(1);
|
|
|
|
}
|
2016-02-05 23:30:18 +01:00
|
|
|
if (FLAGS_prefix_size != 0 && FLAGS_rep_factory != kHashSkipList) {
|
|
|
|
fprintf(stderr,
|
|
|
|
"WARNING: prefix_size is non-zero but "
|
|
|
|
"memtablerep != prefix_hash\n");
|
|
|
|
}
|
2013-08-23 08:10:02 +02:00
|
|
|
switch (FLAGS_rep_factory) {
|
|
|
|
case kSkipList:
|
|
|
|
// no need to do anything
|
|
|
|
break;
|
2014-11-12 22:05:12 +01:00
|
|
|
#ifndef ROCKSDB_LITE
|
|
|
|
case kHashSkipList:
|
|
|
|
options_.memtable_factory.reset(NewHashSkipListRepFactory(10000));
|
|
|
|
break;
|
2013-08-23 08:10:02 +02:00
|
|
|
case kVectorRep:
|
2014-02-27 21:13:48 +01:00
|
|
|
options_.memtable_factory.reset(new VectorRepFactory());
|
2013-08-23 08:10:02 +02:00
|
|
|
break;
|
2014-11-12 22:05:12 +01:00
|
|
|
#else
|
|
|
|
default:
|
|
|
|
fprintf(stderr,
|
|
|
|
"RocksdbLite only supports skip list mem table. Skip "
|
|
|
|
"--rep_factory\n");
|
|
|
|
#endif // ROCKSDB_LITE
|
2013-08-23 08:10:02 +02:00
|
|
|
}
|
2014-11-12 22:05:12 +01:00
|
|
|
|
2018-06-07 19:34:56 +02:00
|
|
|
if (FLAGS_use_full_merge_v1) {
|
|
|
|
options_.merge_operator = MergeOperators::CreateDeprecatedPutOperator();
|
|
|
|
} else {
|
|
|
|
options_.merge_operator = MergeOperators::CreatePutOperator();
|
|
|
|
}
|
|
|
|
|
|
|
|
fprintf(stdout, "DB path: [%s]\n", FLAGS_db.c_str());
|
|
|
|
|
|
|
|
Status s;
|
|
|
|
if (FLAGS_ttl == -1) {
|
|
|
|
std::vector<std::string> existing_column_families;
|
|
|
|
s = DB::ListColumnFamilies(DBOptions(options_), FLAGS_db,
|
|
|
|
&existing_column_families); // ignore errors
|
|
|
|
if (!s.ok()) {
|
|
|
|
// DB doesn't exist
|
|
|
|
assert(existing_column_families.empty());
|
|
|
|
assert(column_family_names_.empty());
|
|
|
|
column_family_names_.push_back(kDefaultColumnFamilyName);
|
|
|
|
} else if (column_family_names_.empty()) {
|
|
|
|
// this is the first call to the function Open()
|
|
|
|
column_family_names_ = existing_column_families;
|
|
|
|
} else {
|
|
|
|
// this is a reopen. just assert that existing column_family_names are
|
|
|
|
// equivalent to what we remember
|
|
|
|
auto sorted_cfn = column_family_names_;
|
|
|
|
std::sort(sorted_cfn.begin(), sorted_cfn.end());
|
|
|
|
std::sort(existing_column_families.begin(),
|
|
|
|
existing_column_families.end());
|
|
|
|
if (sorted_cfn != existing_column_families) {
|
|
|
|
fprintf(stderr,
|
|
|
|
"Expected column families differ from the existing:\n");
|
|
|
|
printf("Expected: {");
|
|
|
|
for (auto cf : sorted_cfn) {
|
|
|
|
printf("%s ", cf.c_str());
|
|
|
|
}
|
|
|
|
printf("}\n");
|
|
|
|
printf("Existing: {");
|
|
|
|
for (auto cf : existing_column_families) {
|
|
|
|
printf("%s ", cf.c_str());
|
|
|
|
}
|
|
|
|
printf("}\n");
|
|
|
|
}
|
|
|
|
assert(sorted_cfn == existing_column_families);
|
|
|
|
}
|
|
|
|
std::vector<ColumnFamilyDescriptor> cf_descriptors;
|
|
|
|
for (auto name : column_family_names_) {
|
|
|
|
if (name != kDefaultColumnFamilyName) {
|
|
|
|
new_column_family_name_ =
|
|
|
|
std::max(new_column_family_name_.load(), std::stoi(name) + 1);
|
|
|
|
}
|
|
|
|
cf_descriptors.emplace_back(name, ColumnFamilyOptions(options_));
|
|
|
|
}
|
|
|
|
while (cf_descriptors.size() < (size_t)FLAGS_column_families) {
|
|
|
|
std::string name = ToString(new_column_family_name_.load());
|
|
|
|
new_column_family_name_++;
|
|
|
|
cf_descriptors.emplace_back(name, ColumnFamilyOptions(options_));
|
|
|
|
column_family_names_.push_back(name);
|
|
|
|
}
|
|
|
|
options_.listeners.clear();
|
|
|
|
options_.listeners.emplace_back(
|
|
|
|
new DbStressListener(FLAGS_db, options_.db_paths, cf_descriptors));
|
|
|
|
options_.create_missing_column_families = true;
|
|
|
|
if (!FLAGS_use_txn) {
|
2019-01-03 02:38:27 +01:00
|
|
|
if (db_preload_finished_.load() && FLAGS_read_only) {
|
|
|
|
s = DB::OpenForReadOnly(DBOptions(options_), FLAGS_db, cf_descriptors,
|
|
|
|
&column_families_, &db_);
|
|
|
|
} else {
|
|
|
|
s = DB::Open(DBOptions(options_), FLAGS_db, cf_descriptors,
|
|
|
|
&column_families_, &db_);
|
|
|
|
}
|
2018-06-07 19:34:56 +02:00
|
|
|
} else {
|
|
|
|
#ifndef ROCKSDB_LITE
|
|
|
|
TransactionDBOptions txn_db_options;
|
|
|
|
// For the moment it is sufficient to test WRITE_PREPARED policy
|
|
|
|
txn_db_options.write_policy = TxnDBWritePolicy::WRITE_PREPARED;
|
|
|
|
s = TransactionDB::Open(options_, txn_db_options, FLAGS_db,
|
|
|
|
cf_descriptors, &column_families_, &txn_db_);
|
|
|
|
db_ = txn_db_;
|
|
|
|
// after a crash, rollback to commit recovered transactions
|
|
|
|
std::vector<Transaction*> trans;
|
|
|
|
txn_db_->GetAllPreparedTransactions(&trans);
|
|
|
|
Random rand(static_cast<uint32_t>(FLAGS_seed));
|
|
|
|
for (auto txn : trans) {
|
|
|
|
if (rand.OneIn(2)) {
|
|
|
|
s = txn->Commit();
|
|
|
|
assert(s.ok());
|
|
|
|
} else {
|
|
|
|
s = txn->Rollback();
|
|
|
|
assert(s.ok());
|
|
|
|
}
|
|
|
|
delete txn;
|
|
|
|
}
|
|
|
|
trans.clear();
|
|
|
|
txn_db_->GetAllPreparedTransactions(&trans);
|
|
|
|
assert(trans.size() == 0);
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
assert(!s.ok() || column_families_.size() ==
|
|
|
|
static_cast<size_t>(FLAGS_column_families));
|
|
|
|
} else {
|
|
|
|
#ifndef ROCKSDB_LITE
|
|
|
|
DBWithTTL* db_with_ttl;
|
|
|
|
s = DBWithTTL::Open(options_, FLAGS_db, &db_with_ttl, FLAGS_ttl);
|
|
|
|
db_ = db_with_ttl;
|
|
|
|
#else
|
|
|
|
fprintf(stderr, "TTL is not supported in RocksDBLite\n");
|
|
|
|
exit(1);
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
if (!s.ok()) {
|
|
|
|
fprintf(stderr, "open error: %s\n", s.ToString().c_str());
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void Reopen() {
|
|
|
|
for (auto cf : column_families_) {
|
|
|
|
delete cf;
|
|
|
|
}
|
|
|
|
column_families_.clear();
|
|
|
|
delete db_;
|
|
|
|
db_ = nullptr;
|
|
|
|
#ifndef ROCKSDB_LITE
|
|
|
|
txn_db_ = nullptr;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
num_times_reopened_++;
|
|
|
|
auto now = FLAGS_env->NowMicros();
|
|
|
|
fprintf(stdout, "%s Reopening database for the %dth time\n",
|
|
|
|
FLAGS_env->TimeToString(now/1000000).c_str(),
|
|
|
|
num_times_reopened_);
|
|
|
|
Open();
|
|
|
|
}
|
|
|
|
|
|
|
|
void PrintStatistics() {
|
|
|
|
if (dbstats) {
|
|
|
|
fprintf(stdout, "STATISTICS:\n%s\n", dbstats->ToString().c_str());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
std::shared_ptr<Cache> cache_;
|
|
|
|
std::shared_ptr<Cache> compressed_cache_;
|
|
|
|
std::shared_ptr<const FilterPolicy> filter_policy_;
|
|
|
|
DB* db_;
|
|
|
|
#ifndef ROCKSDB_LITE
|
|
|
|
TransactionDB* txn_db_;
|
|
|
|
#endif
|
|
|
|
Options options_;
|
|
|
|
std::vector<ColumnFamilyHandle*> column_families_;
|
|
|
|
std::vector<std::string> column_family_names_;
|
|
|
|
std::atomic<int> new_column_family_name_;
|
|
|
|
int num_times_reopened_;
|
|
|
|
std::unordered_map<std::string, std::vector<std::string>> options_table_;
|
|
|
|
std::vector<std::string> options_index_;
|
2019-01-03 02:38:27 +01:00
|
|
|
std::atomic<bool> db_preload_finished_;
|
2018-06-07 19:34:56 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
class NonBatchedOpsStressTest : public StressTest {
|
|
|
|
public:
|
|
|
|
NonBatchedOpsStressTest() {}
|
|
|
|
|
|
|
|
virtual ~NonBatchedOpsStressTest() {}
|
|
|
|
|
|
|
|
virtual void VerifyDb(ThreadState* thread) const {
|
|
|
|
ReadOptions options(FLAGS_verify_checksum, true);
|
|
|
|
auto shared = thread->shared;
|
|
|
|
const int64_t max_key = shared->GetMaxKey();
|
|
|
|
const int64_t keys_per_thread = max_key / shared->GetNumThreads();
|
|
|
|
int64_t start = keys_per_thread * thread->tid;
|
|
|
|
int64_t end = start + keys_per_thread;
|
|
|
|
if (thread->tid == shared->GetNumThreads() - 1) {
|
|
|
|
end = max_key;
|
|
|
|
}
|
|
|
|
for (size_t cf = 0; cf < column_families_.size(); ++cf) {
|
|
|
|
if (thread->shared->HasVerificationFailedYet()) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (!thread->rand.OneIn(2)) {
|
|
|
|
// Use iterator to verify this range
|
2018-11-09 20:17:34 +01:00
|
|
|
std::unique_ptr<Iterator> iter(
|
2018-06-07 19:34:56 +02:00
|
|
|
db_->NewIterator(options, column_families_[cf]));
|
|
|
|
iter->Seek(Key(start));
|
|
|
|
for (auto i = start; i < end; i++) {
|
|
|
|
if (thread->shared->HasVerificationFailedYet()) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
// TODO(ljin): update "long" to uint64_t
|
|
|
|
// Reseek when the prefix changes
|
|
|
|
if (i % (static_cast<int64_t>(1) << 8 * (8 - FLAGS_prefix_size)) ==
|
|
|
|
0) {
|
|
|
|
iter->Seek(Key(i));
|
|
|
|
}
|
|
|
|
std::string from_db;
|
|
|
|
std::string keystr = Key(i);
|
|
|
|
Slice k = keystr;
|
|
|
|
Status s = iter->status();
|
|
|
|
if (iter->Valid()) {
|
|
|
|
if (iter->key().compare(k) > 0) {
|
|
|
|
s = Status::NotFound(Slice());
|
|
|
|
} else if (iter->key().compare(k) == 0) {
|
|
|
|
from_db = iter->value().ToString();
|
|
|
|
iter->Next();
|
|
|
|
} else if (iter->key().compare(k) < 0) {
|
|
|
|
VerificationAbort(shared, "An out of range key was found",
|
|
|
|
static_cast<int>(cf), i);
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
// The iterator found no value for the key in question, so do not
|
|
|
|
// move to the next item in the iterator
|
|
|
|
s = Status::NotFound(Slice());
|
|
|
|
}
|
|
|
|
VerifyValue(static_cast<int>(cf), i, options, shared, from_db, s,
|
|
|
|
true);
|
|
|
|
if (from_db.length()) {
|
|
|
|
PrintKeyValue(static_cast<int>(cf), static_cast<uint32_t>(i),
|
|
|
|
from_db.data(), from_db.length());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
// Use Get to verify this range
|
|
|
|
for (auto i = start; i < end; i++) {
|
|
|
|
if (thread->shared->HasVerificationFailedYet()) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
std::string from_db;
|
|
|
|
std::string keystr = Key(i);
|
|
|
|
Slice k = keystr;
|
|
|
|
Status s = db_->Get(options, column_families_[cf], k, &from_db);
|
|
|
|
VerifyValue(static_cast<int>(cf), i, options, shared, from_db, s,
|
|
|
|
true);
|
|
|
|
if (from_db.length()) {
|
|
|
|
PrintKeyValue(static_cast<int>(cf), static_cast<uint32_t>(i),
|
|
|
|
from_db.data(), from_db.length());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual void MaybeClearOneColumnFamily(ThreadState* thread) {
|
|
|
|
if (FLAGS_clear_column_family_one_in != 0 && FLAGS_column_families > 1) {
|
|
|
|
if (thread->rand.OneIn(FLAGS_clear_column_family_one_in)) {
|
|
|
|
// drop column family and then create it again (can't drop default)
|
|
|
|
int cf = thread->rand.Next() % (FLAGS_column_families - 1) + 1;
|
|
|
|
std::string new_name =
|
|
|
|
ToString(new_column_family_name_.fetch_add(1));
|
|
|
|
{
|
|
|
|
MutexLock l(thread->shared->GetMutex());
|
|
|
|
fprintf(
|
|
|
|
stdout,
|
|
|
|
"[CF %d] Dropping and recreating column family. new name: %s\n",
|
|
|
|
cf, new_name.c_str());
|
|
|
|
}
|
|
|
|
thread->shared->LockColumnFamily(cf);
|
|
|
|
Status s = db_->DropColumnFamily(column_families_[cf]);
|
|
|
|
delete column_families_[cf];
|
|
|
|
if (!s.ok()) {
|
|
|
|
fprintf(stderr, "dropping column family error: %s\n",
|
|
|
|
s.ToString().c_str());
|
|
|
|
std::terminate();
|
|
|
|
}
|
|
|
|
s = db_->CreateColumnFamily(ColumnFamilyOptions(options_), new_name,
|
|
|
|
&column_families_[cf]);
|
|
|
|
column_family_names_[cf] = new_name;
|
|
|
|
thread->shared->ClearColumnFamily(cf);
|
|
|
|
if (!s.ok()) {
|
|
|
|
fprintf(stderr, "creating column family error: %s\n",
|
|
|
|
s.ToString().c_str());
|
|
|
|
std::terminate();
|
|
|
|
}
|
|
|
|
thread->shared->UnlockColumnFamily(cf);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual bool ShouldAcquireMutexOnKey() const { return true; }
|
|
|
|
|
|
|
|
virtual Status TestGet(ThreadState* thread,
|
|
|
|
const ReadOptions& read_opts,
|
|
|
|
const std::vector<int>& rand_column_families,
|
|
|
|
const std::vector<int64_t>& rand_keys) {
|
|
|
|
auto cfh = column_families_[rand_column_families[0]];
|
|
|
|
std::string key_str = Key(rand_keys[0]);
|
|
|
|
Slice key = key_str;
|
|
|
|
std::string from_db;
|
|
|
|
Status s = db_->Get(read_opts, cfh, key, &from_db);
|
|
|
|
if (s.ok()) {
|
|
|
|
// found case
|
|
|
|
thread->stats.AddGets(1, 1);
|
|
|
|
} else if (s.IsNotFound()) {
|
|
|
|
// not found case
|
|
|
|
thread->stats.AddGets(1, 0);
|
|
|
|
} else {
|
|
|
|
// errors case
|
|
|
|
thread->stats.AddErrors(1);
|
|
|
|
}
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual Status TestPrefixScan(ThreadState* thread,
|
|
|
|
const ReadOptions& read_opts,
|
|
|
|
const std::vector<int>& rand_column_families,
|
|
|
|
const std::vector<int64_t>& rand_keys) {
|
|
|
|
auto cfh = column_families_[rand_column_families[0]];
|
|
|
|
std::string key_str = Key(rand_keys[0]);
|
|
|
|
Slice key = key_str;
|
|
|
|
Slice prefix = Slice(key.data(), FLAGS_prefix_size);
|
2018-07-23 19:40:40 +02:00
|
|
|
|
|
|
|
std::string upper_bound;
|
|
|
|
Slice ub_slice;
|
|
|
|
ReadOptions ro_copy = read_opts;
|
|
|
|
if (thread->rand.OneIn(2) && GetNextPrefix(prefix, &upper_bound)) {
|
|
|
|
// For half of the time, set the upper bound to the next prefix
|
|
|
|
ub_slice = Slice(upper_bound);
|
|
|
|
ro_copy.iterate_upper_bound = &ub_slice;
|
|
|
|
}
|
|
|
|
|
|
|
|
Iterator* iter = db_->NewIterator(ro_copy, cfh);
|
2018-10-29 17:52:54 +01:00
|
|
|
long count = 0;
|
2018-06-07 19:34:56 +02:00
|
|
|
for (iter->Seek(prefix);
|
|
|
|
iter->Valid() && iter->key().starts_with(prefix); iter->Next()) {
|
|
|
|
++count;
|
|
|
|
}
|
2018-10-29 17:52:54 +01:00
|
|
|
assert(count <= (static_cast<long>(1) << ((8 - FLAGS_prefix_size) * 8)));
|
2018-06-07 19:34:56 +02:00
|
|
|
Status s = iter->status();
|
|
|
|
if (iter->status().ok()) {
|
2018-10-29 17:52:54 +01:00
|
|
|
thread->stats.AddPrefixes(1, count);
|
2018-06-07 19:34:56 +02:00
|
|
|
} else {
|
|
|
|
thread->stats.AddErrors(1);
|
|
|
|
}
|
|
|
|
delete iter;
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual Status TestPut(ThreadState* thread,
|
|
|
|
WriteOptions& write_opts, const ReadOptions& read_opts,
|
|
|
|
const std::vector<int>& rand_column_families,
|
|
|
|
const std::vector<int64_t>& rand_keys,
|
|
|
|
char (&value) [100], std::unique_ptr<MutexLock>& lock) {
|
|
|
|
auto shared = thread->shared;
|
|
|
|
int64_t max_key = shared->GetMaxKey();
|
|
|
|
int64_t rand_key = rand_keys[0];
|
|
|
|
int rand_column_family = rand_column_families[0];
|
2018-06-13 22:37:21 +02:00
|
|
|
while (!shared->AllowsOverwrite(rand_key) &&
|
|
|
|
(FLAGS_use_merge || shared->Exists(rand_column_family, rand_key))) {
|
2018-06-07 19:34:56 +02:00
|
|
|
lock.reset();
|
|
|
|
rand_key = thread->rand.Next() % max_key;
|
|
|
|
rand_column_family = thread->rand.Next() % FLAGS_column_families;
|
|
|
|
lock.reset(new MutexLock(
|
|
|
|
shared->GetMutexForKey(rand_column_family, rand_key)));
|
|
|
|
}
|
|
|
|
|
|
|
|
std::string key_str = Key(rand_key);
|
|
|
|
Slice key = key_str;
|
|
|
|
ColumnFamilyHandle* cfh = column_families_[rand_column_family];
|
|
|
|
|
|
|
|
if (FLAGS_verify_before_write) {
|
|
|
|
std::string key_str2 = Key(rand_key);
|
|
|
|
Slice k = key_str2;
|
|
|
|
std::string from_db;
|
|
|
|
Status s = db_->Get(read_opts, cfh, k, &from_db);
|
|
|
|
if (!VerifyValue(rand_column_family, rand_key, read_opts, shared,
|
|
|
|
from_db, s, true)) {
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
uint32_t value_base = thread->rand.Next() % shared->UNKNOWN_SENTINEL;
|
|
|
|
size_t sz = GenerateValue(value_base, value, sizeof(value));
|
|
|
|
Slice v(value, sz);
|
|
|
|
shared->Put(rand_column_family, rand_key, value_base, true /* pending */);
|
|
|
|
Status s;
|
|
|
|
if (FLAGS_use_merge) {
|
|
|
|
if (!FLAGS_use_txn) {
|
|
|
|
s = db_->Merge(write_opts, cfh, key, v);
|
|
|
|
} else {
|
|
|
|
#ifndef ROCKSDB_LITE
|
|
|
|
Transaction* txn;
|
|
|
|
s = NewTxn(write_opts, &txn);
|
|
|
|
if (s.ok()) {
|
|
|
|
s = txn->Merge(cfh, key, v);
|
|
|
|
if (s.ok()) {
|
|
|
|
s = CommitTxn(txn);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
if (!FLAGS_use_txn) {
|
|
|
|
s = db_->Put(write_opts, cfh, key, v);
|
|
|
|
} else {
|
|
|
|
#ifndef ROCKSDB_LITE
|
|
|
|
Transaction* txn;
|
|
|
|
s = NewTxn(write_opts, &txn);
|
|
|
|
if (s.ok()) {
|
|
|
|
s = txn->Put(cfh, key, v);
|
|
|
|
if (s.ok()) {
|
|
|
|
s = CommitTxn(txn);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
}
|
|
|
|
shared->Put(rand_column_family, rand_key, value_base, false /* pending */);
|
|
|
|
if (!s.ok()) {
|
|
|
|
fprintf(stderr, "put or merge error: %s\n", s.ToString().c_str());
|
|
|
|
std::terminate();
|
|
|
|
}
|
|
|
|
thread->stats.AddBytesForWrites(1, sz);
|
|
|
|
PrintKeyValue(rand_column_family, static_cast<uint32_t>(rand_key),
|
|
|
|
value, sz);
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual Status TestDelete(ThreadState* thread, WriteOptions& write_opts,
|
|
|
|
const std::vector<int>& rand_column_families,
|
|
|
|
const std::vector<int64_t>& rand_keys,
|
|
|
|
std::unique_ptr<MutexLock>& lock) {
|
|
|
|
int64_t rand_key = rand_keys[0];
|
|
|
|
int rand_column_family = rand_column_families[0];
|
|
|
|
auto shared = thread->shared;
|
2018-06-08 00:34:42 +02:00
|
|
|
int64_t max_key = shared->GetMaxKey();
|
2018-06-07 19:34:56 +02:00
|
|
|
|
|
|
|
// OPERATION delete
|
|
|
|
// If the chosen key does not allow overwrite and it does not exist,
|
|
|
|
// choose another key.
|
2018-06-13 22:37:21 +02:00
|
|
|
while (!shared->AllowsOverwrite(rand_key) &&
|
|
|
|
!shared->Exists(rand_column_family, rand_key)) {
|
2018-06-07 19:34:56 +02:00
|
|
|
lock.reset();
|
|
|
|
rand_key = thread->rand.Next() % max_key;
|
|
|
|
rand_column_family = thread->rand.Next() % FLAGS_column_families;
|
|
|
|
lock.reset(new MutexLock(
|
|
|
|
shared->GetMutexForKey(rand_column_family, rand_key)));
|
|
|
|
}
|
|
|
|
|
|
|
|
std::string key_str = Key(rand_key);
|
|
|
|
Slice key = key_str;
|
|
|
|
auto cfh = column_families_[rand_column_family];
|
|
|
|
|
|
|
|
// Use delete if the key may be overwritten and a single deletion
|
|
|
|
// otherwise.
|
|
|
|
Status s;
|
2018-06-13 22:37:21 +02:00
|
|
|
if (shared->AllowsOverwrite(rand_key)) {
|
2018-06-07 19:34:56 +02:00
|
|
|
shared->Delete(rand_column_family, rand_key, true /* pending */);
|
|
|
|
if (!FLAGS_use_txn) {
|
|
|
|
s = db_->Delete(write_opts, cfh, key);
|
|
|
|
} else {
|
|
|
|
#ifndef ROCKSDB_LITE
|
|
|
|
Transaction* txn;
|
|
|
|
s = NewTxn(write_opts, &txn);
|
|
|
|
if (s.ok()) {
|
|
|
|
s = txn->Delete(cfh, key);
|
|
|
|
if (s.ok()) {
|
|
|
|
s = CommitTxn(txn);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
shared->Delete(rand_column_family, rand_key, false /* pending */);
|
|
|
|
thread->stats.AddDeletes(1);
|
|
|
|
if (!s.ok()) {
|
|
|
|
fprintf(stderr, "delete error: %s\n", s.ToString().c_str());
|
|
|
|
std::terminate();
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
shared->SingleDelete(rand_column_family, rand_key, true /* pending */);
|
|
|
|
if (!FLAGS_use_txn) {
|
|
|
|
s = db_->SingleDelete(write_opts, cfh, key);
|
|
|
|
} else {
|
|
|
|
#ifndef ROCKSDB_LITE
|
|
|
|
Transaction* txn;
|
|
|
|
s = NewTxn(write_opts, &txn);
|
|
|
|
if (s.ok()) {
|
|
|
|
s = txn->SingleDelete(cfh, key);
|
|
|
|
if (s.ok()) {
|
|
|
|
s = CommitTxn(txn);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
shared->SingleDelete(rand_column_family, rand_key, false /* pending */);
|
|
|
|
thread->stats.AddSingleDeletes(1);
|
|
|
|
if (!s.ok()) {
|
|
|
|
fprintf(stderr, "single delete error: %s\n",
|
|
|
|
s.ToString().c_str());
|
|
|
|
std::terminate();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual Status TestDeleteRange(ThreadState* thread,
|
|
|
|
WriteOptions& write_opts,
|
|
|
|
const std::vector<int>& rand_column_families,
|
|
|
|
const std::vector<int64_t>& rand_keys,
|
|
|
|
std::unique_ptr<MutexLock>& lock) {
|
|
|
|
// OPERATION delete range
|
|
|
|
std::vector<std::unique_ptr<MutexLock>> range_locks;
|
|
|
|
// delete range does not respect disallowed overwrites. the keys for
|
|
|
|
// which overwrites are disallowed are randomly distributed so it
|
|
|
|
// could be expensive to find a range where each key allows
|
|
|
|
// overwrites.
|
|
|
|
int64_t rand_key = rand_keys[0];
|
|
|
|
int rand_column_family = rand_column_families[0];
|
|
|
|
auto shared = thread->shared;
|
|
|
|
int64_t max_key = shared->GetMaxKey();
|
|
|
|
if (rand_key > max_key - FLAGS_range_deletion_width) {
|
|
|
|
lock.reset();
|
|
|
|
rand_key = thread->rand.Next() %
|
|
|
|
(max_key - FLAGS_range_deletion_width + 1);
|
|
|
|
range_locks.emplace_back(new MutexLock(
|
|
|
|
shared->GetMutexForKey(rand_column_family, rand_key)));
|
|
|
|
} else {
|
|
|
|
range_locks.emplace_back(std::move(lock));
|
|
|
|
}
|
|
|
|
for (int j = 1; j < FLAGS_range_deletion_width; ++j) {
|
|
|
|
if (((rand_key + j) & ((1 << FLAGS_log2_keys_per_lock) - 1)) == 0) {
|
|
|
|
range_locks.emplace_back(new MutexLock(
|
|
|
|
shared->GetMutexForKey(rand_column_family, rand_key + j)));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
shared->DeleteRange(rand_column_family, rand_key,
|
|
|
|
rand_key + FLAGS_range_deletion_width,
|
|
|
|
true /* pending */);
|
|
|
|
|
|
|
|
std::string keystr = Key(rand_key);
|
|
|
|
Slice key = keystr;
|
|
|
|
auto cfh = column_families_[rand_column_family];
|
|
|
|
std::string end_keystr = Key(rand_key + FLAGS_range_deletion_width);
|
|
|
|
Slice end_key = end_keystr;
|
|
|
|
Status s = db_->DeleteRange(write_opts, cfh, key, end_key);
|
|
|
|
if (!s.ok()) {
|
|
|
|
fprintf(stderr, "delete range error: %s\n",
|
|
|
|
s.ToString().c_str());
|
|
|
|
std::terminate();
|
|
|
|
}
|
|
|
|
int covered = shared->DeleteRange(
|
|
|
|
rand_column_family, rand_key,
|
|
|
|
rand_key + FLAGS_range_deletion_width, false /* pending */);
|
|
|
|
thread->stats.AddRangeDeletions(1);
|
|
|
|
thread->stats.AddCoveredByRangeDeletions(covered);
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
2018-06-21 07:14:12 +02:00
|
|
|
#ifdef ROCKSDB_LITE
|
|
|
|
virtual void TestIngestExternalFile(
|
|
|
|
ThreadState* /* thread */,
|
|
|
|
const std::vector<int>& /* rand_column_families */,
|
|
|
|
const std::vector<int64_t>& /* rand_keys */,
|
|
|
|
std::unique_ptr<MutexLock>& /* lock */) {
|
|
|
|
assert(false);
|
|
|
|
fprintf(stderr,
|
|
|
|
"RocksDB lite does not support "
|
|
|
|
"TestIngestExternalFile\n");
|
|
|
|
std::terminate();
|
|
|
|
}
|
|
|
|
#else
|
|
|
|
virtual void TestIngestExternalFile(
|
|
|
|
ThreadState* thread, const std::vector<int>& rand_column_families,
|
|
|
|
const std::vector<int64_t>& rand_keys, std::unique_ptr<MutexLock>& lock) {
|
|
|
|
const std::string sst_filename =
|
|
|
|
FLAGS_db + "/." + ToString(thread->tid) + ".sst";
|
|
|
|
Status s;
|
|
|
|
if (FLAGS_env->FileExists(sst_filename).ok()) {
|
|
|
|
// Maybe we terminated abnormally before, so cleanup to give this file
|
|
|
|
// ingestion a clean slate
|
|
|
|
s = FLAGS_env->DeleteFile(sst_filename);
|
|
|
|
}
|
|
|
|
|
|
|
|
SstFileWriter sst_file_writer(EnvOptions(), options_);
|
|
|
|
if (s.ok()) {
|
|
|
|
s = sst_file_writer.Open(sst_filename);
|
|
|
|
}
|
|
|
|
int64_t key_base = rand_keys[0];
|
|
|
|
int column_family = rand_column_families[0];
|
|
|
|
std::vector<std::unique_ptr<MutexLock> > range_locks;
|
|
|
|
std::vector<uint32_t> values;
|
|
|
|
SharedState* shared = thread->shared;
|
|
|
|
|
|
|
|
// Grab locks, set pending state on expected values, and add keys
|
|
|
|
for (int64_t key = key_base;
|
|
|
|
s.ok() && key < std::min(key_base + FLAGS_ingest_external_file_width,
|
|
|
|
shared->GetMaxKey());
|
|
|
|
++key) {
|
|
|
|
if (key == key_base) {
|
|
|
|
range_locks.emplace_back(std::move(lock));
|
|
|
|
} else if ((key & ((1 << FLAGS_log2_keys_per_lock) - 1)) == 0) {
|
|
|
|
range_locks.emplace_back(
|
|
|
|
new MutexLock(shared->GetMutexForKey(column_family, key)));
|
|
|
|
}
|
|
|
|
|
|
|
|
uint32_t value_base = thread->rand.Next() % shared->UNKNOWN_SENTINEL;
|
|
|
|
values.push_back(value_base);
|
|
|
|
shared->Put(column_family, key, value_base, true /* pending */);
|
|
|
|
|
|
|
|
char value[100];
|
|
|
|
size_t value_len = GenerateValue(value_base, value, sizeof(value));
|
|
|
|
auto key_str = Key(key);
|
|
|
|
s = sst_file_writer.Put(Slice(key_str), Slice(value, value_len));
|
|
|
|
}
|
|
|
|
|
|
|
|
if (s.ok()) {
|
|
|
|
s = sst_file_writer.Finish();
|
|
|
|
}
|
|
|
|
if (s.ok()) {
|
|
|
|
s = db_->IngestExternalFile(column_families_[column_family],
|
|
|
|
{sst_filename}, IngestExternalFileOptions());
|
|
|
|
}
|
|
|
|
if (!s.ok()) {
|
|
|
|
fprintf(stderr, "file ingestion error: %s\n", s.ToString().c_str());
|
|
|
|
std::terminate();
|
|
|
|
}
|
|
|
|
int64_t key = key_base;
|
2018-06-21 20:09:09 +02:00
|
|
|
for (int32_t value : values) {
|
2018-06-21 07:14:12 +02:00
|
|
|
shared->Put(column_family, key, value, false /* pending */);
|
|
|
|
++key;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif // ROCKSDB_LITE
|
|
|
|
|
2018-06-07 19:34:56 +02:00
|
|
|
bool VerifyValue(int cf, int64_t key, const ReadOptions& /*opts*/,
|
|
|
|
SharedState* shared, const std::string& value_from_db,
|
|
|
|
Status s, bool strict = false) const {
|
|
|
|
if (shared->HasVerificationFailedYet()) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
// compare value_from_db with the value in the shared state
|
|
|
|
char value[kValueMaxLen];
|
|
|
|
uint32_t value_base = shared->Get(cf, key);
|
|
|
|
if (value_base == SharedState::UNKNOWN_SENTINEL) {
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
if (value_base == SharedState::DELETION_SENTINEL && !strict) {
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (s.ok()) {
|
|
|
|
if (value_base == SharedState::DELETION_SENTINEL) {
|
|
|
|
VerificationAbort(shared, "Unexpected value found", cf, key);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
size_t sz = GenerateValue(value_base, value, sizeof(value));
|
|
|
|
if (value_from_db.length() != sz) {
|
|
|
|
VerificationAbort(shared, "Length of value read is not equal", cf, key);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
if (memcmp(value_from_db.data(), value, sz) != 0) {
|
|
|
|
VerificationAbort(shared, "Contents of value read don't match", cf,
|
|
|
|
key);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
if (value_base != SharedState::DELETION_SENTINEL) {
|
|
|
|
VerificationAbort(shared, "Value not found: " + s.ToString(), cf, key);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
class BatchedOpsStressTest : public StressTest {
|
|
|
|
public:
|
|
|
|
BatchedOpsStressTest() {}
|
|
|
|
virtual ~BatchedOpsStressTest() {}
|
|
|
|
|
|
|
|
// Given a key K and value V, this puts ("0"+K, "0"+V), ("1"+K, "1"+V), ...
|
|
|
|
// ("9"+K, "9"+V) in DB atomically i.e in a single batch.
|
|
|
|
// Also refer BatchedOpsStressTest::TestGet
|
|
|
|
virtual Status TestPut(ThreadState* thread,
|
|
|
|
WriteOptions& write_opts, const ReadOptions& /* read_opts */,
|
|
|
|
const std::vector<int>& rand_column_families, const std::vector<int64_t>& rand_keys,
|
|
|
|
char (&value)[100], std::unique_ptr<MutexLock>& /* lock */) {
|
|
|
|
uint32_t value_base =
|
|
|
|
thread->rand.Next() % thread->shared->UNKNOWN_SENTINEL;
|
|
|
|
size_t sz = GenerateValue(value_base, value, sizeof(value));
|
|
|
|
Slice v(value, sz);
|
|
|
|
std::string keys[10] = {"9", "8", "7", "6", "5",
|
|
|
|
"4", "3", "2", "1", "0"};
|
|
|
|
std::string values[10] = {"9", "8", "7", "6", "5",
|
|
|
|
"4", "3", "2", "1", "0"};
|
|
|
|
Slice value_slices[10];
|
|
|
|
WriteBatch batch;
|
|
|
|
Status s;
|
|
|
|
auto cfh = column_families_[rand_column_families[0]];
|
|
|
|
std::string key_str = Key(rand_keys[0]);
|
|
|
|
for (int i = 0; i < 10; i++) {
|
|
|
|
keys[i] += key_str;
|
|
|
|
values[i] += v.ToString();
|
|
|
|
value_slices[i] = values[i];
|
|
|
|
if (FLAGS_use_merge) {
|
|
|
|
batch.Merge(cfh, keys[i], value_slices[i]);
|
|
|
|
} else {
|
|
|
|
batch.Put(cfh, keys[i], value_slices[i]);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
s = db_->Write(write_opts, &batch);
|
|
|
|
if (!s.ok()) {
|
|
|
|
fprintf(stderr, "multiput error: %s\n", s.ToString().c_str());
|
|
|
|
thread->stats.AddErrors(1);
|
|
|
|
} else {
|
|
|
|
// we did 10 writes each of size sz + 1
|
|
|
|
thread->stats.AddBytesForWrites(10, (sz + 1) * 10);
|
|
|
|
}
|
|
|
|
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Given a key K, this deletes ("0"+K), ("1"+K),... ("9"+K)
|
|
|
|
// in DB atomically i.e in a single batch. Also refer MultiGet.
|
|
|
|
virtual Status TestDelete(ThreadState* thread, WriteOptions& writeoptions,
|
|
|
|
const std::vector<int>& rand_column_families,
|
|
|
|
const std::vector<int64_t>& rand_keys,
|
|
|
|
std::unique_ptr<MutexLock>& /* lock */) {
|
|
|
|
std::string keys[10] = {"9", "7", "5", "3", "1",
|
|
|
|
"8", "6", "4", "2", "0"};
|
|
|
|
|
|
|
|
WriteBatch batch;
|
|
|
|
Status s;
|
|
|
|
auto cfh = column_families_[rand_column_families[0]];
|
|
|
|
std::string key_str = Key(rand_keys[0]);
|
|
|
|
for (int i = 0; i < 10; i++) {
|
|
|
|
keys[i] += key_str;
|
|
|
|
batch.Delete(cfh, keys[i]);
|
|
|
|
}
|
|
|
|
|
|
|
|
s = db_->Write(writeoptions, &batch);
|
|
|
|
if (!s.ok()) {
|
|
|
|
fprintf(stderr, "multidelete error: %s\n", s.ToString().c_str());
|
|
|
|
thread->stats.AddErrors(1);
|
2016-07-29 20:02:03 +02:00
|
|
|
} else {
|
2018-06-07 19:34:56 +02:00
|
|
|
thread->stats.AddDeletes(10);
|
Benchmarking for Merge Operator
Summary:
Updated db_bench and utilities/merge_operators.h to allow for dynamic benchmarking
of merge operators in db_bench. Added a new test (--benchmarks=mergerandom), which performs
a bunch of random Merge() operations over random keys. Also added a "--merge_operator=" flag
so that the tester can easily benchmark different merge operators. Currently supports
the PutOperator and UInt64Add operator. Support for stringappend or list append may come later.
Test Plan:
1. make db_bench
2. Test the PutOperator (simulating Put) as follows:
./db_bench --benchmarks=fillrandom,readrandom,updaterandom,readrandom,mergerandom,readrandom --merge_operator=put
--threads=2
3. Test the UInt64AddOperator (simulating numeric addition) similarly:
./db_bench --value_size=8 --benchmarks=fillrandom,readrandom,updaterandom,readrandom,mergerandom,readrandom
--merge_operator=uint64add --threads=2
Reviewers: haobo, dhruba, zshao, MarkCallaghan
Reviewed By: haobo
CC: leveldb
Differential Revision: https://reviews.facebook.net/D11535
2013-08-16 02:13:07 +02:00
|
|
|
}
|
|
|
|
|
2018-06-07 19:34:56 +02:00
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual Status TestDeleteRange(ThreadState* /* thread */,
|
|
|
|
WriteOptions& /* write_opts */,
|
|
|
|
const std::vector<int>& /* rand_column_families */,
|
|
|
|
const std::vector<int64_t>& /* rand_keys */,
|
2018-06-08 00:34:42 +02:00
|
|
|
std::unique_ptr<MutexLock>& /* lock */) {
|
|
|
|
assert(false);
|
|
|
|
return Status::NotSupported("BatchedOpsStressTest does not support "
|
|
|
|
"TestDeleteRange");
|
|
|
|
}
|
2013-06-18 01:13:32 +02:00
|
|
|
|
2018-06-21 07:14:12 +02:00
|
|
|
virtual void TestIngestExternalFile(
|
|
|
|
ThreadState* /* thread */,
|
|
|
|
const std::vector<int>& /* rand_column_families */,
|
|
|
|
const std::vector<int64_t>& /* rand_keys */,
|
|
|
|
std::unique_ptr<MutexLock>& /* lock */) {
|
|
|
|
assert(false);
|
|
|
|
fprintf(stderr,
|
|
|
|
"BatchedOpsStressTest does not support "
|
|
|
|
"TestIngestExternalFile\n");
|
|
|
|
std::terminate();
|
|
|
|
}
|
|
|
|
|
2018-06-07 19:34:56 +02:00
|
|
|
// Given a key K, this gets values for "0"+K, "1"+K,..."9"+K
|
|
|
|
// in the same snapshot, and verifies that all the values are of the form
|
|
|
|
// "0"+V, "1"+V,..."9"+V.
|
|
|
|
// ASSUMES that BatchedOpsStressTest::TestPut was used to put (K, V) into
|
|
|
|
// the DB.
|
|
|
|
virtual Status TestGet(ThreadState* thread, const ReadOptions& readoptions,
|
|
|
|
const std::vector<int>& rand_column_families,
|
|
|
|
const std::vector<int64_t>& rand_keys) {
|
|
|
|
std::string keys[10] = {"0", "1", "2", "3", "4", "5", "6", "7", "8", "9"};
|
|
|
|
Slice key_slices[10];
|
|
|
|
std::string values[10];
|
|
|
|
ReadOptions readoptionscopy = readoptions;
|
|
|
|
readoptionscopy.snapshot = db_->GetSnapshot();
|
|
|
|
std::string key_str = Key(rand_keys[0]);
|
|
|
|
Slice key = key_str;
|
|
|
|
auto cfh = column_families_[rand_column_families[0]];
|
|
|
|
std::string from_db;
|
Timestamp and TTL Wrapper for rocksdb
Summary:
When opened with DBTimestamp::Open call, timestamps are prepended to and stripped from the value during subsequent Put and Get calls respectively. The Timestamp is used to discard values in Get and custom compaction filter which have exceeded their TTL which is specified during Open.
Have made a temporary change to Makefile to let us test with the temporary file TestTime.cc. Have also changed the private members of db_impl.h to protected to let them be inherited by the new class DBTimestamp
Test Plan: make db_timestamp; TestTime.cc(will not check it in) shows how to use the apis currently, but I will write unit-tests shortly
Reviewers: dhruba, vamsi, haobo, sheki, heyongqiang, vkrest
Reviewed By: vamsi
CC: zshao, xjin, vkrest, MarkCallaghan
Differential Revision: https://reviews.facebook.net/D10311
2013-04-15 22:33:13 +02:00
|
|
|
Status s;
|
2018-06-07 19:34:56 +02:00
|
|
|
for (int i = 0; i < 10; i++) {
|
|
|
|
keys[i] += key.ToString();
|
|
|
|
key_slices[i] = keys[i];
|
|
|
|
s = db_->Get(readoptionscopy, cfh, key_slices[i], &from_db);
|
|
|
|
if (!s.ok() && !s.IsNotFound()) {
|
|
|
|
fprintf(stderr, "get error: %s\n", s.ToString().c_str());
|
|
|
|
values[i] = "";
|
|
|
|
thread->stats.AddErrors(1);
|
|
|
|
// we continue after error rather than exiting so that we can
|
|
|
|
// find more errors if any
|
|
|
|
} else if (s.IsNotFound()) {
|
|
|
|
values[i] = "";
|
|
|
|
thread->stats.AddGets(1, 0);
|
2014-02-27 21:13:48 +01:00
|
|
|
} else {
|
2018-06-07 19:34:56 +02:00
|
|
|
values[i] = from_db;
|
|
|
|
|
|
|
|
char expected_prefix = (keys[i])[0];
|
|
|
|
char actual_prefix = (values[i])[0];
|
|
|
|
if (actual_prefix != expected_prefix) {
|
|
|
|
fprintf(stderr, "error expected prefix = %c actual = %c\n",
|
|
|
|
expected_prefix, actual_prefix);
|
2014-02-27 21:13:48 +01:00
|
|
|
}
|
2018-06-07 19:34:56 +02:00
|
|
|
(values[i])[0] = ' '; // blank out the differing character
|
|
|
|
thread->stats.AddGets(1, 1);
|
2014-02-27 21:13:48 +01:00
|
|
|
}
|
2018-06-07 19:34:56 +02:00
|
|
|
}
|
|
|
|
db_->ReleaseSnapshot(readoptionscopy.snapshot);
|
|
|
|
|
|
|
|
// Now that we retrieved all values, check that they all match
|
|
|
|
for (int i = 1; i < 10; i++) {
|
|
|
|
if (values[i] != values[0]) {
|
|
|
|
fprintf(stderr, "error : inconsistent values for key %s: %s, %s\n",
|
|
|
|
key.ToString(true).c_str(), StringToHex(values[0]).c_str(),
|
|
|
|
StringToHex(values[i]).c_str());
|
|
|
|
// we continue after error rather than exiting so that we can
|
|
|
|
// find more errors if any
|
2014-02-27 21:13:48 +01:00
|
|
|
}
|
2018-06-07 19:34:56 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Given a key, this does prefix scans for "0"+P, "1"+P,..."9"+P
|
|
|
|
// in the same snapshot where P is the first FLAGS_prefix_size - 1 bytes
|
|
|
|
// of the key. Each of these 10 scans returns a series of values;
|
|
|
|
// each series should be the same length, and it is verified for each
|
|
|
|
// index i that all the i'th values are of the form "0"+V, "1"+V,..."9"+V.
|
|
|
|
// ASSUMES that MultiPut was used to put (K, V)
|
|
|
|
virtual Status TestPrefixScan(ThreadState* thread, const ReadOptions& readoptions,
|
|
|
|
const std::vector<int>& rand_column_families,
|
|
|
|
const std::vector<int64_t>& rand_keys) {
|
|
|
|
std::string key_str = Key(rand_keys[0]);
|
|
|
|
Slice key = key_str;
|
|
|
|
auto cfh = column_families_[rand_column_families[0]];
|
|
|
|
std::string prefixes[10] = {"0", "1", "2", "3", "4",
|
|
|
|
"5", "6", "7", "8", "9"};
|
|
|
|
Slice prefix_slices[10];
|
|
|
|
ReadOptions readoptionscopy[10];
|
|
|
|
const Snapshot* snapshot = db_->GetSnapshot();
|
|
|
|
Iterator* iters[10];
|
2018-07-23 19:40:40 +02:00
|
|
|
std::string upper_bounds[10];
|
|
|
|
Slice ub_slices[10];
|
2018-06-07 19:34:56 +02:00
|
|
|
Status s = Status::OK();
|
|
|
|
for (int i = 0; i < 10; i++) {
|
|
|
|
prefixes[i] += key.ToString();
|
|
|
|
prefixes[i].resize(FLAGS_prefix_size);
|
|
|
|
prefix_slices[i] = Slice(prefixes[i]);
|
|
|
|
readoptionscopy[i] = readoptions;
|
|
|
|
readoptionscopy[i].snapshot = snapshot;
|
2018-07-23 19:40:40 +02:00
|
|
|
if (thread->rand.OneIn(2) &&
|
|
|
|
GetNextPrefix(prefix_slices[i], &(upper_bounds[i]))) {
|
|
|
|
// For half of the time, set the upper bound to the next prefix
|
|
|
|
ub_slices[i] = Slice(upper_bounds[i]);
|
|
|
|
readoptionscopy[i].iterate_upper_bound = &(ub_slices[i]);
|
|
|
|
}
|
2018-06-07 19:34:56 +02:00
|
|
|
iters[i] = db_->NewIterator(readoptionscopy[i], cfh);
|
|
|
|
iters[i]->Seek(prefix_slices[i]);
|
|
|
|
}
|
|
|
|
|
2018-10-29 17:52:54 +01:00
|
|
|
long count = 0;
|
2018-06-07 19:34:56 +02:00
|
|
|
while (iters[0]->Valid() && iters[0]->key().starts_with(prefix_slices[0])) {
|
|
|
|
count++;
|
|
|
|
std::string values[10];
|
|
|
|
// get list of all values for this iteration
|
|
|
|
for (int i = 0; i < 10; i++) {
|
|
|
|
// no iterator should finish before the first one
|
|
|
|
assert(iters[i]->Valid() &&
|
|
|
|
iters[i]->key().starts_with(prefix_slices[i]));
|
|
|
|
values[i] = iters[i]->value().ToString();
|
|
|
|
|
|
|
|
char expected_first = (prefixes[i])[0];
|
|
|
|
char actual_first = (values[i])[0];
|
|
|
|
|
|
|
|
if (actual_first != expected_first) {
|
|
|
|
fprintf(stderr, "error expected first = %c actual = %c\n",
|
|
|
|
expected_first, actual_first);
|
|
|
|
}
|
|
|
|
(values[i])[0] = ' '; // blank out the differing character
|
2014-06-07 03:04:56 +02:00
|
|
|
}
|
2018-06-07 19:34:56 +02:00
|
|
|
// make sure all values are equivalent
|
|
|
|
for (int i = 0; i < 10; i++) {
|
|
|
|
if (values[i] != values[0]) {
|
|
|
|
fprintf(stderr, "error : %d, inconsistent values for prefix %s: %s, %s\n",
|
|
|
|
i, prefixes[i].c_str(), StringToHex(values[0]).c_str(),
|
|
|
|
StringToHex(values[i]).c_str());
|
|
|
|
// we continue after error rather than exiting so that we can
|
|
|
|
// find more errors if any
|
2018-04-19 01:25:33 +02:00
|
|
|
}
|
2018-06-07 19:34:56 +02:00
|
|
|
iters[i]->Next();
|
2017-12-13 20:51:12 +01:00
|
|
|
}
|
2012-10-03 18:58:45 +02:00
|
|
|
}
|
|
|
|
|
2018-06-07 19:34:56 +02:00
|
|
|
// cleanup iterators and snapshot
|
|
|
|
for (int i = 0; i < 10; i++) {
|
|
|
|
// if the first iterator finished, they should have all finished
|
|
|
|
assert(!iters[i]->Valid() ||
|
|
|
|
!iters[i]->key().starts_with(prefix_slices[i]));
|
|
|
|
assert(iters[i]->status().ok());
|
|
|
|
delete iters[i];
|
Timestamp and TTL Wrapper for rocksdb
Summary:
When opened with DBTimestamp::Open call, timestamps are prepended to and stripped from the value during subsequent Put and Get calls respectively. The Timestamp is used to discard values in Get and custom compaction filter which have exceeded their TTL which is specified during Open.
Have made a temporary change to Makefile to let us test with the temporary file TestTime.cc. Have also changed the private members of db_impl.h to protected to let them be inherited by the new class DBTimestamp
Test Plan: make db_timestamp; TestTime.cc(will not check it in) shows how to use the apis currently, but I will write unit-tests shortly
Reviewers: dhruba, vamsi, haobo, sheki, heyongqiang, vkrest
Reviewed By: vamsi
CC: zshao, xjin, vkrest, MarkCallaghan
Differential Revision: https://reviews.facebook.net/D10311
2013-04-15 22:33:13 +02:00
|
|
|
}
|
2018-06-07 19:34:56 +02:00
|
|
|
db_->ReleaseSnapshot(snapshot);
|
2012-11-09 22:04:12 +01:00
|
|
|
|
2018-06-07 19:34:56 +02:00
|
|
|
if (s.ok()) {
|
|
|
|
thread->stats.AddPrefixes(1, count);
|
|
|
|
} else {
|
|
|
|
thread->stats.AddErrors(1);
|
2012-10-03 18:58:45 +02:00
|
|
|
}
|
2018-06-07 19:34:56 +02:00
|
|
|
|
|
|
|
return s;
|
2012-10-03 18:58:45 +02:00
|
|
|
}
|
|
|
|
|
2018-06-07 19:34:56 +02:00
|
|
|
virtual void VerifyDb(ThreadState* /* thread */) const {}
|
2012-10-03 18:58:45 +02:00
|
|
|
};
|
|
|
|
|
2018-10-27 00:06:44 +02:00
|
|
|
class AtomicFlushStressTest : public StressTest {
|
|
|
|
public:
|
|
|
|
AtomicFlushStressTest() : batch_id_(0) {}
|
|
|
|
|
|
|
|
virtual ~AtomicFlushStressTest() {}
|
|
|
|
|
|
|
|
virtual Status TestPut(ThreadState* thread, WriteOptions& write_opts,
|
|
|
|
const ReadOptions& /* read_opts */,
|
|
|
|
const std::vector<int>& rand_column_families,
|
|
|
|
const std::vector<int64_t>& rand_keys,
|
|
|
|
char (&value)[100],
|
|
|
|
std::unique_ptr<MutexLock>& /* lock */) {
|
|
|
|
std::string key_str = Key(rand_keys[0]);
|
|
|
|
Slice key = key_str;
|
|
|
|
uint64_t value_base = batch_id_.fetch_add(1);
|
|
|
|
size_t sz =
|
|
|
|
GenerateValue(static_cast<uint32_t>(value_base), value, sizeof(value));
|
|
|
|
Slice v(value, sz);
|
|
|
|
WriteBatch batch;
|
|
|
|
for (auto cf : rand_column_families) {
|
|
|
|
ColumnFamilyHandle* cfh = column_families_[cf];
|
|
|
|
if (FLAGS_use_merge) {
|
|
|
|
batch.Merge(cfh, key, v);
|
|
|
|
} else { /* !FLAGS_use_merge */
|
|
|
|
batch.Put(cfh, key, v);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
Status s = db_->Write(write_opts, &batch);
|
|
|
|
if (!s.ok()) {
|
|
|
|
fprintf(stderr, "multi put or merge error: %s\n", s.ToString().c_str());
|
|
|
|
thread->stats.AddErrors(1);
|
|
|
|
} else {
|
2018-10-29 17:52:54 +01:00
|
|
|
auto num = static_cast<long>(rand_column_families.size());
|
2018-10-27 00:06:44 +02:00
|
|
|
thread->stats.AddBytesForWrites(num, (sz + 1) * num);
|
|
|
|
}
|
|
|
|
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual Status TestDelete(ThreadState* thread, WriteOptions& write_opts,
|
|
|
|
const std::vector<int>& rand_column_families,
|
|
|
|
const std::vector<int64_t>& rand_keys,
|
|
|
|
std::unique_ptr<MutexLock>& /* lock */) {
|
|
|
|
std::string key_str = Key(rand_keys[0]);
|
|
|
|
Slice key = key_str;
|
|
|
|
WriteBatch batch;
|
|
|
|
for (auto cf : rand_column_families) {
|
|
|
|
ColumnFamilyHandle* cfh = column_families_[cf];
|
|
|
|
batch.Delete(cfh, key);
|
|
|
|
}
|
|
|
|
Status s = db_->Write(write_opts, &batch);
|
|
|
|
if (!s.ok()) {
|
|
|
|
fprintf(stderr, "multidel error: %s\n", s.ToString().c_str());
|
|
|
|
thread->stats.AddErrors(1);
|
|
|
|
} else {
|
2018-10-29 17:52:54 +01:00
|
|
|
thread->stats.AddDeletes(static_cast<long>(rand_column_families.size()));
|
2018-10-27 00:06:44 +02:00
|
|
|
}
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual Status TestDeleteRange(ThreadState* thread, WriteOptions& write_opts,
|
|
|
|
const std::vector<int>& rand_column_families,
|
|
|
|
const std::vector<int64_t>& rand_keys,
|
|
|
|
std::unique_ptr<MutexLock>& /* lock */) {
|
|
|
|
int64_t rand_key = rand_keys[0];
|
|
|
|
auto shared = thread->shared;
|
|
|
|
int64_t max_key = shared->GetMaxKey();
|
|
|
|
if (rand_key > max_key - FLAGS_range_deletion_width) {
|
|
|
|
rand_key =
|
|
|
|
thread->rand.Next() % (max_key - FLAGS_range_deletion_width + 1);
|
|
|
|
}
|
|
|
|
std::string key_str = Key(rand_key);
|
|
|
|
Slice key = key_str;
|
|
|
|
std::string end_key_str = Key(rand_key + FLAGS_range_deletion_width);
|
|
|
|
Slice end_key = end_key_str;
|
|
|
|
WriteBatch batch;
|
|
|
|
for (auto cf : rand_column_families) {
|
|
|
|
ColumnFamilyHandle* cfh = column_families_[rand_column_families[cf]];
|
|
|
|
batch.DeleteRange(cfh, key, end_key);
|
|
|
|
}
|
|
|
|
Status s = db_->Write(write_opts, &batch);
|
|
|
|
if (!s.ok()) {
|
|
|
|
fprintf(stderr, "multi del range error: %s\n", s.ToString().c_str());
|
|
|
|
thread->stats.AddErrors(1);
|
|
|
|
} else {
|
2018-10-29 17:52:54 +01:00
|
|
|
thread->stats.AddRangeDeletions(
|
|
|
|
static_cast<long>(rand_column_families.size()));
|
2018-10-27 00:06:44 +02:00
|
|
|
}
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual void TestIngestExternalFile(
|
|
|
|
ThreadState* /* thread */,
|
|
|
|
const std::vector<int>& /* rand_column_families */,
|
|
|
|
const std::vector<int64_t>& /* rand_keys */,
|
|
|
|
std::unique_ptr<MutexLock>& /* lock */) {
|
|
|
|
assert(false);
|
|
|
|
fprintf(stderr,
|
|
|
|
"AtomicFlushStressTest does not support TestIngestExternalFile "
|
|
|
|
"because it's not possible to verify the result\n");
|
|
|
|
std::terminate();
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual Status TestGet(ThreadState* thread, const ReadOptions& readoptions,
|
|
|
|
const std::vector<int>& rand_column_families,
|
|
|
|
const std::vector<int64_t>& rand_keys) {
|
|
|
|
std::string key_str = Key(rand_keys[0]);
|
|
|
|
Slice key = key_str;
|
|
|
|
auto cfh =
|
|
|
|
column_families_[rand_column_families[thread->rand.Next() %
|
|
|
|
rand_column_families.size()]];
|
|
|
|
std::string from_db;
|
|
|
|
Status s = db_->Get(readoptions, cfh, key, &from_db);
|
|
|
|
if (s.ok()) {
|
|
|
|
thread->stats.AddGets(1, 1);
|
|
|
|
} else if (s.IsNotFound()) {
|
|
|
|
thread->stats.AddGets(1, 0);
|
|
|
|
} else {
|
|
|
|
thread->stats.AddErrors(1);
|
|
|
|
}
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual Status TestPrefixScan(ThreadState* thread,
|
|
|
|
const ReadOptions& readoptions,
|
|
|
|
const std::vector<int>& rand_column_families,
|
|
|
|
const std::vector<int64_t>& rand_keys) {
|
|
|
|
std::string key_str = Key(rand_keys[0]);
|
|
|
|
Slice key = key_str;
|
|
|
|
Slice prefix = Slice(key.data(), FLAGS_prefix_size);
|
|
|
|
|
|
|
|
std::string upper_bound;
|
|
|
|
Slice ub_slice;
|
|
|
|
ReadOptions ro_copy = readoptions;
|
|
|
|
if (thread->rand.OneIn(2) && GetNextPrefix(prefix, &upper_bound)) {
|
|
|
|
ub_slice = Slice(upper_bound);
|
|
|
|
ro_copy.iterate_upper_bound = &ub_slice;
|
|
|
|
}
|
|
|
|
auto cfh =
|
|
|
|
column_families_[rand_column_families[thread->rand.Next() %
|
|
|
|
rand_column_families.size()]];
|
|
|
|
Iterator* iter = db_->NewIterator(ro_copy, cfh);
|
2018-10-29 17:52:54 +01:00
|
|
|
long count = 0;
|
2018-10-27 00:06:44 +02:00
|
|
|
for (iter->Seek(prefix); iter->Valid() && iter->key().starts_with(prefix);
|
|
|
|
iter->Next()) {
|
|
|
|
++count;
|
|
|
|
}
|
2018-10-29 17:52:54 +01:00
|
|
|
assert(count <= (static_cast<long>(1) << ((8 - FLAGS_prefix_size) * 8)));
|
2018-10-27 00:06:44 +02:00
|
|
|
Status s = iter->status();
|
|
|
|
if (s.ok()) {
|
2018-10-29 17:52:54 +01:00
|
|
|
thread->stats.AddPrefixes(1, count);
|
2018-10-27 00:06:44 +02:00
|
|
|
} else {
|
|
|
|
thread->stats.AddErrors(1);
|
|
|
|
}
|
|
|
|
delete iter;
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
2019-01-08 01:44:52 +01:00
|
|
|
#ifdef ROCKSDB_LITE
|
|
|
|
virtual Status TestCheckpoint(
|
|
|
|
ThreadState* /* thread */,
|
|
|
|
const std::vector<int>& /* rand_column_families */,
|
|
|
|
const std::vector<int64_t>& /* rand_keys */) {
|
|
|
|
assert(false);
|
|
|
|
fprintf(stderr,
|
|
|
|
"RocksDB lite does not support "
|
|
|
|
"TestCheckpoint\n");
|
|
|
|
std::terminate();
|
|
|
|
}
|
|
|
|
#else
|
|
|
|
virtual Status TestCheckpoint(
|
|
|
|
ThreadState* thread, const std::vector<int>& /* rand_column_families */,
|
|
|
|
const std::vector<int64_t>& /* rand_keys */) {
|
|
|
|
std::string checkpoint_dir =
|
|
|
|
FLAGS_db + "/.checkpoint" + ToString(thread->tid);
|
|
|
|
DestroyDB(checkpoint_dir, Options());
|
|
|
|
Checkpoint* checkpoint = nullptr;
|
|
|
|
Status s = Checkpoint::Create(db_, &checkpoint);
|
|
|
|
if (s.ok()) {
|
|
|
|
s = checkpoint->CreateCheckpoint(checkpoint_dir);
|
|
|
|
}
|
|
|
|
std::vector<ColumnFamilyHandle*> cf_handles;
|
|
|
|
DB* checkpoint_db = nullptr;
|
|
|
|
if (s.ok()) {
|
|
|
|
delete checkpoint;
|
|
|
|
checkpoint = nullptr;
|
|
|
|
Options options(options_);
|
|
|
|
options.listeners.clear();
|
|
|
|
std::vector<ColumnFamilyDescriptor> cf_descs;
|
|
|
|
// TODO(ajkr): `column_family_names_` is not safe to access here when
|
|
|
|
// `clear_column_family_one_in != 0`. But we can't easily switch to
|
|
|
|
// `ListColumnFamilies` to get names because it won't necessarily give
|
|
|
|
// the same order as `column_family_names_`.
|
|
|
|
if (FLAGS_clear_column_family_one_in == 0) {
|
|
|
|
for (const auto& name : column_family_names_) {
|
|
|
|
cf_descs.emplace_back(name, ColumnFamilyOptions(options));
|
|
|
|
}
|
|
|
|
s = DB::OpenForReadOnly(DBOptions(options), checkpoint_dir, cf_descs,
|
|
|
|
&cf_handles, &checkpoint_db);
|
|
|
|
}
|
|
|
|
}
|
2019-01-09 02:16:37 +01:00
|
|
|
if (checkpoint_db != nullptr) {
|
|
|
|
for (auto cfh : cf_handles) {
|
|
|
|
delete cfh;
|
|
|
|
}
|
|
|
|
cf_handles.clear();
|
|
|
|
delete checkpoint_db;
|
|
|
|
checkpoint_db = nullptr;
|
|
|
|
}
|
2019-01-08 01:44:52 +01:00
|
|
|
DestroyDB(checkpoint_dir, Options());
|
|
|
|
if (!s.ok()) {
|
|
|
|
fprintf(stderr, "A checkpoint operation failed with: %s\n",
|
|
|
|
s.ToString().c_str());
|
|
|
|
}
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
#endif // !ROCKSDB_LITE
|
|
|
|
|
2018-10-27 00:06:44 +02:00
|
|
|
virtual void VerifyDb(ThreadState* thread) const {
|
|
|
|
ReadOptions options(FLAGS_verify_checksum, true);
|
|
|
|
// We must set total_order_seek to true because we are doing a SeekToFirst
|
|
|
|
// on a column family whose memtables may support (by default) prefix-based
|
|
|
|
// iterator. In this case, NewIterator with options.total_order_seek being
|
|
|
|
// false returns a prefix-based iterator. Calling SeekToFirst using this
|
|
|
|
// iterator causes the iterator to become invalid. That means we cannot
|
|
|
|
// iterate the memtable using this iterator any more, although the memtable
|
|
|
|
// contains the most up-to-date key-values.
|
|
|
|
options.total_order_seek = true;
|
|
|
|
assert(thread != nullptr);
|
|
|
|
auto shared = thread->shared;
|
2018-11-09 20:17:34 +01:00
|
|
|
std::vector<std::unique_ptr<Iterator> > iters(column_families_.size());
|
2018-10-27 00:06:44 +02:00
|
|
|
for (size_t i = 0; i != column_families_.size(); ++i) {
|
|
|
|
iters[i].reset(db_->NewIterator(options, column_families_[i]));
|
|
|
|
}
|
|
|
|
for (auto& iter : iters) {
|
|
|
|
iter->SeekToFirst();
|
|
|
|
}
|
|
|
|
size_t num = column_families_.size();
|
|
|
|
assert(num == iters.size());
|
2018-11-14 05:02:08 +01:00
|
|
|
std::vector<Status> statuses(num, Status::OK());
|
2018-10-27 00:06:44 +02:00
|
|
|
do {
|
|
|
|
size_t valid_cnt = 0;
|
2018-11-14 05:02:08 +01:00
|
|
|
size_t idx = 0;
|
2018-10-27 00:06:44 +02:00
|
|
|
for (auto& iter : iters) {
|
|
|
|
if (iter->Valid()) {
|
|
|
|
++valid_cnt;
|
2018-11-14 05:02:08 +01:00
|
|
|
} else {
|
|
|
|
statuses[idx] = iter->status();
|
2018-10-27 00:06:44 +02:00
|
|
|
}
|
2018-11-14 05:02:08 +01:00
|
|
|
++idx;
|
2018-10-27 00:06:44 +02:00
|
|
|
}
|
|
|
|
if (valid_cnt == 0) {
|
2018-11-14 05:02:08 +01:00
|
|
|
Status status;
|
2018-10-27 00:06:44 +02:00
|
|
|
for (size_t i = 0; i != num; ++i) {
|
2018-11-14 05:02:08 +01:00
|
|
|
const auto& s = statuses[i];
|
|
|
|
if (!s.ok()) {
|
|
|
|
status = s;
|
|
|
|
fprintf(stderr, "Iterator on cf %s has error: %s\n",
|
|
|
|
column_families_[i]->GetName().c_str(),
|
|
|
|
s.ToString().c_str());
|
|
|
|
shared->SetVerificationFailure();
|
2018-10-27 00:06:44 +02:00
|
|
|
}
|
|
|
|
}
|
2018-11-14 05:02:08 +01:00
|
|
|
if (status.ok()) {
|
|
|
|
fprintf(stdout, "Finished scanning all column families.\n");
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
} else if (valid_cnt != iters.size()) {
|
2018-10-27 00:06:44 +02:00
|
|
|
for (size_t i = 0; i != num; ++i) {
|
2018-11-14 05:02:08 +01:00
|
|
|
if (!iters[i]->Valid()) {
|
|
|
|
if (statuses[i].ok()) {
|
|
|
|
fprintf(stderr, "Finished scanning cf %s\n",
|
|
|
|
column_families_[i]->GetName().c_str());
|
|
|
|
} else {
|
|
|
|
fprintf(stderr, "Iterator on cf %s has error: %s\n",
|
|
|
|
column_families_[i]->GetName().c_str(),
|
|
|
|
statuses[i].ToString().c_str());
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
fprintf(stderr, "cf %s has remaining data to scan\n",
|
|
|
|
column_families_[i]->GetName().c_str());
|
2018-10-27 00:06:44 +02:00
|
|
|
}
|
|
|
|
}
|
2018-11-14 05:02:08 +01:00
|
|
|
shared->SetVerificationFailure();
|
|
|
|
break;
|
2018-10-27 00:06:44 +02:00
|
|
|
}
|
|
|
|
// If the program reaches here, then all column families' iterators are
|
|
|
|
// still valid.
|
|
|
|
Slice key;
|
|
|
|
Slice value;
|
|
|
|
for (size_t i = 0; i != num; ++i) {
|
|
|
|
if (i == 0) {
|
|
|
|
key = iters[i]->key();
|
|
|
|
value = iters[i]->value();
|
|
|
|
} else {
|
|
|
|
if (key.compare(iters[i]->key()) != 0) {
|
|
|
|
fprintf(stderr, "Verification failed\n");
|
|
|
|
fprintf(stderr, "cf%s: %s => %s\n",
|
|
|
|
column_families_[0]->GetName().c_str(),
|
|
|
|
key.ToString(true /* hex */).c_str(),
|
|
|
|
value.ToString(/* hex */).c_str());
|
|
|
|
fprintf(stderr, "cf%s: %s => %s\n",
|
|
|
|
column_families_[i]->GetName().c_str(),
|
|
|
|
iters[i]->key().ToString(true /* hex */).c_str(),
|
|
|
|
iters[i]->value().ToString(true /* hex */).c_str());
|
|
|
|
shared->SetVerificationFailure();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
for (auto& iter : iters) {
|
|
|
|
iter->Next();
|
|
|
|
}
|
|
|
|
} while (true);
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual std::vector<int> GenerateColumnFamilies(
|
|
|
|
const int /* num_column_families */, int /* rand_column_family */) const {
|
|
|
|
std::vector<int> ret;
|
|
|
|
int num = static_cast<int>(column_families_.size());
|
|
|
|
int k = 0;
|
|
|
|
std::generate_n(back_inserter(ret), num, [&k]() -> int { return k++; });
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
std::atomic<int64_t> batch_id_;
|
|
|
|
};
|
|
|
|
|
2013-10-04 06:49:15 +02:00
|
|
|
} // namespace rocksdb
|
2012-10-03 18:58:45 +02:00
|
|
|
|
|
|
|
int main(int argc, char** argv) {
|
2014-05-09 02:25:13 +02:00
|
|
|
SetUsageMessage(std::string("\nUSAGE:\n") + std::string(argv[0]) +
|
|
|
|
" [OPTIONS]...");
|
|
|
|
ParseCommandLineFlags(&argc, &argv, true);
|
2013-10-24 16:43:14 +02:00
|
|
|
|
|
|
|
if (FLAGS_statistics) {
|
|
|
|
dbstats = rocksdb::CreateDBStatistics();
|
|
|
|
}
|
|
|
|
FLAGS_compression_type_e =
|
|
|
|
StringToCompressionType(FLAGS_compression_type.c_str());
|
2017-08-24 04:31:40 +02:00
|
|
|
FLAGS_checksum_type_e = StringToChecksumType(FLAGS_checksum_type.c_str());
|
2013-10-24 16:43:14 +02:00
|
|
|
if (!FLAGS_hdfs.empty()) {
|
|
|
|
FLAGS_env = new rocksdb::HdfsEnv(FLAGS_hdfs);
|
2012-10-03 18:58:45 +02:00
|
|
|
}
|
2013-10-24 16:43:14 +02:00
|
|
|
FLAGS_rep_factory = StringToRepFactory(FLAGS_memtablerep.c_str());
|
2012-10-03 18:58:45 +02:00
|
|
|
|
2012-11-15 07:00:11 +01:00
|
|
|
// The number of background threads should be at least as much the
|
|
|
|
// max number of concurrent compactions.
|
|
|
|
FLAGS_env->SetBackgroundThreads(FLAGS_max_background_compactions);
|
2017-08-17 04:03:18 +02:00
|
|
|
FLAGS_env->SetBackgroundThreads(FLAGS_num_bottom_pri_threads,
|
|
|
|
rocksdb::Env::Priority::BOTTOM);
|
2014-03-11 21:44:33 +01:00
|
|
|
if (FLAGS_prefixpercent > 0 && FLAGS_prefix_size <= 0) {
|
|
|
|
fprintf(stderr,
|
|
|
|
"Error: prefixpercent is non-zero while prefix_size is "
|
|
|
|
"not positive!\n");
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
if (FLAGS_test_batches_snapshots && FLAGS_prefix_size <= 0) {
|
|
|
|
fprintf(stderr,
|
|
|
|
"Error: please specify prefix_size for "
|
|
|
|
"test_batches_snapshots test!\n");
|
|
|
|
exit(1);
|
|
|
|
}
|
2017-08-17 04:03:18 +02:00
|
|
|
if (FLAGS_memtable_prefix_bloom_size_ratio > 0.0 && FLAGS_prefix_size <= 0) {
|
|
|
|
fprintf(stderr,
|
|
|
|
"Error: please specify positive prefix_size in order to use "
|
|
|
|
"memtable_prefix_bloom_size_ratio\n");
|
|
|
|
exit(1);
|
|
|
|
}
|
2013-08-15 01:58:36 +02:00
|
|
|
if ((FLAGS_readpercent + FLAGS_prefixpercent +
|
2016-12-07 21:59:59 +01:00
|
|
|
FLAGS_writepercent + FLAGS_delpercent + FLAGS_delrangepercent +
|
|
|
|
FLAGS_iterpercent) != 100) {
|
2013-09-20 01:47:24 +02:00
|
|
|
fprintf(stderr,
|
2016-12-07 21:59:59 +01:00
|
|
|
"Error: Read+Prefix+Write+Delete+DeleteRange+Iterate percents != "
|
|
|
|
"100!\n");
|
2012-11-08 00:35:08 +01:00
|
|
|
exit(1);
|
|
|
|
}
|
2013-05-21 20:27:23 +02:00
|
|
|
if (FLAGS_disable_wal == 1 && FLAGS_reopen > 0) {
|
2018-06-07 19:34:56 +02:00
|
|
|
fprintf(stderr, "Error: Db cannot reopen safely with disable_wal set!\n");
|
|
|
|
exit(1);
|
2013-05-21 20:27:23 +02:00
|
|
|
}
|
2013-04-08 20:50:44 +02:00
|
|
|
if ((unsigned)FLAGS_reopen >= FLAGS_ops_per_thread) {
|
2013-11-17 08:44:39 +01:00
|
|
|
fprintf(stderr,
|
|
|
|
"Error: #DB-reopens should be < ops_per_thread\n"
|
|
|
|
"Provided reopens = %d and ops_per_thread = %lu\n",
|
|
|
|
FLAGS_reopen,
|
|
|
|
(unsigned long)FLAGS_ops_per_thread);
|
2013-04-08 20:50:44 +02:00
|
|
|
exit(1);
|
|
|
|
}
|
2016-12-07 21:59:59 +01:00
|
|
|
if (FLAGS_test_batches_snapshots && FLAGS_delrangepercent > 0) {
|
|
|
|
fprintf(stderr, "Error: nonzero delrangepercent unsupported in "
|
|
|
|
"test_batches_snapshots mode\n");
|
|
|
|
exit(1);
|
|
|
|
}
|
2017-08-15 20:53:00 +02:00
|
|
|
if (FLAGS_active_width > FLAGS_max_key) {
|
|
|
|
fprintf(stderr, "Error: active_width can be at most max_key\n");
|
|
|
|
exit(1);
|
|
|
|
} else if (FLAGS_active_width == 0) {
|
|
|
|
FLAGS_active_width = FLAGS_max_key;
|
|
|
|
}
|
2017-08-17 04:03:18 +02:00
|
|
|
if (FLAGS_value_size_mult * kRandomValueMaxFactor > kValueMaxLen) {
|
|
|
|
fprintf(stderr, "Error: value_size_mult can be at most %d\n",
|
|
|
|
kValueMaxLen / kRandomValueMaxFactor);
|
|
|
|
exit(1);
|
|
|
|
}
|
2018-05-22 19:50:09 +02:00
|
|
|
if (FLAGS_use_merge && FLAGS_nooverwritepercent == 100) {
|
|
|
|
fprintf(
|
|
|
|
stderr,
|
|
|
|
"Error: nooverwritepercent must not be 100 when using merge operands");
|
|
|
|
exit(1);
|
|
|
|
}
|
2018-06-21 07:14:12 +02:00
|
|
|
if (FLAGS_ingest_external_file_one_in > 0 && FLAGS_nooverwritepercent > 0) {
|
|
|
|
fprintf(stderr,
|
|
|
|
"Error: nooverwritepercent must be 0 when using file ingestion\n");
|
|
|
|
exit(1);
|
|
|
|
}
|
2018-11-09 00:13:28 +01:00
|
|
|
if (FLAGS_clear_column_family_one_in > 0 && FLAGS_backup_one_in > 0) {
|
|
|
|
fprintf(stderr,
|
|
|
|
"Error: clear_column_family_one_in must be 0 when using backup\n");
|
|
|
|
exit(1);
|
|
|
|
}
|
2018-12-14 07:05:59 +01:00
|
|
|
if (FLAGS_test_atomic_flush) {
|
|
|
|
FLAGS_atomic_flush = true;
|
|
|
|
}
|
2019-01-03 02:38:27 +01:00
|
|
|
if (FLAGS_read_only) {
|
|
|
|
if (FLAGS_writepercent != 0 || FLAGS_delpercent != 0 ||
|
|
|
|
FLAGS_delrangepercent != 0) {
|
|
|
|
fprintf(stderr, "Error: updates are not supported in read only mode\n");
|
|
|
|
exit(1);
|
|
|
|
} else if (FLAGS_checkpoint_one_in > 0 &&
|
|
|
|
FLAGS_clear_column_family_one_in > 0) {
|
|
|
|
fprintf(stdout,
|
|
|
|
"Warn: checkpoint won't be validated since column families may "
|
|
|
|
"be dropped.\n");
|
|
|
|
}
|
|
|
|
}
|
2013-04-08 20:50:44 +02:00
|
|
|
|
2012-10-03 18:58:45 +02:00
|
|
|
// Choose a location for the test database if none given with --db=<path>
|
2013-10-24 16:43:14 +02:00
|
|
|
if (FLAGS_db.empty()) {
|
|
|
|
std::string default_db_path;
|
2013-10-04 06:49:15 +02:00
|
|
|
rocksdb::Env::Default()->GetTestDirectory(&default_db_path);
|
2012-10-03 18:58:45 +02:00
|
|
|
default_db_path += "/dbstress";
|
2013-10-24 16:43:14 +02:00
|
|
|
FLAGS_db = default_db_path;
|
2012-10-03 18:58:45 +02:00
|
|
|
}
|
|
|
|
|
2015-10-14 23:08:50 +02:00
|
|
|
rocksdb_kill_odds = FLAGS_kill_random_test;
|
|
|
|
rocksdb_kill_prefix_blacklist = SplitString(FLAGS_kill_prefix_blacklist);
|
|
|
|
|
2018-06-07 19:34:56 +02:00
|
|
|
std::unique_ptr<rocksdb::StressTest> stress;
|
2018-12-14 07:05:59 +01:00
|
|
|
if (FLAGS_test_atomic_flush) {
|
2018-10-27 00:06:44 +02:00
|
|
|
stress.reset(new rocksdb::AtomicFlushStressTest());
|
|
|
|
} else if (FLAGS_test_batches_snapshots) {
|
2018-06-07 19:34:56 +02:00
|
|
|
stress.reset(new rocksdb::BatchedOpsStressTest());
|
|
|
|
} else {
|
|
|
|
stress.reset(new rocksdb::NonBatchedOpsStressTest());
|
|
|
|
}
|
|
|
|
if (stress->Run()) {
|
2014-04-24 15:22:58 +02:00
|
|
|
return 0;
|
|
|
|
} else {
|
|
|
|
return 1;
|
|
|
|
}
|
2012-10-03 18:58:45 +02:00
|
|
|
}
|
2014-05-09 02:25:13 +02:00
|
|
|
|
|
|
|
#endif // GFLAGS
|