Home
last modified time | relevance | path

Searched refs:benchmark (Results 1 – 25 of 29) sorted by relevance

12

/bionic/benchmarks/
Dtime_benchmark.cpp25 static void BM_time_clock_gettime(benchmark::State& state) { in BM_time_clock_gettime()
34 static void BM_time_clock_gettime_syscall(benchmark::State& state) { in BM_time_clock_gettime_syscall()
43 static void BM_time_clock_gettime_MONOTONIC_COARSE(benchmark::State& state) { in BM_time_clock_gettime_MONOTONIC_COARSE()
52 static void BM_time_clock_gettime_MONOTONIC_RAW(benchmark::State& state) { in BM_time_clock_gettime_MONOTONIC_RAW()
61 static void BM_time_clock_gettime_REALTIME(benchmark::State& state) { in BM_time_clock_gettime_REALTIME()
70 static void BM_time_clock_gettime_REALTIME_COARSE(benchmark::State& state) { in BM_time_clock_gettime_REALTIME_COARSE()
79 static void BM_time_clock_gettime_BOOTTIME(benchmark::State& state) { in BM_time_clock_gettime_BOOTTIME()
88 static void BM_time_clock_getres(benchmark::State& state) { in BM_time_clock_getres()
97 static void BM_time_clock_getres_syscall(benchmark::State& state) { in BM_time_clock_getres_syscall()
106 static void BM_time_clock_getres_MONOTONIC_COARSE(benchmark::State& state) { in BM_time_clock_getres_MONOTONIC_COARSE()
[all …]
Dmath_benchmark.cpp26 static void SetLabel(benchmark::State& state) { in SetLabel()
38 static void BM_math_sqrt(benchmark::State& state) { in BM_math_sqrt()
47 static void BM_math_log10(benchmark::State& state) { in BM_math_log10()
56 static void BM_math_logb(benchmark::State& state) { in BM_math_logb()
65 static void BM_math_isfinite_macro(benchmark::State& state) { in BM_math_isfinite_macro()
75 static void BM_math_isfinite(benchmark::State& state) { in BM_math_isfinite()
85 static void BM_math_isinf_macro(benchmark::State& state) { in BM_math_isinf_macro()
95 static void BM_math_isinf(benchmark::State& state) { in BM_math_isinf()
105 static void BM_math_isnan_macro(benchmark::State& state) { in BM_math_isnan_macro()
115 static void BM_math_isnan(benchmark::State& state) { in BM_math_isnan()
[all …]
Dmalloc_map_benchmark.cpp64 static void MapBenchmark(benchmark::State& state, size_t num_elements) { in MapBenchmark()
97 static void BM_std_map_8(benchmark::State& state) { in BM_std_map_8()
102 static void BM_std_map_16(benchmark::State& state) { in BM_std_map_16()
107 static void BM_std_map_32(benchmark::State& state) { in BM_std_map_32()
112 static void BM_std_map_64(benchmark::State& state) { in BM_std_map_64()
117 static void BM_std_map_96(benchmark::State& state) { in BM_std_map_96()
122 static void BM_std_map_128(benchmark::State& state) { in BM_std_map_128()
127 static void BM_std_map_256(benchmark::State& state) { in BM_std_map_256()
132 static void BM_std_map_512(benchmark::State& state) { in BM_std_map_512()
137 static void BM_std_unordered_map_8(benchmark::State& state) { in BM_std_unordered_map_8()
[all …]
Dstdio_benchmark.cpp38 void ReadWriteTest(benchmark::State& state, Fn f, bool buffered) { in ReadWriteTest()
60 void BM_stdio_fread(benchmark::State& state) { in BM_stdio_fread()
65 void BM_stdio_fwrite(benchmark::State& state) { in BM_stdio_fwrite()
70 void BM_stdio_fread_unbuffered(benchmark::State& state) { in BM_stdio_fread_unbuffered()
75 void BM_stdio_fwrite_unbuffered(benchmark::State& state) { in BM_stdio_fwrite_unbuffered()
81 static void FopenFgetlnFclose(benchmark::State& state, bool no_locking) { in FopenFgetlnFclose()
94 static void BM_stdio_fopen_fgetln_fclose_locking(benchmark::State& state) { in BM_stdio_fopen_fgetln_fclose_locking()
99 void BM_stdio_fopen_fgetln_fclose_no_locking(benchmark::State& state) { in BM_stdio_fopen_fgetln_fclose_no_locking()
105 static void FopenFgetsFclose(benchmark::State& state, bool no_locking) { in FopenFgetsFclose()
118 static void BM_stdio_fopen_fgets_fclose_locking(benchmark::State& state) { in BM_stdio_fopen_fgets_fclose_locking()
[all …]
Dpthread_benchmark.cpp25 static void BM_pthread_self(benchmark::State& state) { in BM_pthread_self()
32 static void BM_pthread_getspecific(benchmark::State& state) { in BM_pthread_getspecific()
44 static void BM_pthread_setspecific(benchmark::State& state) { in BM_pthread_setspecific()
58 static void BM_pthread_once(benchmark::State& state) { in BM_pthread_once()
68 static void BM_pthread_mutex_lock(benchmark::State& state) { in BM_pthread_mutex_lock()
78 static void BM_pthread_mutex_lock_ERRORCHECK(benchmark::State& state) { in BM_pthread_mutex_lock_ERRORCHECK()
88 static void BM_pthread_mutex_lock_RECURSIVE(benchmark::State& state) { in BM_pthread_mutex_lock_RECURSIVE()
117 static void BM_pthread_mutex_lock_PI(benchmark::State& state) { in BM_pthread_mutex_lock_PI()
127 static void BM_pthread_mutex_lock_ERRORCHECK_PI(benchmark::State& state) { in BM_pthread_mutex_lock_ERRORCHECK_PI()
137 static void BM_pthread_mutex_lock_RECURSIVE_PI(benchmark::State& state) { in BM_pthread_mutex_lock_RECURSIVE_PI()
[all …]
Datomic_benchmark.cpp48 void BM_atomic_empty(benchmark::State& state) { in BM_atomic_empty()
55 static void BM_atomic_load_relaxed(benchmark::State& state) { in BM_atomic_load_relaxed()
65 static void BM_atomic_load_acquire(benchmark::State& state) { in BM_atomic_load_acquire()
75 static void BM_atomic_store_release(benchmark::State& state) { in BM_atomic_store_release()
84 static void BM_atomic_store_seq_cst(benchmark::State& state) { in BM_atomic_store_seq_cst()
93 static void BM_atomic_fetch_add_relaxed(benchmark::State& state) { in BM_atomic_fetch_add_relaxed()
103 static void BM_atomic_fetch_add_seq_cst(benchmark::State& state) { in BM_atomic_fetch_add_seq_cst()
116 static void BM_atomic_acquire_fence(benchmark::State& state) { in BM_atomic_acquire_fence()
127 static void BM_atomic_seq_cst_fence(benchmark::State& state) { in BM_atomic_seq_cst_fence()
140 static void BM_atomic_fetch_add_cs(benchmark::State& state) { in BM_atomic_fetch_add_cs()
Dstdlib_benchmark.cpp27 static void MallocFree(benchmark::State& state) { in MallocFree()
33 benchmark::DoNotOptimize(ptr = malloc(nbytes)); in MallocFree()
41 static void BM_stdlib_malloc_free_default(benchmark::State& state) { in BM_stdlib_malloc_free_default()
52 static void BM_stdlib_malloc_free_decay1(benchmark::State& state) { in BM_stdlib_malloc_free_decay1()
62 static void CallocFree(benchmark::State& state) { in CallocFree()
68 benchmark::DoNotOptimize(ptr = calloc(1, nbytes)); in CallocFree()
76 static void BM_stdlib_calloc_free_default(benchmark::State& state) { in BM_stdlib_calloc_free_default()
87 static void BM_stdlib_calloc_free_decay1(benchmark::State& state) { in BM_stdlib_calloc_free_decay1()
97 static void MallocMultiple(benchmark::State& state, size_t nbytes, size_t numAllocs) { in MallocMultiple()
102 benchmark::DoNotOptimize(ptrs[i] = reinterpret_cast<uint8_t*>(malloc(nbytes))); in MallocMultiple()
[all …]
Dstring_benchmark.cpp24 static void BM_string_memcmp(benchmark::State& state) { in BM_string_memcmp()
43 static void BM_string_memcpy(benchmark::State& state) { in BM_string_memcpy()
61 static void BM_string_memmove_non_overlapping(benchmark::State& state) { in BM_string_memmove_non_overlapping()
79 static void BM_string_memmove_overlap_dst_before_src(benchmark::State& state) { in BM_string_memmove_overlap_dst_before_src()
94 static void BM_string_memmove_overlap_src_before_dst(benchmark::State& state) { in BM_string_memmove_overlap_src_before_dst()
109 static void BM_string_memset(benchmark::State& state) { in BM_string_memset()
124 static void BM_string_strlen(benchmark::State& state) { in BM_string_strlen()
141 static void BM_string_strcat_copy_only(benchmark::State& state) { in BM_string_strcat_copy_only()
164 static void BM_string_strcat_seek_only(benchmark::State& state) { in BM_string_strcat_seek_only()
185 static void BM_string_strcat_half_copy_half_seek(benchmark::State& state) { in BM_string_strcat_half_copy_half_seek()
[all …]
Dproperty_benchmark.cpp127 static void BM_property_get(benchmark::State& state) { in BM_property_get()
140 static void BM_property_find(benchmark::State& state) { in BM_property_find()
152 static void BM_property_read(benchmark::State& state) { in BM_property_read()
175 static void BM_property_serial(benchmark::State& state) { in BM_property_serial()
200 static void BM_property_find_real(benchmark::State& state) { in BM_property_find_real()
Dsemaphore_benchmark.cpp26 static void BM_semaphore_sem_getvalue(benchmark::State& state) { in BM_semaphore_sem_getvalue()
37 static void BM_semaphore_sem_wait_sem_post(benchmark::State& state) { in BM_semaphore_sem_wait_sem_post()
Dget_heap_size_benchmark.cpp45 static void BM_mallinfo(benchmark::State& state) { in BM_mallinfo()
75 static void BM_read_statm(benchmark::State& state) { in BM_read_statm()
DREADME.md8 on top of [Google Benchmark](https://github.com/google/benchmark) with some additions to organize
43 The format for a benchmark is:
106 Google Benchmark uses two settings to control how many times to run each benchmark, "iterations" and
107 "repetitions". By default, the repetition count is one. Google Benchmark runs the benchmark a few
110 Google Benchmark can optionally run a benchmark run repeatedly and report statistics (median, mean,
140 To get consistent results between runs, it can sometimes be helpful to restrict a benchmark to
182 …***WARNING*** CPU scaling is enabled, the benchmark real time measurements may be noisy and will i…
Dutil.h47 static void __name(benchmark::State& state) { \
49 benchmark::DoNotOptimize(__expression); \
Dmalloc_sql_benchmark.cpp106 static void BM_malloc_sql_trace_default(benchmark::State& state) { in BM_malloc_sql_trace_default()
117 static void BM_malloc_sql_trace_decay1(benchmark::State& state) { in BM_malloc_sql_trace_decay1()
Dbionic_benchmarks.cpp115 benchmark::Initialize(&fake_argc, fake_argv); in Usage()
216 void LockAndRun(benchmark::State& state, benchmark_func_t func_to_bench, int cpu_to_lock) { in LockAndRun()
221 reinterpret_cast<void(*) (benchmark::State&)>(func_to_bench)(state); in LockAndRun()
370 auto registration = benchmark::RegisterBenchmark(fn_name.c_str(), LockAndRun, in RegisterGoogleBenchmarks()
603 benchmark::Initialize(&new_argc, new_argv.data()); in main()
604 benchmark::RunSpecifiedBenchmarks(); in main()
DAndroid.bp91 // We don't build a static benchmark executable because it's not usually
94 // performance of the old release's libc, and a static benchmark isn't
/bionic/benchmarks/linker_relocation/
DREADME.md3 This benchmark measures the time spent in the dynamic linker to load a large set
7 ## Running the benchmark
9 To run the benchmark, build the `linker-reloc-bench` target, sync `data`, and
10 run the benchmark from `/data/benchmarktest[64]/linker-reloc-bench`.
13 `gen_bench.py --ninja` mode to generate a benchmark. It's useful for
17 ## Regenerating the synthetic benchmark
20 dump, then `regen/gen_bench.py` processes the JSON file into benchmark code.
Drun_bench_with_ninja.sh36 --cc CC C compiler driver to compiler the benchmark with
40 --linker LINKER Run the benchmark using a specific dynamic linker
44 --multitime N Use multitime to run the benchmark N iterations
Dlinker_reloc_bench.cpp39 static void BM_linker_relocation(benchmark::State& state) { in BM_linker_relocation()
55 BENCHMARK(BM_linker_relocation)->UseRealTime()->Unit(benchmark::kMicrosecond);
DAndroid.bp33 // TODO: This benchmark doesn't work with TradeFed/atest because it doesn't copy its test libraries
37 // "link:(shared/static)" variation. It appears that Soong needs to be fixed to make this benchmark
/bionic/linker/
Dlinker_gnu_hash_benchmark.cpp287 static void BM_gnu_hash_simple(benchmark::State& state) { in BM_gnu_hash_simple()
290 benchmark::DoNotOptimize(calculate_gnu_hash_simple(sym_name)); in BM_gnu_hash_simple()
299 static void BM_gnu_hash_neon(benchmark::State& state) { in BM_gnu_hash_neon()
302 benchmark::DoNotOptimize(calculate_gnu_hash_neon(sym_name)); in BM_gnu_hash_neon()
/bionic/docs/
Dlibc_assembler.md6 * First, benchmark the previous version of the routine.
17 Make sure that you benchmark both the big and little cores to verify that
56 Here is an example of how the benchmark should be executed. For this
63 benchmark.
67 how to add a benchmark for a function that doesn't already exist.
74 Bionic benchmarks is based on the [Google Benchmarks](https://github.com/google/benchmark)
82 …***WARNING*** CPU scaling is enabled, the benchmark real time measurements may be noisy and will i…
106 If you want to verify a single benchmark result, you can run a single test
111 Where the argument to the filter argument is the name of the benchmark from
113 guarantee that you only run the single benchmark, you can execute the benchmark
Dnative_allocator.md6 [SQL Allocation Trace Benchmark](#sql-allocation-trace-benchmark),
21 When evaluating a native allocator, make sure that you benchmark both
147 For all of these benchmark runs, it can be useful to add these two options:
152 This will run the benchmark XX times and then give a mean, median, and stddev
159 Which will lock the benchmark to only run on core XX. This also avoids
162 benchmark moves from big to little or vice-versa, this can cause scores
207 This benchmark is designed to verify that there is no performance issue
223 The other variation of this benchmark is to always do forty allocations in
225 benchmark, only the time it takes to do the allocations is tracked, the
249 This benchmark is a trace of the allocations performed when running
[all …]
/bionic/benchmarks/spawn/include/
Dspawn_benchmark.h34 void BM_spawn_test(benchmark::State& state, const char* const* argv);
47 ->Unit(benchmark::kMicrosecond) \
/bionic/benchmarks/tests/
Dbenchmark_test.cpp20 TEST(benchmark, memory_align) { in TEST() argument
32 TEST(benchmark, ptr_align) { in TEST() argument

12