534c255c7a
Summary: Major changes in this PR: * Implement CassandraCompactionFilter to remove expired columns and rows (if all column expired) * Move cassandra related code from utilities/merge_operators/cassandra to utilities/cassandra/* * Switch to use shared_ptr<> from uniqu_ptr for Column membership management in RowValue. Since columns do have multiple owners in Merge and GC process, use shared_ptr helps make RowValue immutable. * Rename cassandra_merge_test to cassandra_functional_test and add two TTL compaction related tests there. Closes https://github.com/facebook/rocksdb/pull/2588 Differential Revision: D5430010 Pulled By: wpc fbshipit-source-id: 9566c21e06de17491d486a68c70f52d501f27687
113 lines
3.1 KiB
C++
113 lines
3.1 KiB
C++
// Copyright (c) 2017-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).
|
|
|
|
#include <memory>
|
|
#include "util/testharness.h"
|
|
#include "utilities/cassandra/format.h"
|
|
#include "utilities/cassandra/test_utils.h"
|
|
|
|
namespace rocksdb {
|
|
namespace cassandra {
|
|
|
|
TEST(RowValueMergeTest, Merge) {
|
|
std::vector<RowValue> row_values;
|
|
row_values.push_back(
|
|
CreateTestRowValue({
|
|
std::make_tuple(kTombstone, 0, 5),
|
|
std::make_tuple(kColumn, 1, 8),
|
|
std::make_tuple(kExpiringColumn, 2, 5),
|
|
})
|
|
);
|
|
|
|
row_values.push_back(
|
|
CreateTestRowValue({
|
|
std::make_tuple(kColumn, 0, 2),
|
|
std::make_tuple(kExpiringColumn, 1, 5),
|
|
std::make_tuple(kTombstone, 2, 7),
|
|
std::make_tuple(kExpiringColumn, 7, 17),
|
|
})
|
|
);
|
|
|
|
row_values.push_back(
|
|
CreateTestRowValue({
|
|
std::make_tuple(kExpiringColumn, 0, 6),
|
|
std::make_tuple(kTombstone, 1, 5),
|
|
std::make_tuple(kColumn, 2, 4),
|
|
std::make_tuple(kTombstone, 11, 11),
|
|
})
|
|
);
|
|
|
|
RowValue merged = RowValue::Merge(std::move(row_values));
|
|
EXPECT_FALSE(merged.IsTombstone());
|
|
EXPECT_EQ(merged.columns_.size(), 5);
|
|
VerifyRowValueColumns(merged.columns_, 0, kExpiringColumn, 0, 6);
|
|
VerifyRowValueColumns(merged.columns_, 1, kColumn, 1, 8);
|
|
VerifyRowValueColumns(merged.columns_, 2, kTombstone, 2, 7);
|
|
VerifyRowValueColumns(merged.columns_, 3, kExpiringColumn, 7, 17);
|
|
VerifyRowValueColumns(merged.columns_, 4, kTombstone, 11, 11);
|
|
}
|
|
|
|
TEST(RowValueMergeTest, MergeWithRowTombstone) {
|
|
std::vector<RowValue> row_values;
|
|
|
|
// A row tombstone.
|
|
row_values.push_back(
|
|
CreateRowTombstone(11)
|
|
);
|
|
|
|
// This row's timestamp is smaller than tombstone.
|
|
row_values.push_back(
|
|
CreateTestRowValue({
|
|
std::make_tuple(kColumn, 0, 5),
|
|
std::make_tuple(kColumn, 1, 6),
|
|
})
|
|
);
|
|
|
|
// Some of the column's row is smaller, some is larger.
|
|
row_values.push_back(
|
|
CreateTestRowValue({
|
|
std::make_tuple(kColumn, 2, 10),
|
|
std::make_tuple(kColumn, 3, 12),
|
|
})
|
|
);
|
|
|
|
// All of the column's rows are larger than tombstone.
|
|
row_values.push_back(
|
|
CreateTestRowValue({
|
|
std::make_tuple(kColumn, 4, 13),
|
|
std::make_tuple(kColumn, 5, 14),
|
|
})
|
|
);
|
|
|
|
RowValue merged = RowValue::Merge(std::move(row_values));
|
|
EXPECT_FALSE(merged.IsTombstone());
|
|
EXPECT_EQ(merged.columns_.size(), 3);
|
|
VerifyRowValueColumns(merged.columns_, 0, kColumn, 3, 12);
|
|
VerifyRowValueColumns(merged.columns_, 1, kColumn, 4, 13);
|
|
VerifyRowValueColumns(merged.columns_, 2, kColumn, 5, 14);
|
|
|
|
// If the tombstone's timestamp is the latest, then it returns a
|
|
// row tombstone.
|
|
row_values.push_back(
|
|
CreateRowTombstone(15)
|
|
);
|
|
|
|
row_values.push_back(
|
|
CreateRowTombstone(17)
|
|
);
|
|
|
|
merged = RowValue::Merge(std::move(row_values));
|
|
EXPECT_TRUE(merged.IsTombstone());
|
|
EXPECT_EQ(merged.LastModifiedTime(), 17);
|
|
}
|
|
|
|
} // namespace cassandra
|
|
} // namespace rocksdb
|
|
|
|
int main(int argc, char** argv) {
|
|
::testing::InitGoogleTest(&argc, argv);
|
|
return RUN_ALL_TESTS();
|
|
}
|