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

12

/libcore/luni/src/main/java/java/util/concurrent/atomic/
H A DAtomicIntegerFieldUpdater.java142 int prev;
144 prev = get(obj);
145 } while (!compareAndSet(obj, prev, newValue));
146 return prev;
157 int prev, next;
159 prev = get(obj);
160 next = prev + 1;
161 } while (!compareAndSet(obj, prev, next));
162 return prev;
173 int prev, nex
[all...]
H A DAtomicInteger.java191 int prev, next;
193 prev = get();
194 next = updateFunction.applyAsInt(prev);
195 } while (!compareAndSet(prev, next));
196 return prev;
210 int prev, next;
212 prev = get();
213 next = updateFunction.applyAsInt(prev);
214 } while (!compareAndSet(prev, next));
234 int prev, nex
[all...]
H A DAtomicLong.java207 long prev, next;
209 prev = get();
210 next = updateFunction.applyAsLong(prev);
211 } while (!compareAndSet(prev, next));
212 return prev;
226 long prev, next;
228 prev = get();
229 next = updateFunction.applyAsLong(prev);
230 } while (!compareAndSet(prev, next));
250 long prev, nex
[all...]
H A DAtomicReference.java130 V prev, next;
132 prev = get();
133 next = updateFunction.apply(prev);
134 } while (!compareAndSet(prev, next));
135 return prev;
149 V prev, next;
151 prev = get();
152 next = updateFunction.apply(prev);
153 } while (!compareAndSet(prev, next));
173 V prev, nex
[all...]
H A DAtomicLongFieldUpdater.java145 long prev;
147 prev = get(obj);
148 } while (!compareAndSet(obj, prev, newValue));
149 return prev;
160 long prev, next;
162 prev = get(obj);
163 next = prev + 1;
164 } while (!compareAndSet(obj, prev, next));
165 return prev;
176 long prev, nex
[all...]
H A DAtomicIntegerArray.java235 int prev, next;
237 prev = getRaw(offset);
238 next = updateFunction.applyAsInt(prev);
239 } while (!compareAndSetRaw(offset, prev, next));
240 return prev;
256 int prev, next;
258 prev = getRaw(offset);
259 next = updateFunction.applyAsInt(prev);
260 } while (!compareAndSetRaw(offset, prev, next));
282 int prev, nex
[all...]
H A DAtomicLongArray.java234 long prev, next;
236 prev = getRaw(offset);
237 next = updateFunction.applyAsLong(prev);
238 } while (!compareAndSetRaw(offset, prev, next));
239 return prev;
255 long prev, next;
257 prev = getRaw(offset);
258 next = updateFunction.applyAsLong(prev);
259 } while (!compareAndSetRaw(offset, prev, next));
281 long prev, nex
[all...]
H A DAtomicBoolean.java120 boolean prev;
122 prev = get();
123 } while (!compareAndSet(prev, newValue));
124 return prev;
H A DAtomicReferenceFieldUpdater.java160 V prev;
162 prev = get(obj);
163 } while (!compareAndSet(obj, prev, newValue));
164 return prev;
179 V prev, next;
181 prev = get(obj);
182 next = updateFunction.apply(prev);
183 } while (!compareAndSet(obj, prev, next));
184 return prev;
199 V prev, nex
[all...]
H A DAtomicReferenceArray.java185 E prev, next;
187 prev = getRaw(offset);
188 next = updateFunction.apply(prev);
189 } while (!compareAndSetRaw(offset, prev, next));
190 return prev;
206 E prev, next;
208 prev = getRaw(offset);
209 next = updateFunction.apply(prev);
210 } while (!compareAndSetRaw(offset, prev, next));
232 E prev, nex
[all...]
/libcore/ojluni/src/main/java/sun/misc/
H A DCleaner.java76 prev = null; field in class:Cleaner
81 first.prev = cl;
98 first = cl.prev;
101 cl.next.prev = cl.prev;
102 if (cl.prev != null)
103 cl.prev.next = cl.next;
107 cl.prev = cl;
H A DService.java426 ClassLoader prev = null;
428 prev = cl;
431 return Service.providers(service, prev);
/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/test/java/libcore/java/util/
H A DRemoveIfTester.java43 Integer prev = null;
46 if (prev != null) {
47 assertTrue(prev <= i);
49 prev = i;
/libcore/ojluni/src/main/java/java/util/
H A DLinkedList.java92 * (first.prev == null && first.item != null)
132 f.prev = newNode;
157 final Node<E> pred = succ.prev;
159 succ.prev = newNode;
181 next.prev = null;
193 final Node<E> prev = l.prev;
195 l.prev = null; // help GC
196 last = prev;
197 if (prev
974 Node<E> prev; field in class:LinkedList.Node
976 Node(Node<E> prev, E element, Node<E> next) argument
[all...]
H A DWeakHashMap.java306 Entry<K,V> prev = table[i];
307 Entry<K,V> p = prev;
311 if (prev == e)
314 prev.next = next;
321 prev = p;
576 Entry<K,V> prev = tab[i];
577 Entry<K,V> e = prev;
584 if (prev == e)
587 prev.next = next;
590 prev
[all...]
H A DHashtable.java487 for (HashtableEntry<K,V> e = tab[index], prev = null ; e != null ; prev = e, e = e.next) {
490 if (prev != null) {
491 prev.next = e.next;
710 for (HashtableEntry<K,V> e = tab[index], prev = null; e != null;
711 prev = e, e = e.next) {
714 if (prev != null)
715 prev.next = e.next;
1203 for (HashtableEntry<K,V> e = tab[index], prev = null; e != null;
1204 prev
[all...]
H A DServiceLoader.java531 ClassLoader prev = null;
533 prev = cl;
536 return ServiceLoader.load(service, prev);
/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
533 unlinkLast(Node<E> last, Node<E> prev) argument
[all...]
/libcore/luni/src/main/java/java/util/concurrent/locks/
H A DStampedLock.java280 volatile WNode prev; field in class:StampedLock.WNode
286 WNode(int m, WNode p) { mode = m; prev = p; }
986 for (WNode t = wtail; t != null && t != h; t = t.prev)
1025 else if (node.prev != p)
1026 node.prev = p;
1047 node.prev = null;
1067 if ((np = node.prev) != p) {
1074 if ((pp = p.prev) != null) {
1075 node.prev = pp;
1089 whead == h && node.prev
[all...]
H A DAbstractQueuedSynchronizer.java294 * +------+ prev +-----+ +-----+
307 * <p>The "prev" links (not used in original CLH locks), are mainly
417 volatile Node prev; field in class:AbstractQueuedSynchronizer.Node
427 * to be null, we can scan prev's from the tail to
467 Node p = prev;
509 (Node.class.getDeclaredField("prev"));
634 node.prev = null;
661 for (Node p = tail; p != node && p != null; p = p.prev)
754 Node pred = node.prev;
756 node.prev
[all...]
H A DAbstractQueuedLongSynchronizer.java167 node.prev = null;
194 for (Node p = tail; p != node && p != null; p = p.prev)
287 Node pred = node.prev;
289 node.prev = pred = pred.prev;
326 * control in all acquire loops. Requires that pred == node.prev.
346 node.prev = pred = pred.prev;
930 * field is nulled out or s.prev is no longer head, then
938 s.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/ojluni/src/main/java/sun/nio/ch/
H A DFileLockTable.java132 List<FileLockReference> prev;
134 prev = lockMap.putIfAbsent(fileKey, list);
135 if (prev == null) {
142 list = prev;
/libcore/ojluni/src/main/java/sun/security/util/
H A DManifestDigester.java232 int prev = -1;
234 if ((bytes[i] == '\r') && (prev == ' ')) {
238 prev = bytes[i];

Completed in 687 milliseconds

12