Home
last modified time | relevance | path

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

12

/libcore/ojluni/src/main/java/java/util/concurrent/atomic/
DAtomicIntegerFieldUpdater.java170 int prev; in getAndSet() local
172 prev = get(obj); in getAndSet()
173 } while (!compareAndSet(obj, prev, newValue)); in getAndSet()
174 return prev; in getAndSet()
185 int prev, next; in getAndIncrement() local
187 prev = get(obj); in getAndIncrement()
188 next = prev + 1; in getAndIncrement()
189 } while (!compareAndSet(obj, prev, next)); in getAndIncrement()
190 return prev; in getAndIncrement()
201 int prev, next; in getAndDecrement() local
[all …]
DAtomicLongFieldUpdater.java173 long prev; in getAndSet() local
175 prev = get(obj); in getAndSet()
176 } while (!compareAndSet(obj, prev, newValue)); in getAndSet()
177 return prev; in getAndSet()
188 long prev, next; in getAndIncrement() local
190 prev = get(obj); in getAndIncrement()
191 next = prev + 1; in getAndIncrement()
192 } while (!compareAndSet(obj, prev, next)); in getAndIncrement()
193 return prev; in getAndIncrement()
204 long prev, next; in getAndDecrement() local
[all …]
DAtomicInteger.java220 int prev, next; in getAndUpdate() local
222 prev = get(); in getAndUpdate()
223 next = updateFunction.applyAsInt(prev); in getAndUpdate()
224 } while (!compareAndSet(prev, next)); in getAndUpdate()
225 return prev; in getAndUpdate()
239 int prev, next; in updateAndGet() local
241 prev = get(); in updateAndGet()
242 next = updateFunction.applyAsInt(prev); in updateAndGet()
243 } while (!compareAndSet(prev, next)); in updateAndGet()
263 int prev, next; in getAndAccumulate() local
[all …]
DAtomicReference.java159 V prev, next; in getAndUpdate() local
161 prev = get(); in getAndUpdate()
162 next = updateFunction.apply(prev); in getAndUpdate()
163 } while (!compareAndSet(prev, next)); in getAndUpdate()
164 return prev; in getAndUpdate()
178 V prev, next; in updateAndGet() local
180 prev = get(); in updateAndGet()
181 next = updateFunction.apply(prev); in updateAndGet()
182 } while (!compareAndSet(prev, next)); in updateAndGet()
202 V prev, next; in getAndAccumulate() local
[all …]
DAtomicLong.java236 long prev, next; in getAndUpdate() local
238 prev = get(); in getAndUpdate()
239 next = updateFunction.applyAsLong(prev); in getAndUpdate()
240 } while (!compareAndSet(prev, next)); in getAndUpdate()
241 return prev; in getAndUpdate()
255 long prev, next; in updateAndGet() local
257 prev = get(); in updateAndGet()
258 next = updateFunction.applyAsLong(prev); in updateAndGet()
259 } while (!compareAndSet(prev, next)); in updateAndGet()
279 long prev, next; in getAndAccumulate() local
[all …]
DAtomicLongArray.java263 long prev, next; in getAndUpdate() local
265 prev = getRaw(offset); in getAndUpdate()
266 next = updateFunction.applyAsLong(prev); in getAndUpdate()
267 } while (!compareAndSetRaw(offset, prev, next)); in getAndUpdate()
268 return prev; in getAndUpdate()
284 long prev, next; in updateAndGet() local
286 prev = getRaw(offset); in updateAndGet()
287 next = updateFunction.applyAsLong(prev); in updateAndGet()
288 } while (!compareAndSetRaw(offset, prev, next)); in updateAndGet()
310 long prev, next; in getAndAccumulate() local
[all …]
DAtomicIntegerArray.java264 int prev, next; in getAndUpdate() local
266 prev = getRaw(offset); in getAndUpdate()
267 next = updateFunction.applyAsInt(prev); in getAndUpdate()
268 } while (!compareAndSetRaw(offset, prev, next)); in getAndUpdate()
269 return prev; in getAndUpdate()
285 int prev, next; in updateAndGet() local
287 prev = getRaw(offset); in updateAndGet()
288 next = updateFunction.applyAsInt(prev); in updateAndGet()
289 } while (!compareAndSetRaw(offset, prev, next)); in updateAndGet()
311 int prev, next; in getAndAccumulate() local
[all …]
DAtomicReferenceArray.java214 E prev, next; in getAndUpdate() local
216 prev = getRaw(offset); in getAndUpdate()
217 next = updateFunction.apply(prev); in getAndUpdate()
218 } while (!compareAndSetRaw(offset, prev, next)); in getAndUpdate()
219 return prev; in getAndUpdate()
235 E prev, next; in updateAndGet() local
237 prev = getRaw(offset); in updateAndGet()
238 next = updateFunction.apply(prev); in updateAndGet()
239 } while (!compareAndSetRaw(offset, prev, next)); in updateAndGet()
261 E prev, next; in getAndAccumulate() local
[all …]
DAtomicReferenceFieldUpdater.java188 V prev; in getAndSet() local
190 prev = get(obj); in getAndSet()
191 } while (!compareAndSet(obj, prev, newValue)); in getAndSet()
192 return prev; in getAndSet()
207 V prev, next; in getAndUpdate() local
209 prev = get(obj); in getAndUpdate()
210 next = updateFunction.apply(prev); in getAndUpdate()
211 } while (!compareAndSet(obj, prev, next)); in getAndUpdate()
212 return prev; in getAndUpdate()
227 V prev, next; in updateAndGet() local
[all …]
DAtomicBoolean.java149 boolean prev; in getAndSet()
151 prev = get(); in getAndSet()
152 } while (!compareAndSet(prev, newValue)); in getAndSet()
153 return prev; in getAndSet()
/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()
DFDBigInteger.java130 FDBigInteger prev = POW_5_CACHE[i - 1];
132 POW_5_CACHE[i] = prev = prev.mult(5);
133 prev.makeImmutable(); in prev.makeImmutable()
420 …ate static void leftShift(int[] src, int idx, int result[], int bitcount, int anticount, int prev){ in leftShift() argument
422 int v = (prev << bitcount); in leftShift()
423 prev = src[idx - 1]; in leftShift()
424 v |= (prev >>> anticount); in leftShift()
427 int v = prev << bitcount; in leftShift()
469 int prev = data[idx]; in leftShift() local
470 int hi = prev >>> anticount; in leftShift()
[all …]
/libcore/luni/src/main/java/java/lang/ref/
DFinalizerReference.java39 private FinalizerReference<?> prev; field in FinalizerReference
63 reference.prev = null; in add()
66 head.prev = reference; in add()
76 FinalizerReference<?> prev = reference.prev; in remove() local
78 reference.prev = null; in remove()
79 if (prev != null) { in remove()
80 prev.next = next; in remove()
85 next.prev = prev; in remove()
/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 …]
DHashtable.java497 for(HashtableEntry<K,V> prev = null ; e != null ; prev = e, e = e.next) { in remove()
500 if (prev != null) { in remove()
501 prev.next = e.next; in remove()
722 for(HashtableEntry<K,V> prev = null; e != null; prev = e, e = e.next) { in remove()
725 if (prev != null) in remove()
726 prev.next = e.next; in remove()
944 for (HashtableEntry<K,V> prev = null; e != null; prev = e, e = e.next) { in remove()
947 if (prev != null) { in remove()
948 prev.next = e.next; in remove()
1033 for (HashtableEntry<K,V> prev = null; e != null; prev = e, e = e.next) { in computeIfPresent()
[all …]
DWeakHashMap.java324 Entry<K,V> prev = table[i]; in expungeStaleEntries() local
325 Entry<K,V> p = prev; in expungeStaleEntries()
329 if (prev == e) in expungeStaleEntries()
332 prev.next = next; in expungeStaleEntries()
339 prev = p; in expungeStaleEntries()
594 Entry<K,V> prev = tab[i]; in remove() local
595 Entry<K,V> e = prev; in remove()
602 if (prev == e) in remove()
605 prev.next = next; in remove()
608 prev = e; in remove()
[all …]
/libcore/ojluni/src/main/java/java/util/concurrent/
DConcurrentLinkedDeque.java292 volatile Node<E> prev; field in ConcurrentLinkedDeque.Node
357 if ((q = p.prev) != null && in linkFirst()
358 (q = (p = q).prev) != null) in linkFirst()
394 else if (p.prev == p) // NEXT_TERMINATOR in linkLast()
423 final Node<E> prev = x.prev; in unlink() local
425 if (prev == null) { in unlink()
428 unlinkLast(x, prev); in unlink()
454 for (Node<E> p = prev; ; ++hops) { in unlink()
460 Node<E> q = p.prev; in unlink()
483 if (p.prev == p) in unlink()
[all …]
DLinkedBlockingDeque.java122 Node<E> prev; field in LinkedBlockingDeque.Node
227 f.prev = node; in linkFirst()
241 node.prev = l; in linkLast()
268 n.prev = null; in unlinkFirst()
282 Node<E> p = l.prev; in unlinkLast()
285 l.prev = l; // help GC in unlinkLast()
301 Node<E> p = x.prev; in unlink()
309 n.prev = p; in unlink()
608 for (Node<E> p = last; p != null; p = p.prev) { in removeLastOccurrence()
976 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/ojluni/src/main/java/sun/nio/fs/
DAbstractWatchKey.java112 WatchEvent<?> prev = events.get(size-1); in signalEvent() local
113 if ((prev.kind() == StandardWatchEventKinds.OVERFLOW) || in signalEvent()
114 ((kind == prev.kind() && in signalEvent()
115 Objects.equals(context, prev.context())))) in signalEvent()
117 ((Event<?>)prev).increment(); in signalEvent()
/libcore/ojluni/src/main/java/java/util/concurrent/locks/
DStampedLock.java309 volatile WNode prev; field in StampedLock.WNode
315 WNode(int m, WNode p) { mode = m; prev = p; } in WNode()
1015 for (WNode t = wtail; t != null && t != h; t = t.prev) in release()
1054 else if (node.prev != p) in acquireWrite()
1055 node.prev = p; in acquireWrite()
1076 node.prev = null; in acquireWrite()
1096 if ((np = node.prev) != p) { in acquireWrite()
1103 if ((pp = p.prev) != null) { in acquireWrite()
1104 node.prev = pp; in acquireWrite()
1118 whead == h && node.prev == p) in acquireWrite()
[all …]
DAbstractQueuedSynchronizer.java445 volatile Node prev; field in AbstractQueuedSynchronizer.Node
495 Node p = prev; in predecessor()
662 node.prev = null; in setHead()
689 for (Node p = tail; p != node && p != null; p = p.prev) in unparkSuccessor()
782 Node pred = node.prev; in cancelAcquire()
784 node.prev = pred = pred.prev; in cancelAcquire()
841 node.prev = pred = pred.prev; in shouldParkAfterFailedAcquire()
1441 s.prev == head && (st = s.thread) != null) || in fullGetFirstQueuedThread()
1443 s.prev == head && (st = s.thread) != null)) in fullGetFirstQueuedThread()
1455 for (Node p = tail; p != null && p != head; p = p.prev) { in fullGetFirstQueuedThread()
[all …]
DAbstractQueuedLongSynchronizer.java196 node.prev = null; in setHead()
223 for (Node p = tail; p != node && p != null; p = p.prev) in unparkSuccessor()
316 Node pred = node.prev; in cancelAcquire()
318 node.prev = pred = pred.prev; in cancelAcquire()
375 node.prev = pred = pred.prev; in shouldParkAfterFailedAcquire()
967 s.prev == head && (st = s.thread) != null) || in fullGetFirstQueuedThread()
969 s.prev == head && (st = s.thread) != null)) in fullGetFirstQueuedThread()
981 for (Node p = tail; p != null && p != head; p = p.prev) { in fullGetFirstQueuedThread()
1002 for (Node p = tail; p != null; p = p.prev) in isQueued()
1093 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()

12