fix: remove memory allocations, use fixed iteration count

Author: not-matthias

examples/google_benchmark_cmake/helper.hpp

@@ -19,18 +19,8 @@ NOINLINE static uint64_t recursive_fib(int n) {
 }
 
 NOINLINE static uint64_t expensive_operation() {
-  // Large memory allocation
-  std::vector<uint64_t> data(1024 * 1024, 42);  // 8 MiB allocation
-
-  // Expensive recursive computation that will dominate flamegraph
-  uint64_t fib_result = recursive_fib(30);
-
-  // More expensive work
-  uint64_t sum = std::accumulate(data.begin(), data.end(), uint64_t(0));
-  benchmark::DoNotOptimize(sum);
-  benchmark::DoNotOptimize(fib_result);
-
-  return sum + fib_result;
+  // Expensive recursive compuation that will dominate flamegraph
+  return 42 + recursive_fib(30);
 }
 
 #endif  // HELPER_HPP

examples/google_benchmark_cmake/pause_timing_bench.hpp

@@ -25,7 +25,8 @@ static void BM_large_drop(benchmark::State& state) {
     state.ResumeTiming();
   }
 }
-BENCHMARK(BM_large_drop);
+// IMPORTANT: Use fixed iterations, otherwise we'll run for 10+ minutes
+BENCHMARK(BM_large_drop)->Iterations(100);
 
 static void BM_large_setup(benchmark::State& state) {
   for (auto _ : state) {
@@ -36,4 +37,4 @@ static void BM_large_setup(benchmark::State& state) {
     benchmark::DoNotOptimize(actual_work());
   }
 }
-BENCHMARK(BM_large_setup);
+BENCHMARK(BM_large_setup)->Iterations(100);