| /bionic/tests/ |
| string_benchmark.cpp | 29 static void BM_string_memcmp(int iters, int nbytes) {
37 for (int i = 0; i < iters; ++i) {
42 SetBenchmarkBytesProcessed(int64_t(iters) * int64_t(nbytes));
48 static void BM_string_memcpy(int iters, int nbytes) {
54 for (int i = 0; i < iters; ++i) {
59 SetBenchmarkBytesProcessed(int64_t(iters) * int64_t(nbytes));
65 static void BM_string_memmove(int iters, int nbytes) {
71 for (int i = 0; i < iters; ++i) {
76 SetBenchmarkBytesProcessed(int64_t(iters) * int64_t(nbytes));
81 static void BM_string_memset(int iters, int nbytes)
[all...] |
| math_benchmark.cpp | 25 static void BM_math_sqrt(int iters) {
30 for (int i = 0; i < iters; ++i) {
38 static void BM_math_log10(int iters) {
43 for (int i = 0; i < iters; ++i) {
51 static void BM_math_logb(int iters) {
56 for (int i = 0; i < iters; ++i) {
|
| time_benchmark.cpp | 26 static void BM_time_localtime_tz(int iters) {
31 for (int i = 0; i < iters; ++i) {
|
| /frameworks/rs/tests/latency/ |
| latency.cpp | 11 int iters = 100; local
17 iters = atoi(argv[1]);
18 if (iters <= 0) {
19 printf("iters must be positive\n");
24 printf("iters = %d\n", iters);
75 for (int i = 0; i < iters; i++) {
85 printf("time per iter: %f microseconds\n", (double)elapsed / iters);
89 for (int i = 0; i < iters; i++) {
100 printf("time per iter with copy: %f microseconds\n", (double)elapsed / iters);
[all...] |
| /external/regex-re2/re2/testing/ |
| regexp_benchmark.cc | 105 typedef void SearchImpl(int iters, const char* regexp, const StringPiece& text,
113 typedef void ParseImpl(int iters, const char* regexp, const StringPiece& text);
149 // the text for regexp iters times.
150 void Search(int iters, int nbytes, const char* regexp, SearchImpl* search) {
156 search(iters, regexp, s, Prog::kUnanchored, false);
157 SetBenchmarkBytesProcessed(static_cast<int64>(iters)*nbytes);
239 void SearchBigFixed(int iters, int nbytes, SearchImpl* search) {
249 search(iters, regexp.c_str(), s, Prog::kUnanchored, true);
250 SetBenchmarkBytesProcessed(static_cast<int64>(iters)*nbytes);
266 void FindAndConsume(int iters, int nbytes)
[all...] |
| /frameworks/rs/java/tests/LatencyBenchmark/src/com/example/android/rs/computebench/ |
| compute_benchmark.rs | 20 int iters = 1000000;
27 for (int i = 0; i < iters; i++)
|
| /dalvik/tests/055-enum-performance/src/ |
| Main.java | 76 static public int basis(int iters) {
77 for (int i = iters; i > 0; i--) {
100 return iters * 20;
112 static public int test1(int iters) {
114 for (int i = iters; i > 0; i--) {
137 return iters * 20;
140 static public int test2(int iters) {
142 for (int i = iters; i > 0; i--) {
165 return iters * 20;
168 static public int test3(int iters) {
[all...] |
| /system/extras/micro_bench/ |
| micro_bench.cpp | 105 int iters = cmd_data.args[1]; local
109 for (int i = 0; iters == -1 || i < iters; i++) {
138 int iters = cmd_data.args[1]; local
142 for (int i = 0; iters == -1 || i < iters; i++) {
168 int iters = cmd_data.args[1]; local
180 for (int i = 0; iters == -1 || i < iters; i++) {
209 int iters = cmd_data.args[1] local
252 int iters = cmd_data.args[1]; local
[all...] |