HomeSort by relevance Sort by last modified time
    Searched refs:RangePair (Results 1 - 7 of 7) sorted by null

  /external/google-benchmark/test/
options_test.cc 12 BENCHMARK(BM_basic)->RangePair(64, 512, 64, 512);
benchmark_test.cc 95 BENCHMARK(BM_SetInsert)->RangePair(1<<10,8<<10, 1,10);
  /external/llvm/unittests/ADT/
SparseMultiSetTest.cpp 173 USet::RangePair RangePair = Set.equal_range(0);
174 USet::iterator B = RangePair.first;
175 USet::iterator E = RangePair.second;
  /external/google-benchmark/include/benchmark/
benchmark_api.h 83 BENCHMARK(BM_SetInsert)->RangePair(1<<10, 8<<10, 1, 512);
412 Benchmark* RangePair(int lo1, int hi1, int lo2, int hi2);
539 BENCHMARK(n)->RangePair((l1), (h1), (l2), (h2))
  /external/llvm/include/llvm/ADT/
SparseMultiSet.h 311 typedef std::pair<iterator, iterator> RangePair;
407 RangePair equal_range(const KeyT &K) {
  /external/google-benchmark/src/
benchmark.cc 300 void RangePair(int lo1, int hi1, int lo2, int hi2);
449 void BenchmarkImp::RangePair(int lo1, int hi1, int lo2, int hi2) {
549 Benchmark* Benchmark::RangePair(int lo1, int hi1, int lo2, int hi2) {
550 imp_->RangePair(lo1, hi1, lo2, hi2);
  /external/llvm/lib/CodeGen/
ScheduleDAGInstrs.cpp 349 Reg2SUnitsMap::RangePair P = Defs.equal_range(Reg);
    [all...]

Completed in 113 milliseconds