2 * Copyright 2016 Facebook, Inc.
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
8 * http://www.apache.org/licenses/LICENSE-2.0
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
19 #include <gtest/gtest.h>
21 #include <folly/Foreach.h>
22 #include <folly/Random.h>
23 #include <folly/Synchronized.h>
24 #include <glog/logging.h>
26 #include <condition_variable>
34 namespace sync_tests {
36 inline std::mt19937& getRNG() {
37 static const auto seed = folly::randomNumberSeed();
38 static std::mt19937 rng(seed);
42 void randomSleep(std::chrono::milliseconds min, std::chrono::milliseconds max) {
43 std::uniform_int_distribution<> range(min.count(), max.count());
44 std::chrono::milliseconds duration(range(getRNG()));
45 std::this_thread::sleep_for(duration);
49 * Run a functon simultaneously in a number of different threads.
51 * The function will be passed the index number of the thread it is running in.
52 * This function makes an attempt to synchronize the start of the threads as
53 * best as possible. It waits for all threads to be allocated and started
54 * before invoking the function.
56 template <class Function>
57 void runParallel(size_t numThreads, const Function& function) {
58 std::vector<std::thread> threads;
59 threads.reserve(numThreads);
61 // Variables used to synchronize all threads to try and start them
62 // as close to the same time as possible
63 folly::Synchronized<size_t, std::mutex> threadsReady(0);
64 std::condition_variable readyCV;
65 folly::Synchronized<bool, std::mutex> go(false);
66 std::condition_variable goCV;
68 auto worker = [&](size_t threadIndex) {
69 // Signal that we are ready
70 ++(*threadsReady.lock());
73 // Wait until we are given the signal to start
74 // The purpose of this is to try and make sure all threads start
75 // as close to the same time as possible.
77 auto lockedGo = go.lock();
78 goCV.wait(lockedGo.getUniqueLock(), [&] { return *lockedGo; });
81 function(threadIndex);
84 // Start all of the threads
85 for (size_t threadIndex = 0; threadIndex < numThreads; ++threadIndex) {
86 threads.emplace_back([threadIndex, &worker]() { worker(threadIndex); });
89 // Wait for all threads to become ready
91 auto readyLocked = threadsReady.lock();
92 readyCV.wait(readyLocked.getUniqueLock(), [&] {
93 return *readyLocked == numThreads;
96 // Now signal the threads that they can go
100 // Wait for all threads to finish
101 for (auto& thread : threads) {
106 // testBasic() version for shared lock types
107 template <class Mutex>
108 typename std::enable_if<folly::LockTraits<Mutex>::is_shared>::type
110 folly::Synchronized<std::vector<int>, Mutex> obj;
111 const auto& constObj = obj;
113 obj.wlock()->resize(1000);
115 folly::Synchronized<std::vector<int>, Mutex> obj2{*obj.wlock()};
116 EXPECT_EQ(1000, obj2.rlock()->size());
119 auto lockedObj = obj.wlock();
120 lockedObj->push_back(10);
121 EXPECT_EQ(1001, lockedObj->size());
122 EXPECT_EQ(10, lockedObj->back());
123 EXPECT_EQ(1000, obj2.wlock()->size());
124 EXPECT_EQ(1000, obj2.rlock()->size());
127 auto unlocker = lockedObj.scopedUnlock();
128 EXPECT_EQ(1001, obj.wlock()->size());
133 auto lockedObj = obj.rlock();
134 EXPECT_EQ(1001, lockedObj->size());
135 EXPECT_EQ(1001, obj.rlock()->size());
137 auto unlocker = lockedObj.scopedUnlock();
138 EXPECT_EQ(1001, obj.wlock()->size());
142 obj.wlock()->front() = 2;
145 // contextualLock() on a const reference should grab a shared lock
146 auto lockedObj = constObj.contextualLock();
147 EXPECT_EQ(2, lockedObj->front());
148 EXPECT_EQ(2, constObj.rlock()->front());
149 EXPECT_EQ(2, obj.rlock()->front());
152 EXPECT_EQ(1001, obj.rlock()->size());
153 EXPECT_EQ(2, obj.rlock()->front());
154 EXPECT_EQ(10, obj.rlock()->back());
155 EXPECT_EQ(1000, obj2.rlock()->size());
158 // testBasic() version for non-shared lock types
159 template <class Mutex>
160 typename std::enable_if<!folly::LockTraits<Mutex>::is_shared>::type
162 folly::Synchronized<std::vector<int>, Mutex> obj;
163 const auto& constObj = obj;
165 obj.lock()->resize(1000);
167 folly::Synchronized<std::vector<int>, Mutex> obj2{*obj.lock()};
168 EXPECT_EQ(1000, obj2.lock()->size());
171 auto lockedObj = obj.lock();
172 lockedObj->push_back(10);
173 EXPECT_EQ(1001, lockedObj->size());
174 EXPECT_EQ(10, lockedObj->back());
175 EXPECT_EQ(1000, obj2.lock()->size());
178 auto unlocker = lockedObj.scopedUnlock();
179 EXPECT_EQ(1001, obj.lock()->size());
183 auto lockedObj = constObj.lock();
184 EXPECT_EQ(1001, lockedObj->size());
185 EXPECT_EQ(10, lockedObj->back());
186 EXPECT_EQ(1000, obj2.lock()->size());
189 obj.lock()->front() = 2;
191 EXPECT_EQ(1001, obj.lock()->size());
192 EXPECT_EQ(2, obj.lock()->front());
193 EXPECT_EQ(2, obj.contextualLock()->front());
194 EXPECT_EQ(10, obj.lock()->back());
195 EXPECT_EQ(1000, obj2.lock()->size());
198 template <class Mutex>
200 testBasicImpl<Mutex>();
203 // testWithLock() version for shared lock types
204 template <class Mutex>
205 typename std::enable_if<folly::LockTraits<Mutex>::is_shared>::type
207 folly::Synchronized<std::vector<int>, Mutex> obj;
208 const auto& constObj = obj;
210 // Test withWLock() and withRLock()
211 obj.withWLock([](std::vector<int>& lockedObj) {
212 lockedObj.resize(1000);
213 lockedObj.push_back(10);
214 lockedObj.push_back(11);
216 obj.withWLock([](const std::vector<int>& lockedObj) {
217 EXPECT_EQ(1002, lockedObj.size());
219 constObj.withWLock([](const std::vector<int>& lockedObj) {
220 EXPECT_EQ(1002, lockedObj.size());
221 EXPECT_EQ(11, lockedObj.back());
223 obj.withRLock([](const std::vector<int>& lockedObj) {
224 EXPECT_EQ(1002, lockedObj.size());
225 EXPECT_EQ(11, lockedObj.back());
227 constObj.withRLock([](const std::vector<int>& lockedObj) {
228 EXPECT_EQ(1002, lockedObj.size());
231 #if __cpp_generic_lambdas >= 201304
232 obj.withWLock([](auto& lockedObj) { lockedObj.push_back(12); });
234 [](const auto& lockedObj) { EXPECT_EQ(1003, lockedObj.size()); });
235 constObj.withWLock([](const auto& lockedObj) {
236 EXPECT_EQ(1003, lockedObj.size());
237 EXPECT_EQ(12, lockedObj.back());
239 obj.withRLock([](const auto& lockedObj) {
240 EXPECT_EQ(1003, lockedObj.size());
241 EXPECT_EQ(12, lockedObj.back());
244 [](const auto& lockedObj) { EXPECT_EQ(1003, lockedObj.size()); });
245 obj.withWLock([](auto& lockedObj) { lockedObj.pop_back(); });
248 // Test withWLockPtr() and withRLockPtr()
249 using SynchType = folly::Synchronized<std::vector<int>, Mutex>;
250 #if __cpp_generic_lambdas >= 201304
251 obj.withWLockPtr([](auto&& lockedObj) { lockedObj->push_back(13); });
252 obj.withRLockPtr([](auto&& lockedObj) {
253 EXPECT_EQ(1003, lockedObj->size());
254 EXPECT_EQ(13, lockedObj->back());
256 constObj.withRLockPtr([](auto&& lockedObj) {
257 EXPECT_EQ(1003, lockedObj->size());
258 EXPECT_EQ(13, lockedObj->back());
260 obj.withWLockPtr([&](auto&& lockedObj) {
261 lockedObj->push_back(14);
263 auto unlocker = lockedObj.scopedUnlock();
264 obj.wlock()->push_back(15);
266 EXPECT_EQ(15, lockedObj->back());
268 constObj.withWLockPtr([](auto&& lockedObj) {
269 EXPECT_EQ(1005, lockedObj->size());
270 EXPECT_EQ(15, lockedObj->back());
273 obj.withWLockPtr([](typename SynchType::LockedPtr&& lockedObj) {
274 lockedObj->push_back(13);
275 lockedObj->push_back(14);
276 lockedObj->push_back(15);
280 obj.withWLockPtr([](typename SynchType::LockedPtr&& lockedObj) {
281 lockedObj->push_back(16);
282 EXPECT_EQ(1006, lockedObj->size());
284 constObj.withWLockPtr([](typename SynchType::ConstWLockedPtr&& lockedObj) {
285 EXPECT_EQ(1006, lockedObj->size());
286 EXPECT_EQ(16, lockedObj->back());
288 obj.withRLockPtr([](typename SynchType::ConstLockedPtr&& lockedObj) {
289 EXPECT_EQ(1006, lockedObj->size());
290 EXPECT_EQ(16, lockedObj->back());
292 constObj.withRLockPtr([](typename SynchType::ConstLockedPtr&& lockedObj) {
293 EXPECT_EQ(1006, lockedObj->size());
294 EXPECT_EQ(16, lockedObj->back());
298 // testWithLock() version for non-shared lock types
299 template <class Mutex>
300 typename std::enable_if<!folly::LockTraits<Mutex>::is_shared>::type
302 folly::Synchronized<std::vector<int>, Mutex> obj;
305 obj.withLock([](std::vector<int>& lockedObj) {
306 lockedObj.resize(1000);
307 lockedObj.push_back(10);
308 lockedObj.push_back(11);
310 obj.withLock([](const std::vector<int>& lockedObj) {
311 EXPECT_EQ(1002, lockedObj.size());
314 #if __cpp_generic_lambdas >= 201304
315 obj.withLock([](auto& lockedObj) { lockedObj.push_back(12); });
317 [](const auto& lockedObj) { EXPECT_EQ(1003, lockedObj.size()); });
318 obj.withLock([](auto& lockedObj) { lockedObj.pop_back(); });
321 // Test withLockPtr()
322 using SynchType = folly::Synchronized<std::vector<int>, Mutex>;
323 #if __cpp_generic_lambdas >= 201304
324 obj.withLockPtr([](auto&& lockedObj) { lockedObj->push_back(13); });
325 obj.withLockPtr([](auto&& lockedObj) {
326 EXPECT_EQ(1003, lockedObj->size());
327 EXPECT_EQ(13, lockedObj->back());
329 obj.withLockPtr([&](auto&& lockedObj) {
330 lockedObj->push_back(14);
332 auto unlocker = lockedObj.scopedUnlock();
333 obj.lock()->push_back(15);
335 EXPECT_EQ(1005, lockedObj->size());
336 EXPECT_EQ(15, lockedObj->back());
339 obj.withLockPtr([](typename SynchType::LockedPtr&& lockedObj) {
340 lockedObj->push_back(13);
341 lockedObj->push_back(14);
342 lockedObj->push_back(15);
346 obj.withLockPtr([](typename SynchType::LockedPtr&& lockedObj) {
347 lockedObj->push_back(16);
348 EXPECT_EQ(1006, lockedObj->size());
350 const auto& constObj = obj;
351 constObj.withLockPtr([](typename SynchType::ConstLockedPtr&& lockedObj) {
352 EXPECT_EQ(1006, lockedObj->size());
353 EXPECT_EQ(16, lockedObj->back());
357 // Testing the deprecated SYNCHRONIZED and SYNCHRONIZED_CONST APIs
358 template <class Mutex>
359 void testDeprecated() {
360 folly::Synchronized<std::vector<int>, Mutex> obj;
365 EXPECT_EQ(1000, obj2->size());
369 EXPECT_EQ(1001, obj.size());
370 EXPECT_EQ(10, obj.back());
371 EXPECT_EQ(1000, obj2->size());
373 UNSYNCHRONIZED(obj) {
374 EXPECT_EQ(1001, obj->size());
378 SYNCHRONIZED_CONST (obj) {
379 EXPECT_EQ(1001, obj.size());
380 UNSYNCHRONIZED(obj) {
381 EXPECT_EQ(1001, obj->size());
385 SYNCHRONIZED (lockedObj, *&obj) {
386 lockedObj.front() = 2;
389 EXPECT_EQ(1001, obj->size());
390 EXPECT_EQ(10, obj->back());
391 EXPECT_EQ(1000, obj2->size());
393 EXPECT_EQ(FB_ARG_2_OR_1(1, 2), 2);
394 EXPECT_EQ(FB_ARG_2_OR_1(1), 1);
397 template <class Mutex> void testConcurrency() {
398 folly::Synchronized<std::vector<int>, Mutex> v;
399 static const size_t numThreads = 100;
400 // Note: I initially tried using itersPerThread = 1000,
401 // which works fine for most lock types, but std::shared_timed_mutex
402 // appears to be extraordinarily slow. It could take around 30 seconds
403 // to run this test with 1000 iterations per thread using shared_timed_mutex.
404 static const size_t itersPerThread = 100;
406 auto pushNumbers = [&](size_t threadIdx) {
408 for (size_t n = 0; n < itersPerThread; ++n) {
409 v.contextualLock()->push_back((itersPerThread * threadIdx) + n);
413 runParallel(numThreads, pushNumbers);
415 std::vector<int> result;
418 EXPECT_EQ(numThreads * itersPerThread, result.size());
419 sort(result.begin(), result.end());
421 for (size_t i = 0; i < itersPerThread * numThreads; ++i) {
422 EXPECT_EQ(i, result[i]);
426 template <class Mutex>
427 void testAcquireLocked() {
428 folly::Synchronized<std::vector<int>, Mutex> v;
429 folly::Synchronized<std::map<int, int>, Mutex> m;
431 auto dualLockWorker = [&](size_t threadIdx) {
432 // Note: this will be less awkward with C++ 17's structured
433 // binding functionality, which will make it easier to use the returned
436 auto ret = acquireLocked(v, m);
437 std::get<0>(ret)->push_back(threadIdx);
438 (*std::get<1>(ret))[threadIdx] = threadIdx + 1;
440 auto ret = acquireLocked(m, v);
441 std::get<1>(ret)->push_back(threadIdx);
442 (*std::get<0>(ret))[threadIdx] = threadIdx + 1;
445 static const size_t numThreads = 100;
446 runParallel(numThreads, dualLockWorker);
448 std::vector<int> result;
451 EXPECT_EQ(numThreads, result.size());
452 sort(result.begin(), result.end());
454 for (size_t i = 0; i < numThreads; ++i) {
455 EXPECT_EQ(i, result[i]);
459 template <class Mutex>
460 void testAcquireLockedWithConst() {
461 folly::Synchronized<std::vector<int>, Mutex> v;
462 folly::Synchronized<std::map<int, int>, Mutex> m;
464 auto dualLockWorker = [&](size_t threadIdx) {
467 auto ret = acquireLocked(v, cm);
468 (void)std::get<1>(ret)->size();
469 std::get<0>(ret)->push_back(threadIdx);
471 auto ret = acquireLocked(cm, v);
472 (void)std::get<0>(ret)->size();
473 std::get<1>(ret)->push_back(threadIdx);
476 static const size_t numThreads = 100;
477 runParallel(numThreads, dualLockWorker);
479 std::vector<int> result;
482 EXPECT_EQ(numThreads, result.size());
483 sort(result.begin(), result.end());
485 for (size_t i = 0; i < numThreads; ++i) {
486 EXPECT_EQ(i, result[i]);
490 // Testing the deprecated SYNCHRONIZED_DUAL API
491 template <class Mutex> void testDualLocking() {
492 folly::Synchronized<std::vector<int>, Mutex> v;
493 folly::Synchronized<std::map<int, int>, Mutex> m;
495 auto dualLockWorker = [&](size_t threadIdx) {
497 SYNCHRONIZED_DUAL(lv, v, lm, m) {
498 lv.push_back(threadIdx);
499 lm[threadIdx] = threadIdx + 1;
502 SYNCHRONIZED_DUAL(lm, m, lv, v) {
503 lv.push_back(threadIdx);
504 lm[threadIdx] = threadIdx + 1;
508 static const size_t numThreads = 100;
509 runParallel(numThreads, dualLockWorker);
511 std::vector<int> result;
514 EXPECT_EQ(numThreads, result.size());
515 sort(result.begin(), result.end());
517 for (size_t i = 0; i < numThreads; ++i) {
518 EXPECT_EQ(i, result[i]);
522 // Testing the deprecated SYNCHRONIZED_DUAL API
523 template <class Mutex> void testDualLockingWithConst() {
524 folly::Synchronized<std::vector<int>, Mutex> v;
525 folly::Synchronized<std::map<int, int>, Mutex> m;
527 auto dualLockWorker = [&](size_t threadIdx) {
530 SYNCHRONIZED_DUAL(lv, v, lm, cm) {
532 lv.push_back(threadIdx);
535 SYNCHRONIZED_DUAL(lm, cm, lv, v) {
537 lv.push_back(threadIdx);
541 static const size_t numThreads = 100;
542 runParallel(numThreads, dualLockWorker);
544 std::vector<int> result;
547 EXPECT_EQ(numThreads, result.size());
548 sort(result.begin(), result.end());
550 for (size_t i = 0; i < numThreads; ++i) {
551 EXPECT_EQ(i, result[i]);
555 template <class Mutex>
557 folly::Synchronized<std::vector<int>, Mutex> v;
558 folly::Synchronized<uint64_t, Mutex> numTimeouts;
560 auto worker = [&](size_t threadIdx) {
561 // Test directly using operator-> on the lock result
562 v.contextualLock()->push_back(2 * threadIdx);
564 // Test using lock with a timeout
566 auto lv = v.contextualLock(std::chrono::milliseconds(5));
568 ++(*numTimeouts.contextualLock());
572 // Sleep for a random time to ensure we trigger timeouts
574 randomSleep(std::chrono::milliseconds(5), std::chrono::milliseconds(15));
575 lv->push_back(2 * threadIdx + 1);
580 static const size_t numThreads = 100;
581 runParallel(numThreads, worker);
583 std::vector<int> result;
586 EXPECT_EQ(2 * numThreads, result.size());
587 sort(result.begin(), result.end());
589 for (size_t i = 0; i < 2 * numThreads; ++i) {
590 EXPECT_EQ(i, result[i]);
592 // We generally expect a large number of number timeouts here.
593 // I'm not adding a check for it since it's theoretically possible that
594 // we might get 0 timeouts depending on the CPU scheduling if our threads
595 // don't get to run very often.
596 LOG(INFO) << "testTimed: " << *numTimeouts.contextualRLock() << " timeouts";
598 // Make sure we can lock with various timeout duration units
600 auto lv = v.contextualLock(std::chrono::milliseconds(5));
602 EXPECT_FALSE(lv.isNull());
603 auto lv2 = v.contextualLock(std::chrono::microseconds(5));
604 // We may or may not acquire lv2 successfully, depending on whether
605 // or not this is a recursive mutex type.
608 auto lv = v.contextualLock(std::chrono::seconds(1));
613 template <class Mutex>
614 void testTimedShared() {
615 folly::Synchronized<std::vector<int>, Mutex> v;
616 folly::Synchronized<uint64_t, Mutex> numTimeouts;
618 auto worker = [&](size_t threadIdx) {
619 // Test directly using operator-> on the lock result
620 v.wlock()->push_back(threadIdx);
622 // Test lock() with a timeout
624 auto lv = v.rlock(std::chrono::milliseconds(10));
626 ++(*numTimeouts.contextualLock());
630 // Sleep while holding the lock.
632 // This will block other threads from acquiring the write lock to add
633 // their thread index to v, but it won't block threads that have entered
634 // the for loop and are trying to acquire a read lock.
636 // For lock types that give preference to readers rather than writers,
637 // this will tend to serialize all threads on the wlock() above.
638 randomSleep(std::chrono::milliseconds(5), std::chrono::milliseconds(15));
639 auto found = std::find(lv->begin(), lv->end(), threadIdx);
640 CHECK(found != lv->end());
645 static const size_t numThreads = 100;
646 runParallel(numThreads, worker);
648 std::vector<int> result;
651 EXPECT_EQ(numThreads, result.size());
652 sort(result.begin(), result.end());
654 for (size_t i = 0; i < numThreads; ++i) {
655 EXPECT_EQ(i, result[i]);
657 // We generally expect a small number of timeouts here.
658 // For locks that give readers preference over writers this should usually
659 // be 0. With locks that give writers preference we do see a small-ish
660 // number of read timeouts.
661 LOG(INFO) << "testTimedShared: " << *numTimeouts.contextualRLock()
665 // Testing the deprecated TIMED_SYNCHRONIZED API
666 template <class Mutex> void testTimedSynchronized() {
667 folly::Synchronized<std::vector<int>, Mutex> v;
668 folly::Synchronized<uint64_t, Mutex> numTimeouts;
670 auto worker = [&](size_t threadIdx) {
672 v->push_back(2 * threadIdx);
674 // Aaand test the TIMED_SYNCHRONIZED macro
676 TIMED_SYNCHRONIZED(5, lv, v) {
678 // Sleep for a random time to ensure we trigger timeouts
681 std::chrono::milliseconds(5), std::chrono::milliseconds(15));
682 lv->push_back(2 * threadIdx + 1);
686 ++(*numTimeouts.contextualLock());
690 static const size_t numThreads = 100;
691 runParallel(numThreads, worker);
693 std::vector<int> result;
696 EXPECT_EQ(2 * numThreads, result.size());
697 sort(result.begin(), result.end());
699 for (size_t i = 0; i < 2 * numThreads; ++i) {
700 EXPECT_EQ(i, result[i]);
702 // We generally expect a large number of number timeouts here.
703 // I'm not adding a check for it since it's theoretically possible that
704 // we might get 0 timeouts depending on the CPU scheduling if our threads
705 // don't get to run very often.
706 LOG(INFO) << "testTimedSynchronized: " << *numTimeouts.contextualRLock()
710 // Testing the deprecated TIMED_SYNCHRONIZED_CONST API
711 template <class Mutex> void testTimedSynchronizedWithConst() {
712 folly::Synchronized<std::vector<int>, Mutex> v;
713 folly::Synchronized<uint64_t, Mutex> numTimeouts;
715 auto worker = [&](size_t threadIdx) {
717 v->push_back(threadIdx);
719 // Test TIMED_SYNCHRONIZED_CONST
721 TIMED_SYNCHRONIZED_CONST(10, lv, v) {
723 // Sleep while holding the lock.
725 // This will block other threads from acquiring the write lock to add
726 // their thread index to v, but it won't block threads that have
727 // entered the for loop and are trying to acquire a read lock.
729 // For lock types that give preference to readers rather than writers,
730 // this will tend to serialize all threads on the wlock() above.
732 std::chrono::milliseconds(5), std::chrono::milliseconds(15));
733 auto found = std::find(lv->begin(), lv->end(), threadIdx);
734 CHECK(found != lv->end());
737 ++(*numTimeouts.contextualLock());
743 static const size_t numThreads = 100;
744 runParallel(numThreads, worker);
746 std::vector<int> result;
749 EXPECT_EQ(numThreads, result.size());
750 sort(result.begin(), result.end());
752 for (size_t i = 0; i < numThreads; ++i) {
753 EXPECT_EQ(i, result[i]);
755 // We generally expect a small number of timeouts here.
756 // For locks that give readers preference over writers this should usually
757 // be 0. With locks that give writers preference we do see a small-ish
758 // number of read timeouts.
759 LOG(INFO) << "testTimedSynchronizedWithConst: "
760 << *numTimeouts.contextualRLock() << " timeouts";
763 template <class Mutex> void testConstCopy() {
764 std::vector<int> input = {1, 2, 3};
765 const folly::Synchronized<std::vector<int>, Mutex> v(input);
767 std::vector<int> result;
770 EXPECT_EQ(input, result);
773 EXPECT_EQ(input, result);
776 struct NotCopiableNotMovable {
777 NotCopiableNotMovable(int, const char*) {}
778 NotCopiableNotMovable(const NotCopiableNotMovable&) = delete;
779 NotCopiableNotMovable& operator=(const NotCopiableNotMovable&) = delete;
780 NotCopiableNotMovable(NotCopiableNotMovable&&) = delete;
781 NotCopiableNotMovable& operator=(NotCopiableNotMovable&&) = delete;
784 template <class Mutex> void testInPlaceConstruction() {
785 // This won't compile without construct_in_place
786 folly::Synchronized<NotCopiableNotMovable> a(
787 folly::construct_in_place, 5, "a"