Home
last modified time | relevance | path

Searched refs:numLoops (Results 1 – 8 of 8) sorted by relevance

/aosp12/system/libfmq/benchmarks/
H A Dmsgq_benchmark_client.cpp156 uint32_t numLoops = kQueueSize / kPacketSize64; in TEST_F() local
167 for (uint32_t j = 0; j < numLoops; j++) { in TEST_F()
176 accumulatedTime /= (numLoops * kNumIterations); in TEST_F()
202 for (uint32_t j = 0; j < numLoops; j++) { in TEST_F()
210 accumulatedTime /= (numLoops * kNumIterations); in TEST_F()
234 for (uint32_t j = 0; j < numLoops; j++) { in TEST_F()
266 for (uint32_t j = 0; j < numLoops; j++) { in TEST_F()
295 for (uint32_t j = 0; j < numLoops; j++) { in TEST_F()
329 for (uint32_t j = 0; j < numLoops; j++) { in TEST_F()
362 for (uint32_t j = 0; j < numLoops; j++) { in TEST_F()
[all …]
/aosp12/frameworks/av/media/libaaudio/tests/
H A Dtest_block_adapter.cpp125 const int numLoops = 1000; in TEST() local
127 for (int i = 0; i<numLoops && result == 0; i++) { in TEST()
140 const int numLoops = 1000; in TEST() local
142 for (int i = 0; i < numLoops && result == 0; i++) { in TEST()
H A Dtest_clock_model.cpp54 void checkDriftingClock(double hardwareFramesPerSecond, int numLoops) { in checkDriftingClock() argument
68 for (int i = 0; i < numLoops; i++) { in checkDriftingClock()
/aosp12/frameworks/av/media/libaudioprocessing/tests/fuzzer/
H A Dlibaudioprocessing_record_buffer_converter_fuzzer.cpp164 const int numLoops = fdp.ConsumeIntegralInRange<int>(1, 3); in LLVMFuzzerTestOneInput() local
165 for (int loop = 0; loop < numLoops; ++loop) { in LLVMFuzzerTestOneInput()
/aosp12/packages/modules/NetworkStack/tests/unit/src/android/net/shared/
H A DNetdUtilsTest.java61 private void setNetworkAddInterfaceOutcome(final Exception cause, int numLoops) in setNetworkAddInterfaceOutcome() argument
68 if (myCounter.isCounterReached(numLoops)) { in setNetworkAddInterfaceOutcome()
/aosp12/packages/modules/GeoTZ/data_pipeline/src/main/java/com/android/timezone/location/data_pipeline/steps/
H A DTypes.java190 if (one.numLoops() != two.numLoops()) { in s2PolygonEquals()
194 for (int loopIndex = 0; loopIndex < one.numLoops(); loopIndex++) { in s2PolygonEquals()
243 for (int loopIndex = 0; loopIndex < s2Polygon.numLoops(); loopIndex++) { in store()
/aosp12/frameworks/av/media/libstagefright/codecs/aacdec/
H A DSoftAAC2.cpp824 int numLoops = 0; in onQueueFilled() local
839 numLoops++; in onQueueFilled()
890 for (int i = 0; i < numLoops; i++) { in onQueueFilled()
891 n += mDecodedSizes.itemAt(mDecodedSizes.size() - numLoops + i); in onQueueFilled()
/aosp12/frameworks/av/media/libstagefright/codecs/xaacdec/
H A DSoftXAAC.cpp661 int numLoops = 0; in onQueueFilled() local
719 numLoops++; in onQueueFilled()