2007-12-01 00:00:00 +00:00
|
|
|
/*
|
|
|
|
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
|
|
|
*
|
|
|
|
* This code is free software; you can redistribute it and/or modify it
|
|
|
|
* under the terms of the GNU General Public License version 2 only, as
|
2010-05-25 15:58:33 -07:00
|
|
|
* published by the Free Software Foundation. Oracle designates this
|
2007-12-01 00:00:00 +00:00
|
|
|
* particular file as subject to the "Classpath" exception as provided
|
2010-05-25 15:58:33 -07:00
|
|
|
* by Oracle in the LICENSE file that accompanied this code.
|
2007-12-01 00:00:00 +00:00
|
|
|
*
|
|
|
|
* This code is distributed in the hope that it will be useful, but WITHOUT
|
|
|
|
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
|
|
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
|
|
* version 2 for more details (a copy is included in the LICENSE file that
|
|
|
|
* accompanied this code).
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License version
|
|
|
|
* 2 along with this work; if not, write to the Free Software Foundation,
|
|
|
|
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
|
|
*
|
2010-05-25 15:58:33 -07:00
|
|
|
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
|
|
|
* or visit www.oracle.com if you need additional information or have any
|
|
|
|
* questions.
|
2007-12-01 00:00:00 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This file is available under and governed by the GNU General Public
|
|
|
|
* License version 2 only, as published by the Free Software Foundation.
|
|
|
|
* However, the following notice accompanied the original version of this
|
|
|
|
* file:
|
|
|
|
*
|
|
|
|
* Written by Doug Lea with assistance from members of JCP JSR-166
|
|
|
|
* Expert Group and released to the public domain, as explained at
|
2011-04-07 15:06:32 +01:00
|
|
|
* http://creativecommons.org/publicdomain/zero/1.0/
|
2007-12-01 00:00:00 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
package java.util.concurrent.atomic;
|
2013-01-16 12:09:35 +00:00
|
|
|
import java.util.function.UnaryOperator;
|
|
|
|
import java.util.function.BinaryOperator;
|
2007-12-01 00:00:00 +00:00
|
|
|
import sun.misc.Unsafe;
|
|
|
|
|
|
|
|
/**
|
|
|
|
* An object reference that may be updated atomically. See the {@link
|
|
|
|
* java.util.concurrent.atomic} package specification for description
|
|
|
|
* of the properties of atomic variables.
|
|
|
|
* @since 1.5
|
|
|
|
* @author Doug Lea
|
|
|
|
* @param <V> The type of object referred to by this reference
|
|
|
|
*/
|
2012-10-26 21:34:24 +01:00
|
|
|
public class AtomicReference<V> implements java.io.Serializable {
|
2007-12-01 00:00:00 +00:00
|
|
|
private static final long serialVersionUID = -1848883965231344442L;
|
|
|
|
|
|
|
|
private static final Unsafe unsafe = Unsafe.getUnsafe();
|
|
|
|
private static final long valueOffset;
|
|
|
|
|
|
|
|
static {
|
2011-12-05 13:58:44 +00:00
|
|
|
try {
|
|
|
|
valueOffset = unsafe.objectFieldOffset
|
|
|
|
(AtomicReference.class.getDeclaredField("value"));
|
|
|
|
} catch (Exception ex) { throw new Error(ex); }
|
2007-12-01 00:00:00 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
private volatile V value;
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Creates a new AtomicReference with the given initial value.
|
|
|
|
*
|
|
|
|
* @param initialValue the initial value
|
|
|
|
*/
|
|
|
|
public AtomicReference(V initialValue) {
|
|
|
|
value = initialValue;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Creates a new AtomicReference with null initial value.
|
|
|
|
*/
|
|
|
|
public AtomicReference() {
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Gets the current value.
|
|
|
|
*
|
|
|
|
* @return the current value
|
|
|
|
*/
|
|
|
|
public final V get() {
|
|
|
|
return value;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Sets to the given value.
|
|
|
|
*
|
|
|
|
* @param newValue the new value
|
|
|
|
*/
|
|
|
|
public final void set(V newValue) {
|
|
|
|
value = newValue;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Eventually sets to the given value.
|
|
|
|
*
|
|
|
|
* @param newValue the new value
|
|
|
|
* @since 1.6
|
|
|
|
*/
|
|
|
|
public final void lazySet(V newValue) {
|
|
|
|
unsafe.putOrderedObject(this, valueOffset, newValue);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Atomically sets the value to the given updated value
|
|
|
|
* if the current value {@code ==} the expected value.
|
|
|
|
* @param expect the expected value
|
|
|
|
* @param update the new value
|
|
|
|
* @return true if successful. False return indicates that
|
|
|
|
* the actual value was not equal to the expected value.
|
|
|
|
*/
|
|
|
|
public final boolean compareAndSet(V expect, V update) {
|
|
|
|
return unsafe.compareAndSwapObject(this, valueOffset, expect, update);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Atomically sets the value to the given updated value
|
|
|
|
* if the current value {@code ==} the expected value.
|
|
|
|
*
|
|
|
|
* <p>May <a href="package-summary.html#Spurious">fail spuriously</a>
|
|
|
|
* and does not provide ordering guarantees, so is only rarely an
|
|
|
|
* appropriate alternative to {@code compareAndSet}.
|
|
|
|
*
|
|
|
|
* @param expect the expected value
|
|
|
|
* @param update the new value
|
2013-01-10 21:52:38 +00:00
|
|
|
* @return true if successful
|
2007-12-01 00:00:00 +00:00
|
|
|
*/
|
|
|
|
public final boolean weakCompareAndSet(V expect, V update) {
|
|
|
|
return unsafe.compareAndSwapObject(this, valueOffset, expect, update);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Atomically sets to the given value and returns the old value.
|
|
|
|
*
|
|
|
|
* @param newValue the new value
|
|
|
|
* @return the previous value
|
|
|
|
*/
|
2013-01-10 21:52:38 +00:00
|
|
|
@SuppressWarnings("unchecked")
|
2007-12-01 00:00:00 +00:00
|
|
|
public final V getAndSet(V newValue) {
|
2013-01-10 21:52:38 +00:00
|
|
|
return (V)unsafe.getAndSetObject(this, valueOffset, newValue);
|
2007-12-01 00:00:00 +00:00
|
|
|
}
|
|
|
|
|
2013-01-16 12:09:35 +00:00
|
|
|
/**
|
|
|
|
* Atomically updates the current value with the results of
|
|
|
|
* applying the given function, returning the previous value. The
|
|
|
|
* function should be side-effect-free, since it may be re-applied
|
|
|
|
* when attempted updates fail due to contention among threads.
|
|
|
|
*
|
|
|
|
* @param updateFunction a side-effect-free function
|
|
|
|
* @return the previous value
|
|
|
|
* @since 1.8
|
|
|
|
*/
|
|
|
|
public final V getAndUpdate(UnaryOperator<V> updateFunction) {
|
|
|
|
V prev, next;
|
|
|
|
do {
|
|
|
|
prev = get();
|
|
|
|
next = updateFunction.operate(prev);
|
|
|
|
} while (!compareAndSet(prev, next));
|
|
|
|
return prev;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Atomically updates the current value with the results of
|
|
|
|
* applying the given function, returning the updated value. The
|
|
|
|
* function should be side-effect-free, since it may be re-applied
|
|
|
|
* when attempted updates fail due to contention among threads.
|
|
|
|
*
|
|
|
|
* @param updateFunction a side-effect-free function
|
|
|
|
* @return the updated value
|
|
|
|
* @since 1.8
|
|
|
|
*/
|
|
|
|
public final V updateAndGet(UnaryOperator<V> updateFunction) {
|
|
|
|
V prev, next;
|
|
|
|
do {
|
|
|
|
prev = get();
|
|
|
|
next = updateFunction.operate(prev);
|
|
|
|
} while (!compareAndSet(prev, next));
|
|
|
|
return next;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Atomically updates the current value with the results of
|
|
|
|
* applying the given function to the current and given values,
|
|
|
|
* returning the previous value. The function should be
|
|
|
|
* side-effect-free, since it may be re-applied when attempted
|
|
|
|
* updates fail due to contention among threads. The function
|
|
|
|
* is applied with the current value as its first argument,
|
|
|
|
* and the given update as the second argument.
|
|
|
|
*
|
|
|
|
* @param x the update value
|
|
|
|
* @param accumulatorFunction a side-effect-free function of two arguments
|
|
|
|
* @return the previous value
|
|
|
|
* @since 1.8
|
|
|
|
*/
|
|
|
|
public final V getAndAccumulate(V x,
|
|
|
|
BinaryOperator<V> accumulatorFunction) {
|
|
|
|
V prev, next;
|
|
|
|
do {
|
|
|
|
prev = get();
|
|
|
|
next = accumulatorFunction.operate(prev, x);
|
|
|
|
} while (!compareAndSet(prev, next));
|
|
|
|
return prev;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Atomically updates the current value with the results of
|
|
|
|
* applying the given function to the current and given values,
|
|
|
|
* returning the updated value. The function should be
|
|
|
|
* side-effect-free, since it may be re-applied when attempted
|
|
|
|
* updates fail due to contention among threads. The function
|
|
|
|
* is applied with the current value as its first argument,
|
|
|
|
* and the given update as the second argument.
|
|
|
|
*
|
|
|
|
* @param x the update value
|
|
|
|
* @param accumulatorFunction a side-effect-free function of two arguments
|
|
|
|
* @return the updated value
|
|
|
|
* @since 1.8
|
|
|
|
*/
|
|
|
|
public final V accumulateAndGet(V x,
|
|
|
|
BinaryOperator<V> accumulatorFunction) {
|
|
|
|
V prev, next;
|
|
|
|
do {
|
|
|
|
prev = get();
|
|
|
|
next = accumulatorFunction.operate(prev, x);
|
|
|
|
} while (!compareAndSet(prev, next));
|
|
|
|
return next;
|
|
|
|
}
|
|
|
|
|
2007-12-01 00:00:00 +00:00
|
|
|
/**
|
|
|
|
* Returns the String representation of the current value.
|
2013-01-10 21:52:38 +00:00
|
|
|
* @return the String representation of the current value
|
2007-12-01 00:00:00 +00:00
|
|
|
*/
|
|
|
|
public String toString() {
|
|
|
|
return String.valueOf(get());
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|