43   const size_t kc = state.range(2);  in GEMMBenchmark()  local
46   const size_t kc_stride = benchmark::utils::RoundUp(kc, kr);  in GEMMBenchmark()
53   std::vector<uint8_t> a(mc * kc);  in GEMMBenchmark()
55   std::vector<uint8_t> k(nc * kc);  in GEMMBenchmark()
69 …xnn_pack_qu8_gemm_goi_w(1 /* groups */, nc, kc, nr, kr, sr, k.data(), b.data(), w.data(), &packing…  in GEMMBenchmark()
92           mb, nb, kc * sizeof(uint8_t),  in GEMMBenchmark()
93           a.data() + m * kc, kc * sizeof(uint8_t),  in GEMMBenchmark()
107     uint64_t(state.iterations()) * 2 * mc * nc * kc, benchmark::Counter::kIsRate);  in GEMMBenchmark()
148   const size_t kc = state.range(2);  in GemmlowpBenchmark()  local
155   std::vector<uint8_t> a(mc * kc);  in GemmlowpBenchmark()
158   const size_t kElements = nc * kc;  in GemmlowpBenchmark()
182     gemmlowp::MatrixMap<const uint8_t, gemmlowp::MapOrder::RowMajor> AM(a.data(), mc, kc, kc);  in GemmlowpBenchmark()
183 …p<const uint8_t, gemmlowp::MapOrder::ColMajor> BM(k.data() + buffer_index * kElements, kc, nc, kc);  in GemmlowpBenchmark()
196     uint64_t(state.iterations()) * 2 * mc * nc * kc, benchmark::Counter::kIsRate);  in GemmlowpBenchmark()
211   const size_t kc = state.range(2);  in RuyBenchmark()  local
220       nc * (sizeof(uint8_t) * (mc + kc) + sizeof(int32_t)));  in RuyBenchmark()
222   std::vector<uint8_t> a(mc * kc);  in RuyBenchmark()
224   std::vector<uint8_t> k(num_buffers * nc * kc);  in RuyBenchmark()
236   ruy::MakeSimpleLayout(nc, kc, ruy::Order::kRowMajor, ruy_a.mutable_layout());  in RuyBenchmark()
239   ruy::MakeSimpleLayout(kc, mc, ruy::Order::kColMajor, ruy_b.mutable_layout());  in RuyBenchmark()
277     ruy_a.set_data(k.data() + buffer_index * nc * kc);  in RuyBenchmark()
290     uint64_t(state.iterations()) * 2 * mc * nc * kc, benchmark::Counter::kIsRate);  in RuyBenchmark()