| /llvm-project-15.0.7/libc/benchmarks/ |
| H A D | LibcMemoryGoogleBenchmarkMain.cpp | 52 const size_t AvgBytesPerIteration = Setup.getBatchBytes() / Setup.BatchSize; in ~Runner() 67 size_t getBatchSize() const { return Setup.BatchSize; } in getBatchSize() 83 const size_t BatchSize = Setup.getBatchSize(); \ 84 while (State.KeepRunningBatch(BatchSize)) \
|
| H A D | LibcMemoryBenchmark.cpp | 84 BatchSize(BufferSize / sizeof(ParameterType)), Parameters(BatchSize) { in ParameterBatch() 85 if (BufferSize <= 0 || BatchSize < 100) in ParameterBatch()
|
| H A D | LibcMemoryBenchmarkMain.cpp | 111 RI.BatchParameterCount = BatchSize; in createStudy() 222 BO.InitialIterations = BatchSize * 10; in run()
|
| H A D | LibcMemoryBenchmark.h | 186 const size_t BatchSize; member
|
| /llvm-project-15.0.7/libcxx/benchmarks/algorithms/ |
| H A D | common.h | 209 enum class BatchSize { enum 216 BatchSize Count, F Body) { in runOpOnCopies() 220 const size_t Batch = Count == BatchSize::CountElements in runOpOnCopies()
|
| H A D | ranges_sort_heap.bench.cpp | 20 state, Quantity, Order::Heap, BatchSize::CountElements, in run()
|
| H A D | ranges_make_heap.bench.cpp | 20 state, Quantity, Order(), BatchSize::CountElements, in run()
|
| H A D | sort_heap.bench.cpp | 20 state, Quantity, Order::Heap, BatchSize::CountElements, in run()
|
| H A D | make_heap.bench.cpp | 20 state, Quantity, Order(), BatchSize::CountElements, in run()
|
| H A D | ranges_make_heap_then_sort_heap.bench.cpp | 19 runOpOnCopies<ValueType>(state, Quantity, Order(), BatchSize::CountElements, in run()
|
| H A D | ranges_sort.bench.cpp | 20 state, Quantity, Order(), BatchSize::CountElements, in run()
|
| H A D | min_max_element.bench.cpp | 19 runOpOnCopies<ValueType>(state, Quantity, Order(), BatchSize::CountElements, [](auto& Copy) { in run()
|
| H A D | ranges_stable_sort.bench.cpp | 20 state, Quantity, Order(), BatchSize::CountElements, in run()
|
| H A D | pop_heap.bench.cpp | 20 state, Quantity, Order(), BatchSize::CountElements, [](auto& Copy) { in run()
|
| H A D | ranges_pop_heap.bench.cpp | 20 state, Quantity, Order(), BatchSize::CountElements, [](auto& Copy) { in run()
|
| H A D | stable_sort.bench.cpp | 20 state, Quantity, Order(), BatchSize::CountElements, in run()
|
| H A D | sort.bench.cpp | 20 state, Quantity, Order(), BatchSize::CountElements, in run()
|
| H A D | make_heap_then_sort_heap.bench.cpp | 19 runOpOnCopies<ValueType>(state, Quantity, Order(), BatchSize::CountElements, in run()
|
| H A D | lower_bound.bench.cpp | 24 …runOpOnCopies<ValueType>(state, Quantity, Order::Ascending, BatchSize::CountBatch, [&](auto& Copy)… in run()
|
| H A D | push_heap.bench.cpp | 20 state, Quantity, Order(), BatchSize::CountElements, [](auto& Copy) { in run()
|
| H A D | ranges_push_heap.bench.cpp | 20 state, Quantity, Order(), BatchSize::CountElements, [](auto& Copy) { in run()
|