void BM_dispenso()

in benchmarks/trivial_compute_benchmark.cpp [69:104]

• 31 lines of code
• 4 McCabe index (conditional complexity)

void BM_dispenso(benchmark::State& state) {
  const int num_threads = state.range(0);
  const int num_elements = state.range(1);

  dispenso::ThreadPool pool(num_threads);

  uint64_t sum = 0;
  int foo = 0;

  auto input = getInputs(num_elements);
  for (auto UNUSED_VAR : state) {
    dispenso::TaskSet tasks(pool);

    std::vector<uint64_t> sums;
    sums.reserve(num_threads);
    ++foo;
    dispenso::parallel_for(
        tasks,
        sums,
        []() { return uint64_t{0}; },
        dispenso::makeChunkedRange(0, num_elements, dispenso::ParForChunking::kStatic),
        [input, foo](uint64_t& lsumStore, size_t i, size_t end) {
          uint64_t lsum = 0;
          for (; i != end; ++i) {
            lsum += calculate(input, i, foo);
          }
          lsumStore += lsum;
        });
    sum = 0;
    for (auto s : sums) {
      sum += s;
    }
  }

  checkResults(input, sum, foo, num_elements);
}