/libcore/luni/src/test/java/libcore/java/util/ |
OldTreeSetTest.java | 40 for (int counter = 0; counter < objArray.length; counter++) 42 .contains(objArray[counter])); 187 for (int counter = startPos; counter < endPos; counter++) 189 aSubSet.contains(objArray[counter]));
|
/libcore/support/src/test/java/tests/support/ |
Support_ListTest.java | 41 for (int counter = 0; counter < 100; counter++) { 43 elem = list.get(counter); 46 .equals(new Integer(counter))); 117 for (int counter = 0; li.hasNext(); counter++) { 121 .equals(new Integer(counter)));
|
/test/vti/dashboard/src/main/webapp/css/ |
plan_runs.css | 30 .counter {
|
/prebuilts/go/darwin-x86/src/cmd/cover/testdata/ |
main.go | 6 // It knows the coverage counter is called 28 // shorthand for the long counter variable. 31 // check records the location and expected value for a counter. 61 fmt.Fprintf(os.Stderr, "test_go:%d expected count %d got %d [counter %d]\n", b.line, b.count, got, index) 72 // verifyPanic is a special check for the known counter that should be 90 // count returns the count and index for the counter at the specified line. 111 fmt.Fprintln(os.Stderr, "cover_test: no counter for line", line)
|
/prebuilts/go/linux-x86/src/cmd/cover/testdata/ |
main.go | 6 // It knows the coverage counter is called 28 // shorthand for the long counter variable. 31 // check records the location and expected value for a counter. 61 fmt.Fprintf(os.Stderr, "test_go:%d expected count %d got %d [counter %d]\n", b.line, b.count, got, index) 72 // verifyPanic is a special check for the known counter that should be 90 // count returns the count and index for the counter at the specified line. 111 fmt.Fprintln(os.Stderr, "cover_test: no counter for line", line)
|
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Demo/scripts/ |
mboxconvert.py | 79 counter = 0 # for generating unique Message-ID headers
variable 100 global counter
101 counter = counter + 1
102 msgid = "<%s.%d>" % (hex(t), counter)
|
/external/boringssl/src/crypto/chacha/ |
chacha.c | 37 const uint32_t key[8], const uint32_t counter[4]); 41 uint32_t counter) { 44 uint32_t counter_nonce[4]; counter_nonce[0] = counter; 121 uint32_t counter) { 143 input[12] = counter;
|
/external/boringssl/src/crypto/fipsmodule/rsa/ |
blinding.c | 126 unsigned counter; member in struct:bn_blinding_st 151 ret->counter = BN_BLINDING_COUNTER - 1; 172 if (++b->counter == BN_BLINDING_COUNTER) { 177 b->counter = 0; 192 b->counter = BN_BLINDING_COUNTER - 1;
|
/external/compiler-rt/lib/sanitizer_common/tests/ |
sanitizer_stoptheworld_test.cc | 31 volatile int counter; member in struct:__sanitizer::CallbackArgument 35 : counter(0), 43 __sync_fetch_and_add(&callback_argument->counter, 1); 59 int counter_at_init = __sync_fetch_and_add(&callback_argument->counter, 0); 62 if (__sync_fetch_and_add(&callback_argument->counter, 0) !=
|
/external/python/cpython2/Demo/scripts/ |
mboxconvert.py | 79 counter = 0 # for generating unique Message-ID headers variable 100 global counter 101 counter = counter + 1 102 msgid = "<%s.%d>" % (hex(t), counter)
|
/external/tensorflow/tensorflow/core/kernels/batching_util/ |
periodic_function_test.cc | 111 int counter = 0; local 119 [&mu, &counter, &listener]() { 121 counter++; 131 EXPECT_EQ(1, counter); 140 EXPECT_EQ(2, counter);
|
/frameworks/base/libs/hwui/tests/microbench/ |
TaskManagerBench.cpp | 97 atomic_int counter(0); 101 thread->queue().post([&counter]() { counter++; }); 107 if (counter != expected) { 108 printf("Ran %d lambads, should have been %d\n", counter.load(), expected);
|
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
Arrays2Test.java | 123 for (int counter = 0; counter < reversedArray.length; counter++) { 124 reversedArray[counter] = (reversedArray.length - counter - 1); 127 for (int counter = 0; counter < reversedArray.length; counter++) { 129 reversedArray[counter] == counter); [all...] |
/external/tensorflow/tensorflow/contrib/hvx/hexagon_controller/src_impl/ |
graph_functions_wrapper.c | 295 unsigned long long int counter = 0; local 310 counter = GetCounter(info[i]); 311 cum_cycles += counter; 317 counter, 100 * ((double)counter) / total_cycles, cum_cycles, 331 unsigned long long int counter = 0; local 346 counter = GetCounter(info[i]); 347 cum_cycles += counter; 353 counter, 100 * ((double)counter) / total_cycles, cum_cycles [all...] |
/system/core/storaged/ |
storaged_diskstats.cpp | 83 stats->counter = 1; 191 inc->counter = 1; 206 if (dst->counter + src->counter) { 208 ((dst->io_avg * dst->counter) + (src->io_avg * src->counter)) / 209 (dst->counter + src->counter); 211 dst->counter += src->counter; [all...] |
/prebuilts/go/darwin-x86/src/crypto/cipher/ |
gcm.go | 65 // gcm represents a Galois Counter Mode with a specific key. See 75 // NewGCM returns the given 128-bit, block cipher wrapped in Galois Counter Mode 86 // Counter Mode, which accepts nonces of the given length. 148 var counter, tagMask [gcmBlockSize]byte 149 g.deriveCounter(&counter, nonce) 151 g.cipher.Encrypt(tagMask[:], counter[:]) 152 gcmInc32(&counter) 154 g.counterCrypt(out, plaintext, &counter) 177 var counter, tagMask [gcmBlockSize]byte 178 g.deriveCounter(&counter, nonce [all...] |
/prebuilts/go/linux-x86/src/crypto/cipher/ |
gcm.go | 65 // gcm represents a Galois Counter Mode with a specific key. See 75 // NewGCM returns the given 128-bit, block cipher wrapped in Galois Counter Mode 86 // Counter Mode, which accepts nonces of the given length. 148 var counter, tagMask [gcmBlockSize]byte 149 g.deriveCounter(&counter, nonce) 151 g.cipher.Encrypt(tagMask[:], counter[:]) 152 gcmInc32(&counter) 154 g.counterCrypt(out, plaintext, &counter) 177 var counter, tagMask [gcmBlockSize]byte 178 g.deriveCounter(&counter, nonce [all...] |
/external/webrtc/webrtc/modules/remote_bitrate_estimator/ |
remote_bitrate_estimators_test.cc | 96 RateCounterFilter counter(&uplink_, 0, "", ""); 127 RateCounterFilter counter(&uplink_, 0, "", ""); 216 RateCounterFilter counter(&uplink_, 0, "", ""); 234 RateCounterFilter counter(&uplink_, 0, "", ""); 275 RateCounterFilter counter(&uplink_, 0, "Receiver", bwe_names[GetParam()]); 281 PrintResults(kCapacityKbps, counter.GetBitrateStats(), 0, 282 receiver.GetDelayStats(), counter.GetBitrateStats()); 289 RateCounterFilter counter(&uplink_, 0, "Receiver", bwe_names[GetParam()]); 301 counter.GetBitrateStats(), 0, receiver.GetDelayStats(), 302 counter.GetBitrateStats()) [all...] |
/bionic/tests/ |
time_test.cpp | 365 struct Counter { 379 explicit Counter(void (*fn)(sigval_t)) : value(0), timer_valid(false) { 392 ~Counter() { 415 Counter* cd = reinterpret_cast<Counter*>(value.sival_ptr); 420 Counter* cd = reinterpret_cast<Counter*>(value.sival_ptr); 429 Counter counter(Counter::CountAndDisarmNotifyFunction) [all...] |
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/generators/ |
DSAParametersGenerator.java | 167 for (int counter = 0; counter < 4096; ++counter) 199 return new DSAParameters(p, q, g, new DSAValidationParameters(seed, counter)); 273 // 11. For counter = 0 to (4L ? 1) do 275 for (int counter = 0; counter < counterLimit; ++counter) 314 // (optionally) the values of domain_parameter_seed and counter. 320 return new DSAParameters(p, q, g, new DSAValidationParameters(seed, counter, usageIndex)) [all...] |
/frameworks/av/media/libstagefright/codecs/m4v_h263/dec/src/ |
chvr_filter.cpp | 35 int index, counter; local 84 for (br = mbr + 1; br < mbr + 3; br++) /* br is the row counter in blocks */ 91 for (bc = mbc; bc < mbc + 2; bc++) /* bc is the column counter in blocks */ 153 for (counter = 0; counter < 5; counter++) 156 sum = sum - v[counter] + *ptr_n; 248 for (br = mbr; br < mbr + 2; br++) /* br is the row counter in blocks */ 250 for (bc = mbc + 1; bc < mbc + 3; bc++) /* bc is the column counter in blocks */ 311 for (counter = 0; counter < 5; counter++ [all...] |
/art/test/566-polymorphic-inlining/src/ |
Main.java | 81 assertEquals(20001, counter); 132 counter++; 134 public static int counter = 0; field in class:Main
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/ |
BEROctetString.java | 78 int counter = 0; 82 return counter < octs.length; 87 return octs[counter++];
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/modes/ |
GCMBlockCipher.java | 20 * Implements the Galois/Counter mode (GCM) detailed in 28 // 2^36-32 : limitation imposed by NIST GCM as otherwise the counter is wrapped and it can leak 52 private byte[] counter; field in class:GCMBlockCipher 209 this.counter = Arrays.clone(J0); 531 counter = Arrays.clone(J0); 613 c += counter[15] & 0xFF; counter[15] = (byte)c; c >>>= 8; 614 c += counter[14] & 0xFF; counter[14] = (byte)c; c >>>= 8; 615 c += counter[13] & 0xFF; counter[13] = (byte)c; c >>>= 8 [all...] |
/external/desugar/test/java/com/google/devtools/build/android/desugar/ |
TryWithResourcesRewriterTest.java | 234 DesugaredThrowableMethodCallCounter counter = local 236 reader.accept(counter, 0); 237 return counter; 248 DesugaredThrowableMethodCallCounter counter = new DesugaredThrowableMethodCallCounter(loader); local 249 reader.accept(counter, 0); 250 return counter; 256 final AtomicInteger counter = new AtomicInteger(); local 264 counter.incrementAndGet(); 271 return counter.get() > 0; 329 AtomicInteger counter = counterMap.get(signature) local [all...] |