Searched refs:prev (Results 1 - 16 of 16) sorted by relevance

/libcore/luni/src/main/java/java/lang/ref/
H A DFinalizerReference.java34 private FinalizerReference<?> prev; field in class:FinalizerReference
56 reference.prev = null;
59 head.prev = reference;
68 FinalizerReference<?> prev = reference.prev;
70 reference.prev = null;
71 if (prev != null) {
72 prev.next = next;
77 next.prev = prev;
[all...]
/libcore/luni/src/main/java/java/util/concurrent/
H A DConcurrentLinkedDeque.java85 * ("prev") and successor ("next") nodes:
87 * class Node<E> { volatile Node<E> prev, next; volatile E item; }
94 * prev reference that terminates any chain of prev references
100 * A new element is added atomically by CASing the null prev or
108 * A "self-link" is a next or prev reference that is the same node:
109 * p.prev == p or p.next == p
116 * (p.prev == null && p.next != p) ||
117 * (p.next == null && p.prev != p)
122 * following prev pointer
263 volatile Node<E> prev; field in class:ConcurrentLinkedDeque.Node
537 unlinkLast(Node<E> last, Node<E> prev) argument
[all...]
H A DLinkedBlockingDeque.java65 * or "last" (for prev links).
90 Node<E> prev; field in class:LinkedBlockingDeque.Node
108 * (first.prev == null && first.item != null)
195 f.prev = node;
209 node.prev = l;
236 n.prev = null;
250 Node<E> p = l.prev;
253 l.prev = l; // help GC
269 Node<E> p = x.prev;
277 n.prev
[all...]
H A DLinkedTransferQueue.java798 * Moves to next node after prev, or first node if prev null.
800 private void advance(Node prev) { argument
824 this.lastRet = prev;
826 for (Node p = prev, s, n;;) {
H A DConcurrentHashMap.java1306 if ((t.prev = tl) == null)
1771 if ((p.prev = loTail) == null)
1779 if ((p.prev = hiTail) == null)
1826 if ((p.prev = tl) == null)
1864 TreeNode<K,V> prev; // needed to unlink next upon deletion field in class:ConcurrentHashMap.TreeNode
2087 f.prev = x;
2121 TreeNode<K,V> pred = p.prev; // unlink traversal pointers
2128 next.prev = pred;
2406 tb = t.prev, tn = (TreeNode<K,V>)t.next;
2409 if (tn != null && tn.prev !
[all...]
/libcore/luni/src/main/java/java/security/spec/
H A DECFieldF2m.java146 int prev = this.m;
148 if (this.ks[i] < prev) {
149 prev = this.ks[i];
155 if (checkFailed || prev < 1) {
/libcore/luni/src/main/java/java/util/concurrent/locks/
H A DAbstractQueuedLongSynchronizer.java71 * +------+ prev +-----+ +-----+
84 * <p>The "prev" links (not used in original CLH locks), are mainly
194 volatile Node prev; field in class:AbstractQueuedLongSynchronizer.Node
204 * to be null, we can scan prev's from the tail to
244 Node p = prev;
339 node.prev = t;
359 node.prev = pred;
379 node.prev = null;
406 for (Node t = tail; t != null && t != node; t = t.prev)
497 Node pred = node.prev;
[all...]
H A DAbstractQueuedSynchronizer.java301 * +------+ prev +-----+ +-----+
314 * <p>The "prev" links (not used in original CLH locks), are mainly
424 volatile Node prev; field in class:AbstractQueuedSynchronizer.Node
434 * to be null, we can scan prev's from the tail to
474 Node p = prev;
569 node.prev = t;
589 node.prev = pred;
609 node.prev = null;
636 for (Node t = tail; t != null && t != node; t = t.prev)
727 Node pred = node.prev;
[all...]
/libcore/luni/src/main/java/java/math/
H A DConversion.java189 long prev = v;
191 result[--currentChar] = (char) (0x0030 + ((int) (prev - v * 10)));
196 int prev = v;
198 result[--currentChar] = (char) (0x0030 + (prev - v * 10));
337 long prev = v;
339 result[--currentChar] = (char) (0x0030 + (prev - v * 10));
/libcore/luni/src/main/java/java/util/
H A DHashMap.java619 for (HashMapEntry<K, V> e = tab[index], prev = null;
620 e != null; prev = e, e = e.next) {
622 if (prev == null) {
625 prev.next = e.next;
867 for (HashMapEntry<K, V> e = tab[index], prev = null;
868 e != null; prev = e, e = e.next) {
873 if (prev == null) {
876 prev.next = e.next;
H A DHashtable.java556 for (HashtableEntry<K, V> e = tab[index], prev = null;
557 e != null; prev = e, e = e.next) {
559 if (prev == null) {
562 prev.next = e.next;
816 for (HashtableEntry<K, V> e = tab[index], prev = null;
817 e != null; prev = e, e = e.next) {
822 if (prev == null) {
825 prev.next = e.next;
H A DTreeMap.java287 return nearest.prev();
313 return nearest.prev();
817 public Node<K, V> prev() { method in class:TreeMap.Node
898 next = next.prev();
/libcore/luni/src/main/java/java/lang/
H A DCharacter.java2220 int prev = i - 1;
2221 if (prev >= 0 && isHighSurrogate(seq.charAt(prev))) {
2301 int prev = i - 1;
2302 if (prev >= start && isHighSurrogate(seq[prev])) {
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/io/
H A DSerializationStressTest2.java520 DeepNesting prev = new DeepNesting(0.0F);
521 next(prev);
523 prev = prev.next(new DeepNesting(i * 1.0F));
567 DeepNestingWithWriteObject prev = new DeepNestingWithWriteObject(
569 next(prev);
571 prev = prev.next(new DeepNestingWithWriteObject(i * 1.0F));
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
H A DVectorTest.java143 Object prev = tVector.get(45);
146 assertTrue("Failed to fix-up existing indices", tVector.get(46) == prev);
149 prev = tVector.get(50);
153 tVector.get(51) == prev);
/libcore/benchmarks/libs/
H A Dcaliper.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/caliper/ com/google/caliper/AllocationMeasurer ...

Completed in 216 milliseconds