Compare commits
16 Commits
v0.0.13
...
5c0cc1edf5
Author | SHA1 | Date | |
---|---|---|---|
5c0cc1edf5 | |||
de47aa53b0 | |||
56893f9702 | |||
e2234be10f | |||
ce853680f2 | |||
5c39c1d64f | |||
55b73c8ddb | |||
b9503f8258 | |||
c4c4531bd3 | |||
2037d37c66 | |||
6fe6a244af | |||
8a4b370e2a | |||
394f09f9fb | |||
5e06a30357 | |||
cb6e4292f2 | |||
154a48ded0 |
@@ -1,7 +1,7 @@
|
||||
cmake_minimum_required(VERSION 3.18)
|
||||
project(
|
||||
conflict-set
|
||||
VERSION 0.0.13
|
||||
VERSION 0.0.14
|
||||
DESCRIPTION
|
||||
"A data structure for optimistic concurrency control on ranges of bitwise-lexicographically-ordered keys."
|
||||
HOMEPAGE_URL "https://git.weaselab.dev/weaselab/conflict-set"
|
||||
|
365
ConflictSet.cpp
365
ConflictSet.cpp
@@ -17,9 +17,9 @@ limitations under the License.
|
||||
#include "ConflictSet.h"
|
||||
#include "Internal.h"
|
||||
#include "LongestCommonPrefix.h"
|
||||
#include "Metrics.h"
|
||||
|
||||
#include <algorithm>
|
||||
#include <atomic>
|
||||
#include <bit>
|
||||
#include <cassert>
|
||||
#include <cstddef>
|
||||
@@ -578,39 +578,6 @@ static_assert(kBytesPerKey - sizeof(Node0) >= kMinNodeSurplus);
|
||||
|
||||
constexpr int64_t kFreeListMaxMemory = 1 << 20;
|
||||
|
||||
struct Metric {
|
||||
Metric *prev;
|
||||
const char *name;
|
||||
const char *help;
|
||||
ConflictSet::MetricsV1::Type type;
|
||||
std::atomic<int64_t> value;
|
||||
|
||||
protected:
|
||||
Metric(ConflictSet::Impl *impl, const char *name, const char *help,
|
||||
ConflictSet::MetricsV1::Type type);
|
||||
};
|
||||
|
||||
struct Gauge : private Metric {
|
||||
Gauge(ConflictSet::Impl *impl, const char *name, const char *help)
|
||||
: Metric(impl, name, help, ConflictSet::MetricsV1::Gauge) {}
|
||||
|
||||
void set(int64_t value) {
|
||||
this->value.store(value, std::memory_order_relaxed);
|
||||
}
|
||||
};
|
||||
|
||||
struct Counter : private Metric {
|
||||
Counter(ConflictSet::Impl *impl, const char *name, const char *help)
|
||||
: Metric(impl, name, help, ConflictSet::MetricsV1::Counter) {}
|
||||
// Expensive. Accumulate locally and then call add instead of repeatedly
|
||||
// calling add.
|
||||
void add(int64_t value) {
|
||||
assert(value >= 0);
|
||||
static_assert(std::atomic<int64_t>::is_always_lock_free);
|
||||
this->value.fetch_add(value, std::memory_order_relaxed);
|
||||
}
|
||||
};
|
||||
|
||||
template <class T> struct BoundedFreeListAllocator {
|
||||
|
||||
static_assert(sizeof(T) >= sizeof(void *));
|
||||
@@ -2543,38 +2510,19 @@ downLeftSpine:
|
||||
namespace {
|
||||
// Return true if the max version among all keys that start with key[:prefixLen]
|
||||
// that are >= key is <= readVersion
|
||||
struct CheckRangeLeftSide {
|
||||
CheckRangeLeftSide(Node *n, std::span<const uint8_t> key, int prefixLen,
|
||||
InternalVersionT readVersion, ReadContext *tls)
|
||||
: n(n), remaining(key), prefixLen(prefixLen), readVersion(readVersion),
|
||||
impl(tls->impl), tls(tls) {
|
||||
#if DEBUG_VERBOSE && !defined(NDEBUG)
|
||||
fprintf(stderr, "Check range left side from %s for keys starting with %s\n",
|
||||
printable(key).c_str(),
|
||||
printable(key.subspan(0, prefixLen)).c_str());
|
||||
#endif
|
||||
}
|
||||
|
||||
Node *n;
|
||||
std::span<const uint8_t> remaining;
|
||||
int prefixLen;
|
||||
InternalVersionT readVersion;
|
||||
ConflictSet::Impl *impl;
|
||||
ReadContext *tls;
|
||||
bool checkRangeLeftSide(Node *n, std::span<const uint8_t> key, int prefixLen,
|
||||
InternalVersionT readVersion, ReadContext *tls) {
|
||||
auto remaining = key;
|
||||
int searchPathLen = 0;
|
||||
bool ok;
|
||||
|
||||
bool step() {
|
||||
for (;; ++tls->range_read_iterations_accum) {
|
||||
if (remaining.size() == 0) {
|
||||
assert(searchPathLen >= prefixLen);
|
||||
ok = maxVersion(n) <= readVersion;
|
||||
return true;
|
||||
return maxVersion(n) <= readVersion;
|
||||
}
|
||||
|
||||
if (searchPathLen >= prefixLen) {
|
||||
if (!checkMaxBetweenExclusive(n, remaining[0], 256, readVersion, tls)) {
|
||||
ok = false;
|
||||
return true;
|
||||
return false;
|
||||
}
|
||||
}
|
||||
|
||||
@@ -2584,18 +2532,16 @@ struct CheckRangeLeftSide {
|
||||
if (c != nullptr) {
|
||||
if (searchPathLen < prefixLen) {
|
||||
n = c;
|
||||
return downLeftSpine();
|
||||
goto downLeftSpine;
|
||||
}
|
||||
n = c;
|
||||
ok = maxVersion(n) <= readVersion;
|
||||
return true;
|
||||
return maxVersion(n) <= readVersion;
|
||||
} else {
|
||||
n = nextSibling(n);
|
||||
if (n == nullptr) {
|
||||
ok = true;
|
||||
return true;
|
||||
}
|
||||
return downLeftSpine();
|
||||
goto downLeftSpine;
|
||||
}
|
||||
}
|
||||
|
||||
@@ -2611,21 +2557,18 @@ struct CheckRangeLeftSide {
|
||||
auto c = n->partialKey()[i] <=> remaining[i];
|
||||
if (c > 0) {
|
||||
if (searchPathLen < prefixLen) {
|
||||
return downLeftSpine();
|
||||
goto downLeftSpine;
|
||||
}
|
||||
if (n->entryPresent && n->entry.rangeVersion > readVersion) {
|
||||
ok = false;
|
||||
return true;
|
||||
return false;
|
||||
}
|
||||
ok = maxVersion(n) <= readVersion;
|
||||
return true;
|
||||
return maxVersion(n) <= readVersion;
|
||||
} else {
|
||||
n = nextSibling(n);
|
||||
if (n == nullptr) {
|
||||
ok = true;
|
||||
return true;
|
||||
}
|
||||
return downLeftSpine();
|
||||
goto downLeftSpine;
|
||||
}
|
||||
}
|
||||
if (commonLen == n->partialKeyLen) {
|
||||
@@ -2634,83 +2577,47 @@ struct CheckRangeLeftSide {
|
||||
} else if (n->partialKeyLen > int(remaining.size())) {
|
||||
assert(searchPathLen >= prefixLen);
|
||||
if (n->entryPresent && n->entry.rangeVersion > readVersion) {
|
||||
ok = false;
|
||||
return true;
|
||||
return false;
|
||||
}
|
||||
ok = maxVersion(n) <= readVersion;
|
||||
return true;
|
||||
return maxVersion(n) <= readVersion;
|
||||
}
|
||||
}
|
||||
if (maxV <= readVersion) {
|
||||
ok = true;
|
||||
return true;
|
||||
}
|
||||
return false;
|
||||
}
|
||||
|
||||
bool downLeftSpine() {
|
||||
for (; !n->entryPresent; n = getFirstChildExists(n)) {
|
||||
}
|
||||
ok = n->entry.rangeVersion <= readVersion;
|
||||
return true;
|
||||
downLeftSpine:
|
||||
for (; !n->entryPresent; n = getFirstChildExists(n)) {
|
||||
}
|
||||
};
|
||||
return n->entry.rangeVersion <= readVersion;
|
||||
}
|
||||
|
||||
// Return true if the max version among all keys that start with key[:prefixLen]
|
||||
// that are < key is <= readVersion
|
||||
struct CheckRangeRightSide {
|
||||
CheckRangeRightSide(Node *n, std::span<const uint8_t> key, int prefixLen,
|
||||
InternalVersionT readVersion, ReadContext *tls)
|
||||
: n(n), key(key), remaining(key), prefixLen(prefixLen),
|
||||
readVersion(readVersion), impl(tls->impl), tls(tls) {
|
||||
#if DEBUG_VERBOSE && !defined(NDEBUG)
|
||||
fprintf(stderr, "Check range right side to %s for keys starting with %s\n",
|
||||
printable(key).c_str(),
|
||||
printable(key.subspan(0, prefixLen)).c_str());
|
||||
#endif
|
||||
}
|
||||
|
||||
Node *n;
|
||||
std::span<const uint8_t> key;
|
||||
std::span<const uint8_t> remaining;
|
||||
int prefixLen;
|
||||
InternalVersionT readVersion;
|
||||
ConflictSet::Impl *impl;
|
||||
ReadContext *tls;
|
||||
bool checkRangeRightSide(Node *n, std::span<const uint8_t> key, int prefixLen,
|
||||
InternalVersionT readVersion, ReadContext *tls) {
|
||||
auto remaining = key;
|
||||
int searchPathLen = 0;
|
||||
bool ok;
|
||||
|
||||
bool step() {
|
||||
#if DEBUG_VERBOSE && !defined(NDEBUG)
|
||||
fprintf(stderr,
|
||||
"Search path: %s, searchPathLen: %d, prefixLen: %d, remaining: "
|
||||
"%s\n",
|
||||
getSearchPathPrintable(n).c_str(), searchPathLen, prefixLen,
|
||||
printable(remaining).c_str());
|
||||
#endif
|
||||
|
||||
for (;; ++tls->range_read_iterations_accum) {
|
||||
assert(searchPathLen <= int(key.size()));
|
||||
|
||||
if (remaining.size() == 0) {
|
||||
return downLeftSpine();
|
||||
goto downLeftSpine;
|
||||
}
|
||||
|
||||
if (searchPathLen >= prefixLen) {
|
||||
if (n->entryPresent && n->entry.pointVersion > readVersion) {
|
||||
ok = false;
|
||||
return true;
|
||||
return false;
|
||||
}
|
||||
|
||||
if (!checkMaxBetweenExclusive(n, -1, remaining[0], readVersion, tls)) {
|
||||
ok = false;
|
||||
return true;
|
||||
return false;
|
||||
}
|
||||
}
|
||||
|
||||
if (searchPathLen > prefixLen && n->entryPresent &&
|
||||
n->entry.rangeVersion > readVersion) {
|
||||
ok = false;
|
||||
return true;
|
||||
return false;
|
||||
}
|
||||
|
||||
auto *child = getChild(n, remaining[0]);
|
||||
@@ -2718,9 +2625,9 @@ struct CheckRangeRightSide {
|
||||
auto c = getChildGeq(n, remaining[0]);
|
||||
if (c != nullptr) {
|
||||
n = c;
|
||||
return downLeftSpine();
|
||||
goto downLeftSpine;
|
||||
} else {
|
||||
return backtrack();
|
||||
goto backtrack;
|
||||
}
|
||||
}
|
||||
|
||||
@@ -2736,57 +2643,48 @@ struct CheckRangeRightSide {
|
||||
++searchPathLen;
|
||||
auto c = n->partialKey()[i] <=> remaining[i];
|
||||
if (c > 0) {
|
||||
return downLeftSpine();
|
||||
goto downLeftSpine;
|
||||
} else {
|
||||
if (searchPathLen > prefixLen && n->entryPresent &&
|
||||
n->entry.rangeVersion > readVersion) {
|
||||
ok = false;
|
||||
return true;
|
||||
return false;
|
||||
}
|
||||
return backtrack();
|
||||
goto backtrack;
|
||||
}
|
||||
}
|
||||
if (commonLen == n->partialKeyLen) {
|
||||
// partial key matches
|
||||
remaining = remaining.subspan(commonLen, remaining.size() - commonLen);
|
||||
} else if (n->partialKeyLen > int(remaining.size())) {
|
||||
return downLeftSpine();
|
||||
}
|
||||
}
|
||||
return false;
|
||||
}
|
||||
|
||||
bool backtrack() {
|
||||
for (;;) {
|
||||
// searchPathLen > prefixLen implies n is not the root
|
||||
if (searchPathLen > prefixLen && maxVersion(n) > readVersion) {
|
||||
ok = false;
|
||||
return true;
|
||||
}
|
||||
if (n->parent == nullptr) {
|
||||
ok = true;
|
||||
return true;
|
||||
}
|
||||
auto next = getChildGeq(n->parent, n->parentsIndex + 1);
|
||||
if (next == nullptr) {
|
||||
searchPathLen -= 1 + n->partialKeyLen;
|
||||
n = n->parent;
|
||||
} else {
|
||||
searchPathLen -= n->partialKeyLen;
|
||||
n = next;
|
||||
searchPathLen += n->partialKeyLen;
|
||||
return downLeftSpine();
|
||||
goto downLeftSpine;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
bool downLeftSpine() {
|
||||
for (; !n->entryPresent; n = getFirstChildExists(n)) {
|
||||
backtrack:
|
||||
for (;;) {
|
||||
// searchPathLen > prefixLen implies n is not the root
|
||||
if (searchPathLen > prefixLen && maxVersion(n) > readVersion) {
|
||||
return false;
|
||||
}
|
||||
if (n->parent == nullptr) {
|
||||
return true;
|
||||
}
|
||||
auto next = getChildGeq(n->parent, n->parentsIndex + 1);
|
||||
if (next == nullptr) {
|
||||
searchPathLen -= 1 + n->partialKeyLen;
|
||||
n = n->parent;
|
||||
} else {
|
||||
searchPathLen -= n->partialKeyLen;
|
||||
n = next;
|
||||
searchPathLen += n->partialKeyLen;
|
||||
goto downLeftSpine;
|
||||
}
|
||||
ok = n->entry.rangeVersion <= readVersion;
|
||||
return true;
|
||||
}
|
||||
};
|
||||
downLeftSpine:
|
||||
for (; !n->entryPresent; n = getFirstChildExists(n)) {
|
||||
}
|
||||
return n->entry.rangeVersion <= readVersion;
|
||||
}
|
||||
} // namespace
|
||||
|
||||
bool checkRangeRead(Node *n, std::span<const uint8_t> begin,
|
||||
@@ -2807,8 +2705,8 @@ bool checkRangeRead(Node *n, std::span<const uint8_t> begin,
|
||||
|
||||
auto remaining = begin.subspan(0, lcp);
|
||||
Arena arena;
|
||||
// If the common prefix isn't a prefix of any physical entry in the tree, we
|
||||
// can go to "downLeftSpine"
|
||||
|
||||
// Advance down common prefix, but stay on a physical path in the tree
|
||||
for (;; ++tls->range_read_iterations_accum) {
|
||||
assert(getSearchPath(arena, n) <=>
|
||||
begin.subspan(0, lcp - remaining.size()) ==
|
||||
@@ -2849,47 +2747,17 @@ bool checkRangeRead(Node *n, std::span<const uint8_t> begin,
|
||||
lcp -= consumed;
|
||||
|
||||
if (lcp == int(begin.size())) {
|
||||
CheckRangeRightSide checkRangeRightSide{n, end, lcp, readVersion, tls};
|
||||
while (!checkRangeRightSide.step())
|
||||
;
|
||||
return checkRangeRightSide.ok;
|
||||
return checkRangeRightSide(n, end, lcp, readVersion, tls);
|
||||
}
|
||||
|
||||
if (!checkRangeStartsWith(n, begin.subspan(0, lcp), begin[lcp], end[lcp],
|
||||
readVersion, tls)) {
|
||||
return false;
|
||||
}
|
||||
|
||||
// This makes it safe to check maxVersion within CheckRangeLeftSide. If this
|
||||
// This makes it safe to check maxVersion within checkRangeLeftSide. If this
|
||||
// were false, then we would have returned above since lcp == begin.size().
|
||||
assert(!(n->parent == nullptr && begin.size() == 0));
|
||||
CheckRangeLeftSide checkRangeLeftSide{n, begin, lcp + 1, readVersion, tls};
|
||||
CheckRangeRightSide checkRangeRightSide{n, end, lcp + 1, readVersion, tls};
|
||||
|
||||
for (;;) {
|
||||
bool leftDone = checkRangeLeftSide.step();
|
||||
bool rightDone = checkRangeRightSide.step();
|
||||
if (!leftDone && !rightDone) {
|
||||
tls->range_read_iterations_accum += 2;
|
||||
continue;
|
||||
}
|
||||
if (leftDone && rightDone) {
|
||||
break;
|
||||
} else if (leftDone) {
|
||||
while (!checkRangeRightSide.step()) {
|
||||
++tls->range_read_iterations_accum;
|
||||
}
|
||||
break;
|
||||
} else {
|
||||
assert(rightDone);
|
||||
while (!checkRangeLeftSide.step()) {
|
||||
++tls->range_read_iterations_accum;
|
||||
}
|
||||
}
|
||||
break;
|
||||
}
|
||||
|
||||
return checkRangeLeftSide.ok && checkRangeRightSide.ok;
|
||||
return checkRangeStartsWith(n, begin.subspan(0, lcp), begin[lcp], end[lcp],
|
||||
readVersion, tls) &&
|
||||
checkRangeLeftSide(n, begin, lcp + 1, readVersion, tls) &&
|
||||
checkRangeRightSide(n, end, lcp + 1, readVersion, tls);
|
||||
}
|
||||
|
||||
#ifdef __x86_64__
|
||||
@@ -3242,7 +3110,6 @@ struct __attribute__((visibility("hidden"))) ConflictSet::Impl {
|
||||
0) *
|
||||
2;
|
||||
|
||||
memory_bytes.set(totalBytes);
|
||||
point_writes_total.add(tls.accum.point_writes);
|
||||
range_writes_total.add(tls.accum.range_writes);
|
||||
nodes_allocated_total.add(tls.accum.nodes_allocated);
|
||||
@@ -3331,7 +3198,6 @@ struct __attribute__((visibility("hidden"))) ConflictSet::Impl {
|
||||
#endif
|
||||
keyUpdates = gcScanStep(keyUpdates);
|
||||
|
||||
memory_bytes.set(totalBytes);
|
||||
nodes_allocated_total.add(std::exchange(tls.accum.nodes_allocated, 0));
|
||||
nodes_released_total.add(std::exchange(tls.accum.nodes_released, 0));
|
||||
entries_inserted_total.add(std::exchange(tls.accum.entries_inserted, 0));
|
||||
@@ -3379,7 +3245,7 @@ struct __attribute__((visibility("hidden"))) ConflictSet::Impl {
|
||||
explicit Impl(int64_t oldestVersion) {
|
||||
assert(oldestVersion >= 0);
|
||||
init(oldestVersion);
|
||||
initMetrics();
|
||||
metrics = initMetrics(metricsList, metricsCount);
|
||||
}
|
||||
~Impl() {
|
||||
eraseTree(root, &tls);
|
||||
@@ -3402,23 +3268,12 @@ struct __attribute__((visibility("hidden"))) ConflictSet::Impl {
|
||||
|
||||
MetricsV1 *metrics;
|
||||
int metricsCount = 0;
|
||||
void initMetrics() {
|
||||
metrics = (MetricsV1 *)safe_malloc(metricsCount * sizeof(metrics[0]));
|
||||
for (auto [i, m] = std::make_tuple(metricsCount - 1, metricList); i >= 0;
|
||||
--i, m = m->prev) {
|
||||
metrics[i].name = m->name;
|
||||
metrics[i].help = m->help;
|
||||
metrics[i].p = m;
|
||||
metrics[i].type = m->type;
|
||||
}
|
||||
}
|
||||
|
||||
Metric *metricList = nullptr;
|
||||
Metric *metricsList = nullptr;
|
||||
|
||||
#define GAUGE(name, help) \
|
||||
Gauge name { this, #name, help }
|
||||
Gauge name { metricsList, metricsCount, #name, help }
|
||||
#define COUNTER(name, help) \
|
||||
Counter name { this, #name, help }
|
||||
Counter name { metricsList, metricsCount, #name, help }
|
||||
// ==================== METRICS DEFINITIONS ====================
|
||||
COUNTER(point_read_total, "Total number of point reads checked");
|
||||
COUNTER(point_read_short_circuit_total,
|
||||
@@ -3484,13 +3339,6 @@ struct __attribute__((visibility("hidden"))) ConflictSet::Impl {
|
||||
}
|
||||
};
|
||||
|
||||
Metric::Metric(ConflictSet::Impl *impl, const char *name, const char *help,
|
||||
ConflictSet::MetricsV1::Type type)
|
||||
: prev(std::exchange(impl->metricList, this)), name(name), help(help),
|
||||
type(type), value(0) {
|
||||
++impl->metricsCount;
|
||||
}
|
||||
|
||||
Node *&getInTree(Node *n, ConflictSet::Impl *impl) {
|
||||
return n->parent == nullptr ? impl->root
|
||||
: getChildExists(n->parent, n->parentsIndex);
|
||||
@@ -3509,6 +3357,7 @@ void internal_addWrites(ConflictSet::Impl *impl,
|
||||
mallocBytesDelta = 0;
|
||||
impl->addWrites(writes, count, writeVersion);
|
||||
impl->totalBytes += mallocBytesDelta;
|
||||
impl->memory_bytes.set(impl->totalBytes);
|
||||
#if SHOW_MEMORY
|
||||
if (impl->totalBytes != mallocBytes) {
|
||||
abort();
|
||||
@@ -3520,6 +3369,7 @@ void internal_setOldestVersion(ConflictSet::Impl *impl, int64_t oldestVersion) {
|
||||
mallocBytesDelta = 0;
|
||||
impl->setOldestVersion(oldestVersion);
|
||||
impl->totalBytes += mallocBytesDelta;
|
||||
impl->memory_bytes.set(impl->totalBytes);
|
||||
#if SHOW_MEMORY
|
||||
if (impl->totalBytes != mallocBytes) {
|
||||
abort();
|
||||
@@ -4073,6 +3923,73 @@ struct __attribute__((visibility("default"))) PeakPrinter {
|
||||
|
||||
#ifdef ENABLE_MAIN
|
||||
|
||||
#define ANKERL_NANOBENCH_IMPLEMENT
|
||||
#include "third_party/nanobench.h"
|
||||
|
||||
template <int kN> void benchRezero() {
|
||||
static_assert(kN % 16 == 0);
|
||||
ankerl::nanobench::Bench bench;
|
||||
InternalVersionT vs[kN];
|
||||
InternalVersionT zero;
|
||||
bench.run("rezero" + std::to_string(kN), [&]() {
|
||||
bench.doNotOptimizeAway(vs);
|
||||
bench.doNotOptimizeAway(zero);
|
||||
for (int i = 0; i < kN; i += 16) {
|
||||
rezero16(vs + i, zero);
|
||||
}
|
||||
});
|
||||
}
|
||||
|
||||
template <int kN> void benchScan1() {
|
||||
static_assert(kN % 16 == 0);
|
||||
ankerl::nanobench::Bench bench;
|
||||
InternalVersionT vs[kN];
|
||||
uint8_t is[kN];
|
||||
uint8_t begin;
|
||||
uint8_t end;
|
||||
InternalVersionT v;
|
||||
bench.run("scan" + std::to_string(kN), [&]() {
|
||||
bench.doNotOptimizeAway(vs);
|
||||
bench.doNotOptimizeAway(is);
|
||||
bench.doNotOptimizeAway(begin);
|
||||
bench.doNotOptimizeAway(end);
|
||||
bench.doNotOptimizeAway(v);
|
||||
for (int i = 0; i < kN; i += 16) {
|
||||
scan16</*kAVX512=*/true>(vs + i, is + i, begin, end, v);
|
||||
}
|
||||
});
|
||||
}
|
||||
|
||||
template <int kN> void benchScan2() {
|
||||
static_assert(kN % 16 == 0);
|
||||
ankerl::nanobench::Bench bench;
|
||||
InternalVersionT vs[kN];
|
||||
uint8_t is[kN];
|
||||
uint8_t begin;
|
||||
uint8_t end;
|
||||
InternalVersionT v;
|
||||
bench.run("scan" + std::to_string(kN), [&]() {
|
||||
bench.doNotOptimizeAway(vs);
|
||||
bench.doNotOptimizeAway(begin);
|
||||
bench.doNotOptimizeAway(end);
|
||||
bench.doNotOptimizeAway(v);
|
||||
for (int i = 0; i < kN; i += 16) {
|
||||
scan16</*kAVX512=*/true>(vs + i, begin, end, v);
|
||||
}
|
||||
});
|
||||
}
|
||||
|
||||
void benchLCP(int len) {
|
||||
ankerl::nanobench::Bench bench;
|
||||
std::vector<uint8_t> lhs(len);
|
||||
std::vector<uint8_t> rhs(len);
|
||||
bench.run("lcp " + std::to_string(len), [&]() {
|
||||
bench.doNotOptimizeAway(lhs);
|
||||
bench.doNotOptimizeAway(rhs);
|
||||
bench.doNotOptimizeAway(longestCommonPrefix(lhs.data(), rhs.data(), len));
|
||||
});
|
||||
}
|
||||
|
||||
void printTree() {
|
||||
int64_t writeVersion = 0;
|
||||
ConflictSet::Impl cs{writeVersion};
|
||||
@@ -4094,7 +4011,11 @@ void printTree() {
|
||||
debugPrintDot(stdout, cs.root, &cs);
|
||||
}
|
||||
|
||||
int main(void) { printTree(); }
|
||||
int main(void) {
|
||||
for (int i = 0; i < 256; ++i) {
|
||||
benchLCP(i);
|
||||
}
|
||||
}
|
||||
#endif
|
||||
|
||||
#ifdef ENABLE_FUZZ
|
||||
|
2
Jenkinsfile
vendored
2
Jenkinsfile
vendored
@@ -129,7 +129,7 @@ pipeline {
|
||||
}
|
||||
steps {
|
||||
script {
|
||||
filter_args = "-f ConflictSet.cpp -f LongestCommonPrefix.h"
|
||||
filter_args = "-f ConflictSet.cpp -f LongestCommonPrefix.h -f Metrics.h"
|
||||
}
|
||||
CleanBuildAndTest("-DCMAKE_C_COMPILER=gcc -DCMAKE_CXX_COMPILER=g++ -DCMAKE_C_FLAGS=--coverage -DCMAKE_CXX_FLAGS=--coverage -DCMAKE_BUILD_TYPE=Debug -DDISABLE_TSAN=ON")
|
||||
sh """
|
||||
|
64
Metrics.h
Normal file
64
Metrics.h
Normal file
@@ -0,0 +1,64 @@
|
||||
#pragma once
|
||||
|
||||
#include "ConflictSet.h"
|
||||
#include "Internal.h"
|
||||
|
||||
#include <assert.h>
|
||||
#include <atomic>
|
||||
#include <tuple>
|
||||
|
||||
struct Metric {
|
||||
Metric *prev;
|
||||
const char *name;
|
||||
const char *help;
|
||||
weaselab::ConflictSet::MetricsV1::Type type;
|
||||
std::atomic<int64_t> value;
|
||||
|
||||
protected:
|
||||
Metric(Metric *&metricList, int &metricsCount, const char *name,
|
||||
const char *help, weaselab::ConflictSet::MetricsV1::Type type)
|
||||
: prev(std::exchange(metricList, this)), name(name), help(help),
|
||||
type(type), value(0) {
|
||||
++metricsCount;
|
||||
}
|
||||
};
|
||||
|
||||
struct Gauge : private Metric {
|
||||
Gauge(Metric *&metricList, int &metricsCount, const char *name,
|
||||
const char *help)
|
||||
: Metric(metricList, metricsCount, name, help,
|
||||
weaselab::ConflictSet::MetricsV1::Gauge) {}
|
||||
|
||||
void set(int64_t value) {
|
||||
this->value.store(value, std::memory_order_relaxed);
|
||||
}
|
||||
};
|
||||
|
||||
struct Counter : private Metric {
|
||||
Counter(Metric *&metricList, int &metricsCount, const char *name,
|
||||
const char *help)
|
||||
: Metric(metricList, metricsCount, name, help,
|
||||
weaselab::ConflictSet::MetricsV1::Counter) {}
|
||||
// Expensive. Accumulate locally and then call add instead of repeatedly
|
||||
// calling add.
|
||||
void add(int64_t value) {
|
||||
assert(value >= 0);
|
||||
static_assert(std::atomic<int64_t>::is_always_lock_free);
|
||||
this->value.fetch_add(value, std::memory_order_relaxed);
|
||||
}
|
||||
};
|
||||
|
||||
inline weaselab::ConflictSet::MetricsV1 *initMetrics(Metric *metricsList,
|
||||
int metricsCount) {
|
||||
weaselab::ConflictSet::MetricsV1 *metrics =
|
||||
(weaselab::ConflictSet::MetricsV1 *)safe_malloc(metricsCount *
|
||||
sizeof(metrics[0]));
|
||||
for (auto [i, m] = std::make_tuple(metricsCount - 1, metricsList); i >= 0;
|
||||
--i, m = m->prev) {
|
||||
metrics[i].name = m->name;
|
||||
metrics[i].help = m->help;
|
||||
metrics[i].p = m;
|
||||
metrics[i].type = m->type;
|
||||
}
|
||||
return metrics;
|
||||
}
|
18
README.md
18
README.md
@@ -24,15 +24,15 @@ Hardware for all benchmarks is an AMD Ryzen 9 7900 with (2x32GB) 5600MT/s CL28-3
|
||||
|
||||
| ns/op | op/s | err% | ins/op | cyc/op | IPC | bra/op | miss% | total | benchmark
|
||||
|--------------------:|--------------------:|--------:|----------------:|----------------:|-------:|---------------:|--------:|----------:|:----------
|
||||
| 11.18 | 89,455,125.34 | 0.6% | 185.37 | 57.08 | 3.248 | 41.51 | 0.4% | 0.01 | `point reads`
|
||||
| 14.53 | 68,800,688.89 | 0.4% | 282.41 | 74.80 | 3.776 | 55.06 | 0.3% | 0.01 | `prefix reads`
|
||||
| 36.54 | 27,367,576.87 | 0.2% | 798.06 | 188.90 | 4.225 | 141.69 | 0.2% | 0.01 | `range reads`
|
||||
| 16.69 | 59,912,106.02 | 0.6% | 314.57 | 86.29 | 3.645 | 39.84 | 0.4% | 0.01 | `point writes`
|
||||
| 30.09 | 33,235,744.07 | 0.5% | 591.33 | 155.92 | 3.793 | 82.69 | 0.2% | 0.01 | `prefix writes`
|
||||
| 35.77 | 27,956,388.03 | 1.4% | 682.25 | 187.63 | 3.636 | 96.12 | 0.1% | 0.01 | `range writes`
|
||||
| 74.04 | 13,505,408.41 | 2.7% | 1,448.95 | 392.10 | 3.695 | 260.53 | 0.1% | 0.01 | `monotonic increasing point writes`
|
||||
| 330,984.50 | 3,021.29 | 1.9% | 3,994,153.50 | 1,667,309.00 | 2.396 | 806,019.50 | 0.0% | 0.01 | `worst case for radix tree`
|
||||
| 92.46 | 10,814,961.65 | 0.5% | 1,800.00 | 463.41 | 3.884 | 297.00 | 0.0% | 0.01 | `create and destroy`
|
||||
| 12.88 | 77,653,350.77 | 0.5% | 185.37 | 64.45 | 2.876 | 41.51 | 0.4% | 0.01 | `point reads`
|
||||
| 14.67 | 68,179,354.49 | 0.1% | 271.44 | 73.40 | 3.698 | 53.70 | 0.3% | 0.01 | `prefix reads`
|
||||
| 34.84 | 28,701,444.36 | 0.3% | 715.74 | 175.27 | 4.084 | 127.30 | 0.2% | 0.01 | `range reads`
|
||||
| 17.12 | 58,422,988.28 | 0.2% | 314.30 | 86.11 | 3.650 | 39.82 | 0.4% | 0.01 | `point writes`
|
||||
| 31.42 | 31,830,804.65 | 0.1% | 591.06 | 158.07 | 3.739 | 82.67 | 0.2% | 0.01 | `prefix writes`
|
||||
| 37.37 | 26,759,432.70 | 2.2% | 681.98 | 188.95 | 3.609 | 96.10 | 0.1% | 0.01 | `range writes`
|
||||
| 76.72 | 13,035,140.63 | 2.3% | 1,421.28 | 387.17 | 3.671 | 257.76 | 0.1% | 0.01 | `monotonic increasing point writes`
|
||||
| 297,452.00 | 3,361.89 | 0.9% | 3,508,083.00 | 1,500,834.67 | 2.337 | 727,525.33 | 0.1% | 0.01 | `worst case for radix tree`
|
||||
| 87.70 | 11,402,490.60 | 1.0% | 1,795.00 | 442.09 | 4.060 | 297.00 | 0.0% | 0.01 | `create and destroy`
|
||||
|
||||
# "Real data" test
|
||||
|
||||
|
@@ -21,7 +21,7 @@
|
||||
|
||||
std::atomic<int64_t> transactions;
|
||||
|
||||
constexpr int kBaseSearchDepth = 32;
|
||||
constexpr int kBaseSearchDepth = 115;
|
||||
constexpr int kWindowSize = 10000000;
|
||||
|
||||
std::string numToKey(int64_t num) {
|
||||
|
97
SkipList.cpp
97
SkipList.cpp
@@ -22,6 +22,7 @@
|
||||
|
||||
#include "ConflictSet.h"
|
||||
#include "Internal.h"
|
||||
#include "Metrics.h"
|
||||
|
||||
#include <algorithm>
|
||||
#include <span>
|
||||
@@ -434,13 +435,14 @@ public:
|
||||
return result;
|
||||
}
|
||||
|
||||
void detectConflicts(ReadConflictRange *ranges, int count,
|
||||
ConflictSet::Result *transactionConflictStatus) const {
|
||||
// Return number of iterations of main loop
|
||||
int detectConflicts(ReadConflictRange *ranges, int count,
|
||||
ConflictSet::Result *transactionConflictStatus) const {
|
||||
const int M = 16;
|
||||
int nextJob[M];
|
||||
CheckMax inProgress[M];
|
||||
if (!count)
|
||||
return;
|
||||
return 0;
|
||||
|
||||
int started = std::min(M, count);
|
||||
for (int i = 0; i < started; i++) {
|
||||
@@ -451,8 +453,9 @@ public:
|
||||
|
||||
int prevJob = started - 1;
|
||||
int job = 0;
|
||||
int iters = 0;
|
||||
// vtune: 340 parts
|
||||
while (true) {
|
||||
for (;; ++iters) {
|
||||
if (inProgress[job].advance()) {
|
||||
if (started == count) {
|
||||
if (prevJob == job)
|
||||
@@ -468,6 +471,7 @@ public:
|
||||
prevJob = job;
|
||||
job = nextJob[job];
|
||||
}
|
||||
return iters;
|
||||
}
|
||||
|
||||
void find(const StringRef *values, Finger *results, int *temp, int count) {
|
||||
@@ -702,15 +706,27 @@ private:
|
||||
};
|
||||
};
|
||||
|
||||
struct ReadContext {
|
||||
int64_t commits_accum = 0;
|
||||
int64_t conflicts_accum = 0;
|
||||
int64_t too_olds_accum = 0;
|
||||
int64_t check_bytes_accum = 0;
|
||||
};
|
||||
|
||||
struct __attribute__((visibility("hidden"))) ConflictSet::Impl {
|
||||
Impl(int64_t oldestVersion)
|
||||
: oldestVersion(oldestVersion), newestVersion(oldestVersion),
|
||||
skipList(oldestVersion) {}
|
||||
skipList(oldestVersion) {
|
||||
metrics = initMetrics(metricsList, metricsCount);
|
||||
}
|
||||
~Impl() { safe_free(metrics, metricsCount * sizeof(metrics[0])); }
|
||||
void check(const ConflictSet::ReadRange *reads, ConflictSet::Result *results,
|
||||
int count) const {
|
||||
int count) {
|
||||
ReadContext tls;
|
||||
Arena arena;
|
||||
auto *ranges = new (arena) ReadConflictRange[count];
|
||||
for (int i = 0; i < count; ++i) {
|
||||
tls.check_bytes_accum += reads[i].begin.len + reads[i].end.len;
|
||||
ranges[i].begin = {reads[i].begin.p, size_t(reads[i].begin.len)};
|
||||
ranges[i].end = reads[i].end.len > 0
|
||||
? StringRef{reads[i].end.p, size_t(reads[i].end.len)}
|
||||
@@ -718,13 +734,22 @@ struct __attribute__((visibility("hidden"))) ConflictSet::Impl {
|
||||
ranges[i].version = reads[i].readVersion;
|
||||
results[i] = ConflictSet::Commit;
|
||||
}
|
||||
skipList.detectConflicts(ranges, count, results);
|
||||
int iters = skipList.detectConflicts(ranges, count, results);
|
||||
for (int i = 0; i < count; ++i) {
|
||||
if (reads[i].readVersion < oldestVersion ||
|
||||
reads[i].readVersion < newestVersion - 2e9) {
|
||||
results[i] = TooOld;
|
||||
}
|
||||
tls.commits_accum += results[i] == Commit;
|
||||
tls.conflicts_accum += results[i] == Conflict;
|
||||
tls.too_olds_accum += results[i] == TooOld;
|
||||
}
|
||||
range_read_iterations_total.add(iters);
|
||||
range_read_total.add(count);
|
||||
commits_total.add(tls.commits_accum);
|
||||
conflicts_total.add(tls.conflicts_accum);
|
||||
too_olds_total.add(tls.too_olds_accum);
|
||||
check_bytes_total.add(tls.check_bytes_accum);
|
||||
}
|
||||
|
||||
void addWrites(const ConflictSet::WriteRange *writes, int count,
|
||||
@@ -788,6 +813,9 @@ struct __attribute__((visibility("hidden"))) ConflictSet::Impl {
|
||||
}
|
||||
|
||||
void setOldestVersion(int64_t oldestVersion) {
|
||||
// This isn't 100% accurate. It overcounts if you hit the end
|
||||
gc_iterations_total.add(keyUpdates);
|
||||
|
||||
assert(oldestVersion >= this->oldestVersion);
|
||||
this->oldestVersion = oldestVersion;
|
||||
SkipList::Finger finger;
|
||||
@@ -802,6 +830,54 @@ struct __attribute__((visibility("hidden"))) ConflictSet::Impl {
|
||||
|
||||
int64_t totalBytes = 0;
|
||||
|
||||
MetricsV1 *metrics;
|
||||
int metricsCount = 0;
|
||||
Metric *metricsList = nullptr;
|
||||
|
||||
#define GAUGE(name, help) \
|
||||
Gauge name { metricsList, metricsCount, #name, help }
|
||||
#define COUNTER(name, help) \
|
||||
Counter name { metricsList, metricsCount, #name, help }
|
||||
// ==================== METRICS DEFINITIONS ====================
|
||||
COUNTER(range_read_total, "Total number of range reads checked");
|
||||
COUNTER(range_read_iterations_total,
|
||||
"Total number of iterations of the main loops for range read checks");
|
||||
COUNTER(commits_total,
|
||||
"Total number of checks where the result is \"commit\"");
|
||||
COUNTER(conflicts_total,
|
||||
"Total number of checks where the result is \"conflict\"");
|
||||
COUNTER(too_olds_total,
|
||||
"Total number of checks where the result is \"too old\"");
|
||||
COUNTER(check_bytes_total, "Total number of key bytes checked");
|
||||
GAUGE(memory_bytes, "Total number of bytes in use");
|
||||
COUNTER(nodes_allocated_total,
|
||||
"The total number of physical tree nodes allocated");
|
||||
COUNTER(nodes_released_total,
|
||||
"The total number of physical tree nodes released");
|
||||
COUNTER(insert_iterations_total,
|
||||
"The total number of iterations of the main loop for insertion. "
|
||||
"Includes searches where the entry already existed, and so insertion "
|
||||
"did not take place");
|
||||
COUNTER(entries_inserted_total,
|
||||
"The total number of entries inserted in the tree");
|
||||
COUNTER(entries_erased_total,
|
||||
"The total number of entries erased from the tree");
|
||||
COUNTER(
|
||||
gc_iterations_total,
|
||||
"The total number of iterations of the main loop for garbage collection");
|
||||
COUNTER(write_bytes_total, "Total number of key bytes in calls to addWrites");
|
||||
GAUGE(oldest_version,
|
||||
"The lowest version that doesn't result in \"TooOld\" for checks");
|
||||
GAUGE(newest_version, "The version of the most recent call to addWrites");
|
||||
// ==================== END METRICS DEFINITIONS ====================
|
||||
#undef GAUGE
|
||||
#undef COUNTER
|
||||
|
||||
void getMetricsV1(MetricsV1 **metrics, int *count) {
|
||||
*metrics = this->metrics;
|
||||
*count = metricsCount;
|
||||
}
|
||||
|
||||
private:
|
||||
int64_t keyUpdates = 0;
|
||||
Arena removalArena;
|
||||
@@ -824,6 +900,7 @@ void internal_addWrites(ConflictSet::Impl *impl,
|
||||
mallocBytesDelta = 0;
|
||||
impl->addWrites(writes, count, writeVersion);
|
||||
impl->totalBytes += mallocBytesDelta;
|
||||
impl->memory_bytes.set(impl->totalBytes);
|
||||
#if SHOW_MEMORY
|
||||
if (impl->totalBytes != mallocBytes) {
|
||||
abort();
|
||||
@@ -835,6 +912,7 @@ void internal_setOldestVersion(ConflictSet::Impl *impl, int64_t oldestVersion) {
|
||||
mallocBytesDelta = 0;
|
||||
impl->setOldestVersion(oldestVersion);
|
||||
impl->totalBytes += mallocBytesDelta;
|
||||
impl->memory_bytes.set(impl->totalBytes);
|
||||
#if SHOW_MEMORY
|
||||
if (impl->totalBytes != mallocBytes) {
|
||||
abort();
|
||||
@@ -858,12 +936,11 @@ int64_t internal_getBytes(ConflictSet::Impl *impl) { return impl->totalBytes; }
|
||||
|
||||
void internal_getMetricsV1(ConflictSet::Impl *impl,
|
||||
ConflictSet::MetricsV1 **metrics, int *count) {
|
||||
*metrics = nullptr;
|
||||
*count = 0;
|
||||
return impl->getMetricsV1(metrics, count);
|
||||
}
|
||||
|
||||
double internal_getMetricValue(const ConflictSet::MetricsV1 *metric) {
|
||||
return 0;
|
||||
return ((Metric *)metric->p)->value.load(std::memory_order_relaxed);
|
||||
}
|
||||
|
||||
void ConflictSet::check(const ReadRange *reads, Result *results,
|
||||
|
BIN
corpus/008e3be49d62c3e7fa3785b882bdb65ee4b68977
Normal file
BIN
corpus/008e3be49d62c3e7fa3785b882bdb65ee4b68977
Normal file
Binary file not shown.
BIN
corpus/0292e5991e94d8861e8240171e7ce2c0a9742616
Normal file
BIN
corpus/0292e5991e94d8861e8240171e7ce2c0a9742616
Normal file
Binary file not shown.
BIN
corpus/0390280ec499c5f687428e700028c230e8ce944e
Normal file
BIN
corpus/0390280ec499c5f687428e700028c230e8ce944e
Normal file
Binary file not shown.
BIN
corpus/05a9e20eac1e7efb9b40fa032c35f76f87622210
Normal file
BIN
corpus/05a9e20eac1e7efb9b40fa032c35f76f87622210
Normal file
Binary file not shown.
BIN
corpus/076952738748aac93fca3e1e59b104547e4177ba
Normal file
BIN
corpus/076952738748aac93fca3e1e59b104547e4177ba
Normal file
Binary file not shown.
BIN
corpus/0b1ed19f50f707d5e805bcbed195bff0bcad8c7c
Normal file
BIN
corpus/0b1ed19f50f707d5e805bcbed195bff0bcad8c7c
Normal file
Binary file not shown.
BIN
corpus/0b287addaa1aa43c286023650cd407af888ea016
Normal file
BIN
corpus/0b287addaa1aa43c286023650cd407af888ea016
Normal file
Binary file not shown.
BIN
corpus/10970b15ecff0b0564ef8dc31c30680e5e4a4421
Normal file
BIN
corpus/10970b15ecff0b0564ef8dc31c30680e5e4a4421
Normal file
Binary file not shown.
BIN
corpus/1357a36bfcab4e48cf165b984e1840f3e8c6ce51
Normal file
BIN
corpus/1357a36bfcab4e48cf165b984e1840f3e8c6ce51
Normal file
Binary file not shown.
BIN
corpus/170a0ec4714b5ee34045037b38f038a8e3fa2035
Normal file
BIN
corpus/170a0ec4714b5ee34045037b38f038a8e3fa2035
Normal file
Binary file not shown.
BIN
corpus/175195f4753b812598e59f9d14742c1aeed67180
Normal file
BIN
corpus/175195f4753b812598e59f9d14742c1aeed67180
Normal file
Binary file not shown.
BIN
corpus/198314d10d86adbfb9d14a0a48cb01fd050cdd50
Normal file
BIN
corpus/198314d10d86adbfb9d14a0a48cb01fd050cdd50
Normal file
Binary file not shown.
BIN
corpus/1f1a703161be463bc598349de981d56fecff1f7a
Normal file
BIN
corpus/1f1a703161be463bc598349de981d56fecff1f7a
Normal file
Binary file not shown.
BIN
corpus/23098c203c4d176ab274847ed6131d1e72bb2f79
Normal file
BIN
corpus/23098c203c4d176ab274847ed6131d1e72bb2f79
Normal file
Binary file not shown.
BIN
corpus/23d4c4704607cea96775f90eec72ec444a53327e
Normal file
BIN
corpus/23d4c4704607cea96775f90eec72ec444a53327e
Normal file
Binary file not shown.
BIN
corpus/256d76a7b41e7ed6e7baca0a4968a872f670b40e
Normal file
BIN
corpus/256d76a7b41e7ed6e7baca0a4968a872f670b40e
Normal file
Binary file not shown.
BIN
corpus/26cb93458db8c96971c2dac90d1656309626057c
Normal file
BIN
corpus/26cb93458db8c96971c2dac90d1656309626057c
Normal file
Binary file not shown.
BIN
corpus/288d8bc1d39945470448074ce98e4cc92e95c4df
Normal file
BIN
corpus/288d8bc1d39945470448074ce98e4cc92e95c4df
Normal file
Binary file not shown.
BIN
corpus/2b2a3848abb733ce26310bce956cc299144e2c37
Normal file
BIN
corpus/2b2a3848abb733ce26310bce956cc299144e2c37
Normal file
Binary file not shown.
BIN
corpus/2cbf5f3c9d7c4fe38f2da48096d37d29fa75eec6
Normal file
BIN
corpus/2cbf5f3c9d7c4fe38f2da48096d37d29fa75eec6
Normal file
Binary file not shown.
BIN
corpus/2f850fa41006d53a3b4869295c319f077f585e27
Normal file
BIN
corpus/2f850fa41006d53a3b4869295c319f077f585e27
Normal file
Binary file not shown.
BIN
corpus/3246c5494cf81eb96a15a962352bf3f62cf44188
Normal file
BIN
corpus/3246c5494cf81eb96a15a962352bf3f62cf44188
Normal file
Binary file not shown.
BIN
corpus/32b1f5278c998e688bf7a44d89f54a2c183e75eb
Normal file
BIN
corpus/32b1f5278c998e688bf7a44d89f54a2c183e75eb
Normal file
Binary file not shown.
BIN
corpus/37636f0129daeb11db2665b746ec1d63650ddea7
Normal file
BIN
corpus/37636f0129daeb11db2665b746ec1d63650ddea7
Normal file
Binary file not shown.
BIN
corpus/3b6efa6b4581d3f75d307ecdd5aa53b4fa3fea90
Normal file
BIN
corpus/3b6efa6b4581d3f75d307ecdd5aa53b4fa3fea90
Normal file
Binary file not shown.
BIN
corpus/3feb7520632cdb454178f4fa5b63a5665d739e1c
Normal file
BIN
corpus/3feb7520632cdb454178f4fa5b63a5665d739e1c
Normal file
Binary file not shown.
BIN
corpus/403cac13d939872be09b35ba73712a7026412ad2
Normal file
BIN
corpus/403cac13d939872be09b35ba73712a7026412ad2
Normal file
Binary file not shown.
BIN
corpus/4137466d9c418d90463f635ac6401ec69da598ab
Normal file
BIN
corpus/4137466d9c418d90463f635ac6401ec69da598ab
Normal file
Binary file not shown.
BIN
corpus/4206bbb85073ab30a5f04f17bcec0b6b09dec446
Normal file
BIN
corpus/4206bbb85073ab30a5f04f17bcec0b6b09dec446
Normal file
Binary file not shown.
BIN
corpus/4aee549dc867bd0fa32db38bd1680d66ef1a80e4
Normal file
BIN
corpus/4aee549dc867bd0fa32db38bd1680d66ef1a80e4
Normal file
Binary file not shown.
BIN
corpus/4e12dbd10635705a7230aa0f062e590264828cde
Normal file
BIN
corpus/4e12dbd10635705a7230aa0f062e590264828cde
Normal file
Binary file not shown.
BIN
corpus/4ee3990f6a97d901eaa69a32216a17f9f86e8c77
Normal file
BIN
corpus/4ee3990f6a97d901eaa69a32216a17f9f86e8c77
Normal file
Binary file not shown.
BIN
corpus/54952d3ba4a1dca49238f941dee26d26edc46db2
Normal file
BIN
corpus/54952d3ba4a1dca49238f941dee26d26edc46db2
Normal file
Binary file not shown.
BIN
corpus/57e1c08766ffade2c8221997d16b5e0ad7ecc93c
Normal file
BIN
corpus/57e1c08766ffade2c8221997d16b5e0ad7ecc93c
Normal file
Binary file not shown.
BIN
corpus/5acdc011bd62a40c8e018a2621545bf4e005a903
Normal file
BIN
corpus/5acdc011bd62a40c8e018a2621545bf4e005a903
Normal file
Binary file not shown.
BIN
corpus/5ede0d70336f00fad64d4a617e5b34f53533a306
Normal file
BIN
corpus/5ede0d70336f00fad64d4a617e5b34f53533a306
Normal file
Binary file not shown.
BIN
corpus/63edba2479b48db7458149a7df2e2c224920877c
Normal file
BIN
corpus/63edba2479b48db7458149a7df2e2c224920877c
Normal file
Binary file not shown.
BIN
corpus/6769617662feb59ce9e326d3263cc75951e0a0bc
Normal file
BIN
corpus/6769617662feb59ce9e326d3263cc75951e0a0bc
Normal file
Binary file not shown.
BIN
corpus/688ce2c66897225949c811ce88c2fde511d69047
Normal file
BIN
corpus/688ce2c66897225949c811ce88c2fde511d69047
Normal file
Binary file not shown.
BIN
corpus/6b44ebb59ae80f72048e8c2c5572a7901166a461
Normal file
BIN
corpus/6b44ebb59ae80f72048e8c2c5572a7901166a461
Normal file
Binary file not shown.
BIN
corpus/6bea64428c692936d5017a7bfc9a9bbae4a7c646
Normal file
BIN
corpus/6bea64428c692936d5017a7bfc9a9bbae4a7c646
Normal file
Binary file not shown.
BIN
corpus/6bf94eb62dc0d1ac85f7529f3efbdea197c37c4a
Normal file
BIN
corpus/6bf94eb62dc0d1ac85f7529f3efbdea197c37c4a
Normal file
Binary file not shown.
BIN
corpus/6cc2abc6c19e461912bb07ae9d3031ebb1c6f2a7
Normal file
BIN
corpus/6cc2abc6c19e461912bb07ae9d3031ebb1c6f2a7
Normal file
Binary file not shown.
BIN
corpus/6edf9950965a9643a3f5611164e77fdcc3f31b99
Normal file
BIN
corpus/6edf9950965a9643a3f5611164e77fdcc3f31b99
Normal file
Binary file not shown.
BIN
corpus/73894bc13e0bae69f58b228e148341143ebd5a8a
Normal file
BIN
corpus/73894bc13e0bae69f58b228e148341143ebd5a8a
Normal file
Binary file not shown.
BIN
corpus/74ebc76aa3859fb9db3b51af55713cbd845f99f0
Normal file
BIN
corpus/74ebc76aa3859fb9db3b51af55713cbd845f99f0
Normal file
Binary file not shown.
BIN
corpus/7754ffffb55baeb3e25d9c772d11e0efec95f751
Normal file
BIN
corpus/7754ffffb55baeb3e25d9c772d11e0efec95f751
Normal file
Binary file not shown.
BIN
corpus/7879186e12b1fa9339efa2aa37e80136df0e427c
Normal file
BIN
corpus/7879186e12b1fa9339efa2aa37e80136df0e427c
Normal file
Binary file not shown.
BIN
corpus/79e82b2aeffca8c33516ce8723ac5acfa85e2c61
Normal file
BIN
corpus/79e82b2aeffca8c33516ce8723ac5acfa85e2c61
Normal file
Binary file not shown.
BIN
corpus/7badef6c646baf6f1ac4aadedcb3842be1dd876c
Normal file
BIN
corpus/7badef6c646baf6f1ac4aadedcb3842be1dd876c
Normal file
Binary file not shown.
BIN
corpus/7e7b26c627325c68b5de1cb17d7e0bd35f6e2039
Normal file
BIN
corpus/7e7b26c627325c68b5de1cb17d7e0bd35f6e2039
Normal file
Binary file not shown.
BIN
corpus/7e7b3164f81316a25b103f3b391867692ea5cec0
Normal file
BIN
corpus/7e7b3164f81316a25b103f3b391867692ea5cec0
Normal file
Binary file not shown.
BIN
corpus/834f54738de969afb72c5355bc6bf226aee2bc46
Normal file
BIN
corpus/834f54738de969afb72c5355bc6bf226aee2bc46
Normal file
Binary file not shown.
BIN
corpus/83fb951c0b10b3a0beffbb100314c717a8085c05
Normal file
BIN
corpus/83fb951c0b10b3a0beffbb100314c717a8085c05
Normal file
Binary file not shown.
BIN
corpus/841521614f7ecab8ba225275035ad413024dd552
Normal file
BIN
corpus/841521614f7ecab8ba225275035ad413024dd552
Normal file
Binary file not shown.
BIN
corpus/845ac7d3ef2e4e3844308ba4aa966cef34dae1c7
Normal file
BIN
corpus/845ac7d3ef2e4e3844308ba4aa966cef34dae1c7
Normal file
Binary file not shown.
BIN
corpus/86707e4f00fefde1e3fde7e5d3d66260658f0dbc
Normal file
BIN
corpus/86707e4f00fefde1e3fde7e5d3d66260658f0dbc
Normal file
Binary file not shown.
BIN
corpus/8ad5c9dd3bc2f5323dc895bd924c45351413ee4d
Normal file
BIN
corpus/8ad5c9dd3bc2f5323dc895bd924c45351413ee4d
Normal file
Binary file not shown.
BIN
corpus/8c41ef3f7296bfb6205b075316ef446b481031fd
Normal file
BIN
corpus/8c41ef3f7296bfb6205b075316ef446b481031fd
Normal file
Binary file not shown.
BIN
corpus/9010fce51ca20e78fadcf10003ad80dec1a92b38
Normal file
BIN
corpus/9010fce51ca20e78fadcf10003ad80dec1a92b38
Normal file
Binary file not shown.
BIN
corpus/927404b87e7cf01180250b4c9310efa8911462e4
Normal file
BIN
corpus/927404b87e7cf01180250b4c9310efa8911462e4
Normal file
Binary file not shown.
BIN
corpus/9a4c784fc270a66e635d42ca267ae9edeca2b948
Normal file
BIN
corpus/9a4c784fc270a66e635d42ca267ae9edeca2b948
Normal file
Binary file not shown.
BIN
corpus/9ae60c538e98c4569e1ed1744ee5be7cc8d02c51
Normal file
BIN
corpus/9ae60c538e98c4569e1ed1744ee5be7cc8d02c51
Normal file
Binary file not shown.
BIN
corpus/9be9e164978a0553b3a1cfe45c197ec1159ee7d0
Normal file
BIN
corpus/9be9e164978a0553b3a1cfe45c197ec1159ee7d0
Normal file
Binary file not shown.
BIN
corpus/9c3032fc7003dbee823e55556bc24c5f5833311e
Normal file
BIN
corpus/9c3032fc7003dbee823e55556bc24c5f5833311e
Normal file
Binary file not shown.
BIN
corpus/a1a4d54aea9674d4b415cdae8626b6991e01ed1e
Normal file
BIN
corpus/a1a4d54aea9674d4b415cdae8626b6991e01ed1e
Normal file
Binary file not shown.
BIN
corpus/a4b24364f0a23987e8eeac1ef66e16e91766ff92
Normal file
BIN
corpus/a4b24364f0a23987e8eeac1ef66e16e91766ff92
Normal file
Binary file not shown.
BIN
corpus/a4f4b06d1c524d09ad4b9515353f0dcbc1e8ed92
Normal file
BIN
corpus/a4f4b06d1c524d09ad4b9515353f0dcbc1e8ed92
Normal file
Binary file not shown.
BIN
corpus/a7298a2735842a9f9a9f7c40c1f940df308c4107
Normal file
BIN
corpus/a7298a2735842a9f9a9f7c40c1f940df308c4107
Normal file
Binary file not shown.
BIN
corpus/a8614158379e0b3f8eec546e17d3f73a9b8e81fe
Normal file
BIN
corpus/a8614158379e0b3f8eec546e17d3f73a9b8e81fe
Normal file
Binary file not shown.
BIN
corpus/aa26947b4c530eb1cd226950fe6202958dc9a755
Normal file
BIN
corpus/aa26947b4c530eb1cd226950fe6202958dc9a755
Normal file
Binary file not shown.
BIN
corpus/af593f241017f854b87f692ed318d7935d34510f
Normal file
BIN
corpus/af593f241017f854b87f692ed318d7935d34510f
Normal file
Binary file not shown.
BIN
corpus/b216fa66614fbd934e587e97f85f72ac7965f8ff
Normal file
BIN
corpus/b216fa66614fbd934e587e97f85f72ac7965f8ff
Normal file
Binary file not shown.
BIN
corpus/b5814790889fd3452daa4beed6f1167ee1986a17
Normal file
BIN
corpus/b5814790889fd3452daa4beed6f1167ee1986a17
Normal file
Binary file not shown.
BIN
corpus/b73d259e5934e4275aef3298f16aeaf63b294a84
Normal file
BIN
corpus/b73d259e5934e4275aef3298f16aeaf63b294a84
Normal file
Binary file not shown.
BIN
corpus/bc32def2213b5758b2e03413209c2f67e2768ca4
Normal file
BIN
corpus/bc32def2213b5758b2e03413209c2f67e2768ca4
Normal file
Binary file not shown.
BIN
corpus/be536e15193fbf20b4c6daf9da5543d4a5048ea0
Normal file
BIN
corpus/be536e15193fbf20b4c6daf9da5543d4a5048ea0
Normal file
Binary file not shown.
BIN
corpus/bf103ed62958ca20d91b5cc9774c1977b190f251
Normal file
BIN
corpus/bf103ed62958ca20d91b5cc9774c1977b190f251
Normal file
Binary file not shown.
BIN
corpus/c1cc87e1bdfb7e6a6d2e039bf7686c169a7d2bfb
Normal file
BIN
corpus/c1cc87e1bdfb7e6a6d2e039bf7686c169a7d2bfb
Normal file
Binary file not shown.
BIN
corpus/c49c4863fef47396b5d588a453275289c66e13cf
Normal file
BIN
corpus/c49c4863fef47396b5d588a453275289c66e13cf
Normal file
Binary file not shown.
BIN
corpus/c7937b0759b0319ef1eaa9e938bc2fae4a1bb9e3
Normal file
BIN
corpus/c7937b0759b0319ef1eaa9e938bc2fae4a1bb9e3
Normal file
Binary file not shown.
BIN
corpus/cc297c7df1c523973836d6eed05187664cf8b028
Normal file
BIN
corpus/cc297c7df1c523973836d6eed05187664cf8b028
Normal file
Binary file not shown.
BIN
corpus/cdf9b63169be156e3d3981f0046d63a833a8a9d4
Normal file
BIN
corpus/cdf9b63169be156e3d3981f0046d63a833a8a9d4
Normal file
Binary file not shown.
BIN
corpus/cfaba94477a30e01d857f9e63b26f04ade740205
Normal file
BIN
corpus/cfaba94477a30e01d857f9e63b26f04ade740205
Normal file
Binary file not shown.
BIN
corpus/cfd924c0ac6d2c4b8b091373cc110094c8ad47d1
Normal file
BIN
corpus/cfd924c0ac6d2c4b8b091373cc110094c8ad47d1
Normal file
Binary file not shown.
BIN
corpus/d12ac70ac49ad2d5b8fdc2cb1f800f9702c395bf
Normal file
BIN
corpus/d12ac70ac49ad2d5b8fdc2cb1f800f9702c395bf
Normal file
Binary file not shown.
BIN
corpus/d426172fde1e278c2c00cb6618ecb0fc18f246b6
Normal file
BIN
corpus/d426172fde1e278c2c00cb6618ecb0fc18f246b6
Normal file
Binary file not shown.
BIN
corpus/dba9de8358577750602a49cc36bfcdc1961f99f2
Normal file
BIN
corpus/dba9de8358577750602a49cc36bfcdc1961f99f2
Normal file
Binary file not shown.
BIN
corpus/dcbb39e697bfa20d9540b4cfe3560b90dafab2f8
Normal file
BIN
corpus/dcbb39e697bfa20d9540b4cfe3560b90dafab2f8
Normal file
Binary file not shown.
BIN
corpus/dce5be7f32f8303efb13a259c509d18df6baec4c
Normal file
BIN
corpus/dce5be7f32f8303efb13a259c509d18df6baec4c
Normal file
Binary file not shown.
BIN
corpus/dfcae858f0376f68bba82dd4285c36e045997c06
Normal file
BIN
corpus/dfcae858f0376f68bba82dd4285c36e045997c06
Normal file
Binary file not shown.
BIN
corpus/e8a5b4c5982787a48fd8f410012bed2e25ded753
Normal file
BIN
corpus/e8a5b4c5982787a48fd8f410012bed2e25ded753
Normal file
Binary file not shown.
BIN
corpus/e9b37fd80338dbffa6b85349766cb4990c62a322
Normal file
BIN
corpus/e9b37fd80338dbffa6b85349766cb4990c62a322
Normal file
Binary file not shown.
Some files were not shown because too many files have changed in this diff Show More
Reference in New Issue
Block a user