Package java.util.concurrent.atomic

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

416
417
418
419
420
421
422
423
424
425
426
    long oldValue = atomic.get();
    if (oldValue != value) {
      return false;
    }

    if (oldValue == 0L || atomic.compareAndSet(oldValue, 0L)) {
      // only remove after setting to zero, to avoid concurrent updates
      map.remove(key, atomic);
      // succeed even if the remove fails, since the value was already adjusted
      return true;
    }
View Full Code Here
433
434
435
436
437
438
439
440
441
442
443
           */
          try {
            startSignal.countDown();
            startSignal.await();
            long now = System.currentTimeMillis();
            startTime.compareAndSet(0, now);
            task.run();
          } catch (Throwable e) {
            Logger threadLog = Logger.getLogger(ConfigUtil.LINKBENCH_LOGGER);
            threadLog.error("Unrecoverable exception in worker thread:", e);
            Runtime.getRuntime().halt(1);
View Full Code Here
149
150
151
152
153
154
155
156
157
158
159
        long oldseed, nextseed;
        AtomicLong seed = this.seed;
        do {
            oldseed = seed.get();
            nextseed = (oldseed * multiplier + addend) & mask;
        } while (!seed.compareAndSet(oldseed, nextseed));
        return (int)(nextseed >>> (48 - bits));
    }

    /**
     * Generates random bytes and places them into a user-supplied
View Full Code Here
152
153
154
155
156
157
158
159
160
161
162
         log.debug("Building the index");
         forEachOnDisk(false, false, new EntryFunctor() {
            @Override
            public boolean apply(int file, int offset, int size, byte[] serializedKey, byte[] serializedMetadata, byte[] serializedValue, long seqId, long expiration) throws IOException, ClassNotFoundException {
               long prevSeqId;
               while (seqId > (prevSeqId = maxSeqId.get()) && !maxSeqId.compareAndSet(prevSeqId, seqId));
               Object key = marshaller.objectFromByteBuffer(serializedKey);
               if (trace) log.tracef("Loaded %d:%d (seqId %d, expiration %d)", file, offset, seqId, expiration);
               try {
                  // We may check the seqId safely as we are the only thread writing to index
                  EntryPosition entry = temporaryTable.get(key);
View Full Code Here
117
118
119
120
121
122
123
124
125
126
127
                public ServerCache call() throws Exception {
                    QueryPlan hashPlan = hashPlans[index];
                    ServerCache cache = hashClient.addHashCache(ranges, hashPlan.iterator(),
                            clientProjectors[index], hashPlan.getEstimatedSize(), hashExpressions[index], plan.getTableRef());
                    long endTime = System.currentTimeMillis();
                    boolean isSet = firstJobEndTime.compareAndSet(0, endTime);
                    if (!isSet && (endTime - firstJobEndTime.get()) > maxServerCacheTimeToLive) {
                        LOG.warn("Hash plan [" + index + "] execution seems too slow. Earlier hash cache(s) might have expired on servers.");
                    }
                    return cache;
                }
View Full Code Here
163
164
165
166
167
168
169
170
171
172
173
            AtomicLong size = sizes.get(id);
            if (size != null) {
                while(true) {
                    long expected = size.get();
                    long newValue = expected + s;
                    if (size.compareAndSet(expected, newValue)) {
                        break;
                    }
                }
            }
           
View Full Code Here
174
175
176
177
178
179
180
181
182
183
184
            AtomicLong count = counts.get(id);
            if (count != null) {
                while(true) {
                    long expected = count.get();
                    long newValue = expected + c;
                    if (count.compareAndSet(expected, newValue)) {
                        break;
                    }
                }
            }
        } else if (event instanceof Expunged) {
View Full Code Here
195
196
197
198
199
200
201
202
203
204
205
            AtomicLong size = sizes.get(id);
            if (size != null) {
                while(true) {
                    long expected = size.get();
                    long newValue = expected - s;
                    if (size.compareAndSet(expected, newValue)) {
                        break;
                    }
                }
            }
           
View Full Code Here
206
207
208
209
210
211
212
213
214
215
216
            AtomicLong count = counts.get(id);
            if (count != null) {
                while(true) {
                    long expected = count.get();
                    long newValue = expected - c;
                    if (count.compareAndSet(expected, newValue)) {
                        break;
                    }
                }
            }
        } else if (event instanceof MailboxAdded) {
View Full Code Here
110
111
112
113
114
115
116
117
118
119
120
                public ServerCache call() throws Exception {
                    QueryPlan hashPlan = hashPlans[index];
                    ServerCache cache = hashClient.addHashCache(ranges, hashPlan.iterator(),
                            hashPlan.getEstimatedSize(), hashExpressions[index], plan.getTableRef());
                    long endTime = System.currentTimeMillis();
                    boolean isSet = firstJobEndTime.compareAndSet(0, endTime);
                    if (!isSet && (endTime - firstJobEndTime.get()) > maxServerCacheTimeToLive) {
                        LOG.warn("Hash plan [" + index + "] execution seems too slow. Earlier hash cache(s) might have expired on servers.");
                    }
                    return cache;
                }
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.