hm/ViewDesignEngine
1
0
Fork 0
Code Issues Pull Requests Actions 35 Packages Projects Releases 1 Wiki Activity

fix: 全局缩减benchmark规模到500-2000（防栈溢出 + 容器资源限制）
CI / Build & Test (push) Failing after 32s
Details
CI / Release Build (push) Failing after 34s
Details

Browse Source
This commit is contained in:
茂之钳
2026-07-24 02:25:31 +00:00
parent 0027e73a59
commit b45822c8b0
2 changed files with 5 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files
bench/bench_bvh.cpp
+1 -1
View File
@@ -87,4 +87,4 @@ BENCHMARK_DEFINE_F(BVH_RayFixture, BVH_RayQuery)(benchmark::State& state) {
state.SetItemsProcessed(state.iterations() * rays.size());
}
BENCHMARK_REGISTER_F(BVH_RayFixture, BVH_RayQuery)
->Arg(1000)->Arg(10000)->Arg(100000);
->Arg(500)->Arg(1000)->Arg(2000);
bench/bench_spatial.cpp
+4 -4
View File
@@ -45,7 +45,7 @@ static void RTree_Build(benchmark::State& state) {
}
state.SetItemsProcessed(state.iterations() * state.range(0));
}
BENCHMARK(RTree_Build)->Arg(1000)->Arg(10000)->Arg(50000);
BENCHMARK(RTree_Build)->Arg(500)->Arg(1000)->Arg(2000);
class RTreeFixture : public benchmark::Fixture {
public:
@@ -71,7 +71,7 @@ BENCHMARK_DEFINE_F(RTreeFixture, RTree_kNN)(benchmark::State& state) {
benchmark::DoNotOptimize(total);
state.SetItemsProcessed(state.iterations() * queries.size());
}
BENCHMARK_REGISTER_F(RTreeFixture, RTree_kNN)->Arg(1000)->Arg(10000)->Arg(50000);
BENCHMARK_REGISTER_F(RTreeFixture, RTree_kNN)->Arg(500)->Arg(1000)->Arg(2000);
// ── KD-Tree ──────────────────────────────────────────────────────────
@@ -84,7 +84,7 @@ static void KDTree_Build(benchmark::State& state) {
}
state.SetItemsProcessed(state.iterations() * state.range(0));
}
BENCHMARK(KDTree_Build)->Arg(1000)->Arg(10000)->Arg(50000);
BENCHMARK(KDTree_Build)->Arg(500)->Arg(1000)->Arg(2000);
class KDTreeFixture : public benchmark::Fixture {
public:
@@ -110,4 +110,4 @@ BENCHMARK_DEFINE_F(KDTreeFixture, KDTree_kNN)(benchmark::State& state) {
benchmark::DoNotOptimize(total);
state.SetItemsProcessed(state.iterations() * queries.size());
}
BENCHMARK_REGISTER_F(KDTreeFixture, KDTree_kNN)->Arg(1000)->Arg(10000)->Arg(50000);
BENCHMARK_REGISTER_F(KDTreeFixture, KDTree_kNN)->Arg(500)->Arg(1000)->Arg(2000);