Package java.util.concurrent.atomic

Examples of java.util.concurrent.atomic.AtomicInteger.compareAndSet()

105
106
107
108
109
110
111
112
113
114
115
    } else {
      Logger.debug("Lock Refused - Realtime " + lockIndex.toString());
      throw FAILURE_EXCEPTION;
    }
   
    boolean isLocked = lock.compareAndSet(val, val | LOCK);
   
    if( !isLocked){
      Logger.debug("Remote Lock Failed: Concurrent Locked object");
      throw FAILURE_EXCEPTION;
    }   
View Full Code Here
181
182
183
184
185
186
187
188
189
190
191
        return true;
      Logger.debug("Locally Locked object");
      throw FAILURE_EXCEPTION;
    }
   
    boolean isLocked = lock.compareAndSet(val, val | LOCK);
   
    if( !isLocked){
      Logger.debug("Being Locked object");
      throw FAILURE_EXCEPTION;
    }   
View Full Code Here
229
230
231
232
233
234
235
236
237
238
239
      Logger.debug("Lock Refused - Realtime " + lockIndex.toString());
      //System.out.println("Lock Refused - Realtime " + lockIndex.toString());
      throw FAILURE_EXCEPTION;
    }
       
    boolean isLocked = lock.compareAndSet(val, val | LOCK);
   
    if( !isLocked){
      Logger.debug("Being Locked object");
      //System.out.println("Being Locked object");
      throw FAILURE_EXCEPTION;
View Full Code Here
182
183
184
185
186
187
188
189
190
191
192
      Logger.debug("Can't unlock remote object");
      return false;
    }
   
    int unlockedValue = val & UNLOCK;
    if(!lock.compareAndSet(val, unlockedValue)){
      Logger.debug("Fail due to concurrent unlock!!");
      return false;
    }
   
    if(contextLocks!=null)
View Full Code Here
314
315
316
317
318
319
320
321
322
323
324
      Logger.debug("Can't unlock remote object");
      return false;
    }
   
    int unlockedValue = val & UNLOCK;
    if(!lock.compareAndSet(val, unlockedValue)){
      Logger.fetal("Fail due to concurrent unlock!!");
      return false;
    }
   
    if(contextLocks!=null)
View Full Code Here
340
341
342
343
344
345
346
347
348
  public boolean kill() {
    Object[] metadata = registery.get(txnId);
    if(metadata==null)
      return true;
    AtomicInteger status = ((AtomicInteger)metadata[STATUS_INDEX]);
    return status.get()==ABORTED || status.compareAndSet(ACTIVE, ABORTED);
  }

}
View Full Code Here
228
229
230
231
232
233
234
235
236
237
238
      while (true) {
        int oldValue = existingCounter.get();
        if (oldValue != 0) {
          try {
            int newValue = IntMath.checkedAdd(oldValue, occurrences);
            if (existingCounter.compareAndSet(oldValue, newValue)) {
              // newValue can't == 0, so no need to check & remove
              return oldValue;
            }
          } catch (ArithmeticException overflow) {
            throw new IllegalArgumentException("Overflow adding " + occurrences
View Full Code Here
285
286
287
288
289
290
291
292
293
294
295
    }
    while (true) {
      int oldValue = existingCounter.get();
      if (oldValue != 0) {
        int newValue = Math.max(0, oldValue - occurrences);
        if (existingCounter.compareAndSet(oldValue, newValue)) {
          if (newValue == 0) {
            // Just CASed to 0; remove the entry to clean up the map. If the removal fails,
            // another thread has already replaced it with a new counter, which is fine.
            countMap.remove(element, existingCounter);
          }
View Full Code Here
326
327
328
329
330
331
332
333
334
335
336
      int oldValue = existingCounter.get();
      if (oldValue < occurrences) {
        return false;
      }
      int newValue = oldValue - occurrences;
      if (existingCounter.compareAndSet(oldValue, newValue)) {
        if (newValue == 0) {
          // Just CASed to 0; remove the entry to clean up the map. If the removal fails,
          // another thread has already replaced it with a new counter, which is fine.
          countMap.remove(element, existingCounter);
        }
View Full Code Here
228
229
230
231
232
233
234
235
236
237
238
      while (true) {
        int oldValue = existingCounter.get();
        if (oldValue != 0) {
          try {
            int newValue = IntMath.checkedAdd(oldValue, occurrences);
            if (existingCounter.compareAndSet(oldValue, newValue)) {
              // newValue can't == 0, so no need to check & remove
              return oldValue;
            }
          } catch (ArithmeticException overflow) {
            throw new IllegalArgumentException("Overflow adding " + occurrences
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.