• Home
  • Raw
  • Download

Lines Matching full:family

53 // The size of a benchmark family determines is the number of inputs to repeat
65 // benchmark identifies a family of related benchmarks to run.
70 // Registers a benchmark family and returns the index assigned to it.
71 size_t AddBenchmark(std::unique_ptr<Benchmark> family);
94 size_t BenchmarkFamilies::AddBenchmark(std::unique_ptr<Benchmark> family) { in AddBenchmark() argument
97 families_.push_back(std::move(family)); in AddBenchmark()
124 for (std::unique_ptr<Benchmark>& family : families_) { in FindBenchmarks()
125 // Family was deleted or benchmark doesn't match in FindBenchmarks()
126 if (!family) continue; in FindBenchmarks()
128 if (family->ArgsCnt() == -1) { in FindBenchmarks()
129 family->Args({}); in FindBenchmarks()
132 (family->thread_counts_.empty() in FindBenchmarks()
134 : &static_cast<const std::vector<int>&>(family->thread_counts_)); in FindBenchmarks()
135 const size_t family_size = family->args_.size() * thread_counts->size(); in FindBenchmarks()
139 Err << "The number of inputs is very large. " << family->name_ in FindBenchmarks()
143 // family size. in FindBenchmarks()
146 for (auto const& args : family->args_) { in FindBenchmarks()
149 instance.name = family->name_; in FindBenchmarks()
150 instance.benchmark = family.get(); in FindBenchmarks()
151 instance.report_mode = family->report_mode_; in FindBenchmarks()
153 instance.time_unit = family->time_unit_; in FindBenchmarks()
154 instance.range_multiplier = family->range_multiplier_; in FindBenchmarks()
155 instance.min_time = family->min_time_; in FindBenchmarks()
156 instance.iterations = family->iterations_; in FindBenchmarks()
157 instance.repetitions = family->repetitions_; in FindBenchmarks()
158 instance.use_real_time = family->use_real_time_; in FindBenchmarks()
159 instance.use_manual_time = family->use_manual_time_; in FindBenchmarks()
160 instance.complexity = family->complexity_; in FindBenchmarks()
161 instance.complexity_lambda = family->complexity_lambda_; in FindBenchmarks()
169 if (arg_i < family->arg_names_.size()) { in FindBenchmarks()
170 const auto& arg_name = family->arg_names_[arg_i]; in FindBenchmarks()
173 StringPrintF("%s:", family->arg_names_[arg_i].c_str()); in FindBenchmarks()
181 if (!IsZero(family->min_time_)) in FindBenchmarks()
182 instance.name += StringPrintF("/min_time:%0.3f", family->min_time_); in FindBenchmarks()
183 if (family->iterations_ != 0) in FindBenchmarks()
184 instance.name += StringPrintF("/iterations:%d", family->iterations_); in FindBenchmarks()
185 if (family->repetitions_ != 0) in FindBenchmarks()
186 instance.name += StringPrintF("/repeats:%d", family->repetitions_); in FindBenchmarks()
188 if (family->use_manual_time_) { in FindBenchmarks()
190 } else if (family->use_real_time_) { in FindBenchmarks()
195 if (!family->thread_counts_.empty()) { in FindBenchmarks()
200 instance.last_benchmark_instance = (&args == &family->args_.back()); in FindBenchmarks()