1 /* 2 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 3 * 4 * This code is free software; you can redistribute it and/or modify it 5 * under the terms of the GNU General Public License version 2 only, as 6 * published by the Free Software Foundation. Oracle designates this 7 * particular file as subject to the "Classpath" exception as provided 8 * by Oracle in the LICENSE file that accompanied this code. 9 * 10 * This code is distributed in the hope that it will be useful, but WITHOUT 11 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 12 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 13 * version 2 for more details (a copy is included in the LICENSE file that 14 * accompanied this code). 15 * 16 * You should have received a copy of the GNU General Public License version 17 * 2 along with this work; if not, write to the Free Software Foundation, 18 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 19 * 20 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 21 * or visit www.oracle.com if you need additional information or have any 22 * questions. 23 */ 24 25 /* 26 * This file is available under and governed by the GNU General Public 27 * License version 2 only, as published by the Free Software Foundation. 28 * However, the following notice accompanied the original version of this 29 * file: 30 * 31 * Written by Doug Lea with assistance from members of JCP JSR-166 32 * Expert Group and released to the public domain, as explained at 33 * http://creativecommons.org/publicdomain/zero/1.0/ 34 */ 35 36 package java.util.concurrent.atomic; 37 import sun.misc.Unsafe; 38 39 /** 40 * An {@code int} array in which elements may be updated atomically. 41 * See the {@link java.util.concurrent.atomic} package 42 * specification for description of the properties of atomic 43 * variables. 44 * @since 1.5 45 * @author Doug Lea 46 */ 47 public class AtomicIntegerArray implements java.io.Serializable { 48 private static final long serialVersionUID = 2862133569453604235L; 49 50 private static final Unsafe unsafe = Unsafe.getUnsafe(); 51 private static final int base = unsafe.arrayBaseOffset(int[].class); 52 private static final int shift; 53 private final int[] array; 54 55 static { 56 int scale = unsafe.arrayIndexScale(int[].class); 57 if ((scale & (scale - 1)) != 0) 58 throw new Error("data type scale not a power of two"); 59 shift = 31 - Integer.numberOfLeadingZeros(scale); 60 } 61 62 private long checkedByteOffset(int i) { 63 if (i < 0 || i >= array.length) 64 throw new IndexOutOfBoundsException("index " + i); 65 66 return byteOffset(i); 67 } 68 69 private static long byteOffset(int i) { 70 return ((long) i << shift) + base; 71 } 72 73 /** 74 * Creates a new AtomicIntegerArray of the given length, with all 75 * elements initially zero. 76 * 77 * @param length the length of the array 78 */ 79 public AtomicIntegerArray(int length) { 80 array = new int[length]; 81 } 82 83 /** 84 * Creates a new AtomicIntegerArray with the same length as, and 85 * all elements copied from, the given array. 86 * 87 * @param array the array to copy elements from 88 * @throws NullPointerException if array is null 89 */ 90 public AtomicIntegerArray(int[] array) { 91 // Visibility guaranteed by final field guarantees 92 this.array = array.clone(); 93 } 94 95 /** 96 * Returns the length of the array. 97 * 98 * @return the length of the array 99 */ 100 public final int length() { 101 return array.length; 102 } 103 104 /** 105 * Gets the current value at position {@code i}. 106 * 107 * @param i the index 108 * @return the current value 109 */ 110 public final int get(int i) { 111 return getRaw(checkedByteOffset(i)); 112 } 113 114 private int getRaw(long offset) { 115 return unsafe.getIntVolatile(array, offset); 116 } 117 118 /** 119 * Sets the element at position {@code i} to the given value. 120 * 121 * @param i the index 122 * @param newValue the new value 123 */ 124 public final void set(int i, int newValue) { 125 unsafe.putIntVolatile(array, checkedByteOffset(i), newValue); 126 } 127 128 /** 129 * Eventually sets the element at position {@code i} to the given value. 130 * 131 * @param i the index 132 * @param newValue the new value 133 * @since 1.6 134 */ 135 public final void lazySet(int i, int newValue) { 136 unsafe.putOrderedInt(array, checkedByteOffset(i), newValue); 137 } 138 139 /** 140 * Atomically sets the element at position {@code i} to the given 141 * value and returns the old value. 142 * 143 * @param i the index 144 * @param newValue the new value 145 * @return the previous value 146 */ 147 public final int getAndSet(int i, int newValue) { 148 long offset = checkedByteOffset(i); 149 while (true) { 150 int current = getRaw(offset); 151 if (compareAndSetRaw(offset, current, newValue)) 152 return current; 153 } 154 } 155 156 /** 157 * Atomically sets the element at position {@code i} to the given 158 * updated value if the current value {@code ==} the expected value. 159 * 160 * @param i the index 161 * @param expect the expected value 162 * @param update the new value 163 * @return true if successful. False return indicates that 164 * the actual value was not equal to the expected value. 165 */ 166 public final boolean compareAndSet(int i, int expect, int update) { 167 return compareAndSetRaw(checkedByteOffset(i), expect, update); 168 } 169 170 private boolean compareAndSetRaw(long offset, int expect, int update) { 171 return unsafe.compareAndSwapInt(array, offset, expect, update); 172 } 173 174 /** 175 * Atomically sets the element at position {@code i} to the given 176 * updated value if the current value {@code ==} the expected value. 177 * 178 * <p>May <a href="package-summary.html#Spurious">fail spuriously</a> 179 * and does not provide ordering guarantees, so is only rarely an 180 * appropriate alternative to {@code compareAndSet}. 181 * 182 * @param i the index 183 * @param expect the expected value 184 * @param update the new value 185 * @return true if successful. 186 */ 187 public final boolean weakCompareAndSet(int i, int expect, int update) { 188 return compareAndSet(i, expect, update); 189 } 190 191 /** 192 * Atomically increments by one the element at index {@code i}. 193 * 194 * @param i the index 195 * @return the previous value 196 */ 197 public final int getAndIncrement(int i) { 198 return getAndAdd(i, 1); 199 } 200 201 /** 202 * Atomically decrements by one the element at index {@code i}. 203 * 204 * @param i the index 205 * @return the previous value 206 */ 207 public final int getAndDecrement(int i) { 208 return getAndAdd(i, -1); 209 } 210 211 /** 212 * Atomically adds the given value to the element at index {@code i}. 213 * 214 * @param i the index 215 * @param delta the value to add 216 * @return the previous value 217 */ 218 public final int getAndAdd(int i, int delta) { 219 long offset = checkedByteOffset(i); 220 while (true) { 221 int current = getRaw(offset); 222 if (compareAndSetRaw(offset, current, current + delta)) 223 return current; 224 } 225 } 226 227 /** 228 * Atomically increments by one the element at index {@code i}. 229 * 230 * @param i the index 231 * @return the updated value 232 */ 233 public final int incrementAndGet(int i) { 234 return addAndGet(i, 1); 235 } 236 237 /** 238 * Atomically decrements by one the element at index {@code i}. 239 * 240 * @param i the index 241 * @return the updated value 242 */ 243 public final int decrementAndGet(int i) { 244 return addAndGet(i, -1); 245 } 246 247 /** 248 * Atomically adds the given value to the element at index {@code i}. 249 * 250 * @param i the index 251 * @param delta the value to add 252 * @return the updated value 253 */ 254 public final int addAndGet(int i, int delta) { 255 long offset = checkedByteOffset(i); 256 while (true) { 257 int current = getRaw(offset); 258 int next = current + delta; 259 if (compareAndSetRaw(offset, current, next)) 260 return next; 261 } 262 } 263 264 /** 265 * Returns the String representation of the current values of array. 266 * @return the String representation of the current values of array 267 */ 268 public String toString() { 269 int iMax = array.length - 1; 270 if (iMax == -1) 271 return "[]"; 272 273 StringBuilder b = new StringBuilder(); 274 b.append('['); 275 for (int i = 0; ; i++) { 276 b.append(getRaw(byteOffset(i))); 277 if (i == iMax) 278 return b.append(']').toString(); 279 b.append(',').append(' '); 280 } 281 } 282 283 } --- EOF ---