jdk/src/java.base/share/classes/java/util/concurrent/ConcurrentLinkedDeque.java
changeset 36936 bfcdf736a998
parent 33674 566777f73c32
child 39040 a6f5ef42ecda
equal deleted inserted replaced
36935:9a10a2c4dc13 36936:bfcdf736a998
   307         boolean casItem(E cmp, E val) {
   307         boolean casItem(E cmp, E val) {
   308             return U.compareAndSwapObject(this, ITEM, cmp, val);
   308             return U.compareAndSwapObject(this, ITEM, cmp, val);
   309         }
   309         }
   310 
   310 
   311         void lazySetNext(Node<E> val) {
   311         void lazySetNext(Node<E> val) {
   312             U.putOrderedObject(this, NEXT, val);
   312             U.putObjectRelease(this, NEXT, val);
   313         }
   313         }
   314 
   314 
   315         boolean casNext(Node<E> cmp, Node<E> val) {
   315         boolean casNext(Node<E> cmp, Node<E> val) {
   316             return U.compareAndSwapObject(this, NEXT, cmp, val);
   316             return U.compareAndSwapObject(this, NEXT, cmp, val);
   317         }
   317         }
   318 
   318 
   319         void lazySetPrev(Node<E> val) {
   319         void lazySetPrev(Node<E> val) {
   320             U.putOrderedObject(this, PREV, val);
   320             U.putObjectRelease(this, PREV, val);
   321         }
   321         }
   322 
   322 
   323         boolean casPrev(Node<E> cmp, Node<E> val) {
   323         boolean casPrev(Node<E> cmp, Node<E> val) {
   324             return U.compareAndSwapObject(this, PREV, cmp, val);
   324             return U.compareAndSwapObject(this, PREV, cmp, val);
   325         }
   325         }