2017-08-31 16:27:14 +00:00
|
|
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
|
|
|
// 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).
|
|
|
|
|
|
|
|
#pragma once
|
|
|
|
|
|
|
|
#include <algorithm>
|
2019-09-20 19:00:55 +00:00
|
|
|
#include <cinttypes>
|
2017-08-31 16:27:14 +00:00
|
|
|
#include <functional>
|
|
|
|
#include <string>
|
|
|
|
#include <thread>
|
|
|
|
|
2019-05-31 18:52:59 +00:00
|
|
|
#include "db/db_impl/db_impl.h"
|
2020-08-24 20:20:32 +00:00
|
|
|
#include "db/db_test_util.h"
|
2020-07-09 21:33:42 +00:00
|
|
|
#include "port/port.h"
|
2017-08-31 16:27:14 +00:00
|
|
|
#include "rocksdb/db.h"
|
|
|
|
#include "rocksdb/options.h"
|
|
|
|
#include "rocksdb/utilities/transaction.h"
|
|
|
|
#include "rocksdb/utilities/transaction_db.h"
|
|
|
|
#include "table/mock_table.h"
|
2019-05-30 18:21:38 +00:00
|
|
|
#include "test_util/sync_point.h"
|
|
|
|
#include "test_util/testharness.h"
|
|
|
|
#include "test_util/testutil.h"
|
|
|
|
#include "test_util/transaction_test_util.h"
|
2019-05-31 00:39:43 +00:00
|
|
|
#include "util/random.h"
|
|
|
|
#include "util/string_util.h"
|
2023-06-22 06:38:54 +00:00
|
|
|
#include "utilities/fault_injection_fs.h"
|
2017-08-31 16:27:14 +00:00
|
|
|
#include "utilities/merge_operators.h"
|
|
|
|
#include "utilities/merge_operators/string_append/stringappend.h"
|
|
|
|
#include "utilities/transactions/pessimistic_transaction_db.h"
|
2019-08-12 19:11:21 +00:00
|
|
|
#include "utilities/transactions/write_unprepared_txn_db.h"
|
2017-08-31 16:27:14 +00:00
|
|
|
|
2020-02-20 20:07:53 +00:00
|
|
|
namespace ROCKSDB_NAMESPACE {
|
2017-08-31 16:27:14 +00:00
|
|
|
|
2018-02-13 00:27:39 +00:00
|
|
|
// Return true if the ith bit is set in combination represented by comb
|
|
|
|
bool IsInCombination(size_t i, size_t comb) { return comb & (size_t(1) << i); }
|
|
|
|
|
2019-05-14 00:43:47 +00:00
|
|
|
enum WriteOrdering : bool { kOrderedWrite, kUnorderedWrite };
|
|
|
|
|
2018-01-30 01:03:23 +00:00
|
|
|
class TransactionTestBase : public ::testing::Test {
|
2017-08-31 16:27:14 +00:00
|
|
|
public:
|
|
|
|
TransactionDB* db;
|
2020-08-24 20:20:32 +00:00
|
|
|
SpecialEnv special_env;
|
2023-06-22 06:38:54 +00:00
|
|
|
std::shared_ptr<FaultInjectionTestFS> fault_fs;
|
|
|
|
std::unique_ptr<Env> env;
|
2017-08-31 16:27:14 +00:00
|
|
|
std::string dbname;
|
|
|
|
Options options;
|
|
|
|
|
|
|
|
TransactionDBOptions txn_db_options;
|
2018-01-30 01:03:23 +00:00
|
|
|
bool use_stackable_db_;
|
2017-08-31 16:27:14 +00:00
|
|
|
|
2018-01-30 01:03:23 +00:00
|
|
|
TransactionTestBase(bool use_stackable_db, bool two_write_queue,
|
2019-05-14 00:43:47 +00:00
|
|
|
TxnDBWritePolicy write_policy,
|
|
|
|
WriteOrdering write_ordering)
|
2020-08-24 20:20:32 +00:00
|
|
|
: db(nullptr),
|
|
|
|
special_env(Env::Default()),
|
|
|
|
env(nullptr),
|
|
|
|
use_stackable_db_(use_stackable_db) {
|
2017-08-31 16:27:14 +00:00
|
|
|
options.create_if_missing = true;
|
|
|
|
options.max_write_buffer_number = 2;
|
|
|
|
options.write_buffer_size = 4 * 1024;
|
2019-05-14 00:43:47 +00:00
|
|
|
options.unordered_write = write_ordering == kUnorderedWrite;
|
2017-08-31 16:27:14 +00:00
|
|
|
options.level0_file_num_compaction_trigger = 2;
|
|
|
|
options.merge_operator = MergeOperators::CreateFromStringId("stringappend");
|
2020-11-06 22:16:07 +00:00
|
|
|
special_env.skip_fsync_ = true;
|
2023-06-22 06:38:54 +00:00
|
|
|
fault_fs.reset(new FaultInjectionTestFS(FileSystem::Default()));
|
|
|
|
env.reset(new CompositeEnvWrapper(&special_env, fault_fs));
|
|
|
|
options.env = env.get();
|
2018-01-30 01:03:23 +00:00
|
|
|
options.two_write_queues = two_write_queue;
|
2018-07-14 00:18:39 +00:00
|
|
|
dbname = test::PerThreadDBPath("transaction_testdb");
|
2017-08-31 16:27:14 +00:00
|
|
|
|
2020-12-10 05:19:55 +00:00
|
|
|
EXPECT_OK(DestroyDB(dbname, options));
|
2017-08-31 16:27:14 +00:00
|
|
|
txn_db_options.transaction_lock_timeout = 0;
|
|
|
|
txn_db_options.default_lock_timeout = 0;
|
2018-01-30 01:03:23 +00:00
|
|
|
txn_db_options.write_policy = write_policy;
|
2018-04-12 18:52:15 +00:00
|
|
|
txn_db_options.rollback_merge_operands = true;
|
2019-08-12 19:11:21 +00:00
|
|
|
// This will stress write unprepared, by forcing write batch flush on every
|
|
|
|
// write.
|
|
|
|
txn_db_options.default_write_batch_flush_threshold = 1;
|
|
|
|
// Write unprepared requires all transactions to be named. This setting
|
|
|
|
// autogenerates the name so that existing tests can pass.
|
|
|
|
txn_db_options.autogenerate_name = true;
|
2017-08-31 16:27:14 +00:00
|
|
|
Status s;
|
2018-01-30 01:03:23 +00:00
|
|
|
if (use_stackable_db == false) {
|
2017-08-31 16:27:14 +00:00
|
|
|
s = TransactionDB::Open(options, txn_db_options, dbname, &db);
|
|
|
|
} else {
|
|
|
|
s = OpenWithStackableDB();
|
|
|
|
}
|
2020-12-10 05:19:55 +00:00
|
|
|
EXPECT_OK(s);
|
2017-08-31 16:27:14 +00:00
|
|
|
}
|
|
|
|
|
2018-01-30 01:03:23 +00:00
|
|
|
~TransactionTestBase() {
|
2017-08-31 16:27:14 +00:00
|
|
|
delete db;
|
2018-05-11 22:08:16 +00:00
|
|
|
db = nullptr;
|
2018-01-04 19:10:03 +00:00
|
|
|
// This is to skip the assert statement in FaultInjectionTestEnv. There
|
|
|
|
// seems to be a bug in btrfs that the makes readdir return recently
|
|
|
|
// unlink-ed files. By using the default fs we simply ignore errors resulted
|
|
|
|
// from attempting to delete such files in DestroyDB.
|
2021-08-18 05:13:21 +00:00
|
|
|
if (getenv("KEEP_DB") == nullptr) {
|
|
|
|
options.env = Env::Default();
|
|
|
|
EXPECT_OK(DestroyDB(dbname, options));
|
|
|
|
} else {
|
|
|
|
fprintf(stdout, "db is still in %s\n", dbname.c_str());
|
|
|
|
}
|
2017-08-31 16:27:14 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
Status ReOpenNoDelete() {
|
|
|
|
delete db;
|
|
|
|
db = nullptr;
|
2023-06-22 06:38:54 +00:00
|
|
|
fault_fs->AssertNoOpenFile();
|
2023-08-09 22:46:44 +00:00
|
|
|
EXPECT_OK(fault_fs->DropUnsyncedFileData());
|
2023-06-22 06:38:54 +00:00
|
|
|
fault_fs->ResetState();
|
2017-08-31 16:27:14 +00:00
|
|
|
Status s;
|
2018-01-30 01:03:23 +00:00
|
|
|
if (use_stackable_db_ == false) {
|
2017-08-31 16:27:14 +00:00
|
|
|
s = TransactionDB::Open(options, txn_db_options, dbname, &db);
|
|
|
|
} else {
|
|
|
|
s = OpenWithStackableDB();
|
|
|
|
}
|
2018-08-21 23:28:41 +00:00
|
|
|
assert(!s.ok() || db != nullptr);
|
2017-08-31 16:27:14 +00:00
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
2018-03-05 18:48:29 +00:00
|
|
|
Status ReOpenNoDelete(std::vector<ColumnFamilyDescriptor>& cfs,
|
|
|
|
std::vector<ColumnFamilyHandle*>* handles) {
|
|
|
|
for (auto h : *handles) {
|
|
|
|
delete h;
|
|
|
|
}
|
|
|
|
handles->clear();
|
|
|
|
delete db;
|
|
|
|
db = nullptr;
|
2023-06-22 06:38:54 +00:00
|
|
|
fault_fs->AssertNoOpenFile();
|
2023-08-09 22:46:44 +00:00
|
|
|
EXPECT_OK(fault_fs->DropUnsyncedFileData());
|
2023-06-22 06:38:54 +00:00
|
|
|
fault_fs->ResetState();
|
2018-03-05 18:48:29 +00:00
|
|
|
Status s;
|
|
|
|
if (use_stackable_db_ == false) {
|
|
|
|
s = TransactionDB::Open(options, txn_db_options, dbname, cfs, handles,
|
|
|
|
&db);
|
|
|
|
} else {
|
|
|
|
s = OpenWithStackableDB(cfs, handles);
|
|
|
|
}
|
2020-01-29 19:39:11 +00:00
|
|
|
assert(!s.ok() || db != nullptr);
|
2018-03-05 18:48:29 +00:00
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
2017-08-31 16:27:14 +00:00
|
|
|
Status ReOpen() {
|
|
|
|
delete db;
|
2018-05-11 22:08:16 +00:00
|
|
|
db = nullptr;
|
2023-08-09 22:46:44 +00:00
|
|
|
EXPECT_OK(DestroyDB(dbname, options));
|
2017-08-31 16:27:14 +00:00
|
|
|
Status s;
|
2018-01-30 01:03:23 +00:00
|
|
|
if (use_stackable_db_ == false) {
|
2017-08-31 16:27:14 +00:00
|
|
|
s = TransactionDB::Open(options, txn_db_options, dbname, &db);
|
|
|
|
} else {
|
|
|
|
s = OpenWithStackableDB();
|
|
|
|
}
|
2018-08-21 23:28:41 +00:00
|
|
|
assert(db != nullptr);
|
2017-08-31 16:27:14 +00:00
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
2018-03-05 18:48:29 +00:00
|
|
|
Status OpenWithStackableDB(std::vector<ColumnFamilyDescriptor>& cfs,
|
|
|
|
std::vector<ColumnFamilyHandle*>* handles) {
|
|
|
|
std::vector<size_t> compaction_enabled_cf_indices;
|
|
|
|
TransactionDB::PrepareWrap(&options, &cfs, &compaction_enabled_cf_indices);
|
2018-05-11 22:08:16 +00:00
|
|
|
DB* root_db = nullptr;
|
2018-03-05 18:48:29 +00:00
|
|
|
Options options_copy(options);
|
|
|
|
const bool use_seq_per_batch =
|
2018-06-01 21:57:55 +00:00
|
|
|
txn_db_options.write_policy == WRITE_PREPARED ||
|
|
|
|
txn_db_options.write_policy == WRITE_UNPREPARED;
|
2018-06-29 01:46:39 +00:00
|
|
|
const bool use_batch_per_txn =
|
|
|
|
txn_db_options.write_policy == WRITE_COMMITTED ||
|
|
|
|
txn_db_options.write_policy == WRITE_PREPARED;
|
2018-03-05 18:48:29 +00:00
|
|
|
Status s = DBImpl::Open(options_copy, dbname, cfs, handles, &root_db,
|
2024-04-19 00:36:33 +00:00
|
|
|
use_seq_per_batch, use_batch_per_txn,
|
|
|
|
/*is_retry=*/false, /*can_retry=*/nullptr);
|
Support user-defined timestamps in write-committed txns (#9629)
Summary:
Pull Request resolved: https://github.com/facebook/rocksdb/pull/9629
Pessimistic transactions use pessimistic concurrency control, i.e. locking. Keys are
locked upon first operation that writes the key or has the intention of writing. For example,
`PessimisticTransaction::Put()`, `PessimisticTransaction::Delete()`,
`PessimisticTransaction::SingleDelete()` will write to or delete a key, while
`PessimisticTransaction::GetForUpdate()` is used by application to indicate
to RocksDB that the transaction has the intention of performing write operation later
in the same transaction.
Pessimistic transactions support two-phase commit (2PC). A transaction can be
`Prepared()`'ed and then `Commit()`. The prepare phase is similar to a promise: once
`Prepare()` succeeds, the transaction has acquired the necessary resources to commit.
The resources include locks, persistence of WAL, etc.
Write-committed transaction is the default pessimistic transaction implementation. In
RocksDB write-committed transaction, `Prepare()` will write data to the WAL as a prepare
section. `Commit()` will write a commit marker to the WAL and then write data to the
memtables. While writing to the memtables, different keys in the transaction's write batch
will be assigned different sequence numbers in ascending order.
Until commit/rollback, the transaction holds locks on the keys so that no other transaction
can write to the same keys. Furthermore, the keys' sequence numbers represent the order
in which they are committed and should be made visible. This is convenient for us to
implement support for user-defined timestamps.
Since column families with and without timestamps can co-exist in the same database,
a transaction may or may not involve timestamps. Based on this observation, we add two
optional members to each `PessimisticTransaction`, `read_timestamp_` and
`commit_timestamp_`. If no key in the transaction's write batch has timestamp, then
setting these two variables do not have any effect. For the rest of this commit, we discuss
only the cases when these two variables are meaningful.
read_timestamp_ is used mainly for validation, and should be set before first call to
`GetForUpdate()`. Otherwise, the latter will return non-ok status. `GetForUpdate()` calls
`TryLock()` that can verify if another transaction has written the same key since
`read_timestamp_` till this call to `GetForUpdate()`. If another transaction has indeed
written the same key, then validation fails, and RocksDB allows this transaction to
refine `read_timestamp_` by increasing it. Note that a transaction can still use `Get()`
with a different timestamp to read, but the result of the read should not be used to
determine data that will be written later.
commit_timestamp_ must be set after finishing writing and before transaction commit.
This applies to both 2PC and non-2PC cases. In the case of 2PC, it's usually set after
prepare phase succeeds.
We currently require that the commit timestamp be chosen after all keys are locked. This
means we disallow the `TransactionDB`-level APIs if user-defined timestamp is used
by the transaction. Specifically, calling `PessimisticTransactionDB::Put()`,
`PessimisticTransactionDB::Delete()`, `PessimisticTransactionDB::SingleDelete()`,
etc. will return non-ok status because they specify timestamps before locking the keys.
Users are also prompted to use the `Transaction` APIs when they receive the non-ok status.
Reviewed By: ltamasi
Differential Revision: D31822445
fbshipit-source-id: b82abf8e230216dc89cc519564a588224a88fd43
2022-03-09 00:20:59 +00:00
|
|
|
auto stackable_db = std::make_unique<StackableDB>(root_db);
|
2018-03-05 18:48:29 +00:00
|
|
|
if (s.ok()) {
|
2018-05-11 22:08:16 +00:00
|
|
|
assert(root_db != nullptr);
|
2022-02-12 04:18:06 +00:00
|
|
|
// If WrapStackableDB() returns non-ok, then stackable_db is already
|
|
|
|
// deleted within WrapStackableDB().
|
Support user-defined timestamps in write-committed txns (#9629)
Summary:
Pull Request resolved: https://github.com/facebook/rocksdb/pull/9629
Pessimistic transactions use pessimistic concurrency control, i.e. locking. Keys are
locked upon first operation that writes the key or has the intention of writing. For example,
`PessimisticTransaction::Put()`, `PessimisticTransaction::Delete()`,
`PessimisticTransaction::SingleDelete()` will write to or delete a key, while
`PessimisticTransaction::GetForUpdate()` is used by application to indicate
to RocksDB that the transaction has the intention of performing write operation later
in the same transaction.
Pessimistic transactions support two-phase commit (2PC). A transaction can be
`Prepared()`'ed and then `Commit()`. The prepare phase is similar to a promise: once
`Prepare()` succeeds, the transaction has acquired the necessary resources to commit.
The resources include locks, persistence of WAL, etc.
Write-committed transaction is the default pessimistic transaction implementation. In
RocksDB write-committed transaction, `Prepare()` will write data to the WAL as a prepare
section. `Commit()` will write a commit marker to the WAL and then write data to the
memtables. While writing to the memtables, different keys in the transaction's write batch
will be assigned different sequence numbers in ascending order.
Until commit/rollback, the transaction holds locks on the keys so that no other transaction
can write to the same keys. Furthermore, the keys' sequence numbers represent the order
in which they are committed and should be made visible. This is convenient for us to
implement support for user-defined timestamps.
Since column families with and without timestamps can co-exist in the same database,
a transaction may or may not involve timestamps. Based on this observation, we add two
optional members to each `PessimisticTransaction`, `read_timestamp_` and
`commit_timestamp_`. If no key in the transaction's write batch has timestamp, then
setting these two variables do not have any effect. For the rest of this commit, we discuss
only the cases when these two variables are meaningful.
read_timestamp_ is used mainly for validation, and should be set before first call to
`GetForUpdate()`. Otherwise, the latter will return non-ok status. `GetForUpdate()` calls
`TryLock()` that can verify if another transaction has written the same key since
`read_timestamp_` till this call to `GetForUpdate()`. If another transaction has indeed
written the same key, then validation fails, and RocksDB allows this transaction to
refine `read_timestamp_` by increasing it. Note that a transaction can still use `Get()`
with a different timestamp to read, but the result of the read should not be used to
determine data that will be written later.
commit_timestamp_ must be set after finishing writing and before transaction commit.
This applies to both 2PC and non-2PC cases. In the case of 2PC, it's usually set after
prepare phase succeeds.
We currently require that the commit timestamp be chosen after all keys are locked. This
means we disallow the `TransactionDB`-level APIs if user-defined timestamp is used
by the transaction. Specifically, calling `PessimisticTransactionDB::Put()`,
`PessimisticTransactionDB::Delete()`, `PessimisticTransactionDB::SingleDelete()`,
etc. will return non-ok status because they specify timestamps before locking the keys.
Users are also prompted to use the `Transaction` APIs when they receive the non-ok status.
Reviewed By: ltamasi
Differential Revision: D31822445
fbshipit-source-id: b82abf8e230216dc89cc519564a588224a88fd43
2022-03-09 00:20:59 +00:00
|
|
|
s = TransactionDB::WrapStackableDB(stackable_db.release(), txn_db_options,
|
2018-05-11 22:08:16 +00:00
|
|
|
compaction_enabled_cf_indices,
|
|
|
|
*handles, &db);
|
|
|
|
}
|
2018-03-05 18:48:29 +00:00
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
2017-08-31 16:27:14 +00:00
|
|
|
Status OpenWithStackableDB() {
|
|
|
|
std::vector<size_t> compaction_enabled_cf_indices;
|
|
|
|
std::vector<ColumnFamilyDescriptor> column_families{ColumnFamilyDescriptor(
|
|
|
|
kDefaultColumnFamilyName, ColumnFamilyOptions(options))};
|
|
|
|
|
|
|
|
TransactionDB::PrepareWrap(&options, &column_families,
|
|
|
|
&compaction_enabled_cf_indices);
|
|
|
|
std::vector<ColumnFamilyHandle*> handles;
|
2018-05-11 22:08:16 +00:00
|
|
|
DB* root_db = nullptr;
|
2017-08-31 16:27:14 +00:00
|
|
|
Options options_copy(options);
|
2017-11-11 01:18:01 +00:00
|
|
|
const bool use_seq_per_batch =
|
2018-06-01 21:57:55 +00:00
|
|
|
txn_db_options.write_policy == WRITE_PREPARED ||
|
|
|
|
txn_db_options.write_policy == WRITE_UNPREPARED;
|
2018-06-29 01:46:39 +00:00
|
|
|
const bool use_batch_per_txn =
|
|
|
|
txn_db_options.write_policy == WRITE_COMMITTED ||
|
|
|
|
txn_db_options.write_policy == WRITE_PREPARED;
|
2017-11-11 01:18:01 +00:00
|
|
|
Status s = DBImpl::Open(options_copy, dbname, column_families, &handles,
|
2024-04-19 00:36:33 +00:00
|
|
|
&root_db, use_seq_per_batch, use_batch_per_txn,
|
|
|
|
/*is_retry=*/false, /*can_retry=*/nullptr);
|
2018-08-21 23:28:41 +00:00
|
|
|
if (!s.ok()) {
|
|
|
|
delete root_db;
|
|
|
|
return s;
|
2017-08-31 16:27:14 +00:00
|
|
|
}
|
2018-08-21 23:28:41 +00:00
|
|
|
StackableDB* stackable_db = new StackableDB(root_db);
|
|
|
|
assert(root_db != nullptr);
|
|
|
|
assert(handles.size() == 1);
|
|
|
|
s = TransactionDB::WrapStackableDB(stackable_db, txn_db_options,
|
|
|
|
compaction_enabled_cf_indices, handles,
|
|
|
|
&db);
|
|
|
|
delete handles[0];
|
2018-05-11 22:08:16 +00:00
|
|
|
if (!s.ok()) {
|
|
|
|
delete stackable_db;
|
|
|
|
}
|
2017-08-31 16:27:14 +00:00
|
|
|
return s;
|
|
|
|
}
|
2017-09-28 23:43:04 +00:00
|
|
|
|
|
|
|
std::atomic<size_t> linked = {0};
|
|
|
|
std::atomic<size_t> exp_seq = {0};
|
|
|
|
std::atomic<size_t> commit_writes = {0};
|
|
|
|
std::atomic<size_t> expected_commits = {0};
|
2019-05-28 21:18:24 +00:00
|
|
|
// Without Prepare, the commit does not write to WAL
|
|
|
|
std::atomic<size_t> with_empty_commits = {0};
|
2022-11-07 20:31:48 +00:00
|
|
|
void TestTxn0(size_t index) {
|
2017-09-28 23:43:04 +00:00
|
|
|
// Test DB's internal txn. It involves no prepare phase nor a commit marker.
|
2022-11-07 20:31:48 +00:00
|
|
|
auto s = db->Put(WriteOptions(), "key" + std::to_string(index), "value");
|
|
|
|
ASSERT_OK(s);
|
2017-09-28 23:43:04 +00:00
|
|
|
if (txn_db_options.write_policy == TxnDBWritePolicy::WRITE_COMMITTED) {
|
|
|
|
// Consume one seq per key
|
|
|
|
exp_seq++;
|
|
|
|
} else {
|
|
|
|
// Consume one seq per batch
|
|
|
|
exp_seq++;
|
2017-12-18 16:03:18 +00:00
|
|
|
if (options.two_write_queues) {
|
2017-10-23 21:20:22 +00:00
|
|
|
// Consume one seq for commit
|
|
|
|
exp_seq++;
|
2017-12-18 16:03:18 +00:00
|
|
|
}
|
2017-09-28 23:43:04 +00:00
|
|
|
}
|
2019-05-28 21:18:24 +00:00
|
|
|
with_empty_commits++;
|
2022-11-07 20:31:48 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void TestTxn1(size_t index) {
|
2017-09-28 23:43:04 +00:00
|
|
|
// Testing directly writing a write batch. Functionality-wise it is
|
|
|
|
// equivalent to commit without prepare.
|
|
|
|
WriteBatch wb;
|
|
|
|
auto istr = std::to_string(index);
|
2018-05-11 22:08:16 +00:00
|
|
|
ASSERT_OK(wb.Put("k1" + istr, "v1"));
|
|
|
|
ASSERT_OK(wb.Put("k2" + istr, "v2"));
|
|
|
|
ASSERT_OK(wb.Put("k3" + istr, "v3"));
|
2022-11-07 20:31:48 +00:00
|
|
|
auto s = db->Write(WriteOptions(), &wb);
|
2017-09-28 23:43:04 +00:00
|
|
|
if (txn_db_options.write_policy == TxnDBWritePolicy::WRITE_COMMITTED) {
|
|
|
|
// Consume one seq per key
|
|
|
|
exp_seq += 3;
|
|
|
|
} else {
|
|
|
|
// Consume one seq per batch
|
|
|
|
exp_seq++;
|
2017-12-18 16:03:18 +00:00
|
|
|
if (options.two_write_queues) {
|
2017-10-23 21:20:22 +00:00
|
|
|
// Consume one seq for commit
|
|
|
|
exp_seq++;
|
2017-12-18 16:03:18 +00:00
|
|
|
}
|
2017-09-28 23:43:04 +00:00
|
|
|
}
|
|
|
|
ASSERT_OK(s);
|
2019-05-28 21:18:24 +00:00
|
|
|
with_empty_commits++;
|
2022-11-07 20:31:48 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void TestTxn2(size_t index) {
|
2017-09-28 23:43:04 +00:00
|
|
|
// Commit without prepare. It should write to DB without a commit marker.
|
2022-11-07 20:31:48 +00:00
|
|
|
Transaction* txn =
|
|
|
|
db->BeginTransaction(WriteOptions(), TransactionOptions());
|
2017-09-28 23:43:04 +00:00
|
|
|
auto istr = std::to_string(index);
|
2018-05-11 22:08:16 +00:00
|
|
|
ASSERT_OK(txn->SetName("xid" + istr));
|
|
|
|
ASSERT_OK(txn->Put(Slice("foo" + istr), Slice("bar")));
|
|
|
|
ASSERT_OK(txn->Put(Slice("foo2" + istr), Slice("bar2")));
|
|
|
|
ASSERT_OK(txn->Put(Slice("foo3" + istr), Slice("bar3")));
|
|
|
|
ASSERT_OK(txn->Put(Slice("foo4" + istr), Slice("bar4")));
|
|
|
|
ASSERT_OK(txn->Commit());
|
2017-09-28 23:43:04 +00:00
|
|
|
if (txn_db_options.write_policy == TxnDBWritePolicy::WRITE_COMMITTED) {
|
|
|
|
// Consume one seq per key
|
|
|
|
exp_seq += 4;
|
2019-08-12 19:11:21 +00:00
|
|
|
} else if (txn_db_options.write_policy ==
|
|
|
|
TxnDBWritePolicy::WRITE_PREPARED) {
|
2017-09-28 23:43:04 +00:00
|
|
|
// Consume one seq per batch
|
|
|
|
exp_seq++;
|
2017-12-18 16:03:18 +00:00
|
|
|
if (options.two_write_queues) {
|
2017-10-23 21:20:22 +00:00
|
|
|
// Consume one seq for commit
|
|
|
|
exp_seq++;
|
2017-12-18 16:03:18 +00:00
|
|
|
}
|
2019-08-12 19:11:21 +00:00
|
|
|
} else {
|
|
|
|
// Flushed after each key, consume one seq per flushed batch
|
|
|
|
exp_seq += 4;
|
|
|
|
// WriteUnprepared implements CommitWithoutPrepareInternal by simply
|
|
|
|
// calling Prepare then Commit. Consume one seq for the prepare.
|
|
|
|
exp_seq++;
|
2017-09-28 23:43:04 +00:00
|
|
|
}
|
|
|
|
delete txn;
|
2019-05-28 21:18:24 +00:00
|
|
|
with_empty_commits++;
|
2022-11-07 20:31:48 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void TestTxn3(size_t index) {
|
2017-09-28 23:43:04 +00:00
|
|
|
// A full 2pc txn that also involves a commit marker.
|
2022-11-07 20:31:48 +00:00
|
|
|
Transaction* txn =
|
|
|
|
db->BeginTransaction(WriteOptions(), TransactionOptions());
|
2017-09-28 23:43:04 +00:00
|
|
|
auto istr = std::to_string(index);
|
2018-05-11 22:08:16 +00:00
|
|
|
ASSERT_OK(txn->SetName("xid" + istr));
|
|
|
|
ASSERT_OK(txn->Put(Slice("foo" + istr), Slice("bar")));
|
|
|
|
ASSERT_OK(txn->Put(Slice("foo2" + istr), Slice("bar2")));
|
|
|
|
ASSERT_OK(txn->Put(Slice("foo3" + istr), Slice("bar3")));
|
|
|
|
ASSERT_OK(txn->Put(Slice("foo4" + istr), Slice("bar4")));
|
|
|
|
ASSERT_OK(txn->Put(Slice("foo5" + istr), Slice("bar5")));
|
2017-09-28 23:43:04 +00:00
|
|
|
expected_commits++;
|
2018-05-11 22:08:16 +00:00
|
|
|
ASSERT_OK(txn->Prepare());
|
2017-09-28 23:43:04 +00:00
|
|
|
commit_writes++;
|
2018-05-11 22:08:16 +00:00
|
|
|
ASSERT_OK(txn->Commit());
|
2017-09-28 23:43:04 +00:00
|
|
|
if (txn_db_options.write_policy == TxnDBWritePolicy::WRITE_COMMITTED) {
|
|
|
|
// Consume one seq per key
|
|
|
|
exp_seq += 5;
|
2019-08-12 19:11:21 +00:00
|
|
|
} else if (txn_db_options.write_policy ==
|
|
|
|
TxnDBWritePolicy::WRITE_PREPARED) {
|
2017-09-28 23:43:04 +00:00
|
|
|
// Consume one seq per batch
|
|
|
|
exp_seq++;
|
|
|
|
// Consume one seq per commit marker
|
|
|
|
exp_seq++;
|
2019-08-12 19:11:21 +00:00
|
|
|
} else {
|
|
|
|
// Flushed after each key, consume one seq per flushed batch
|
|
|
|
exp_seq += 5;
|
|
|
|
// Consume one seq per commit marker
|
|
|
|
exp_seq++;
|
2017-09-28 23:43:04 +00:00
|
|
|
}
|
|
|
|
delete txn;
|
2022-11-07 20:31:48 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void TestTxn4(size_t index) {
|
2017-11-15 16:19:57 +00:00
|
|
|
// A full 2pc txn that also involves a commit marker.
|
2022-11-07 20:31:48 +00:00
|
|
|
Transaction* txn =
|
|
|
|
db->BeginTransaction(WriteOptions(), TransactionOptions());
|
2017-11-15 16:19:57 +00:00
|
|
|
auto istr = std::to_string(index);
|
2018-05-11 22:08:16 +00:00
|
|
|
ASSERT_OK(txn->SetName("xid" + istr));
|
|
|
|
ASSERT_OK(txn->Put(Slice("foo" + istr), Slice("bar")));
|
|
|
|
ASSERT_OK(txn->Put(Slice("foo2" + istr), Slice("bar2")));
|
|
|
|
ASSERT_OK(txn->Put(Slice("foo3" + istr), Slice("bar3")));
|
|
|
|
ASSERT_OK(txn->Put(Slice("foo4" + istr), Slice("bar4")));
|
|
|
|
ASSERT_OK(txn->Put(Slice("foo5" + istr), Slice("bar5")));
|
2017-11-15 16:19:57 +00:00
|
|
|
expected_commits++;
|
2018-05-11 22:08:16 +00:00
|
|
|
ASSERT_OK(txn->Prepare());
|
2017-11-15 16:19:57 +00:00
|
|
|
commit_writes++;
|
2018-05-11 22:08:16 +00:00
|
|
|
ASSERT_OK(txn->Rollback());
|
2017-11-15 16:19:57 +00:00
|
|
|
if (txn_db_options.write_policy == TxnDBWritePolicy::WRITE_COMMITTED) {
|
|
|
|
// No seq is consumed for deleting the txn buffer
|
|
|
|
exp_seq += 0;
|
2019-08-12 19:11:21 +00:00
|
|
|
} else if (txn_db_options.write_policy ==
|
|
|
|
TxnDBWritePolicy::WRITE_PREPARED) {
|
2017-11-15 16:19:57 +00:00
|
|
|
// Consume one seq per batch
|
|
|
|
exp_seq++;
|
|
|
|
// Consume one seq per rollback batch
|
|
|
|
exp_seq++;
|
2017-12-18 16:03:18 +00:00
|
|
|
if (options.two_write_queues) {
|
2017-11-15 16:19:57 +00:00
|
|
|
// Consume one seq for rollback commit
|
|
|
|
exp_seq++;
|
2017-12-18 16:03:18 +00:00
|
|
|
}
|
2019-08-12 19:11:21 +00:00
|
|
|
} else {
|
|
|
|
// Flushed after each key, consume one seq per flushed batch
|
|
|
|
exp_seq += 5;
|
|
|
|
// Consume one seq per rollback batch
|
|
|
|
exp_seq++;
|
|
|
|
if (options.two_write_queues) {
|
|
|
|
// Consume one seq for rollback commit
|
|
|
|
exp_seq++;
|
|
|
|
}
|
2017-11-15 16:19:57 +00:00
|
|
|
}
|
|
|
|
delete txn;
|
2022-11-07 20:31:48 +00:00
|
|
|
}
|
2017-11-11 19:23:43 +00:00
|
|
|
|
|
|
|
// Test that we can change write policy after a clean shutdown (which would
|
|
|
|
// empty the WAL)
|
|
|
|
void CrossCompatibilityTest(TxnDBWritePolicy from_policy,
|
|
|
|
TxnDBWritePolicy to_policy, bool empty_wal) {
|
|
|
|
TransactionOptions txn_options;
|
|
|
|
ReadOptions read_options;
|
|
|
|
WriteOptions write_options;
|
|
|
|
uint32_t index = 0;
|
|
|
|
Random rnd(1103);
|
|
|
|
options.write_buffer_size = 1024; // To create more sst files
|
|
|
|
std::unordered_map<std::string, std::string> committed_kvs;
|
|
|
|
Transaction* txn;
|
|
|
|
|
|
|
|
txn_db_options.write_policy = from_policy;
|
2019-05-14 00:43:47 +00:00
|
|
|
if (txn_db_options.write_policy == WRITE_COMMITTED) {
|
|
|
|
options.unordered_write = false;
|
|
|
|
}
|
2020-12-10 05:19:55 +00:00
|
|
|
ASSERT_OK(ReOpen());
|
2017-11-11 19:23:43 +00:00
|
|
|
|
|
|
|
for (int i = 0; i < 1024; i++) {
|
|
|
|
auto istr = std::to_string(index);
|
|
|
|
auto k = Slice("foo-" + istr).ToString();
|
|
|
|
auto v = Slice("bar-" + istr).ToString();
|
|
|
|
// For test the duplicate keys
|
|
|
|
auto v2 = Slice("bar2-" + istr).ToString();
|
|
|
|
auto type = rnd.Uniform(4);
|
|
|
|
switch (type) {
|
|
|
|
case 0:
|
|
|
|
committed_kvs[k] = v;
|
2018-05-11 22:08:16 +00:00
|
|
|
ASSERT_OK(db->Put(write_options, k, v));
|
2017-11-11 19:23:43 +00:00
|
|
|
committed_kvs[k] = v2;
|
2018-05-11 22:08:16 +00:00
|
|
|
ASSERT_OK(db->Put(write_options, k, v2));
|
2017-11-11 19:23:43 +00:00
|
|
|
break;
|
|
|
|
case 1: {
|
|
|
|
WriteBatch wb;
|
|
|
|
committed_kvs[k] = v;
|
2020-12-10 05:19:55 +00:00
|
|
|
ASSERT_OK(wb.Put(k, v));
|
2018-04-20 22:13:47 +00:00
|
|
|
committed_kvs[k] = v2;
|
2020-12-10 05:19:55 +00:00
|
|
|
ASSERT_OK(wb.Put(k, v2));
|
2018-05-11 22:08:16 +00:00
|
|
|
ASSERT_OK(db->Write(write_options, &wb));
|
|
|
|
|
2017-11-11 19:23:43 +00:00
|
|
|
} break;
|
|
|
|
case 2:
|
|
|
|
case 3:
|
|
|
|
txn = db->BeginTransaction(write_options, txn_options);
|
2018-05-11 22:08:16 +00:00
|
|
|
ASSERT_OK(txn->SetName("xid" + istr));
|
2017-11-11 19:23:43 +00:00
|
|
|
committed_kvs[k] = v;
|
2018-05-11 22:08:16 +00:00
|
|
|
ASSERT_OK(txn->Put(k, v));
|
2018-04-20 22:13:47 +00:00
|
|
|
committed_kvs[k] = v2;
|
2018-05-11 22:08:16 +00:00
|
|
|
ASSERT_OK(txn->Put(k, v2));
|
|
|
|
|
2017-11-11 19:23:43 +00:00
|
|
|
if (type == 3) {
|
2018-05-11 22:08:16 +00:00
|
|
|
ASSERT_OK(txn->Prepare());
|
2017-11-11 19:23:43 +00:00
|
|
|
}
|
2018-05-11 22:08:16 +00:00
|
|
|
ASSERT_OK(txn->Commit());
|
2017-11-11 19:23:43 +00:00
|
|
|
delete txn;
|
|
|
|
break;
|
|
|
|
default:
|
2020-12-10 05:19:55 +00:00
|
|
|
FAIL();
|
2017-11-11 19:23:43 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
index++;
|
|
|
|
} // for i
|
|
|
|
|
|
|
|
txn_db_options.write_policy = to_policy;
|
2019-05-14 00:43:47 +00:00
|
|
|
if (txn_db_options.write_policy == WRITE_COMMITTED) {
|
|
|
|
options.unordered_write = false;
|
|
|
|
}
|
2020-07-03 02:24:25 +00:00
|
|
|
auto db_impl = static_cast_with_check<DBImpl>(db->GetRootDB());
|
2017-11-11 19:23:43 +00:00
|
|
|
// Before upgrade/downgrade the WAL must be emptied
|
|
|
|
if (empty_wal) {
|
2020-12-10 05:19:55 +00:00
|
|
|
ASSERT_OK(db_impl->TEST_FlushMemTable());
|
2017-11-11 19:23:43 +00:00
|
|
|
} else {
|
2020-12-10 05:19:55 +00:00
|
|
|
ASSERT_OK(db_impl->FlushWAL(true));
|
2017-11-11 19:23:43 +00:00
|
|
|
}
|
|
|
|
auto s = ReOpenNoDelete();
|
|
|
|
if (empty_wal) {
|
|
|
|
ASSERT_OK(s);
|
|
|
|
} else {
|
2018-08-09 23:49:45 +00:00
|
|
|
// Test that we can detect the WAL that is produced by an incompatible
|
2017-11-11 19:23:43 +00:00
|
|
|
// WritePolicy and fail fast before mis-interpreting the WAL.
|
|
|
|
ASSERT_TRUE(s.IsNotSupported());
|
|
|
|
return;
|
|
|
|
}
|
2020-07-03 02:24:25 +00:00
|
|
|
db_impl = static_cast_with_check<DBImpl>(db->GetRootDB());
|
2017-11-11 19:23:43 +00:00
|
|
|
// Check that WAL is empty
|
|
|
|
VectorLogPtr log_files;
|
2020-12-10 05:19:55 +00:00
|
|
|
ASSERT_OK(db_impl->GetSortedWalFiles(log_files));
|
2017-11-11 19:23:43 +00:00
|
|
|
ASSERT_EQ(0, log_files.size());
|
|
|
|
|
|
|
|
for (auto& kv : committed_kvs) {
|
|
|
|
std::string value;
|
|
|
|
s = db->Get(read_options, kv.first, &value);
|
|
|
|
if (s.IsNotFound()) {
|
|
|
|
printf("key = %s\n", kv.first.c_str());
|
|
|
|
}
|
|
|
|
ASSERT_OK(s);
|
|
|
|
if (kv.second != value) {
|
|
|
|
printf("key = %s\n", kv.first.c_str());
|
|
|
|
}
|
|
|
|
ASSERT_EQ(kv.second, value);
|
|
|
|
}
|
|
|
|
}
|
2017-08-31 16:27:14 +00:00
|
|
|
};
|
|
|
|
|
2019-05-14 00:43:47 +00:00
|
|
|
class TransactionTest
|
|
|
|
: public TransactionTestBase,
|
|
|
|
virtual public ::testing::WithParamInterface<
|
|
|
|
std::tuple<bool, bool, TxnDBWritePolicy, WriteOrdering>> {
|
2018-01-30 01:03:23 +00:00
|
|
|
public:
|
|
|
|
TransactionTest()
|
|
|
|
: TransactionTestBase(std::get<0>(GetParam()), std::get<1>(GetParam()),
|
2019-05-14 00:43:47 +00:00
|
|
|
std::get<2>(GetParam()), std::get<3>(GetParam())){};
|
2018-01-30 01:03:23 +00:00
|
|
|
};
|
|
|
|
|
2023-09-15 17:25:57 +00:00
|
|
|
class TransactionDBTest : public TransactionTestBase {
|
|
|
|
public:
|
|
|
|
TransactionDBTest()
|
|
|
|
: TransactionTestBase(false, false, WRITE_COMMITTED, kOrderedWrite) {}
|
|
|
|
};
|
|
|
|
|
2018-07-13 20:55:13 +00:00
|
|
|
class TransactionStressTest : public TransactionTest {};
|
|
|
|
|
2019-02-20 00:52:50 +00:00
|
|
|
class MySQLStyleTransactionTest
|
|
|
|
: public TransactionTestBase,
|
|
|
|
virtual public ::testing::WithParamInterface<
|
2019-05-14 00:43:47 +00:00
|
|
|
std::tuple<bool, bool, TxnDBWritePolicy, WriteOrdering, bool>> {
|
2019-02-20 00:52:50 +00:00
|
|
|
public:
|
|
|
|
MySQLStyleTransactionTest()
|
|
|
|
: TransactionTestBase(std::get<0>(GetParam()), std::get<1>(GetParam()),
|
2019-05-14 00:43:47 +00:00
|
|
|
std::get<2>(GetParam()), std::get<3>(GetParam())),
|
|
|
|
with_slow_threads_(std::get<4>(GetParam())) {
|
2019-02-20 00:52:50 +00:00
|
|
|
if (with_slow_threads_ &&
|
|
|
|
(txn_db_options.write_policy == WRITE_PREPARED ||
|
|
|
|
txn_db_options.write_policy == WRITE_UNPREPARED)) {
|
|
|
|
// The corner case with slow threads involves the caches filling
|
|
|
|
// over which would not happen even with artifial delays. To help
|
|
|
|
// such cases to show up we lower the size of the cache-related data
|
|
|
|
// structures.
|
|
|
|
txn_db_options.wp_snapshot_cache_bits = 1;
|
|
|
|
txn_db_options.wp_commit_cache_bits = 10;
|
2019-05-15 20:48:59 +00:00
|
|
|
options.write_buffer_size = 1024;
|
2019-02-20 00:52:50 +00:00
|
|
|
EXPECT_OK(ReOpen());
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
protected:
|
|
|
|
// Also emulate slow threads by addin artiftial delays
|
|
|
|
const bool with_slow_threads_;
|
|
|
|
};
|
2017-08-31 16:27:14 +00:00
|
|
|
|
Support user-defined timestamps in write-committed txns (#9629)
Summary:
Pull Request resolved: https://github.com/facebook/rocksdb/pull/9629
Pessimistic transactions use pessimistic concurrency control, i.e. locking. Keys are
locked upon first operation that writes the key or has the intention of writing. For example,
`PessimisticTransaction::Put()`, `PessimisticTransaction::Delete()`,
`PessimisticTransaction::SingleDelete()` will write to or delete a key, while
`PessimisticTransaction::GetForUpdate()` is used by application to indicate
to RocksDB that the transaction has the intention of performing write operation later
in the same transaction.
Pessimistic transactions support two-phase commit (2PC). A transaction can be
`Prepared()`'ed and then `Commit()`. The prepare phase is similar to a promise: once
`Prepare()` succeeds, the transaction has acquired the necessary resources to commit.
The resources include locks, persistence of WAL, etc.
Write-committed transaction is the default pessimistic transaction implementation. In
RocksDB write-committed transaction, `Prepare()` will write data to the WAL as a prepare
section. `Commit()` will write a commit marker to the WAL and then write data to the
memtables. While writing to the memtables, different keys in the transaction's write batch
will be assigned different sequence numbers in ascending order.
Until commit/rollback, the transaction holds locks on the keys so that no other transaction
can write to the same keys. Furthermore, the keys' sequence numbers represent the order
in which they are committed and should be made visible. This is convenient for us to
implement support for user-defined timestamps.
Since column families with and without timestamps can co-exist in the same database,
a transaction may or may not involve timestamps. Based on this observation, we add two
optional members to each `PessimisticTransaction`, `read_timestamp_` and
`commit_timestamp_`. If no key in the transaction's write batch has timestamp, then
setting these two variables do not have any effect. For the rest of this commit, we discuss
only the cases when these two variables are meaningful.
read_timestamp_ is used mainly for validation, and should be set before first call to
`GetForUpdate()`. Otherwise, the latter will return non-ok status. `GetForUpdate()` calls
`TryLock()` that can verify if another transaction has written the same key since
`read_timestamp_` till this call to `GetForUpdate()`. If another transaction has indeed
written the same key, then validation fails, and RocksDB allows this transaction to
refine `read_timestamp_` by increasing it. Note that a transaction can still use `Get()`
with a different timestamp to read, but the result of the read should not be used to
determine data that will be written later.
commit_timestamp_ must be set after finishing writing and before transaction commit.
This applies to both 2PC and non-2PC cases. In the case of 2PC, it's usually set after
prepare phase succeeds.
We currently require that the commit timestamp be chosen after all keys are locked. This
means we disallow the `TransactionDB`-level APIs if user-defined timestamp is used
by the transaction. Specifically, calling `PessimisticTransactionDB::Put()`,
`PessimisticTransactionDB::Delete()`, `PessimisticTransactionDB::SingleDelete()`,
etc. will return non-ok status because they specify timestamps before locking the keys.
Users are also prompted to use the `Transaction` APIs when they receive the non-ok status.
Reviewed By: ltamasi
Differential Revision: D31822445
fbshipit-source-id: b82abf8e230216dc89cc519564a588224a88fd43
2022-03-09 00:20:59 +00:00
|
|
|
class WriteCommittedTxnWithTsTest
|
|
|
|
: public TransactionTestBase,
|
|
|
|
public ::testing::WithParamInterface<std::tuple<bool, bool, bool>> {
|
|
|
|
public:
|
|
|
|
WriteCommittedTxnWithTsTest()
|
|
|
|
: TransactionTestBase(std::get<0>(GetParam()), std::get<1>(GetParam()),
|
|
|
|
WRITE_COMMITTED, kOrderedWrite) {}
|
|
|
|
~WriteCommittedTxnWithTsTest() override {
|
|
|
|
for (auto* h : handles_) {
|
|
|
|
delete h;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
Status GetFromDb(ReadOptions read_opts, ColumnFamilyHandle* column_family,
|
|
|
|
const Slice& key, TxnTimestamp ts, std::string* value) {
|
|
|
|
std::string ts_buf;
|
|
|
|
PutFixed64(&ts_buf, ts);
|
|
|
|
Slice ts_slc = ts_buf;
|
|
|
|
read_opts.timestamp = &ts_slc;
|
|
|
|
assert(db);
|
|
|
|
return db->Get(read_opts, column_family, key, value);
|
|
|
|
}
|
|
|
|
|
|
|
|
Transaction* NewTxn(WriteOptions write_opts, TransactionOptions txn_opts) {
|
|
|
|
assert(db);
|
|
|
|
auto* txn = db->BeginTransaction(write_opts, txn_opts);
|
|
|
|
assert(txn);
|
|
|
|
const bool enable_indexing = std::get<2>(GetParam());
|
|
|
|
if (enable_indexing) {
|
|
|
|
txn->EnableIndexing();
|
|
|
|
} else {
|
|
|
|
txn->DisableIndexing();
|
|
|
|
}
|
|
|
|
return txn;
|
|
|
|
}
|
|
|
|
|
|
|
|
protected:
|
|
|
|
std::vector<ColumnFamilyHandle*> handles_{};
|
|
|
|
};
|
|
|
|
|
Snapshots with user-specified timestamps (#9879)
Summary:
In RocksDB, keys are associated with (internal) sequence numbers which denote when the keys are written
to the database. Sequence numbers in different RocksDB instances are unrelated, thus not comparable.
It is nice if we can associate sequence numbers with their corresponding actual timestamps. One thing we can
do is to support user-defined timestamp, which allows the applications to specify the format of custom timestamps
and encode a timestamp with each key. More details can be found at https://github.com/facebook/rocksdb/wiki/User-defined-Timestamp-%28Experimental%29.
This PR provides a different but complementary approach. We can associate rocksdb snapshots (defined in
https://github.com/facebook/rocksdb/blob/7.2.fb/include/rocksdb/snapshot.h#L20) with **user-specified** timestamps.
Since a snapshot is essentially an object representing a sequence number, this PR establishes a bi-directional mapping between sequence numbers and timestamps.
In the past, snapshots are usually taken by readers. The current super-version is grabbed, and a `rocksdb::Snapshot`
object is created with the last published sequence number of the super-version. You can see that the reader actually
has no good idea of what timestamp to assign to this snapshot, because by the time the `GetSnapshot()` is called,
an arbitrarily long period of time may have already elapsed since the last write, which is when the last published
sequence number is written.
This observation motivates the creation of "timestamped" snapshots on the write path. Currently, this functionality is
exposed only to the layer of `TransactionDB`. Application can tell RocksDB to create a snapshot when a transaction
commits, effectively associating the last sequence number with a timestamp. It is also assumed that application will
ensure any two snapshots with timestamps should satisfy the following:
```
snapshot1.seq < snapshot2.seq iff. snapshot1.ts < snapshot2.ts
```
If the application can guarantee that when a reader takes a timestamped snapshot, there is no active writes going on
in the database, then we also allow the user to use a new API `TransactionDB::CreateTimestampedSnapshot()` to create
a snapshot with associated timestamp.
Code example
```cpp
// Create a timestamped snapshot when committing transaction.
txn->SetCommitTimestamp(100);
txn->SetSnapshotOnNextOperation();
txn->Commit();
// A wrapper API for convenience
Status Transaction::CommitAndTryCreateSnapshot(
std::shared_ptr<TransactionNotifier> notifier,
TxnTimestamp ts,
std::shared_ptr<const Snapshot>* ret);
// Create a timestamped snapshot if caller guarantees no concurrent writes
std::pair<Status, std::shared_ptr<const Snapshot>> snapshot = txn_db->CreateTimestampedSnapshot(100);
```
The snapshots created in this way will be managed by RocksDB with ref-counting and potentially shared with
other readers. We provide the following APIs for readers to retrieve a snapshot given a timestamp.
```cpp
// Return the timestamped snapshot correponding to given timestamp. If ts is
// kMaxTxnTimestamp, then we return the latest timestamped snapshot if present.
// Othersise, we return the snapshot whose timestamp is equal to `ts`. If no
// such snapshot exists, then we return null.
std::shared_ptr<const Snapshot> TransactionDB::GetTimestampedSnapshot(TxnTimestamp ts) const;
// Return the latest timestamped snapshot if present.
std::shared_ptr<const Snapshot> TransactionDB::GetLatestTimestampedSnapshot() const;
```
We also provide two additional APIs for stats collection and reporting purposes.
```cpp
Status TransactionDB::GetAllTimestampedSnapshots(
std::vector<std::shared_ptr<const Snapshot>>& snapshots) const;
// Return timestamped snapshots whose timestamps fall in [ts_lb, ts_ub) and store them in `snapshots`.
Status TransactionDB::GetTimestampedSnapshots(
TxnTimestamp ts_lb,
TxnTimestamp ts_ub,
std::vector<std::shared_ptr<const Snapshot>>& snapshots) const;
```
To prevent the number of timestamped snapshots from growing infinitely, we provide the following API to release
timestamped snapshots whose timestamps are older than or equal to a given threshold.
```cpp
void TransactionDB::ReleaseTimestampedSnapshotsOlderThan(TxnTimestamp ts);
```
Before shutdown, RocksDB will release all timestamped snapshots.
Comparison with user-defined timestamp and how they can be combined:
User-defined timestamp persists every key with a timestamp, while timestamped snapshots maintain a volatile
mapping between snapshots (sequence numbers) and timestamps.
Different internal keys with the same user key but different timestamps will be treated as different by compaction,
thus a newer version will not hide older versions (with smaller timestamps) unless they are eligible for garbage collection.
In contrast, taking a timestamped snapshot at a certain sequence number and timestamp prevents all the keys visible in
this snapshot from been dropped by compaction. Here, visible means (seq < snapshot and most recent).
The timestamped snapshot supports the semantics of reading at an exact point in time.
Timestamped snapshots can also be used with user-defined timestamp.
Pull Request resolved: https://github.com/facebook/rocksdb/pull/9879
Test Plan:
```
make check
TEST_TMPDIR=/dev/shm make crash_test_with_txn
```
Reviewed By: siying
Differential Revision: D35783919
Pulled By: riversand963
fbshipit-source-id: 586ad905e169189e19d3bfc0cb0177a7239d1bd4
2022-06-10 23:07:03 +00:00
|
|
|
class TimestampedSnapshotWithTsSanityCheck
|
|
|
|
: public TransactionTestBase,
|
|
|
|
public ::testing::WithParamInterface<
|
|
|
|
std::tuple<bool, bool, TxnDBWritePolicy, WriteOrdering>> {
|
|
|
|
public:
|
|
|
|
explicit TimestampedSnapshotWithTsSanityCheck()
|
|
|
|
: TransactionTestBase(std::get<0>(GetParam()), std::get<1>(GetParam()),
|
|
|
|
std::get<2>(GetParam()), std::get<3>(GetParam())) {}
|
|
|
|
~TimestampedSnapshotWithTsSanityCheck() override {
|
|
|
|
for (auto* h : handles_) {
|
|
|
|
delete h;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
protected:
|
|
|
|
std::vector<ColumnFamilyHandle*> handles_{};
|
|
|
|
};
|
|
|
|
|
2020-02-20 20:07:53 +00:00
|
|
|
} // namespace ROCKSDB_NAMESPACE
|