wal_edit_test.cc 6.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213
  1. // Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
  2. // This source code is licensed under both the GPLv2 (found in the
  3. // COPYING file in the root directory) and Apache 2.0 License
  4. // (found in the LICENSE.Apache file in the root directory).
  5. #include "db/wal_edit.h"
  6. #include "db/db_test_util.h"
  7. #include "file/file_util.h"
  8. #include "port/port.h"
  9. #include "port/stack_trace.h"
  10. #include "test_util/testharness.h"
  11. #include "test_util/testutil.h"
  12. namespace ROCKSDB_NAMESPACE {
  13. TEST(WalSet, AddDeleteReset) {
  14. WalSet wals;
  15. ASSERT_TRUE(wals.GetWals().empty());
  16. // Create WAL 1 - 10.
  17. for (WalNumber log_number = 1; log_number <= 10; log_number++) {
  18. wals.AddWal(WalAddition(log_number));
  19. }
  20. ASSERT_EQ(wals.GetWals().size(), 10);
  21. // Delete WAL 1 - 5.
  22. wals.DeleteWalsBefore(6);
  23. ASSERT_EQ(wals.GetWals().size(), 5);
  24. WalNumber expected_log_number = 6;
  25. for (auto it : wals.GetWals()) {
  26. WalNumber log_number = it.first;
  27. ASSERT_EQ(log_number, expected_log_number++);
  28. }
  29. wals.Reset();
  30. ASSERT_TRUE(wals.GetWals().empty());
  31. }
  32. TEST(WalSet, Overwrite) {
  33. constexpr WalNumber kNumber = 100;
  34. constexpr uint64_t kBytes = 200;
  35. WalSet wals;
  36. wals.AddWal(WalAddition(kNumber));
  37. ASSERT_FALSE(wals.GetWals().at(kNumber).HasSyncedSize());
  38. wals.AddWal(WalAddition(kNumber, WalMetadata(kBytes)));
  39. ASSERT_TRUE(wals.GetWals().at(kNumber).HasSyncedSize());
  40. ASSERT_EQ(wals.GetWals().at(kNumber).GetSyncedSizeInBytes(), kBytes);
  41. }
  42. TEST(WalSet, SmallerSyncedSize) {
  43. constexpr WalNumber kNumber = 100;
  44. constexpr uint64_t kBytes = 100;
  45. WalSet wals;
  46. ASSERT_OK(wals.AddWal(WalAddition(kNumber, WalMetadata(kBytes))));
  47. const auto wals1 = wals.GetWals();
  48. Status s = wals.AddWal(WalAddition(kNumber, WalMetadata(0)));
  49. const auto wals2 = wals.GetWals();
  50. ASSERT_OK(s);
  51. ASSERT_EQ(wals1, wals2);
  52. }
  53. TEST(WalSet, CreateTwice) {
  54. constexpr WalNumber kNumber = 100;
  55. WalSet wals;
  56. ASSERT_OK(wals.AddWal(WalAddition(kNumber)));
  57. Status s = wals.AddWal(WalAddition(kNumber));
  58. ASSERT_TRUE(s.IsCorruption());
  59. ASSERT_TRUE(s.ToString().find("WAL 100 is created more than once") !=
  60. std::string::npos);
  61. }
  62. TEST(WalSet, DeleteAllWals) {
  63. constexpr WalNumber kMaxWalNumber = 10;
  64. WalSet wals;
  65. for (WalNumber i = 1; i <= kMaxWalNumber; i++) {
  66. wals.AddWal(WalAddition(i));
  67. }
  68. ASSERT_OK(wals.DeleteWalsBefore(kMaxWalNumber + 1));
  69. }
  70. TEST(WalSet, AddObsoleteWal) {
  71. constexpr WalNumber kNumber = 100;
  72. WalSet wals;
  73. ASSERT_OK(wals.DeleteWalsBefore(kNumber + 1));
  74. ASSERT_OK(wals.AddWal(WalAddition(kNumber)));
  75. ASSERT_TRUE(wals.GetWals().empty());
  76. }
  77. TEST(WalSet, MinWalNumberToKeep) {
  78. constexpr WalNumber kNumber = 100;
  79. WalSet wals;
  80. ASSERT_EQ(wals.GetMinWalNumberToKeep(), 0);
  81. ASSERT_OK(wals.DeleteWalsBefore(kNumber));
  82. ASSERT_EQ(wals.GetMinWalNumberToKeep(), kNumber);
  83. ASSERT_OK(wals.DeleteWalsBefore(kNumber - 1));
  84. ASSERT_EQ(wals.GetMinWalNumberToKeep(), kNumber);
  85. ASSERT_OK(wals.DeleteWalsBefore(kNumber + 1));
  86. ASSERT_EQ(wals.GetMinWalNumberToKeep(), kNumber + 1);
  87. }
  88. class WalSetTest : public DBTestBase {
  89. public:
  90. WalSetTest() : DBTestBase("WalSetTest", /* env_do_fsync */ true) {}
  91. void SetUp() override {
  92. test_dir_ = test::PerThreadDBPath("wal_set_test");
  93. ASSERT_OK(env_->CreateDir(test_dir_));
  94. }
  95. void TearDown() override {
  96. EXPECT_OK(DestroyDir(env_, test_dir_));
  97. logs_on_disk_.clear();
  98. wals_.Reset();
  99. }
  100. void CreateWalOnDisk(WalNumber number, const std::string& fname,
  101. uint64_t size_bytes) {
  102. std::unique_ptr<WritableFile> f;
  103. std::string fpath = Path(fname);
  104. ASSERT_OK(env_->NewWritableFile(fpath, &f, EnvOptions()));
  105. std::string content(size_bytes, '0');
  106. ASSERT_OK(f->Append(content));
  107. ASSERT_OK(f->Close());
  108. logs_on_disk_[number] = fpath;
  109. }
  110. void AddWalToWalSet(WalNumber number, uint64_t size_bytes) {
  111. // Create WAL.
  112. ASSERT_OK(wals_.AddWal(WalAddition(number)));
  113. // Close WAL.
  114. WalMetadata wal(size_bytes);
  115. ASSERT_OK(wals_.AddWal(WalAddition(number, wal)));
  116. }
  117. Status CheckWals() const { return wals_.CheckWals(env_, logs_on_disk_); }
  118. private:
  119. std::string test_dir_;
  120. std::unordered_map<WalNumber, std::string> logs_on_disk_;
  121. WalSet wals_;
  122. std::string Path(const std::string& fname) { return test_dir_ + "/" + fname; }
  123. };
  124. TEST_F(WalSetTest, CheckEmptyWals) { ASSERT_OK(CheckWals()); }
  125. TEST_F(WalSetTest, CheckWals) {
  126. for (int number = 1; number < 10; number++) {
  127. uint64_t size = rand() % 100;
  128. std::stringstream ss;
  129. ss << "log" << number;
  130. std::string fname = ss.str();
  131. CreateWalOnDisk(number, fname, size);
  132. // log 0 - 5 are obsolete.
  133. if (number > 5) {
  134. AddWalToWalSet(number, size);
  135. }
  136. }
  137. ASSERT_OK(CheckWals());
  138. }
  139. TEST_F(WalSetTest, CheckMissingWals) {
  140. for (int number = 1; number < 10; number++) {
  141. uint64_t size = rand() % 100;
  142. AddWalToWalSet(number, size);
  143. // logs with even number are missing from disk.
  144. if (number % 2) {
  145. std::stringstream ss;
  146. ss << "log" << number;
  147. std::string fname = ss.str();
  148. CreateWalOnDisk(number, fname, size);
  149. }
  150. }
  151. Status s = CheckWals();
  152. ASSERT_TRUE(s.IsCorruption()) << s.ToString();
  153. // The first log with even number is missing.
  154. std::stringstream expected_err;
  155. expected_err << "Missing WAL with log number: " << 2;
  156. ASSERT_TRUE(s.ToString().find(expected_err.str()) != std::string::npos)
  157. << s.ToString();
  158. }
  159. TEST_F(WalSetTest, CheckWalsWithShrinkedSize) {
  160. for (int number = 1; number < 10; number++) {
  161. uint64_t size = rand() % 100 + 1;
  162. AddWalToWalSet(number, size);
  163. // logs with even number have shrinked size.
  164. std::stringstream ss;
  165. ss << "log" << number;
  166. std::string fname = ss.str();
  167. CreateWalOnDisk(number, fname, (number % 2) ? size : size - 1);
  168. }
  169. Status s = CheckWals();
  170. ASSERT_TRUE(s.IsCorruption()) << s.ToString();
  171. // The first log with even number has wrong size.
  172. std::stringstream expected_err;
  173. expected_err << "Size mismatch: WAL (log number: " << 2 << ")";
  174. ASSERT_TRUE(s.ToString().find(expected_err.str()) != std::string::npos)
  175. << s.ToString();
  176. }
  177. } // namespace ROCKSDB_NAMESPACE
  178. int main(int argc, char** argv) {
  179. ROCKSDB_NAMESPACE::port::InstallStackTraceHandler();
  180. ::testing::InitGoogleTest(&argc, argv);
  181. return RUN_ALL_TESTS();
  182. }