#include <array>
#include <atomic>
-#include <cinttypes>
-#include <cstdlib>
+#include <cassert>
+#include <cstdint>
#include <mutex>
#include <type_traits>
-#include <boost/noncopyable.hpp>
-#include <glog/logging.h>
-
#include <folly/Portability.h>
-#include <folly/detail/Sleeper.h>
+#include <folly/lang/Align.h>
+#include <folly/synchronization/detail/Sleeper.h>
namespace folly {
sleeper.wait();
}
} while (!try_lock());
- DCHECK(payload()->load() == LOCKED);
+ assert(payload()->load() == LOCKED);
}
void unlock() {
- CHECK(payload()->load() == LOCKED);
+ assert(payload()->load() == LOCKED);
payload()->store(FREE, std::memory_order_release);
}
#define FOLLY_CACHE_LINE_SIZE 64
template <class T, size_t N>
-struct FOLLY_ALIGNED_MAX SpinLockArray {
+struct alignas(max_align_v) SpinLockArray {
T& operator[](size_t i) {
return data_[i].lock;
}
// Check if T can theoretically cross a cache line.
static_assert(
- folly::max_align_v > 0 &&
- FOLLY_CACHE_LINE_SIZE % folly::max_align_v == 0 &&
- sizeof(T) <= folly::max_align_v,
+ max_align_v > 0 && FOLLY_CACHE_LINE_SIZE % max_align_v == 0 &&
+ sizeof(T) <= max_align_v,
"T can cross cache line boundaries");
char padding_[FOLLY_CACHE_LINE_SIZE];
//////////////////////////////////////////////////////////////////////
-}
+} // namespace folly