Remove dead branches from the fast translation
Drop predicate operands and unreachable arms that dispatch and readable invariants fix, and extend the exhaustive sweep to cover every branch side. Gate coverage on branch coverage as well.
This commit is contained in:
1 parent
3bb5d062ff
commit
73e371fb40
4 files changed
+101
-172
No files matched your search
@@ -3,12 +3,12 @@
|
||||
//
|
||||
// The fuzzers sample readable instances; this test enumerates them: every
|
||||
// sorted database (up to four keys) over a fixed universe of interesting keys,
|
||||
// every selector key (including ⊥ and ⊤) paired with offsets in [-3, 4], and
|
||||
// every selector key (including ⊥ and ⊤) paired with offsets in [-3, 5], and
|
||||
// every readable result (the complete traversal, each nonempty truncated
|
||||
// prefix, or the empty result when the traversal is empty) in both directions.
|
||||
//
|
||||
// Together with `golden_test`, `diff_corpus`, and `extreme_test`, this covers
|
||||
// every line of `src/fast.cpp`.
|
||||
// every line and branch side of `src/fast.cpp`.
|
||||
#include <algorithm>
|
||||
#include <bit>
|
||||
#include <cstdint>
|
||||
@@ -24,7 +24,9 @@ namespace {
|
||||
|
||||
using namespace cr;
|
||||
|
||||
const Int kOffsets[] = {-3, -2, -1, 0, 1, 2, 3, 4};
|
||||
// Offset 5 is what lets the default sweep exercise the last three
|
||||
// short-circuit branch sides in `fast.cpp` (all in crossed subtrees).
|
||||
const Int kOffsets[] = {-3, -2, -1, 0, 1, 2, 3, 4, 5};
|
||||
|
||||
void check(const RangeRead& r, const Result& res, long long& cases,
|
||||
long long& bad, const char* kind, Int bo, Int eo, bool reverse,
|
||||
|
||||
Reference in new issue
Block a user