private void incr(int i) { counts.incrementAndGet(i); }
private void incr(int i) { counts.incrementAndGet(i); }
public void record(long millis) { int index = rangeCounters.length() - 1; for (int i = 0; i < ranges.length; ++i) { if (millis < ranges[i]) { index = i; break; } } rangeCounters.incrementAndGet(index); }
private void doRemoveTask(TaskHandle taskHandle) { List<PrioritizedSplitRunner> splits; synchronized (this) { tasks.remove(taskHandle); splits = taskHandle.destroy(); // stop tracking splits (especially blocked splits which may never unblock) allSplits.removeAll(splits); intermediateSplits.removeAll(splits); blockedSplits.keySet().removeAll(splits); waitingSplits.removeAll(splits); } // call destroy outside of synchronized block as it is expensive and doesn't need a lock on the task executor for (PrioritizedSplitRunner split : splits) { split.destroy(); } // record completed stats long threadUsageNanos = taskHandle.getScheduledNanos(); completedTasksPerLevel.incrementAndGet(computeLevel(threadUsageNanos)); log.debug("Task finished or failed " + taskHandle.getTaskId()); }
private void splitFinished(PrioritizedSplitRunner split) { completedSplitsPerLevel.incrementAndGet(split.getPriority().getLevel()); synchronized (this) { allSplits.remove(split); long wallNanos = System.nanoTime() - split.getCreatedNanos(); splitWallTime.add(Duration.succinctNanos(wallNanos)); if (intermediateSplits.remove(split)) { intermediateSplitWallTime.add(wallNanos); intermediateSplitScheduledTime.add(split.getScheduledNanos()); intermediateSplitWaitTime.add(split.getWaitNanos()); intermediateSplitCpuTime.add(split.getCpuTimeNanos()); } else { leafSplitWallTime.add(wallNanos); leafSplitScheduledTime.add(split.getScheduledNanos()); leafSplitWaitTime.add(split.getWaitNanos()); leafSplitCpuTime.add(split.getCpuTimeNanos()); } TaskHandle taskHandle = split.getTaskHandle(); taskHandle.splitComplete(split); scheduleTaskIfNecessary(taskHandle); addNewEntrants(); } // call destroy outside of synchronized block as it is expensive and doesn't need a lock on the task executor split.destroy(); }
public void record(long millis) { int index = rangeCounters.length() - 1; for (int i = 0; i < ranges.length; ++i) { if (millis < ranges[i]) { index = i; break; } } rangeCounters.incrementAndGet(index); }
public long forceNext() { return longs.incrementAndGet(INDEX_HEAD); }
public long forceNext() { return longs.incrementAndGet(INDEX_HEAD); }
/** * Increments the count of the bucket closest to n, rounding UP. */ public void add(long n) { int index = Arrays.binarySearch(bucketOffsets, n); if (index < 0) { // inexact match, take the first bucket higher than n index = -index - 1; } // else exact match; we're good buckets.incrementAndGet(index); }
/** * Increments the hits in interval containing given 'value', rounding UP. * * @param value */ public void add(long value) { int index = Arrays.binarySearch(bins, value); if (index < 0) { // inexact match, take the first bin higher than value index = -index - 1; } hits.incrementAndGet(index); }
/** * Increments the hits in interval containing given 'value', rounding UP. * * @param value */ public void add(long value) { int index = Arrays.binarySearch(bins, value); if (index < 0) { // inexact match, take the first bin higher than value index = -index - 1; } hits.incrementAndGet(index); }
@Override public void complete() { long newTail = longs.incrementAndGet(INDEX_TAIL); assert newTail <= longs.get(INDEX_HEAD); }
public void record(long range) { int index = rangeCounters.length(); for (int i = 0; i < ranges.length; i++) { if (range == ranges[i]) { index = i; break; } } rangeCounters.incrementAndGet(index); }
@Override public void complete() { long newTail = longs.incrementAndGet(INDEX_TAIL); assert newTail <= longs.get(INDEX_HEAD); }
/** * Increments the count of the bucket closest to n, rounding UP. * * @param n */ public void add(long n) { buckets.incrementAndGet(findIndex(n)); }
@Override public final long receivedV0InvalidChecksum(int fragments) { return this.v0InvalidChecksum.incrementAndGet(intLog2(fragments - 1)); }
public long nextSequence(String name, int partitionId) { return sequenceGenerator(name).incrementAndGet(partitionId); }
@Override public long receivedV0InvalidMultipartFragment(final int fragmentIndex, final int expectedFragments) { final int target = ((Short.SIZE + 1) * intLog2(expectedFragments - 1)) + intLog2(fragmentIndex); return invalidFragments.incrementAndGet(target); }
@Override public long missingFragmentInDroppedMessage(final int fragmentIndex, final int expectedFragments) { final int target = ((Short.SIZE + 1) * intLog2(expectedFragments - 1)) + intLog2(fragmentIndex); return droppedFragments.incrementAndGet(target); }
private void updateBand(final long val) { int i; for (i=0; i<getRange().length && val > getRange()[i]; i++); getRangeVals().incrementAndGet(i); }