/*
- * Copyright 2013 Facebook, Inc.
+ * Copyright 2017 Facebook, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
// @author: Xin Liu <xliux@fb.com>
#include <map>
+#include <random>
#include <set>
#include <thread>
-#include <gflags/gflags.h>
+#include <folly/Benchmark.h>
+#include <folly/ConcurrentSkipList.h>
+#include <folly/Hash.h>
+#include <folly/RWSpinLock.h>
+#include <folly/portability/GFlags.h>
#include <glog/logging.h>
-#include "folly/Benchmark.h"
-#include "folly/ConcurrentSkipList.h"
-#include "folly/Hash.h"
-#include "folly/RWSpinLock.h"
-
DEFINE_int32(num_threads, 12, "num concurrent threads to test");
for (int i = 0; i < kMaxValue; ++i) {
gData[i] = i;
}
- std::random_shuffle(gData.begin(), gData.end());
+ std::shuffle(gData.begin(), gData.end(), std::mt19937{});
}
// single thread benchmarks
auto sl = skiplist.get();
susp.dismiss();
- for (int i = 0; i < iters; ++i) {
+ for (size_t i = 0; i < iters; ++i) {
SkipListAccessor accessor(sl);
}
}
l.init();
susp.dismiss();
- for (int i = 0; i < iters; ++i) {
+ for (size_t i = 0; i < iters; ++i) {
value->fetch_add(1, std::memory_order_relaxed);
if (dirty->load(std::memory_order_acquire) != 0) {
folly::MSLGuard g(l);
if (i > 0) sets_[i] = sets_[0];
}
+// This requires knowledge of the C++ library internals. Only use it if we're
+// using the GNU C++ library.
+#ifdef _GLIBCXX_SYMVER
// memory usage
int64_t setMemorySize = sets_[0].size() * sizeof(*sets_[0].begin()._M_node);
int64_t cslMemorySize = 0;
LOG(INFO) << "size=" << sets_[0].size()
<< "; std::set memory size=" << setMemorySize
<< "; csl memory size=" << cslMemorySize;
+#endif
readValues_.reserve(size);
deleteValues_.reserve(size);
// half new values and half already in the list
writeValues_.push_back((rand() % 2) + 2 * i);
}
- std::random_shuffle(readValues_.begin(), readValues_.end());
- std::random_shuffle(deleteValues_.begin(), deleteValues_.end());
- std::random_shuffle(writeValues_.begin(), writeValues_.end());
+ std::shuffle(readValues_.begin(), readValues_.end(), std::mt19937{});
+ std::shuffle(deleteValues_.begin(), deleteValues_.end(), std::mt19937{});
+ std::shuffle(writeValues_.begin(), writeValues_.end(), std::mt19937{});
}
~ConcurrentAccessData() {
FOR_EACH(lock, locks_) delete *lock;
}
- inline bool skipListFind(int idx, ValueType val) {
+ inline bool skipListFind(int /* idx */, ValueType val) {
return skipList_.contains(val);
}
- inline void skipListInsert(int idx, ValueType val) {
+ inline void skipListInsert(int /* idx */, ValueType val) {
skipList_.add(val);
}
- inline void skipListErase(int idx, ValueType val) {
+ inline void skipListErase(int /* idx */, ValueType val) {
skipList_.remove(val);
}
sets_[idx].erase(val);
}
- void runSkipList(int id, int iters) {
+ void runSkipList(int id, size_t iters) {
int sum = 0;
- for (int i = 0; i < iters; ++i) {
+ for (size_t i = 0; i < iters; ++i) {
sum += accessSkipList(id, i);
}
// VLOG(20) << sum;
}
- void runSet(int id, int iters) {
+ void runSet(size_t id, size_t iters) {
int sum = 0;
- for (int i = 0; i < iters; ++i) {
+ for (size_t i = 0; i < iters; ++i) {
sum += accessSet(id, i);
}
// VLOG(20) << sum;
}
- bool accessSkipList(int64_t id, int t) {
+ bool accessSkipList(int64_t id, size_t t) {
if (t > readValues_.size()) {
t = t % readValues_.size();
}
}
}
- bool accessSet(int64_t id, int t) {
+ bool accessSet(int64_t id, size_t t) {
if (t > readValues_.size()) {
t = t % readValues_.size();
}
int main(int argc, char** argv) {
google::InitGoogleLogging(argv[0]);
- google::ParseCommandLineFlags(&argc, &argv, true);
+ gflags::ParseCommandLineFlags(&argc, &argv, true);
initData();
runBenchmarks();