Home
last modified time | relevance | path

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

12

/libcore/luni/src/main/java/java/util/concurrent/atomic/
DAtomicIntegerFieldUpdater.java142 int prev; in getAndSet() local
144 prev = get(obj); in getAndSet()
145 } while (!compareAndSet(obj, prev, newValue)); in getAndSet()
146 return prev; in getAndSet()
157 int prev, next; in getAndIncrement() local
159 prev = get(obj); in getAndIncrement()
160 next = prev + 1; in getAndIncrement()
161 } while (!compareAndSet(obj, prev, next)); in getAndIncrement()
162 return prev; in getAndIncrement()
173 int prev, next; in getAndDecrement() local
[all …]
DAtomicLongFieldUpdater.java145 long prev; in getAndSet() local
147 prev = get(obj); in getAndSet()
148 } while (!compareAndSet(obj, prev, newValue)); in getAndSet()
149 return prev; in getAndSet()
160 long prev, next; in getAndIncrement() local
162 prev = get(obj); in getAndIncrement()
163 next = prev + 1; in getAndIncrement()
164 } while (!compareAndSet(obj, prev, next)); in getAndIncrement()
165 return prev; in getAndIncrement()
176 long prev, next; in getAndDecrement() local
[all …]
DAtomicReference.java130 V prev, next; in getAndUpdate() local
132 prev = get(); in getAndUpdate()
133 next = updateFunction.apply(prev); in getAndUpdate()
134 } while (!compareAndSet(prev, next)); in getAndUpdate()
135 return prev; in getAndUpdate()
149 V prev, next; in updateAndGet() local
151 prev = get(); in updateAndGet()
152 next = updateFunction.apply(prev); in updateAndGet()
153 } while (!compareAndSet(prev, next)); in updateAndGet()
173 V prev, next; in getAndAccumulate() local
[all …]
DAtomicInteger.java191 int prev, next; in getAndUpdate() local
193 prev = get(); in getAndUpdate()
194 next = updateFunction.applyAsInt(prev); in getAndUpdate()
195 } while (!compareAndSet(prev, next)); in getAndUpdate()
196 return prev; in getAndUpdate()
210 int prev, next; in updateAndGet() local
212 prev = get(); in updateAndGet()
213 next = updateFunction.applyAsInt(prev); in updateAndGet()
214 } while (!compareAndSet(prev, next)); in updateAndGet()
234 int prev, next; in getAndAccumulate() local
[all …]
DAtomicLong.java207 long prev, next; in getAndUpdate() local
209 prev = get(); in getAndUpdate()
210 next = updateFunction.applyAsLong(prev); in getAndUpdate()
211 } while (!compareAndSet(prev, next)); in getAndUpdate()
212 return prev; in getAndUpdate()
226 long prev, next; in updateAndGet() local
228 prev = get(); in updateAndGet()
229 next = updateFunction.applyAsLong(prev); in updateAndGet()
230 } while (!compareAndSet(prev, next)); in updateAndGet()
250 long prev, next; in getAndAccumulate() local
[all …]
DAtomicIntegerArray.java235 int prev, next; in getAndUpdate() local
237 prev = getRaw(offset); in getAndUpdate()
238 next = updateFunction.applyAsInt(prev); in getAndUpdate()
239 } while (!compareAndSetRaw(offset, prev, next)); in getAndUpdate()
240 return prev; in getAndUpdate()
256 int prev, next; in updateAndGet() local
258 prev = getRaw(offset); in updateAndGet()
259 next = updateFunction.applyAsInt(prev); in updateAndGet()
260 } while (!compareAndSetRaw(offset, prev, next)); in updateAndGet()
282 int prev, next; in getAndAccumulate() local
[all …]
DAtomicLongArray.java234 long prev, next; in getAndUpdate() local
236 prev = getRaw(offset); in getAndUpdate()
237 next = updateFunction.applyAsLong(prev); in getAndUpdate()
238 } while (!compareAndSetRaw(offset, prev, next)); in getAndUpdate()
239 return prev; in getAndUpdate()
255 long prev, next; in updateAndGet() local
257 prev = getRaw(offset); in updateAndGet()
258 next = updateFunction.applyAsLong(prev); in updateAndGet()
259 } while (!compareAndSetRaw(offset, prev, next)); in updateAndGet()
281 long prev, next; in getAndAccumulate() local
[all …]
DAtomicReferenceFieldUpdater.java160 V prev; in getAndSet() local
162 prev = get(obj); in getAndSet()
163 } while (!compareAndSet(obj, prev, newValue)); in getAndSet()
164 return prev; in getAndSet()
179 V prev, next; in getAndUpdate() local
181 prev = get(obj); in getAndUpdate()
182 next = updateFunction.apply(prev); in getAndUpdate()
183 } while (!compareAndSet(obj, prev, next)); in getAndUpdate()
184 return prev; in getAndUpdate()
199 V prev, next; in updateAndGet() local
[all …]
DAtomicReferenceArray.java185 E prev, next; in getAndUpdate() local
187 prev = getRaw(offset); in getAndUpdate()
188 next = updateFunction.apply(prev); in getAndUpdate()
189 } while (!compareAndSetRaw(offset, prev, next)); in getAndUpdate()
190 return prev; in getAndUpdate()
206 E prev, next; in updateAndGet() local
208 prev = getRaw(offset); in updateAndGet()
209 next = updateFunction.apply(prev); in updateAndGet()
210 } while (!compareAndSetRaw(offset, prev, next)); in updateAndGet()
232 E prev, next; in getAndAccumulate() local
[all …]
DAtomicBoolean.java120 boolean prev; in getAndSet()
122 prev = get(); in getAndSet()
123 } while (!compareAndSet(prev, newValue)); in getAndSet()
124 return prev; in getAndSet()
/libcore/luni/src/main/java/java/lang/ref/
DFinalizerReference.java34 private FinalizerReference<?> prev; field in FinalizerReference
56 reference.prev = null; in add()
59 head.prev = reference; in add()
68 FinalizerReference<?> prev = reference.prev; in remove() local
70 reference.prev = null; in remove()
71 if (prev != null) { in remove()
72 prev.next = next; in remove()
77 next.prev = prev; in remove()
/libcore/ojluni/src/main/java/sun/misc/
DCleaner.java76 prev = null; field in Cleaner
81 first.prev = cl; in add()
98 first = cl.prev; in remove()
101 cl.next.prev = cl.prev; in remove()
102 if (cl.prev != null) in remove()
103 cl.prev.next = cl.next; in remove()
107 cl.prev = cl; in remove()
DService.java426 ClassLoader prev = null; in installedProviders() local
428 prev = cl; in installedProviders()
431 return Service.providers(service, prev); in installedProviders()
/libcore/ojluni/src/main/java/java/util/
DLinkedList.java132 f.prev = newNode; in linkFirst()
157 final Node<E> pred = succ.prev; in linkBefore()
159 succ.prev = newNode; in linkBefore()
181 next.prev = null; in unlinkFirst()
193 final Node<E> prev = l.prev; in unlinkLast() local
195 l.prev = null; // help GC in unlinkLast()
196 last = prev; in unlinkLast()
197 if (prev == null) in unlinkLast()
200 prev.next = null; in unlinkLast()
213 final Node<E> prev = x.prev; in unlink() local
[all …]
DWeakHashMap.java306 Entry<K,V> prev = table[i]; in expungeStaleEntries() local
307 Entry<K,V> p = prev; in expungeStaleEntries()
311 if (prev == e) in expungeStaleEntries()
314 prev.next = next; in expungeStaleEntries()
321 prev = p; in expungeStaleEntries()
576 Entry<K,V> prev = tab[i]; in remove() local
577 Entry<K,V> e = prev; in remove()
584 if (prev == e) in remove()
587 prev.next = next; in remove()
590 prev = e; in remove()
[all …]
DHashtable.java487 for (HashtableEntry<K,V> e = tab[index], prev = null ; e != null ; prev = e, e = e.next) { in remove()
490 if (prev != null) { in remove()
491 prev.next = e.next; in remove()
710 for (HashtableEntry<K,V> e = tab[index], prev = null; e != null; in remove()
711 prev = e, e = e.next) { in remove()
714 if (prev != null) in remove()
715 prev.next = e.next; in remove()
1203 for (HashtableEntry<K,V> e = tab[index], prev = null; e != null; in remove()
1204 prev = e, e = e.next) { in remove()
1208 if (prev == null) in remove()
[all …]
/libcore/luni/src/main/java/java/util/concurrent/
DConcurrentLinkedDeque.java263 volatile Node<E> prev; field in ConcurrentLinkedDeque.Node
328 if ((q = p.prev) != null && in linkFirst()
329 (q = (p = q).prev) != null) in linkFirst()
365 else if (p.prev == p) // NEXT_TERMINATOR in linkLast()
394 final Node<E> prev = x.prev; in unlink() local
396 if (prev == null) { in unlink()
399 unlinkLast(x, prev); in unlink()
425 for (Node<E> p = prev; ; ++hops) { in unlink()
431 Node<E> q = p.prev; in unlink()
454 if (p.prev == p) in unlink()
[all …]
DLinkedBlockingDeque.java93 Node<E> prev; field in LinkedBlockingDeque.Node
198 f.prev = node; in linkFirst()
212 node.prev = l; in linkLast()
239 n.prev = null; in unlinkFirst()
253 Node<E> p = l.prev; in unlinkLast()
256 l.prev = l; // help GC in unlinkLast()
272 Node<E> p = x.prev; in unlink()
280 n.prev = p; in unlink()
579 for (Node<E> p = last; p != null; p = p.prev) { in removeLastOccurrence()
947 f.prev = null; in clear()
[all …]
/libcore/luni/src/test/java/libcore/java/util/
DRemoveIfTester.java43 Integer prev = null; in runBasicRemoveIfTests() local
46 if (prev != null) { in runBasicRemoveIfTests()
47 assertTrue(prev <= i); in runBasicRemoveIfTests()
49 prev = i; in runBasicRemoveIfTests()
/libcore/luni/src/main/java/java/util/concurrent/locks/
DStampedLock.java280 volatile WNode prev; field in StampedLock.WNode
286 WNode(int m, WNode p) { mode = m; prev = p; } in WNode()
986 for (WNode t = wtail; t != null && t != h; t = t.prev) in release()
1025 else if (node.prev != p) in acquireWrite()
1026 node.prev = p; in acquireWrite()
1047 node.prev = null; in acquireWrite()
1067 if ((np = node.prev) != p) { in acquireWrite()
1074 if ((pp = p.prev) != null) { in acquireWrite()
1075 node.prev = pp; in acquireWrite()
1089 whead == h && node.prev == p) in acquireWrite()
[all …]
DAbstractQueuedSynchronizer.java417 volatile Node prev; field in AbstractQueuedSynchronizer.Node
467 Node p = prev; in predecessor()
634 node.prev = null; in setHead()
661 for (Node p = tail; p != node && p != null; p = p.prev) in unparkSuccessor()
754 Node pred = node.prev; in cancelAcquire()
756 node.prev = pred = pred.prev; in cancelAcquire()
813 node.prev = pred = pred.prev; in shouldParkAfterFailedAcquire()
1409 s.prev == head && (st = s.thread) != null) || in fullGetFirstQueuedThread()
1411 s.prev == head && (st = s.thread) != null)) in fullGetFirstQueuedThread()
1423 for (Node p = tail; p != null && p != head; p = p.prev) { in fullGetFirstQueuedThread()
[all …]
DAbstractQueuedLongSynchronizer.java167 node.prev = null; in setHead()
194 for (Node p = tail; p != node && p != null; p = p.prev) in unparkSuccessor()
287 Node pred = node.prev; in cancelAcquire()
289 node.prev = pred = pred.prev; in cancelAcquire()
346 node.prev = pred = pred.prev; in shouldParkAfterFailedAcquire()
938 s.prev == head && (st = s.thread) != null) || in fullGetFirstQueuedThread()
940 s.prev == head && (st = s.thread) != null)) in fullGetFirstQueuedThread()
952 for (Node p = tail; p != null && p != head; p = p.prev) { in fullGetFirstQueuedThread()
973 for (Node p = tail; p != null; p = p.prev) in isQueued()
1064 for (Node p = tail; p != null; p = p.prev) { in getQueueLength()
[all …]
/libcore/ojluni/src/main/java/sun/nio/ch/
DFileLockTable.java132 List<FileLockReference> prev; in add() local
134 prev = lockMap.putIfAbsent(fileKey, list); in add()
135 if (prev == null) { in add()
142 list = prev; in add()
/libcore/luni/src/main/java/java/math/
DConversion.java189 long prev = v; in toDecimalScaledString() local
191 result[--currentChar] = (char) (0x0030 + ((int) (prev - v * 10))); in toDecimalScaledString()
196 int prev = v; in toDecimalScaledString() local
198 result[--currentChar] = (char) (0x0030 + (prev - v * 10)); in toDecimalScaledString()
337 long prev = v; in toDecimalScaledString()
339 result[--currentChar] = (char) (0x0030 + (prev - v * 10)); in toDecimalScaledString()
/libcore/ojluni/src/main/java/sun/security/util/
DManifestDigester.java232 int prev = -1; in doOldStyle() local
234 if ((bytes[i] == '\r') && (prev == ' ')) { in doOldStyle()
238 prev = bytes[i]; in doOldStyle()

12