210   std::vector<float> gemm_times;  in benchmark_gemm_sizes()  local
220     gemm_times.push_back(  in benchmark_gemm_sizes()
228   std::sort(gemm_times.begin(), gemm_times.end());  in benchmark_gemm_sizes()
234   const size_t count_trimmed = gemm_times.size() * trim_ratio;  in benchmark_gemm_sizes()
238   const size_t count_best = gemm_times.size() * best_ratio;  in benchmark_gemm_sizes()
240   for (size_t i = 0; i < gemm_times.size(); i++) {  in benchmark_gemm_sizes()
241     sum_gemm_times += gemm_times[i];  in benchmark_gemm_sizes()
242     if (i >= count_trimmed && i < gemm_times.size() - count_trimmed) {  in benchmark_gemm_sizes()
243       sum_gemm_times_trimmed += gemm_times[i];  in benchmark_gemm_sizes()
247       sum_gemm_times_best += gemm_times[i];  in benchmark_gemm_sizes()
252   const double min_latency = gemm_times.front();  in benchmark_gemm_sizes()
253   const double max_latency = gemm_times.back();  in benchmark_gemm_sizes()
254   const double mean_latency = sum_gemm_times / gemm_times.size();  in benchmark_gemm_sizes()
259   std::cout << "Graph latency (over " << gemm_times.size()  in benchmark_gemm_sizes()