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 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477
|
//******************************************************************************
//
// File: SharedFloatArray.java
// Package: edu.rit.pj.reduction
// Unit: Class edu.rit.pj.reduction.SharedFloatArray
//
// This Java source file is copyright (C) 2007 by Alan Kaminsky. All rights
// reserved. For further information, contact the author, Alan Kaminsky, at
// ark@cs.rit.edu.
//
// This Java source file is part of the Parallel Java Library ("PJ"). PJ is free
// software; you can redistribute it and/or modify it under the terms of the GNU
// General Public License as published by the Free Software Foundation; either
// version 3 of the License, or (at your option) any later version.
//
// PJ 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 for more details.
//
// Linking this library statically or dynamically with other modules is making a
// combined work based on this library. Thus, the terms and conditions of the
// GNU General Public License cover the whole combination.
//
// As a special exception, the copyright holders of this library give you
// permission to link this library with independent modules to produce an
// executable, regardless of the license terms of these independent modules, and
// to copy and distribute the resulting executable under terms of your choice,
// provided that you also meet, for each linked independent module, the terms
// and conditions of the license of that module. An independent module is a
// module which is not derived from or based on this library. If you modify this
// library, you may extend this exception to your version of the library, but
// you are not obligated to do so. If you do not wish to do so, delete this
// exception statement from your version.
//
// A copy of the GNU General Public License is provided in the file gpl.txt. You
// may also obtain a copy of the GNU General Public License on the World Wide
// Web at http://www.gnu.org/licenses/gpl.html.
//
//******************************************************************************
package edu.rit.pj.reduction;
import java.util.concurrent.atomic.AtomicIntegerArray;
/**
* Class SharedFloatArray provides an array reduction variable with elements
* of type <TT>float</TT>.
* <P>
* Class SharedFloatArray is multiple thread safe. The methods use lock-free
* atomic compare-and-set.
* <P>
* <I>Note:</I> Class SharedFloatArray is implemented using class
* java.util.concurrent.atomic.AtomicIntegerArray. Each float array element is
* stored as an <TT>int</TT> whose bit pattern is the same as the float value.
*
* @author Alan Kaminsky
* @version 24-Aug-2007
*/
public class SharedFloatArray
{
// Hidden data members.
private AtomicIntegerArray myArray;
// Exported constructors.
/**
* Construct a new float array reduction variable with the given length.
* Each array element is initially 0.
*
* @param len Length.
*
* @exception NegativeArraySizeException
* (unchecked exception) Thrown if <TT>len</TT> < 0.
*/
public SharedFloatArray
(int len)
{
myArray = new AtomicIntegerArray (len);
}
/**
* Construct a new float array reduction variable whose elements are
* copied from the given array.
*
* @param array Array to copy.
*
* @exception NullPointerException
* (unchecked exception) Thrown if <TT>array</TT> is null.
*/
public SharedFloatArray
(float[] array)
{
int n = array.length;
int[] intarray = new int [n];
for (int i = 0; i < n; ++ i)
{
intarray[i] = Float.floatToIntBits (array[i]);
}
myArray = new AtomicIntegerArray (intarray);
}
// Exported operations.
/**
* Returns this array reduction variable's length.
*
* @return Length.
*/
public int length()
{
return myArray.length();
}
/**
* Returns this array reduction variable's current value at the given index.
*
* @param i Index.
*
* @return Current value.
*/
public float get
(int i)
{
return Float.intBitsToFloat (myArray.get (i));
}
/**
* Set this array reduction variable at the given index to the given value.
*
* @param i Index.
* @param value New value.
*/
public void set
(int i,
float value)
{
myArray.set (i, Float.floatToIntBits (value));
}
/**
* Set this array reduction variable at the given index to the given value
* and return the previous value.
*
* @param i Index.
* @param value New value.
*
* @return Previous value.
*/
public float getAndSet
(int i,
float value)
{
return Float.intBitsToFloat
(myArray.getAndSet (i, Float.floatToIntBits (value)));
}
/**
* Atomically set this array reduction variable at the given index to the
* given updated value if the current value equals the expected value.
*
* @param i Index.
* @param expect Expected value.
* @param update Updated value.
*
* @return True if the update happened, false otherwise.
*/
public boolean compareAndSet
(int i,
float expect,
float update)
{
return myArray.compareAndSet
(i, Float.floatToIntBits (expect), Float.floatToIntBits (update));
}
/**
* Atomically set this array reduction variable at the given index to the
* given updated value if the current value equals the expected value. May
* fail spuriously.
*
* @param i Index.
* @param expect Expected value.
* @param update Updated value.
*
* @return True if the update happened, false otherwise.
*/
public boolean weakCompareAndSet
(int i,
float expect,
float update)
{
return myArray.weakCompareAndSet
(i, Float.floatToIntBits (expect), Float.floatToIntBits (update));
}
/**
* Add one to this array reduction variable at the given index and return
* the previous value.
*
* @param i Index.
*
* @return Previous value.
*/
public float getAndIncrement
(int i)
{
for (;;)
{
int oldvalueInt = myArray.get (i);
float oldvalue = Float.intBitsToFloat (oldvalueInt);
float newvalue = oldvalue + 1.0f;
int newvalueInt = Float.floatToIntBits (newvalue);
if (myArray.compareAndSet (i, oldvalueInt, newvalueInt))
{
return oldvalue;
}
}
}
/**
* Subtract one from this array reduction variable at the given index and
* return the previous value.
*
* @param i Index.
*
* @return Previous value.
*/
public float getAndDecrement
(int i)
{
for (;;)
{
int oldvalueInt = myArray.get (i);
float oldvalue = Float.intBitsToFloat (oldvalueInt);
float newvalue = oldvalue - 1.0f;
int newvalueInt = Float.floatToIntBits (newvalue);
if (myArray.compareAndSet (i, oldvalueInt, newvalueInt))
{
return oldvalue;
}
}
}
/**
* Add the given value to this array reduction variable at the given index
* and return the previous value.
*
* @param i Index.
* @param value Value to add.
*
* @return Previous value.
*/
public float getAndAdd
(int i,
float value)
{
for (;;)
{
int oldvalueInt = myArray.get (i);
float oldvalue = Float.intBitsToFloat (oldvalueInt);
float newvalue = oldvalue + value;
int newvalueInt = Float.floatToIntBits (newvalue);
if (myArray.compareAndSet (i, oldvalueInt, newvalueInt))
{
return oldvalue;
}
}
}
/**
* Add one to this array reduction variable at the given index and return
* the new value.
*
* @param i Index.
*
* @return New value.
*/
public float incrementAndGet
(int i)
{
for (;;)
{
int oldvalueInt = myArray.get (i);
float oldvalue = Float.intBitsToFloat (oldvalueInt);
float newvalue = oldvalue + 1.0f;
int newvalueInt = Float.floatToIntBits (newvalue);
if (myArray.compareAndSet (i, oldvalueInt, newvalueInt))
{
return newvalue;
}
}
}
/**
* Subtract one from this array reduction variable at the given index and
* return the new value.
*
* @param i Index.
*
* @return New value.
*/
public float decrementAndGet
(int i)
{
for (;;)
{
int oldvalueInt = myArray.get (i);
float oldvalue = Float.intBitsToFloat (oldvalueInt);
float newvalue = oldvalue - 1.0f;
int newvalueInt = Float.floatToIntBits (newvalue);
if (myArray.compareAndSet (i, oldvalueInt, newvalueInt))
{
return newvalue;
}
}
}
/**
* Add the given value to this array reduction variable at the given index
* and return the new value.
*
* @param i Index.
* @param value Value to add.
*
* @return New value.
*/
public float addAndGet
(int i,
float value)
{
for (;;)
{
int oldvalueInt = myArray.get (i);
float oldvalue = Float.intBitsToFloat (oldvalueInt);
float newvalue = oldvalue + value;
int newvalueInt = Float.floatToIntBits (newvalue);
if (myArray.compareAndSet (i, oldvalueInt, newvalueInt))
{
return newvalue;
}
}
}
/**
* Combine this array reduction variable at the given index with the given
* value using the given operation. (This array <TT>[i]</TT>) is set to
* (this array <TT>[i]</TT>) <I>op</I> (<TT>value</TT>), then (this array
* <TT>[i]</TT>) is returned.
*
* @param i Index.
* @param value Value.
* @param op Binary operation.
*
* @return (This array <TT>[i]</TT>) <I>op</I> (<TT>value</TT>).
*/
public float reduce
(int i,
float value,
FloatOp op)
{
for (;;)
{
int oldvalueInt = myArray.get (i);
float oldvalue = Float.intBitsToFloat (oldvalueInt);
float newvalue = op.op (oldvalue, value);
int newvalueInt = Float.floatToIntBits (newvalue);
if (myArray.compareAndSet (i, oldvalueInt, newvalueInt))
{
return newvalue;
}
}
}
/**
* Combine this array reduction variable with the given array using the
* given operation. For each index <TT>i</TT> from 0 to this array's
* length-1, (this array <TT>[i]</TT>) is set to (this array <TT>[i]</TT>)
* <I>op</I> (<TT>src[i]</TT>).
* <P>
* The <TT>reduce()</TT> method is multiple thread safe <I>on a per-element
* basis.</I> Each individual array element is updated atomically, but the
* array as a whole is not updated atomically.
*
* @param src Source array.
* @param op Binary operation.
*
* @exception NullPointerException
* (unchecked exception) Thrown if <TT>src</TT> is null. Thrown if
* <TT>op</TT> is null.
* @exception IndexOutOfBoundsException
* (unchecked exception) Thrown if any array index would be out of
* bounds.
*/
public void reduce
(float[] src,
FloatOp op)
{
reduce (0, src, 0, myArray.length(), op);
}
/**
* Combine a portion of this array reduction variable with a portion of the
* given array using the given operation. For each index <TT>i</TT> from 0
* to <TT>len</TT>-1, (this array <TT>[dstoff+i]</TT>) is set to (this array
* <TT>[dstoff+i]</TT>) <I>op</I> (<TT>src[srcoff+i]</TT>).
* <P>
* The <TT>reduce()</TT> method is multiple thread safe <I>on a per-element
* basis.</I> Each individual array element is updated atomically, but the
* array as a whole is not updated atomically.
*
* @param dstoff Index of first element to update in this array.
* @param src Source array.
* @param srcoff Index of first element to update from in the source
* array.
* @param len Number of array elements to update.
* @param op Binary operation.
*
* @exception NullPointerException
* (unchecked exception) Thrown if <TT>src</TT> is null. Thrown if
* <TT>op</TT> is null.
* @exception IndexOutOfBoundsException
* (unchecked exception) Thrown if <TT>len</TT> < 0. Thrown if any
* array index would be out of bounds.
*/
public void reduce
(int dstoff,
float[] src,
int srcoff,
int len,
FloatOp op)
{
if
(len < 0 ||
dstoff < 0 || dstoff+len > myArray.length() ||
srcoff < 0 || srcoff+len > src.length)
{
throw new IndexOutOfBoundsException();
}
while (len > 0)
{
updateLoop: for (;;)
{
int oldvalueInt = myArray.get (dstoff);
float oldvalue = Float.intBitsToFloat (oldvalueInt);
float newvalue = op.op (oldvalue, src[srcoff]);
int newvalueInt = Float.floatToIntBits (newvalue);
if (myArray.compareAndSet (dstoff, oldvalueInt, newvalueInt))
break updateLoop;
}
++ dstoff;
++ srcoff;
-- len;
}
}
/**
* Returns a string version of this array reduction variable.
*
* @return String version.
*/
public String toString()
{
StringBuilder b = new StringBuilder();
b.append ('[');
int n = myArray.length();
for (int i = 0; i < n; ++ i)
{
if (i > 0) b.append (", ");
b.append (get (i));
}
b.append (']');
return b.toString();
}
}
|