Home
last modified time | relevance | path

Searched refs:Iterations (Results 1 - 19 of 19) sorted by relevance

/third_party/benchmark/test/
H A Dinternal_threading_test.cc46 BENCHMARK(BM_MainThread)->Iterations(1)->Threads(1);
47 BENCHMARK(BM_MainThread)->Iterations(1)->Threads(1)->UseRealTime();
48 BENCHMARK(BM_MainThread)->Iterations(1)->Threads(1)->UseManualTime();
49 BENCHMARK(BM_MainThread)->Iterations(1)->Threads(1)->MeasureProcessCPUTime();
51 ->Iterations(1)
56 ->Iterations(1)
61 BENCHMARK(BM_MainThread)->Iterations(1)->Threads(2);
62 BENCHMARK(BM_MainThread)->Iterations(1)->Threads(2)->UseRealTime();
63 BENCHMARK(BM_MainThread)->Iterations(1)->Threads(2)->UseManualTime();
64 BENCHMARK(BM_MainThread)->Iterations(
[all...]
H A Dbenchmark_setup_teardown_test.cc38 ->Iterations(100)
68 ->Iterations(100)
106 ->Iterations(100);
127 ->Iterations(100)
H A Dbenchmark_name_gtest.cc43 TEST(BenchmarkNameTest, Iterations) { in TEST()
H A Dbenchmark_random_interleaving_gtest.cc70 ->Iterations(100)
H A Doptions_test.cc75 BENCHMARK(BM_explicit_iteration_count)->Iterations(42);
H A Dskip_with_error_test.cc139 BENCHMARK(BM_error_during_running_ranged_for)->Arg(1)->Arg(2)->Iterations(5);
H A Dreporter_output_test.cc14 {"^Benchmark %s Time %s CPU %s Iterations$", MR_Next},
829 ->Iterations(5)
960 ->Iterations(5)
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/MCA/
H A DSourceMgr.h32 const unsigned Iterations; member in llvm::mca::SourceMgr
37 : Sequence(S), Current(0), Iterations(Iter ? Iter : DefaultIterations) {} in SourceMgr()
39 unsigned getNumIterations() const { return Iterations; } in getNumIterations()
41 bool hasNext() const { return Current < (Iterations * Sequence.size()); } in hasNext()
/third_party/skia/third_party/externals/swiftshader/third_party/marl/tools/bench/
H A Dbench.go34 Iterations uint
113 Iterations: uint(iterations),
124 Iterations uint `json:"iterations"`
143 Iterations: test.Iterations,
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/
H A DHexagonVectorLoopCarriedReuse.cpp244 int Iterations = -1; member
252 Iterations = -1; in reset()
584 ReuseCandidate.Iterations = Iters; in findValueToReuse()
608 int Iterations = ReuseCandidate.Iterations; in reuseValue() local
614 for (int i = 0; i < Iterations; ++i) { in reuseValue()
640 for (int i = Iterations-1; i >=0 ; --i) { in reuseValue()
/third_party/ltp/testcases/kernel/fs/doio/
H A Diogen.c151 int Iterations; /* # requests to generate (0 --> infinite) */ variable
152 int Time_Mode = 0; /* non-zero if Iterations is in seconds */
420 * While iterations (or forever if Iterations == 0) - compute an in main()
424 infinite = !Iterations; in main()
428 (!Time_Mode && Iterations--) || in main()
429 (Time_Mode && (ts.tv_sec - start_time <= Iterations))) { in main()
459 if (Iterations) { in startup_info()
460 fprintf(stream, "Iterations: %d", Iterations); in startup_info()
466 fprintf(stream, "Iterations in startup_info()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/
H A DDependenceAnalysis.cpp2547 Bound[K].Iterations = A[K].Iterations ? A[K].Iterations : B[K].Iterations; in banerjeeMIVtest()
2746 if (Bound[K].Iterations) { in findBoundsALL()
2749 Bound[K].Iterations); in findBoundsALL()
2752 Bound[K].Iterations); in findBoundsALL()
2785 if (Bound[K].Iterations) { in findBoundsEQ()
2789 SE->getMulExpr(NegativePart, Bound[K].Iterations); in findBoundsEQ()
2792 SE->getMulExpr(PositivePart, Bound[K].Iterations); in findBoundsEQ()
[all...]
/third_party/musl/Benchmark/musl/
H A Dbenchmark_framework.cpp275 registration->Iterations(iterNum); in RegisterSingleBenchmark()
283 registration->Iterations(iterNum); in RegisterSingleBenchmark()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/
H A DDependenceAnalysis.h357 const SCEV *Iterations; member
361 const SCEV *Iterations; member
/third_party/benchmark/bindings/python/google_benchmark/
H A Dbenchmark.cc98 .def("iterations", &Benchmark::Iterations, in NB_MODULE()
/third_party/benchmark/src/
H A Dbenchmark_register.cc366 Benchmark* Benchmark::Iterations(IterationCount n) { in Iterations() function in benchmark::internal::Benchmark
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/
H A DNewGVN.cpp3345 unsigned int Iterations = 0;
3353 ++Iterations;
3401 NumGVNMaxIterations = std::max(NumGVNMaxIterations.getValue(), Iterations);
/third_party/benchmark/include/benchmark/
H A Dbenchmark.h1179 // REQUIRES: `t > 0` and `Iterations` has not been called on this benchmark.
1185 // REQUIRES: `t >= 0` and `Iterations` has not been called on this benchmark.
1195 Benchmark* Iterations(IterationCount n);
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/SelectionDAG/
H A DDAGCombiner.cpp545 SDValue buildSqrtNROneConst(SDValue Arg, SDValue Est, unsigned Iterations,
547 SDValue buildSqrtNRTwoConst(SDValue Arg, SDValue Est, unsigned Iterations,
20614 int Iterations = TLI.getDivRefinementSteps(VT, MF); in BuildDivEstimate() local
20615 if (SDValue Est = TLI.getRecipEstimate(Op, DAG, Enabled, Iterations)) { in BuildDivEstimate()
20619 if (Iterations) { in BuildDivEstimate()
20624 for (int i = 0; i < Iterations; ++i) { in BuildDivEstimate()
20627 if (i == Iterations - 1) { in BuildDivEstimate()
20636 (i == Iterations - 1 ? N : FPOne), NewEst, Flags); in BuildDivEstimate()
20664 unsigned Iterations, in buildSqrtNROneConst()
20676 for (unsigned i = 0; i < Iterations; in buildSqrtNROneConst()
20663 buildSqrtNROneConst(SDValue Arg, SDValue Est, unsigned Iterations, SDNodeFlags Flags, bool Reciprocal) buildSqrtNROneConst() argument
20695 buildSqrtNRTwoConst(SDValue Arg, SDValue Est, unsigned Iterations, SDNodeFlags Flags, bool Reciprocal) buildSqrtNRTwoConst() argument
20753 int Iterations = TLI.getSqrtRefinementSteps(VT, MF); buildSqrtEstimateImpl() local
[all...]

Completed in 53 milliseconds