Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
/*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.jctools.queues.atomic.unpadded;
import java.util.concurrent.atomic.*;
import org.jctools.queues.*;
import static org.jctools.queues.atomic.AtomicQueueUtil.*;
import org.jctools.queues.atomic.AtomicReferenceArrayQueue;
import org.jctools.queues.atomic.SequencedAtomicReferenceArrayQueue;
/**
* NOTE: This class was automatically generated by org.jctools.queues.atomic.unpadded.JavaParsingAtomicUnpaddedArrayQueueGenerator
* which can found in the jctools-build module. The original source file is SpmcArrayQueue.java.
*/
abstract class SpmcAtomicUnpaddedArrayQueueL1Pad extends AtomicReferenceArrayQueue {
SpmcAtomicUnpaddedArrayQueueL1Pad(int capacity) {
super(capacity);
}
}
/**
* NOTE: This class was automatically generated by org.jctools.queues.atomic.unpadded.JavaParsingAtomicUnpaddedArrayQueueGenerator
* which can found in the jctools-build module. The original source file is SpmcArrayQueue.java.
*/
abstract class SpmcAtomicUnpaddedArrayQueueProducerIndexField extends SpmcAtomicUnpaddedArrayQueueL1Pad {
private static final AtomicLongFieldUpdater P_INDEX_UPDATER = AtomicLongFieldUpdater.newUpdater(SpmcAtomicUnpaddedArrayQueueProducerIndexField.class, "producerIndex");
private volatile long producerIndex;
SpmcAtomicUnpaddedArrayQueueProducerIndexField(int capacity) {
super(capacity);
}
@Override
public final long lvProducerIndex() {
return producerIndex;
}
final long lpProducerIndex() {
return producerIndex;
}
final void soProducerIndex(long newValue) {
P_INDEX_UPDATER.lazySet(this, newValue);
}
}
/**
* NOTE: This class was automatically generated by org.jctools.queues.atomic.unpadded.JavaParsingAtomicUnpaddedArrayQueueGenerator
* which can found in the jctools-build module. The original source file is SpmcArrayQueue.java.
*/
abstract class SpmcAtomicUnpaddedArrayQueueL2Pad extends SpmcAtomicUnpaddedArrayQueueProducerIndexField {
SpmcAtomicUnpaddedArrayQueueL2Pad(int capacity) {
super(capacity);
}
}
/**
* NOTE: This class was automatically generated by org.jctools.queues.atomic.unpadded.JavaParsingAtomicUnpaddedArrayQueueGenerator
* which can found in the jctools-build module. The original source file is SpmcArrayQueue.java.
*/
abstract class SpmcAtomicUnpaddedArrayQueueConsumerIndexField extends SpmcAtomicUnpaddedArrayQueueL2Pad {
private static final AtomicLongFieldUpdater C_INDEX_UPDATER = AtomicLongFieldUpdater.newUpdater(SpmcAtomicUnpaddedArrayQueueConsumerIndexField.class, "consumerIndex");
private volatile long consumerIndex;
SpmcAtomicUnpaddedArrayQueueConsumerIndexField(int capacity) {
super(capacity);
}
@Override
public final long lvConsumerIndex() {
return consumerIndex;
}
final boolean casConsumerIndex(long expect, long newValue) {
return C_INDEX_UPDATER.compareAndSet(this, expect, newValue);
}
}
/**
* NOTE: This class was automatically generated by org.jctools.queues.atomic.unpadded.JavaParsingAtomicUnpaddedArrayQueueGenerator
* which can found in the jctools-build module. The original source file is SpmcArrayQueue.java.
*/
abstract class SpmcAtomicUnpaddedArrayQueueMidPad extends SpmcAtomicUnpaddedArrayQueueConsumerIndexField {
SpmcAtomicUnpaddedArrayQueueMidPad(int capacity) {
super(capacity);
}
}
/**
* NOTE: This class was automatically generated by org.jctools.queues.atomic.unpadded.JavaParsingAtomicUnpaddedArrayQueueGenerator
* which can found in the jctools-build module. The original source file is SpmcArrayQueue.java.
*/
abstract class SpmcAtomicUnpaddedArrayQueueProducerIndexCacheField extends SpmcAtomicUnpaddedArrayQueueMidPad {
// This is separated from the consumerIndex which will be highly contended in the hope that this value spends most
// of it's time in a cache line that is Shared(and rarely invalidated)
private volatile long producerIndexCache;
SpmcAtomicUnpaddedArrayQueueProducerIndexCacheField(int capacity) {
super(capacity);
}
protected final long lvProducerIndexCache() {
return producerIndexCache;
}
protected final void svProducerIndexCache(long newValue) {
producerIndexCache = newValue;
}
}
/**
* NOTE: This class was automatically generated by org.jctools.queues.atomic.unpadded.JavaParsingAtomicUnpaddedArrayQueueGenerator
* which can found in the jctools-build module. The original source file is SpmcArrayQueue.java.
*/
abstract class SpmcAtomicUnpaddedArrayQueueL3Pad extends SpmcAtomicUnpaddedArrayQueueProducerIndexCacheField {
SpmcAtomicUnpaddedArrayQueueL3Pad(int capacity) {
super(capacity);
}
}
/**
* NOTE: This class was automatically generated by org.jctools.queues.atomic.unpadded.JavaParsingAtomicUnpaddedArrayQueueGenerator
* which can found in the jctools-build module. The original source file is SpmcArrayQueue.java.
*/
public class SpmcAtomicUnpaddedArrayQueue extends SpmcAtomicUnpaddedArrayQueueL3Pad {
public SpmcAtomicUnpaddedArrayQueue(final int capacity) {
super(capacity);
}
@Override
public boolean offer(final E e) {
if (null == e) {
throw new NullPointerException();
}
final AtomicReferenceArray buffer = this.buffer;
final int mask = this.mask;
final long currProducerIndex = lvProducerIndex();
final int offset = calcCircularRefElementOffset(currProducerIndex, mask);
if (null != lvRefElement(buffer, offset)) {
long size = currProducerIndex - lvConsumerIndex();
if (size > mask) {
return false;
} else {
// Bubble: This can happen because `poll` moves index before placing element.
// spin wait for slot to clear, buggers wait freedom
while (null != lvRefElement(buffer, offset)) {
// BURN
}
}
}
soRefElement(buffer, offset, e);
// single producer, so store ordered is valid. It is also required to correctly publish the element
// and for the consumers to pick up the tail value.
soProducerIndex(currProducerIndex + 1);
return true;
}
@Override
public E poll() {
long currentConsumerIndex;
long currProducerIndexCache = lvProducerIndexCache();
do {
currentConsumerIndex = lvConsumerIndex();
if (currentConsumerIndex >= currProducerIndexCache) {
long currProducerIndex = lvProducerIndex();
if (currentConsumerIndex >= currProducerIndex) {
return null;
} else {
currProducerIndexCache = currProducerIndex;
svProducerIndexCache(currProducerIndex);
}
}
} while (!casConsumerIndex(currentConsumerIndex, currentConsumerIndex + 1));
// consumers are gated on latest visible tail, and so can't see a null value in the queue or overtake
// and wrap to hit same location.
return removeElement(buffer, currentConsumerIndex, mask);
}
private E removeElement(final AtomicReferenceArray buffer, long index, final int mask) {
final int offset = calcCircularRefElementOffset(index, mask);
// load plain, element happens before it's index becomes visible
final E e = lpRefElement(buffer, offset);
// store ordered, make sure nulling out is visible. Producer is waiting for this value.
soRefElement(buffer, offset, null);
return e;
}
@Override
public E peek() {
final AtomicReferenceArray buffer = this.buffer;
final int mask = this.mask;
long currProducerIndexCache = lvProducerIndexCache();
long currentConsumerIndex;
long nextConsumerIndex = lvConsumerIndex();
E e;
do {
currentConsumerIndex = nextConsumerIndex;
if (currentConsumerIndex >= currProducerIndexCache) {
long currProducerIndex = lvProducerIndex();
if (currentConsumerIndex >= currProducerIndex) {
return null;
} else {
currProducerIndexCache = currProducerIndex;
svProducerIndexCache(currProducerIndex);
}
}
e = lvRefElement(buffer, calcCircularRefElementOffset(currentConsumerIndex, mask));
// sandwich the element load between 2 consumer index loads
nextConsumerIndex = lvConsumerIndex();
} while (null == e || nextConsumerIndex != currentConsumerIndex);
return e;
}
@Override
public boolean relaxedOffer(E e) {
if (null == e) {
throw new NullPointerException("Null is not a valid element");
}
final AtomicReferenceArray buffer = this.buffer;
final int mask = this.mask;
final long producerIndex = lpProducerIndex();
final int offset = calcCircularRefElementOffset(producerIndex, mask);
if (null != lvRefElement(buffer, offset)) {
return false;
}
soRefElement(buffer, offset, e);
// single producer, so store ordered is valid. It is also required to correctly publish the element
// and for the consumers to pick up the tail value.
soProducerIndex(producerIndex + 1);
return true;
}
@Override
public E relaxedPoll() {
return poll();
}
@Override
public E relaxedPeek() {
final AtomicReferenceArray buffer = this.buffer;
final int mask = this.mask;
long currentConsumerIndex;
long nextConsumerIndex = lvConsumerIndex();
E e;
do {
currentConsumerIndex = nextConsumerIndex;
e = lvRefElement(buffer, calcCircularRefElementOffset(currentConsumerIndex, mask));
// sandwich the element load between 2 consumer index loads
nextConsumerIndex = lvConsumerIndex();
} while (nextConsumerIndex != currentConsumerIndex);
return e;
}
@Override
public int drain(final Consumer c, final int limit) {
if (null == c)
throw new IllegalArgumentException("c is null");
if (limit < 0)
throw new IllegalArgumentException("limit is negative: " + limit);
if (limit == 0)
return 0;
final AtomicReferenceArray buffer = this.buffer;
final int mask = this.mask;
long currProducerIndexCache = lvProducerIndexCache();
int adjustedLimit = 0;
long currentConsumerIndex;
do {
currentConsumerIndex = lvConsumerIndex();
// is there any space in the queue?
if (currentConsumerIndex >= currProducerIndexCache) {
long currProducerIndex = lvProducerIndex();
if (currentConsumerIndex >= currProducerIndex) {
return 0;
} else {
currProducerIndexCache = currProducerIndex;
svProducerIndexCache(currProducerIndex);
}
}
// try and claim up to 'limit' elements in one go
int remaining = (int) (currProducerIndexCache - currentConsumerIndex);
adjustedLimit = Math.min(remaining, limit);
} while (!casConsumerIndex(currentConsumerIndex, currentConsumerIndex + adjustedLimit));
for (int i = 0; i < adjustedLimit; i++) {
c.accept(removeElement(buffer, currentConsumerIndex + i, mask));
}
return adjustedLimit;
}
@Override
public int fill(final Supplier s, final int limit) {
if (null == s)
throw new IllegalArgumentException("supplier is null");
if (limit < 0)
throw new IllegalArgumentException("limit is negative:" + limit);
if (limit == 0)
return 0;
final AtomicReferenceArray buffer = this.buffer;
final int mask = this.mask;
long producerIndex = this.lpProducerIndex();
for (int i = 0; i < limit; i++) {
final int offset = calcCircularRefElementOffset(producerIndex, mask);
if (null != lvRefElement(buffer, offset)) {
return i;
}
producerIndex++;
soRefElement(buffer, offset, s.get());
// ordered store -> atomic and ordered for size()
soProducerIndex(producerIndex);
}
return limit;
}
@Override
public int drain(final Consumer c) {
return MessagePassingQueueUtil.drain(this, c);
}
@Override
public int fill(final Supplier s) {
return fill(s, capacity());
}
@Override
public void drain(final Consumer c, final WaitStrategy w, final ExitCondition exit) {
MessagePassingQueueUtil.drain(this, c, w, exit);
}
@Override
public void fill(final Supplier s, final WaitStrategy w, final ExitCondition e) {
MessagePassingQueueUtil.fill(this, s, w, e);
}
}
