src/java.base/share/classes/java/util/concurrent/ConcurrentHashMap.java

*** 755,774 ****
       * and so require only release ordering.
       */
  
      @SuppressWarnings("unchecked")
      static final <K,V> Node<K,V> tabAt(Node<K,V>[] tab, int i) {
!         return (Node<K,V>)U.getObjectAcquire(tab, ((long)i << ASHIFT) + ABASE);
      }
  
      static final <K,V> boolean casTabAt(Node<K,V>[] tab, int i,
                                          Node<K,V> c, Node<K,V> v) {
!         return U.compareAndSetObject(tab, ((long)i << ASHIFT) + ABASE, c, v);
      }
  
      static final <K,V> void setTabAt(Node<K,V>[] tab, int i, Node<K,V> v) {
!         U.putObjectRelease(tab, ((long)i << ASHIFT) + ABASE, v);
      }
  
      /* ---------------- Fields -------------- */
  
      /**
--- 755,774 ----
       * and so require only release ordering.
       */
  
      @SuppressWarnings("unchecked")
      static final <K,V> Node<K,V> tabAt(Node<K,V>[] tab, int i) {
!         return (Node<K,V>)U.getReferenceAcquire(tab, ((long)i << ASHIFT) + ABASE);
      }
  
      static final <K,V> boolean casTabAt(Node<K,V>[] tab, int i,
                                          Node<K,V> c, Node<K,V> v) {
!         return U.compareAndSetReference(tab, ((long)i << ASHIFT) + ABASE, c, v);
      }
  
      static final <K,V> void setTabAt(Node<K,V>[] tab, int i, Node<K,V> v) {
!         U.putReferenceRelease(tab, ((long)i << ASHIFT) + ABASE, v);
      }
  
      /* ---------------- Fields -------------- */
  
      /**