|
|
|
#include "hash.h"
|
|
|
|
#include "cases_helper.h"
|
|
|
|
#include "common_code/common_code.h"
|
|
|
|
|
|
|
|
using klotski::cases::Ranges;
|
|
|
|
using klotski::codec::CommonCode;
|
|
|
|
|
|
|
|
static constexpr auto ALL_CASES_XXH3 = std::to_array<uint64_t>({
|
|
|
|
0x71c8ff7a71c93da0, 0x2a5247ee8bfed666, 0xf4efc8fc692d58e2, 0x2d06800538d394c2,
|
|
|
|
0xb3f7cc1b962d6944, 0x7e2792f8ab777faa, 0x4b8e78026cca8a27, 0x2d06800538d394c2,
|
|
|
|
0x8acd688c5ab93c42, 0xedca5101ed81cc77, 0xe8dc9d30c91ce682, 0x2d06800538d394c2,
|
|
|
|
0x2cdf6c14a7ce3e9a, 0xb9dd04a315583f5c, 0x19046e49c44ae90d, 0x2d06800538d394c2,
|
|
|
|
});
|
|
|
|
|
|
|
|
class AllCasesTest : public testing::Test, public Concurrent {
|
|
|
|
protected:
|
|
|
|
void SetUp() override {
|
|
|
|
Reset();
|
|
|
|
EXPECT_FALSE(Available());
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Whether all cases are ready.
|
|
|
|
[[nodiscard]] static bool Available() {
|
|
|
|
return AllCases::instance().is_available();
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Reset all cases build state, note it is thread-unsafe.
|
|
|
|
static void Reset() {
|
|
|
|
exposer::AllCases_available_(AllCases::instance()) = false;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Verify that whether all cases data is correct.
|
|
|
|
static void Verify() {
|
|
|
|
const auto &all_cases = AllCases::instance().fetch();
|
|
|
|
for (int head = 0; head < 16; ++head) {
|
|
|
|
EXPECT_EQ(all_cases[head].size(), ALL_CASES_NUM[head]); // verify all cases size
|
|
|
|
EXPECT_EQ(hash::xxh3(all_cases[head]), ALL_CASES_XXH3[head]); // verify all cases checksum
|
|
|
|
}
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
TEST_FF(AllCases, content) {
|
|
|
|
auto verify = [](const uint64_t head) {
|
|
|
|
auto &cases = AllCases::instance().fetch()[head];
|
|
|
|
|
|
|
|
EXPECT_EQ(cases.size(), ALL_CASES_NUM[head]); // size verify
|
|
|
|
EXPECT_EQ(hash::xxh3(cases), ALL_CASES_XXH3[head]); // checksum verify
|
|
|
|
|
|
|
|
EXPECT_TRUE(std::ranges::is_sorted(cases.begin(), cases.end()));
|
|
|
|
const auto match = std::ranges::adjacent_find(cases.begin(), cases.end());
|
|
|
|
EXPECT_EQ(match, cases.end()); // no duplicates
|
|
|
|
|
|
|
|
auto &all = BasicRanges::instance().fetch(); // subset verify
|
|
|
|
EXPECT_TRUE(std::ranges::includes(all.begin(), all.end(), cases.begin(), cases.end()));
|
|
|
|
|
|
|
|
for (const auto range : cases) {
|
|
|
|
CommonCode::check(head << 32 | range); // release verify
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
for (int head = 0; head < 16; ++head) {
|
|
|
|
if (head % 4 != 3) {
|
|
|
|
verify(head);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
EXPECT_EQ(AllCases::instance().fetch()[head].size(), 0);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_FF(AllCases, constant) {
|
|
|
|
EXPECT_EQ(ALL_CASES_NUM_, 29334498);
|
|
|
|
EXPECT_EQ(ALL_CASES_NUM.size(), 16);
|
|
|
|
EXPECT_EQ(array_sum(ALL_CASES_NUM), ALL_CASES_NUM_);
|
|
|
|
|
|
|
|
auto ranges = BasicRanges::instance().fetch();
|
|
|
|
ranges.reverse();
|
|
|
|
for (int head = 0; head < 16; ++head) {
|
|
|
|
if (head % 4 == 3) {
|
|
|
|
EXPECT_EQ(ALL_CASES_NUM[head], 0);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
Ranges release;
|
|
|
|
ranges.derive(head, release);
|
|
|
|
EXPECT_EQ(release.size(), ALL_CASES_NUM[head]);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_FF(AllCases, all_cases) {
|
|
|
|
AllCases::instance().build();
|
|
|
|
EXPECT_TRUE(Available());
|
|
|
|
Verify();
|
|
|
|
|
|
|
|
AllCases::instance().build();
|
|
|
|
EXPECT_TRUE(Available());
|
|
|
|
Verify();
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_FF(AllCases, all_cases_race) {
|
|
|
|
racer_.Start([] {
|
|
|
|
AllCases::instance().build();
|
|
|
|
});
|
|
|
|
EXPECT_FALSE(Available());
|
|
|
|
racer_.Join();
|
|
|
|
EXPECT_TRUE(Available());
|
|
|
|
Verify();
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_FF(AllCases, all_cases_async) {
|
|
|
|
condition_.clear();
|
|
|
|
AllCases::instance().build_async(executor_.Entry(), [this] {
|
|
|
|
EXPECT_FALSE(condition_.test_and_set());
|
|
|
|
condition_.notify_all();
|
|
|
|
});
|
|
|
|
EXPECT_FALSE(Available());
|
|
|
|
condition_.wait(false);
|
|
|
|
EXPECT_TRUE(Available());
|
|
|
|
Verify();
|
|
|
|
|
|
|
|
condition_.clear();
|
|
|
|
AllCases::instance().build_async(executor_.Entry(), [this] {
|
|
|
|
EXPECT_FALSE(condition_.test_and_set());
|
|
|
|
condition_.notify_all();
|
|
|
|
});
|
|
|
|
EXPECT_TRUE(Available());
|
|
|
|
condition_.wait(false);
|
|
|
|
EXPECT_TRUE(Available());
|
|
|
|
Verify();
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_FF(AllCases, all_cases_async_race) {
|
|
|
|
counter_.store(0);
|
|
|
|
racer_.Start([this] {
|
|
|
|
AllCases::instance().build_async(executor_.Entry(), [this] {
|
|
|
|
counter_.fetch_add(1);
|
|
|
|
});
|
|
|
|
});
|
|
|
|
EXPECT_FALSE(Available());
|
|
|
|
racer_.Join();
|
|
|
|
EXPECT_TRUE(Available());
|
|
|
|
EXPECT_EQ(counter_.load(), racer_.RaceNum());
|
|
|
|
Verify();
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_FF(AllCases, all_cases_async_block) {
|
|
|
|
condition_.clear();
|
|
|
|
serial_.Entry()([this] {
|
|
|
|
AllCases::instance().build_async(serial_.Entry(), [this] {
|
|
|
|
EXPECT_FALSE(condition_.test_and_set());
|
|
|
|
condition_.notify_all();
|
|
|
|
});
|
|
|
|
});
|
|
|
|
EXPECT_FALSE(Available());
|
|
|
|
condition_.wait(false);
|
|
|
|
EXPECT_TRUE(Available());
|
|
|
|
Verify();
|
|
|
|
}
|