Function BenchLinearizeOptimallyPerCost

src/bench/cluster_linearize.cpp:69–95

}

void BenchLinearizeOptimallyPerCost(benchmark::Bench& bench, const std::string& name, const std::vector<std::vector<uint8_t>>& serializeds)
{
    for (const auto& serialized : serializeds) {
        SpanReader reader{serialized};
        DepGraph<BitSet<64>> depgraph;
        reader >> Using<DepGraphFormatter>(depgraph);
        auto bench_name = strprintf("%s_%utx_%udep", name, depgraph.TxCount(), depgraph.CountDependencies());

        // Determine the cost of 100 rng_seeds.
        uint64_t total_cost = 0;
        for (uint64_t iter = 0; iter < 100; ++iter) {
            auto [_lin, optimal, cost] = Linearize(depgraph, /*max_cost=*/10000000, /*rng_seed=*/iter, IndexTxOrder{});
            total_cost += cost;
        }

        // Benchmark the time per cost.
        bench.name(bench_name).unit("cost").batch(total_cost).run([&] {
            uint64_t recompute_cost = 0;
            for (uint64_t iter = 0; iter < 100; ++iter) {
                auto [_lin, optimal, cost] = Linearize(depgraph, /*max_cost=*/10000000, /*rng_seed=*/iter, IndexTxOrder{});
                assert(optimal);
                recompute_cost += cost;
            }
            assert(total_cost == recompute_cost);
        });
    }
}

} // namespace