1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245
|
/*
File: SynchronizedLong.java
Originally written by Doug Lea and released into the public domain.
This may be used for any purposes whatsoever without acknowledgment.
Thanks for the assistance and support of Sun Microsystems Labs,
and everyone contributing, testing, and using this code.
History:
Date Who What
19Jun1998 dl Create public version
15Apr2003 dl Removed redundant "synchronized" for multiply()
23jan04 dl synchronize self-swap case for swap
*/
package EDU.oswego.cs.dl.util.concurrent;
/**
* A class useful for offloading synch for long instance variables.
*
* <p>[<a href="http://gee.cs.oswego.edu/dl/classes/EDU/oswego/cs/dl/util/concurrent/intro.html"> Introduction to this package. </a>]
**/
public class SynchronizedLong extends SynchronizedVariable implements Comparable, Cloneable {
protected long value_;
/**
* Make a new SynchronizedLong with the given initial value,
* and using its own internal lock.
**/
public SynchronizedLong(long initialValue) {
super();
value_ = initialValue;
}
/**
* Make a new SynchronizedLong with the given initial value,
* and using the supplied lock.
**/
public SynchronizedLong(long initialValue, Object lock) {
super(lock);
value_ = initialValue;
}
/**
* Return the current value
**/
public final long get() { synchronized(lock_) { return value_; } }
/**
* Set to newValue.
* @return the old value
**/
public long set(long newValue) {
synchronized (lock_) {
long old = value_;
value_ = newValue;
return old;
}
}
/**
* Set value to newValue only if it is currently assumedValue.
* @return true if successful
**/
public boolean commit(long assumedValue, long newValue) {
synchronized(lock_) {
boolean success = (assumedValue == value_);
if (success) value_ = newValue;
return success;
}
}
/**
* Atomically swap values with another SynchronizedLong.
* Uses identityHashCode to avoid deadlock when
* two SynchronizedLongs attempt to simultaneously swap with each other.
* @return the new value
**/
public long swap(SynchronizedLong other) {
if (other == this) return get();
SynchronizedLong fst = this;
SynchronizedLong snd = other;
if (System.identityHashCode(fst) > System.identityHashCode(snd)) {
fst = other;
snd = this;
}
synchronized(fst.lock_) {
synchronized(snd.lock_) {
fst.set(snd.set(fst.get()));
return get();
}
}
}
/**
* Increment the value.
* @return the new value
**/
public long increment() {
synchronized (lock_) {
return ++value_;
}
}
/**
* Decrement the value.
* @return the new value
**/
public long decrement() {
synchronized (lock_) {
return --value_;
}
}
/**
* Add amount to value (i.e., set value += amount)
* @return the new value
**/
public long add(long amount) {
synchronized (lock_) {
return value_ += amount;
}
}
/**
* Subtract amount from value (i.e., set value -= amount)
* @return the new value
**/
public long subtract(long amount) {
synchronized (lock_) {
return value_ -= amount;
}
}
/**
* Multiply value by factor (i.e., set value *= factor)
* @return the new value
**/
public long multiply(long factor) {
synchronized (lock_) {
return value_ *= factor;
}
}
/**
* Divide value by factor (i.e., set value /= factor)
* @return the new value
**/
public long divide(long factor) {
synchronized (lock_) {
return value_ /= factor;
}
}
/**
* Set the value to the negative of its old value
* @return the new value
**/
public long negate() {
synchronized (lock_) {
value_ = -value_;
return value_;
}
}
/**
* Set the value to its complement
* @return the new value
**/
public long complement() {
synchronized (lock_) {
value_ = ~value_;
return value_;
}
}
/**
* Set value to value & b.
* @return the new value
**/
public long and(long b) {
synchronized (lock_) {
value_ = value_ & b;
return value_;
}
}
/**
* Set value to value | b.
* @return the new value
**/
public long or(long b) {
synchronized (lock_) {
value_ = value_ | b;
return value_;
}
}
/**
* Set value to value ^ b.
* @return the new value
**/
public long xor(long b) {
synchronized (lock_) {
value_ = value_ ^ b;
return value_;
}
}
public int compareTo(long other) {
long val = get();
return (val < other)? -1 : (val == other)? 0 : 1;
}
public int compareTo(SynchronizedLong other) {
return compareTo(other.get());
}
public int compareTo(Object other) {
return compareTo((SynchronizedLong)other);
}
public boolean equals(Object other) {
if (other != null &&
other instanceof SynchronizedLong)
return get() == ((SynchronizedLong)other).get();
else
return false;
}
public int hashCode() { // same expression as java.lang.Long
long v = get();
return (int)(v ^ (v >> 32));
}
public String toString() { return String.valueOf(get()); }
}
|