/dalvik/libcore/luni/src/test/java/tests/api/java/util/ |
D | ArraysTest.java | 80 for (int counter = 0; counter < arraySize; counter++) { in test_asList$Ljava_lang_Object() 83 convertedList.get(counter) == objectArray[counter]); in test_asList$Ljava_lang_Object() 95 for (int counter = 0; counter < arraySize; counter++) { in test_asList$Ljava_lang_Object() 98 convertedList.get(counter) == myArray[counter]); in test_asList$Ljava_lang_Object() 120 for (byte counter = 0; counter < arraySize; counter++) in test_binarySearch$BB() 122 Arrays.binarySearch(byteArray, counter) == counter); in test_binarySearch$BB() 128 for (byte counter = 0; counter < arraySize; counter++) in test_binarySearch$BB() 129 byteArray[counter] -= 50; in test_binarySearch$BB() 130 for (byte counter = 0; counter < arraySize; counter++) in test_binarySearch$BB() 133 Arrays.binarySearch(byteArray, (byte) (counter - 50)) == counter); in test_binarySearch$BB() [all …]
|
D | EmptyStackExceptionTest.java | 46 for (int counter = 0; counter < objArray.length + 1; counter++) in test_Constructor() 59 for (int counter = 0; counter < objArray.length; counter++) { in setUp() 60 objArray[counter] = new Integer(counter); in setUp() 64 for (int counter = 0; counter < objArray.length; counter++) { in setUp() 65 s.push(objArray[counter]); in setUp()
|
D | RandomTest.java | 75 for (int counter = 0; counter < 100; counter++) in test_nextBoolean() 101 for (int counter = 1; counter < randomBytes.length; counter++) in test_nextBytes$B() 102 if (randomBytes[counter] != firstByte) in test_nextBytes$B() 124 for (int counter = 0; counter < 100; counter++) { in test_nextDouble() 154 for (int counter = 0; counter < 100; counter++) { in test_nextFloat() 183 for (int counter = 0; counter < 100; counter++) { in test_nextGaussian() 212 for (int counter = 0; counter < 100; counter++) { in test_nextInt() 238 for (int counter = 0; counter < 100; counter++) { in test_nextIntI() 268 for (int counter = 0; counter < 100; counter++) { in test_nextLong() 298 for (int counter = 0; counter < randomArray.length; counter++) { in test_setSeedJ() [all …]
|
D | CollectionsTest.java | 128 for (int counter = 0; counter < colSize; counter++) in SynchCollectionChecker() 129 normalCountingList.add(new Integer(counter)); in SynchCollectionChecker() 130 for (int counter = 0; counter < colSize; counter++) in SynchCollectionChecker() 131 offsetCountingList.add(new Integer(counter + colSize)); in SynchCollectionChecker() 211 for (int counter = 0; counter < mapSize; counter++) { in SynchMapChecker() 212 myInt = new Integer(counter); in SynchMapChecker() 215 for (int counter = 0; counter < mapSize; counter++) { in SynchMapChecker() 216 myInt = new Integer(counter + mapSize); in SynchMapChecker() 292 for (int counter = 0; counter < llSize; counter++) { in test_binarySearchLjava_util_ListLjava_lang_Object() 294 .get(Collections.binarySearch(ll, ll.get(counter))) == ll in test_binarySearchLjava_util_ListLjava_lang_Object() [all …]
|
D | ConcurrentModificationExceptionTest.java | 69 for (int counter = 0; counter < 50; counter++) in test_Constructor() 70 myCollection.add(new Integer(counter)); in test_Constructor()
|
D | IdentityHashMapTest.java | 121 for (int counter = 0; counter < hmSize; counter++) in test_ConstructorLjava_util_Map() 122 myMap.put(objArray2[counter], objArray[counter]); in test_ConstructorLjava_util_Map() 124 for (int counter = 0; counter < hmSize; counter++) in test_ConstructorLjava_util_Map() 126 .get(objArray2[counter]) == hm2.get(objArray2[counter])); in test_ConstructorLjava_util_Map() 172 for (int counter = 0; counter < hmSize; counter++) in test_clone() 174 .get(objArray2[counter]) == hm2.get(objArray2[counter])); in test_clone()
|
D | TreeSetTest.java | 81 for (int counter = 0; counter < objArray.length; counter++) in test_ConstructorLjava_util_Collection() 83 .contains(objArray[counter])); in test_ConstructorLjava_util_Collection() 145 for (int counter = 0; counter < objArray.length; counter++) in test_ConstructorLjava_util_SortedSet() 147 anotherTreeSet.contains(objArray[counter])); in test_ConstructorLjava_util_SortedSet() 480 for (int counter = startPos; counter < endPos; counter++) in test_subSetLjava_lang_ObjectLjava_lang_Object() 482 aSubSet.contains(objArray[counter])); in test_subSetLjava_lang_ObjectLjava_lang_Object()
|
/dalvik/libcore/security/src/main/java/org/bouncycastle/crypto/params/ |
D | DSAValidationParameters.java | 6 private int counter; field in DSAValidationParameters 10 int counter) in DSAValidationParameters() argument 13 this.counter = counter; in DSAValidationParameters() 18 return counter; in getCounter() 36 if (other.counter != this.counter) in equals()
|
D | DHValidationParameters.java | 6 private int counter; field in DHValidationParameters 10 int counter) in DHValidationParameters() argument 13 this.counter = counter; in DHValidationParameters() 26 if (other.counter != this.counter) in equals() 49 int code = counter; in hashCode()
|
/dalvik/libcore/support/src/test/java/tests/support/ |
D | Support_UnmodifiableCollectionTest.java | 81 for (int counter = 0; it.hasNext(); counter++) { in runTest() 85 + counter + " got: " + nextValue, in runTest() 86 nextValue == counter); in runTest() 97 for (int counter = 0; it.hasNext(); counter++) { in runTest() 100 objArray[counter] == it.next()); in runTest() 106 for (int counter = 0; it.hasNext(); counter++) { in runTest() 109 objArray[counter] == it.next()); in runTest()
|
D | Support_UnmodifiableMapTest.java | 148 for (int counter = 0; it.hasNext(); counter++) { in t_KeySet() 151 objArray[counter] == it.next()); in t_KeySet() 157 for (int counter = 0; it.hasNext(); counter++) { in t_KeySet() 160 objArray[counter] == it.next()); in t_KeySet()
|
D | Support_ListTest.java | 44 for (int counter = 0; counter < 100; counter++) { in runTest() 46 elem = list.get(counter); in runTest() 49 .equals(new Integer(counter))); in runTest() 120 for (int counter = 0; li.hasNext(); counter++) { in runTest() 124 .equals(new Integer(counter))); in runTest()
|
/dalvik/libcore/security/src/main/java/org/bouncycastle/crypto/modes/ |
D | SICBlockCipher.java | 18 private byte[] counter; field in SICBlockCipher 32 this.counter = new byte[blockSize]; in SICBlockCipher() 78 cipher.processBlock(counter, 0, counterOut, 0); in processBlock() 90 for (int i = counter.length - 1; i >= 0; i--) in processBlock() 92 int x = (counter[i] & 0xff) + carry; in processBlock() 103 counter[i] = (byte)x; in processBlock() 106 return counter.length; in processBlock() 112 System.arraycopy(IV, 0, counter, 0, counter.length); in reset()
|
/dalvik/libcore/security/src/main/java/org/bouncycastle/crypto/generators/ |
D | MGF1BytesGenerator.java | 82 int counter = 0; in generateBytes() local 90 ItoOSP(counter, C); in generateBytes() 96 System.arraycopy(hashBuf, 0, out, outOff + counter * hLen, hLen); in generateBytes() 98 while (++counter < (len / hLen)); in generateBytes() 101 if ((counter * hLen) < len) in generateBytes() 103 ItoOSP(counter, C); in generateBytes() 109 System.arraycopy(hashBuf, 0, out, outOff + counter * hLen, len - (counter * hLen)); in generateBytes()
|
D | BaseKDFBytesGenerator.java | 106 int counter = counterStart; in generateBytes() local 112 digest.update((byte)(counter >> 24)); in generateBytes() 113 digest.update((byte)(counter >> 16)); in generateBytes() 114 digest.update((byte)(counter >> 8)); in generateBytes() 115 digest.update((byte)counter); in generateBytes() 135 counter++; in generateBytes()
|
D | DSAParametersGenerator.java | 79 int counter = 0; in generateParameters() local 112 counter = 0; in generateParameters() 116 while (counter < 4096) in generateParameters() 148 counter += 1; in generateParameters() 176 return new DSAParameters(p, q, g, new DSAValidationParameters(seed, counter)); in generateParameters()
|
/dalvik/libcore/security/src/main/java/org/bouncycastle/jce/provider/ |
D | BrokenKDF2BytesGenerator.java | 99 for (int counter = 1; counter <= cThreshold; counter++) in generateBytes() 103 digest.update((byte)(counter & 0xff)); in generateBytes() 104 digest.update((byte)((counter >> 8) & 0xff)); in generateBytes() 105 digest.update((byte)((counter >> 16) & 0xff)); in generateBytes() 106 digest.update((byte)((counter >> 24) & 0xff)); in generateBytes()
|
/dalvik/libcore/luni/src/main/native/ |
D | java_net_NetworkInterface.c | 455 unsigned int counter = 0; in sockGetNetworkInterfaces() local 510 for(counter = 0; counter < totalInterfaces; counter++) { in sockGetNetworkInterfaces() 511 … if((NULL == lastName) || (strncmp(lastName, ifc.ifc_req[counter].ifr_name, IFNAMSIZ) != 0)) { in sockGetNetworkInterfaces() 513 reqCopy = ifc.ifc_req[counter]; in sockGetNetworkInterfaces() 519 lastName = ifc.ifc_req[counter].ifr_name; in sockGetNetworkInterfaces() 531 for(counter = 0; counter < numAdapters; counter++) { in sockGetNetworkInterfaces() 532 interfaces[counter].name = NULL; in sockGetNetworkInterfaces() 533 interfaces[counter].displayName = NULL; in sockGetNetworkInterfaces() 534 interfaces[counter].addresses = NULL; in sockGetNetworkInterfaces() 541 for(counter = 0; counter < totalInterfaces; counter++) { in sockGetNetworkInterfaces() [all …]
|
/dalvik/libcore/luni/src/test/java/tests/api/java/net/ |
D | PasswordAuthenticationTest.java | 65 for (int counter = password.length - 1; counter >= 0; counter--) in test_ConstructorLjava_lang_String$C() 67 returnedPassword[counter] == password[counter]); in test_ConstructorLjava_lang_String$C()
|
/dalvik/libcore/icu/src/main/native/ |
D | ResourceInterface.cpp | 979 int counter = 0; in getContentImpl() local 1015 counter += 2; in getContentImpl() 1022 counter++; in getContentImpl() 1029 counter++; in getContentImpl() 1036 counter++; in getContentImpl() 1042 counter++; in getContentImpl() 1049 counter++; in getContentImpl() 1056 counter++; in getContentImpl() 1063 counter++; in getContentImpl() 1100 counter++; in getContentImpl() [all …]
|
/dalvik/libcore/security/src/main/java/org/bouncycastle/crypto/signers/ |
D | PSSSigner.java | 288 int counter = 0; in maskGeneratorFunction1() local 292 while (counter < (length / hLen)) in maskGeneratorFunction1() 294 ItoOSP(counter, C); in maskGeneratorFunction1() 300 System.arraycopy(hashBuf, 0, mask, counter * hLen, hLen); in maskGeneratorFunction1() 302 counter++; in maskGeneratorFunction1() 305 if ((counter * hLen) < length) in maskGeneratorFunction1() 307 ItoOSP(counter, C); in maskGeneratorFunction1() 313 System.arraycopy(hashBuf, 0, mask, counter * hLen, mask.length - (counter * hLen)); in maskGeneratorFunction1()
|
/dalvik/libcore/luni/src/test/java/org/apache/harmony/luni/tests/java/util/ |
D | ArraysTest.java | 157 for (int counter = 0; counter < reversedArray.length; counter ++) { in test_sort$D() 158 reversedArray[counter] = (reversedArray.length - counter - 1); in test_sort$D() 161 for (int counter = 0; counter < reversedArray.length; counter ++) { in test_sort$D() 163 reversedArray[counter] == counter); in test_sort$D() 200 for (int counter = 0; counter < reversedArray.length; counter ++) { in test_sort$F() 201 reversedArray[counter] = (reversedArray.length - counter - 1); in test_sort$F() 204 for (int counter = 0; counter < reversedArray.length; counter ++) { in test_sort$F() 206 reversedArray[counter] == counter); in test_sort$F()
|
/dalvik/libcore/security/src/test/java/tests/targets/security/ |
D | SecureRandomTest.java | 32 private int counter=0; field in SecureRandomTest 90 random.setSeed(System.currentTimeMillis()+counter); in getRandomBytes() 91 counter++; in getRandomBytes()
|
/dalvik/libcore/security/src/main/java/org/bouncycastle/crypto/encodings/ |
D | OAEPEncoding.java | 313 int counter = 0; in maskGeneratorFunction1() local 319 ItoOSP(counter, C); in maskGeneratorFunction1() 325 System.arraycopy(hashBuf, 0, mask, counter * defHash.length, defHash.length); in maskGeneratorFunction1() 327 while (++counter < (length / defHash.length)); in maskGeneratorFunction1() 329 if ((counter * defHash.length) < length) in maskGeneratorFunction1() 331 ItoOSP(counter, C); in maskGeneratorFunction1() 337 …System.arraycopy(hashBuf, 0, mask, counter * defHash.length, mask.length - (counter * defHash.leng… in maskGeneratorFunction1()
|
/dalvik/libcore/security/src/main/java/org/apache/harmony/security/provider/crypto/ |
D | SHA1PRNG_SecureRandomImpl.java | 134 private transient long counter; field in SHA1PRNG_SecureRandomImpl 173 counter = COUNTER_BASE; in SHA1PRNG_SecureRandomImpl() 360 seed[lastWord] = (int) (counter >>> 32); in engineNextBytes() 361 seed[lastWord + 1] = (int) (counter & 0xFFFFFFFF); in engineNextBytes() 366 seed[lastWord] |= (int) ((counter >>> RIGHT1[n]) & MASK[n]); in engineNextBytes() 367 seed[lastWord + 1] = (int) ((counter >>> RIGHT2[n]) & 0xFFFFFFFF); in engineNextBytes() 368 seed[lastWord + 2] = (int) ((counter << LEFT[n]) | END_FLAGS[n]); in engineNextBytes() 386 counter++; in engineNextBytes() 424 oos.writeLong(counter); 492 counter = ois.readLong();
|