/libcore/luni/src/main/java/java/util/concurrent/atomic/ |
H A D | AtomicMarkableReference.java | 168 private boolean casPair(Pair<V> cmp, Pair<V> val) { argument 169 return UNSAFE.compareAndSwapObject(this, pairOffset, cmp, val);
|
H A D | AtomicStampedReference.java | 168 private boolean casPair(Pair<V> cmp, Pair<V> val) { argument 169 return UNSAFE.compareAndSwapObject(this, pairOffset, cmp, val);
|
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
H A D | RefSortedMap.java | 253 cmp = createCmp(); 355 transient private Comparator<MapEntry<K, V>> cmp = createCmp(); field in class:RefSortedMap 369 return Collections.binarySearch(entries, new MapEntry<K, V>((K) arg0, null), cmp); 393 cmp = createCmp();
|
/libcore/luni/src/main/java/java/util/concurrent/ |
H A D | ConcurrentLinkedQueue.java | 160 boolean casItem(E cmp, E val) { argument 161 return UNSAFE.compareAndSwapObject(this, itemOffset, cmp, val); 168 boolean casNext(Node<E> cmp, Node<E> val) { argument 169 return UNSAFE.compareAndSwapObject(this, nextOffset, cmp, val); 776 private boolean casTail(Node<E> cmp, Node<E> val) { argument 777 return UNSAFE.compareAndSwapObject(this, tailOffset, cmp, val); 780 private boolean casHead(Node<E> cmp, Node<E> val) { argument 781 return UNSAFE.compareAndSwapObject(this, headOffset, cmp, val);
|
H A D | PriorityBlockingQueue.java | 292 Comparator<? super E> cmp = comparator; 293 if (cmp == null) 296 siftDownUsingComparator(0, x, array, n, cmp); 331 Comparator<? super T> cmp) { 335 if (cmp.compare(x, (T) e) >= 0) 376 Comparator<? super T> cmp) { 383 if (right < n && cmp.compare((T) c, (T) array[right]) > 0) 385 if (cmp.compare(x, (T) c) <= 0) 402 Comparator<? super E> cmp = comparator; 403 if (cmp 330 siftUpUsingComparator(int k, T x, Object[] array, Comparator<? super T> cmp) argument 374 siftDownUsingComparator(int k, T x, Object[] array, int n, Comparator<? super T> cmp) argument [all...] |
H A D | ConcurrentLinkedDeque.java | 278 boolean casItem(E cmp, E val) { argument 279 return UNSAFE.compareAndSwapObject(this, itemOffset, cmp, val); 286 boolean casNext(Node<E> cmp, Node<E> val) { argument 287 return UNSAFE.compareAndSwapObject(this, nextOffset, cmp, val); 294 boolean casPrev(Node<E> cmp, Node<E> val) { argument 295 return UNSAFE.compareAndSwapObject(this, prevOffset, cmp, val); 1406 private boolean casHead(Node<E> cmp, Node<E> val) { argument 1407 return UNSAFE.compareAndSwapObject(this, headOffset, cmp, val); 1410 private boolean casTail(Node<E> cmp, Node<E> val) { argument 1411 return UNSAFE.compareAndSwapObject(this, tailOffset, cmp, va [all...] |
H A D | LinkedTransferQueue.java | 426 final boolean casNext(Node cmp, Node val) { argument 427 return UNSAFE.compareAndSwapObject(this, nextOffset, cmp, val); 430 final boolean casItem(Object cmp, Object val) { argument 431 // assert cmp == null || cmp.getClass() != Node.class; 432 return UNSAFE.compareAndSwapObject(this, itemOffset, cmp, val); 539 private boolean casTail(Node cmp, Node val) { argument 540 return UNSAFE.compareAndSwapObject(this, tailOffset, cmp, val); 543 private boolean casHead(Node cmp, Node val) { argument 544 return UNSAFE.compareAndSwapObject(this, headOffset, cmp, va 547 casSweepVotes(int cmp, int val) argument [all...] |
H A D | SynchronousQueue.java | 215 boolean casNext(SNode cmp, SNode val) { argument 216 return cmp == next && 217 UNSAFE.compareAndSwapObject(this, nextOffset, cmp, val); 517 boolean casNext(QNode cmp, QNode val) { argument 518 return next == cmp && 519 UNSAFE.compareAndSwapObject(this, nextOffset, cmp, val); 522 boolean casItem(Object cmp, Object val) { argument 523 return item == cmp && 524 UNSAFE.compareAndSwapObject(this, itemOffset, cmp, val); 530 void tryCancel(Object cmp) { argument 604 casCleanMe(QNode cmp, QNode val) argument [all...] |
H A D | ConcurrentSkipListMap.java | 352 private boolean casHead(HeadIndex<K,V> cmp, HeadIndex<K,V> val) { argument 353 return UNSAFE.compareAndSwapObject(this, headOffset, cmp, val); 395 boolean casValue(Object cmp, Object val) { argument 396 return UNSAFE.compareAndSwapObject(this, valueOffset, cmp, val); 402 boolean casNext(Node<K,V> cmp, Node<K,V> val) { argument 403 return UNSAFE.compareAndSwapObject(this, nextOffset, cmp, val); 528 final boolean casRight(Index<K,V> cmp, Index<K,V> val) { argument 529 return UNSAFE.compareAndSwapObject(this, rightOffset, cmp, val); 612 final Comparator<? super K> cmp; field in class:ConcurrentSkipListMap.ComparableUsingComparator 613 ComparableUsingComparator(K key, Comparator<? super K> cmp) { argument [all...] |
/libcore/luni/src/main/java/java/math/ |
H A D | BigInt.java | 62 static int cmp(BigInt a, BigInt b) { method in class:BigInt
|
/libcore/luni/src/main/java/java/util/ |
H A D | Collections.java | 203 private final Comparator<T> cmp; field in class:Collections.ReverseComparator2 206 this.cmp = comparator; 210 return cmp.compare(o2, o1); 215 && ((ReverseComparator2) o).cmp.equals(cmp); 219 return ~cmp.hashCode(); 1760 return ((ReverseComparator2<T>) c).cmp;
|
/libcore/benchmarks/libs/ |
H A D | caliper.jar | META-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/caliper/ com/google/caliper/AllocationMeasurer ... |