| /libcore/benchmarks/src/benchmarks/regression/ |
| D | NativeMethodBenchmark.java | 30 NativeTestTarget n = new NativeTestTarget(); in time_emptyJniSynchronizedMethod0() local
43 NativeTestTarget n = new NativeTestTarget(); in time_emptyJniMethod0() local
60 NativeTestTarget n = new NativeTestTarget(); in time_emptyJniMethod6() local
73 NativeTestTarget n = new NativeTestTarget(); in time_emptyJniMethod6L() local
|
| D | SSLSocketBenchmark.java | 87 int n = in.read(buffer); in time() local
|
| /libcore/luni/src/test/etc/loading-test-jar/ |
| D | Target.java | 34 public static void setStaticVariable(int n) { in setStaticVariable()
42 public void setInstanceVariable(int n) { in setInstanceVariable()
|
| /libcore/luni/src/test/etc/loading-test2-jar/ |
| D | Target2.java | 34 public static void setStaticIgram(int n) { in setStaticIgram()
42 public void setInstanceMagri(int n) { in setInstanceMagri()
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| D | PriorityBlockingQueue.java | 225 int n = a.length; in PriorityBlockingQueue() local
284 int n = size - 1; in dequeue() local
354 int n) { in siftDownComparable()
375 int n, in siftDownUsingComparator()
400 int n = size; in heapify() local
443 int n, cap; in offer() local
576 int n = size; in indexOf() local
589 int n = size - 1; in removeAt() local
699 int n = size; in toString() local
742 int n = Math.min(size, maxElements); in drainTo() local
[all …]
|
| D | ConcurrentSkipListMap.java | 549 Node<K,V> n = node; in link() local
690 Node<K,V> n = r.node; in findPredecessor() local
761 Node<K,V> n = b.next; in findNode() local
799 Node<K,V> n = findNode(key); in doGet() local
822 Node<K,V> n = b.next; in doPut() local
956 Node<K,V> n = r.node; in addIndex() local
1021 Node<K,V> n = b.next; in doRemove() local
1103 Node<K,V> n = b.next; in findFirst() local
1119 Node<K,V> n = b.next; in doRemoveFirstEntry() local
1185 Node<K,V> n = b.next; in findLast() local
[all …]
|
| D | LinkedTransferQueue.java | 591 Node n = q.next; // update by 2 unless singleton in xfer() local
604 Node n = p.next; in xfer() local
632 Node n, u; // temps for reads of next & tail in tryAppend() local
780 Node n = p.next; in countOfMode() local
817 Node s, n; // help with removal of lastPred.next in advance() local
904 Node n = s.next; in unsplice() local
1134 int n = 0; in drainTo() local
1151 int n = 0; in drainTo() local
|
| D | LinkedBlockingDeque.java | 270 Node<E> n = x.next; in unlink() local
721 int n = Math.min(maxElements, count); in drainTo() local
963 Node<E> n = f.next; in clear() local
1035 abstract Node<E> nextNode(Node<E> n); in nextNode()
1053 private Node<E> succ(Node<E> n) { in succ()
1098 Node<E> n = lastRet; in remove() local
1116 Node<E> nextNode(Node<E> n) { return n.next; } in nextNode()
1122 Node<E> nextNode(Node<E> n) { return n.prev; } in nextNode()
|
| D | ThreadLocalRandom.java | 129 public long nextLong(long n) { in nextLong()
174 public double nextDouble(double n) { in nextDouble()
|
| D | DelayQueue.java | 315 int n = 0; in drainTo() local
343 int n = 0; in drainTo() local
|
| /libcore/luni/src/test/java/tests/security/interfaces/ |
| D | RSAPublicKeyTest.java | 33 final BigInteger n = BigInteger.valueOf(3233); in test_getPublicExponent() local
|
| D | RSAPrivateKeyTest.java | 33 final BigInteger n = BigInteger.valueOf(3233); in test_getPrivateExponent() local
|
| D | RSAKeyTest.java | 37 final BigInteger n = BigInteger.valueOf(3233); in test_getModulus() local
|
| /libcore/luni/src/main/java/java/math/ |
| D | Primality.java | 85 static BigInteger nextProbablePrime(BigInteger n) { in nextProbablePrime()
|
| D | BigInteger.java | 465 public BigInteger shiftRight(int n) { in shiftRight()
482 public BigInteger shiftLeft(int n) { in shiftLeft()
536 public boolean testBit(int n) { in testBit()
582 public BigInteger setBit(int n) { in setBit()
602 public BigInteger clearBit(int n) { in clearBit()
622 public BigInteger flipBit(int n) { in flipBit()
|
| D | NativeBN.java | 71 public static native void BN_set_negative(long b, int n); in BN_set_negative()
76 public static native boolean BN_is_bit_set(long a, int n); in BN_is_bit_set()
79 public static native void BN_shift(long r, long a, int n); in BN_shift()
118 public static native void BN_mod_inverse(long ret, long a, long n); in BN_mod_inverse()
|
| D | BitLevel.java | 91 static boolean testBit(BigInteger val, int n) { in testBit()
213 static BigInteger flipBit(BigInteger val, int n){ in flipBit()
|
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/zip/ |
| D | ZipEntryTest.java | 67 String n = null; in test_ConstructorLjava_lang_String() local
179 String n = null; in test_setCommentLjava_lang_String() local
|
| /libcore/luni/src/main/java/javax/xml/transform/dom/ |
| D | DOMSource.java | 78 public DOMSource(Node n) { in DOMSource()
|
| /libcore/luni/src/main/java/java/util/ |
| D | ComparableTimSort.java | 242 int n = start - left; // The number of elements to move in binarySort() local
366 int n = stackSize - 2; local
385 int n = stackSize - 2; in mergeForceCollapse() local
|
| D | TimSort.java | 275 int n = start - left; // The number of elements to move in binarySort() local
400 int n = stackSize - 2; local
419 int n = stackSize - 2; in mergeForceCollapse() local
|
| /libcore/luni/src/main/java/org/w3c/dom/traversal/ |
| D | NodeFilter.java | 144 public short acceptNode(Node n); in acceptNode()
|
| /libcore/jsr166-tests/src/test/java/jsr166/ |
| D | RecursiveTaskTest.java | 188 FibTask(int n) { number = n; } in FibTask()
190 int n = number; in realCompute() local
207 FailingFibTask(int n) { number = n; } in FailingFibTask()
209 int n = number; in compute() local
|
| /libcore/luni/src/test/java/libcore/java/io/ |
| D | OldAndroidInputStreamReaderTest.java | 100 int n = r.read(ca, 0, 600); in testStringy() local
|
| /libcore/luni/src/test/java/libcore/java/util/zip/ |
| D | DeflaterOutputStreamTest.java | 144 int n = iis.read(input, total, input.length - total); in testSyncFlushDeflater() local
|