Home
last modified time | relevance | path

Searched refs:kTrialCount (Results 1 – 4 of 4) sorted by relevance

/packages/apps/Test/connectivity/sl4n/rapidjson/test/perftest/
Drapidjsontest.cpp66 for (size_t i = 0; i < kTrialCount; i++) { in TEST_F()
76 for (size_t i = 0; i < kTrialCount; i++) { in TEST_F()
86 for (size_t i = 0; i < kTrialCount; i++) { in TEST_F()
95 for (size_t i = 0; i < kTrialCount; i++) { in TEST_F()
104 for (size_t i = 0; i < kTrialCount; i++) { in TEST_F()
113 for (size_t i = 0; i < kTrialCount; i++) { in TEST_F()
123 for (size_t i = 0; i < kTrialCount; i++) { in TEST_F()
132 for (size_t i = 0; i < kTrialCount; i++) { in TEST_F()
141 for (size_t i = 0; i < kTrialCount; i++) { in TEST_F()
150 for (size_t i = 0; i < kTrialCount; i++) { in TEST_F()
[all …]
Dplatformtest.cpp66 for (int i = 0; i < kTrialCount; i++) in TEST_F()
71 for (int i = 0; i < kTrialCount; i++) { in TEST_F()
78 for (int i = 0; i < kTrialCount; i++) { in TEST_F()
85 for (int i = 0; i < kTrialCount * kTrialCount; i++) in TEST_F()
91 for (int i = 0; i < kTrialCount; i++) { in TEST_F()
98 for (int i = 0; i < kTrialCount; i++) { in TEST_F()
105 for (int i = 0; i < kTrialCount; i++) { in TEST_F()
115 for (int i = 0; i < kTrialCount; i++) { in TEST_F()
125 for (int i = 0; i < kTrialCount; i++) { in TEST_F()
137 for (int i = 0; i < kTrialCount; i++) { in TEST_F()
[all …]
Dperftest.h126 static const size_t kTrialCount = 1000; variable
Dmisctest.cpp77 for (size_t i = 0; i < kTrialCount; i++) { in TEST_F()