weaselbot/conflict-set
1
Fork 0
forked from weaselab/conflict-set
Code Pull Requests Activity

Don't count loop entry as an "iteration"

Browse Source
This commit is contained in:
andrew
2024-07-15 14:46:57 -07:00
parent 9b470a367c
commit ebaac253e2
1 changed files with 3 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files
ConflictSet.cpp
+3 -6
View File
@@ -1732,8 +1732,7 @@ bool checkPointRead(Node *n, const std::span<const uint8_t> key,
fprintf(stderr, "Check point read: %s\n", printable(key).c_str()); fprintf(stderr, "Check point read: %s\n", printable(key).c_str());
#endif #endif
auto remaining = key; auto remaining = key;
for (;;) { for (;; ++point_read_iterations_accum) {
++point_read_iterations_accum;
if (maxVersion(n, impl) <= readVersion) { if (maxVersion(n, impl) <= readVersion) {
++point_read_short_circuit_accum; ++point_read_short_circuit_accum;
return true; return true;
@@ -1812,8 +1811,7 @@ bool checkPrefixRead(Node *n, const std::span<const uint8_t> key,
fprintf(stderr, "Check prefix read: %s\n", printable(key).c_str()); fprintf(stderr, "Check prefix read: %s\n", printable(key).c_str());
#endif #endif
auto remaining = key; auto remaining = key;
for (;;) { for (;; ++prefix_read_iterations_accum) {
++prefix_read_iterations_accum;
auto m = maxVersion(n, impl); auto m = maxVersion(n, impl);
if (remaining.size() == 0) { if (remaining.size() == 0) {
return m <= readVersion; return m <= readVersion;
@@ -2664,8 +2662,7 @@ bool checkRangeReadImpl(Node *n, std::span<const uint8_t> begin,
SearchStepWise search{n, begin.subspan(0, lcp)}; SearchStepWise search{n, begin.subspan(0, lcp)};
Arena arena; Arena arena;
for (;;) { for (;; ++range_read_iterations_accum) {
++range_read_iterations_accum;
assert(getSearchPath(arena, search.n) <=> assert(getSearchPath(arena, search.n) <=>
begin.subspan(0, lcp - search.remaining.size()) == begin.subspan(0, lcp - search.remaining.size()) ==
0); 0);