cleanable_test.cc 9.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390
  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 "rocksdb/cleanable.h"
  6. #include <gtest/gtest.h>
  7. #include <functional>
  8. #include "port/port.h"
  9. #include "port/stack_trace.h"
  10. #include "rocksdb/iostats_context.h"
  11. #include "rocksdb/perf_context.h"
  12. #include "test_util/testharness.h"
  13. #include "test_util/testutil.h"
  14. namespace ROCKSDB_NAMESPACE {
  15. class CleanableTest : public testing::Test {};
  16. // Use this to keep track of the cleanups that were actually performed
  17. void Multiplier(void* arg1, void* arg2) {
  18. int* res = reinterpret_cast<int*>(arg1);
  19. int* num = reinterpret_cast<int*>(arg2);
  20. *res *= *num;
  21. }
  22. // the first Cleanup is on stack and the rest on heap, so test with both cases
  23. TEST_F(CleanableTest, Register) {
  24. int n2 = 2, n3 = 3;
  25. int res = 1;
  26. { Cleanable c1; }
  27. // ~Cleanable
  28. ASSERT_EQ(1, res);
  29. res = 1;
  30. {
  31. Cleanable c1;
  32. c1.RegisterCleanup(Multiplier, &res, &n2); // res = 2;
  33. }
  34. // ~Cleanable
  35. ASSERT_EQ(2, res);
  36. res = 1;
  37. {
  38. Cleanable c1;
  39. c1.RegisterCleanup(Multiplier, &res, &n2); // res = 2;
  40. c1.RegisterCleanup(Multiplier, &res, &n3); // res = 2 * 3;
  41. }
  42. // ~Cleanable
  43. ASSERT_EQ(6, res);
  44. // Test the Reset does cleanup
  45. res = 1;
  46. {
  47. Cleanable c1;
  48. c1.RegisterCleanup(Multiplier, &res, &n2); // res = 2;
  49. c1.RegisterCleanup(Multiplier, &res, &n3); // res = 2 * 3;
  50. c1.Reset();
  51. ASSERT_EQ(6, res);
  52. }
  53. // ~Cleanable
  54. ASSERT_EQ(6, res);
  55. // Test Clenable is usable after Reset
  56. res = 1;
  57. {
  58. Cleanable c1;
  59. c1.RegisterCleanup(Multiplier, &res, &n2); // res = 2;
  60. c1.Reset();
  61. ASSERT_EQ(2, res);
  62. c1.RegisterCleanup(Multiplier, &res, &n3); // res = 2 * 3;
  63. }
  64. // ~Cleanable
  65. ASSERT_EQ(6, res);
  66. }
  67. // the first Cleanup is on stack and the rest on heap,
  68. // so test all the combinations of them
  69. TEST_F(CleanableTest, Delegation) {
  70. int n2 = 2, n3 = 3, n5 = 5, n7 = 7;
  71. int res = 1;
  72. {
  73. Cleanable c2;
  74. {
  75. Cleanable c1;
  76. c1.RegisterCleanup(Multiplier, &res, &n2); // res = 2;
  77. c1.DelegateCleanupsTo(&c2);
  78. }
  79. // ~Cleanable
  80. ASSERT_EQ(1, res);
  81. }
  82. // ~Cleanable
  83. ASSERT_EQ(2, res);
  84. res = 1;
  85. {
  86. Cleanable c2;
  87. {
  88. Cleanable c1;
  89. c1.DelegateCleanupsTo(&c2);
  90. }
  91. // ~Cleanable
  92. ASSERT_EQ(1, res);
  93. }
  94. // ~Cleanable
  95. ASSERT_EQ(1, res);
  96. res = 1;
  97. {
  98. Cleanable c2;
  99. {
  100. Cleanable c1;
  101. c1.RegisterCleanup(Multiplier, &res, &n2); // res = 2;
  102. c1.RegisterCleanup(Multiplier, &res, &n3); // res = 2 * 3;
  103. c1.DelegateCleanupsTo(&c2);
  104. }
  105. // ~Cleanable
  106. ASSERT_EQ(1, res);
  107. }
  108. // ~Cleanable
  109. ASSERT_EQ(6, res);
  110. res = 1;
  111. {
  112. Cleanable c2;
  113. c2.RegisterCleanup(Multiplier, &res, &n5); // res = 5;
  114. {
  115. Cleanable c1;
  116. c1.RegisterCleanup(Multiplier, &res, &n2); // res = 2;
  117. c1.RegisterCleanup(Multiplier, &res, &n3); // res = 2 * 3;
  118. c1.DelegateCleanupsTo(&c2); // res = 2 * 3 * 5;
  119. }
  120. // ~Cleanable
  121. ASSERT_EQ(1, res);
  122. }
  123. // ~Cleanable
  124. ASSERT_EQ(30, res);
  125. res = 1;
  126. {
  127. Cleanable c2;
  128. c2.RegisterCleanup(Multiplier, &res, &n5); // res = 5;
  129. c2.RegisterCleanup(Multiplier, &res, &n7); // res = 5 * 7;
  130. {
  131. Cleanable c1;
  132. c1.RegisterCleanup(Multiplier, &res, &n2); // res = 2;
  133. c1.RegisterCleanup(Multiplier, &res, &n3); // res = 2 * 3;
  134. c1.DelegateCleanupsTo(&c2); // res = 2 * 3 * 5 * 7;
  135. }
  136. // ~Cleanable
  137. ASSERT_EQ(1, res);
  138. }
  139. // ~Cleanable
  140. ASSERT_EQ(210, res);
  141. res = 1;
  142. {
  143. Cleanable c2;
  144. c2.RegisterCleanup(Multiplier, &res, &n5); // res = 5;
  145. c2.RegisterCleanup(Multiplier, &res, &n7); // res = 5 * 7;
  146. {
  147. Cleanable c1;
  148. c1.RegisterCleanup(Multiplier, &res, &n2); // res = 2;
  149. c1.DelegateCleanupsTo(&c2); // res = 2 * 5 * 7;
  150. }
  151. // ~Cleanable
  152. ASSERT_EQ(1, res);
  153. }
  154. // ~Cleanable
  155. ASSERT_EQ(70, res);
  156. res = 1;
  157. {
  158. Cleanable c2;
  159. c2.RegisterCleanup(Multiplier, &res, &n5); // res = 5;
  160. c2.RegisterCleanup(Multiplier, &res, &n7); // res = 5 * 7;
  161. {
  162. Cleanable c1;
  163. c1.DelegateCleanupsTo(&c2); // res = 5 * 7;
  164. }
  165. // ~Cleanable
  166. ASSERT_EQ(1, res);
  167. }
  168. // ~Cleanable
  169. ASSERT_EQ(35, res);
  170. res = 1;
  171. {
  172. Cleanable c2;
  173. c2.RegisterCleanup(Multiplier, &res, &n5); // res = 5;
  174. {
  175. Cleanable c1;
  176. c1.DelegateCleanupsTo(&c2); // res = 5;
  177. }
  178. // ~Cleanable
  179. ASSERT_EQ(1, res);
  180. }
  181. // ~Cleanable
  182. ASSERT_EQ(5, res);
  183. }
  184. static void ReleaseStringHeap(void* s, void*) {
  185. delete reinterpret_cast<const std::string*>(s);
  186. }
  187. class PinnableSlice4Test : public PinnableSlice {
  188. public:
  189. void TestStringIsRegistered(std::string* s) {
  190. ASSERT_TRUE(cleanup_.function == ReleaseStringHeap);
  191. ASSERT_EQ(cleanup_.arg1, s);
  192. ASSERT_EQ(cleanup_.arg2, nullptr);
  193. ASSERT_EQ(cleanup_.next, nullptr);
  194. }
  195. };
  196. // Putting the PinnableSlice tests here due to similarity to Cleanable tests
  197. TEST_F(CleanableTest, PinnableSlice) {
  198. int n2 = 2;
  199. int res = 1;
  200. const std::string const_str = "123";
  201. {
  202. res = 1;
  203. PinnableSlice4Test value;
  204. Slice slice(const_str);
  205. value.PinSlice(slice, Multiplier, &res, &n2);
  206. std::string str;
  207. str.assign(value.data(), value.size());
  208. ASSERT_EQ(const_str, str);
  209. }
  210. // ~Cleanable
  211. ASSERT_EQ(2, res);
  212. {
  213. res = 1;
  214. PinnableSlice4Test value;
  215. Slice slice(const_str);
  216. {
  217. Cleanable c1;
  218. c1.RegisterCleanup(Multiplier, &res, &n2); // res = 2;
  219. value.PinSlice(slice, &c1);
  220. }
  221. // ~Cleanable
  222. ASSERT_EQ(1, res); // cleanups must have be delegated to value
  223. std::string str;
  224. str.assign(value.data(), value.size());
  225. ASSERT_EQ(const_str, str);
  226. }
  227. // ~Cleanable
  228. ASSERT_EQ(2, res);
  229. {
  230. PinnableSlice4Test value;
  231. Slice slice(const_str);
  232. value.PinSelf(slice);
  233. std::string str;
  234. str.assign(value.data(), value.size());
  235. ASSERT_EQ(const_str, str);
  236. }
  237. {
  238. PinnableSlice4Test value;
  239. std::string* self_str_ptr = value.GetSelf();
  240. self_str_ptr->assign(const_str);
  241. value.PinSelf();
  242. std::string str;
  243. str.assign(value.data(), value.size());
  244. ASSERT_EQ(const_str, str);
  245. }
  246. }
  247. static void Decrement(void* intptr, void*) { --*static_cast<int*>(intptr); }
  248. // Allow unit testing moved-from data
  249. template <class T>
  250. void MarkInitializedForClangAnalyze(T& t) {
  251. // No net effect, but confuse analyzer. (Published advice doesn't work.)
  252. char* p = reinterpret_cast<char*>(&t);
  253. std::swap(*p, *p);
  254. }
  255. TEST_F(CleanableTest, SharedWrapCleanables) {
  256. int val = 5;
  257. Cleanable c1, c2;
  258. c1.RegisterCleanup(&Decrement, &val, nullptr);
  259. c1.RegisterCleanup(&Decrement, &val, nullptr);
  260. ASSERT_TRUE(c1.HasCleanups());
  261. ASSERT_FALSE(c2.HasCleanups());
  262. SharedCleanablePtr scp1;
  263. ASSERT_EQ(scp1.get(), nullptr);
  264. // No-ops
  265. scp1.RegisterCopyWith(&c2);
  266. scp1.MoveAsCleanupTo(&c2);
  267. ASSERT_FALSE(c2.HasCleanups());
  268. c2.RegisterCleanup(&Decrement, &val, nullptr);
  269. c2.RegisterCleanup(&Decrement, &val, nullptr);
  270. c2.RegisterCleanup(&Decrement, &val, nullptr);
  271. scp1.Allocate();
  272. ASSERT_NE(scp1.get(), nullptr);
  273. ASSERT_FALSE(scp1->HasCleanups());
  274. // Copy ctor (alias scp2 = scp1)
  275. SharedCleanablePtr scp2{scp1};
  276. ASSERT_EQ(scp1.get(), scp2.get());
  277. c1.DelegateCleanupsTo(&*scp1);
  278. ASSERT_TRUE(scp1->HasCleanups());
  279. ASSERT_TRUE(scp2->HasCleanups());
  280. ASSERT_FALSE(c1.HasCleanups());
  281. SharedCleanablePtr scp3;
  282. ASSERT_EQ(scp3.get(), nullptr);
  283. // Copy operator (alias scp3 = scp2 = scp1)
  284. scp3 = scp2;
  285. // Make scp2 point elsewhere
  286. scp2.Allocate();
  287. c2.DelegateCleanupsTo(&*scp2);
  288. ASSERT_EQ(val, 5);
  289. // Move operator, invoke old c2 cleanups
  290. scp2 = std::move(scp1);
  291. ASSERT_EQ(val, 2);
  292. MarkInitializedForClangAnalyze(scp1);
  293. ASSERT_EQ(scp1.get(), nullptr);
  294. // Move ctor
  295. {
  296. SharedCleanablePtr scp4{std::move(scp3)};
  297. MarkInitializedForClangAnalyze(scp3);
  298. ASSERT_EQ(scp3.get(), nullptr);
  299. ASSERT_EQ(scp4.get(), scp2.get());
  300. scp2.Reset();
  301. ASSERT_EQ(val, 2);
  302. // invoke old c1 cleanups
  303. }
  304. ASSERT_EQ(val, 0);
  305. }
  306. TEST_F(CleanableTest, CleanableWrapShared) {
  307. int val = 5;
  308. SharedCleanablePtr scp1, scp2;
  309. scp1.Allocate();
  310. scp1->RegisterCleanup(&Decrement, &val, nullptr);
  311. scp1->RegisterCleanup(&Decrement, &val, nullptr);
  312. scp2.Allocate();
  313. scp2->RegisterCleanup(&Decrement, &val, nullptr);
  314. scp2->RegisterCleanup(&Decrement, &val, nullptr);
  315. scp2->RegisterCleanup(&Decrement, &val, nullptr);
  316. {
  317. Cleanable c1;
  318. {
  319. Cleanable c2, c3;
  320. scp1.RegisterCopyWith(&c1);
  321. scp1.MoveAsCleanupTo(&c2);
  322. ASSERT_TRUE(c1.HasCleanups());
  323. ASSERT_TRUE(c2.HasCleanups());
  324. ASSERT_EQ(scp1.get(), nullptr);
  325. scp2.MoveAsCleanupTo(&c3);
  326. ASSERT_TRUE(c3.HasCleanups());
  327. ASSERT_EQ(scp2.get(), nullptr);
  328. c2.Reset();
  329. ASSERT_FALSE(c2.HasCleanups());
  330. ASSERT_EQ(val, 5);
  331. // invoke cleanups from scp2
  332. }
  333. ASSERT_EQ(val, 2);
  334. // invoke cleanups from scp1
  335. }
  336. ASSERT_EQ(val, 0);
  337. }
  338. } // namespace ROCKSDB_NAMESPACE
  339. int main(int argc, char** argv) {
  340. ROCKSDB_NAMESPACE::port::InstallStackTraceHandler();
  341. ::testing::InitGoogleTest(&argc, argv);
  342. return RUN_ALL_TESTS();
  343. }