Class MpscRelaxedAtomicArrayQueue<E>
- All Implemented Interfaces:
Iterable<E>
,Collection<E>
,Queue<E>
,MessagePassingQueue<E>
-
Nested Class Summary
Nested ClassesModifier and TypeClassDescriptionprivate static final class
Nested classes/interfaces inherited from interface org.jctools.queues.MessagePassingQueue
MessagePassingQueue.Consumer<T>, MessagePassingQueue.ExitCondition, MessagePassingQueue.Supplier<T>, MessagePassingQueue.WaitStrategy
-
Field Summary
FieldsModifier and TypeFieldDescriptionprivate final AtomicReferenceArray
<E> private final int
private final int
private final int
private final int
private final long
private final long
private final int
private final AtomicLongArray
Fields inherited from class org.jctools.queues.atomic.MpscRelaxedAtomicArrayQueueL3Pad
p01, p02, p03, p04, p05, p06, p07, p10, p11, p12, p13, p14, p15, p16, p17
Fields inherited from class org.jctools.queues.atomic.MpscAtomicArrayQueueConsumerPositionField
consumerPosition
Fields inherited from class org.jctools.queues.atomic.MpscRelaxedAtomicArrayQueueL2Pad
p00
Fields inherited from interface org.jctools.queues.MessagePassingQueue
UNBOUNDED_CAPACITY
-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionprivate static int
calcElementOffset
(int cycle, int positionWithinCycle, int cycleLengthLog2) private static int
calcElementOffset
(long position, long mask) int
capacity()
void
clear()
Removes all items from the queue.private static long
cycleId
(long producerCycleClaim, int cycleIdBitShift) int
Remove all available item from the queue and hand to consume.int
drain
(MessagePassingQueue.Consumer<E> c, int limit) Remove up to limit elements from the queue and hand to consume.void
drain
(MessagePassingQueue.Consumer<E> c, MessagePassingQueue.WaitStrategy w, MessagePassingQueue.ExitCondition exit) Remove elements from the queue and hand to consume forever.int
Stuff the queue with elements from the supplier.int
fill
(MessagePassingQueue.Supplier<E> s, int limit) Stuff the queue with up to limit elements from the supplier.void
fill
(MessagePassingQueue.Supplier<E> s, MessagePassingQueue.WaitStrategy w, MessagePassingQueue.ExitCondition exit) Stuff the queue with elements from the supplier forever.private boolean
isBackPressured
(long producerPosition) boolean
isEmpty()
This method's accuracy is subject to concurrent modifications happening as the observation is carried out.iterator()
boolean
Called from a producer thread subject to the restrictions appropriate to the implementation and according to theQueue.offer(Object)
interface.peek()
Called from the consumer thread subject to the restrictions appropriate to the implementation and according to theQueue.peek()
interface.poll()
Called from the consumer thread subject to the restrictions appropriate to the implementation and according to theQueue.poll()
interface.private E
pollMaybeEmpty
(AtomicReferenceArray<E> buffer, int offset, long consumerPosition) private static int
positionOnCycle
(long producerCycleClaim, int positionOnCycleMask) private static long
producerPosition
(long cycleId, int positionWithinCycle, int cycleLengthLog2) boolean
relaxedOffer
(E e) Called from a producer thread subject to the restrictions appropriate to the implementation.Called from the consumer thread subject to the restrictions appropriate to the implementation.Called from the consumer thread subject to the restrictions appropriate to the implementation.private void
rotateCycle
(AtomicLongArray producerCycleClaims, int activeCycle, long producerCycleClaim, int cycleIdBitShift, long maxCycleId) int
size()
This method's accuracy is subject to concurrent modifications happening as the size is estimated and as such is a best effort rather than absolute value.toString()
private void
validateSlowProducerClaim
(long cycleId, int positionOnCycle, int cycleLengthLog2) Methods inherited from class org.jctools.queues.atomic.MpscAtomicArrayQueueConsumerPositionField
lvConsumerPosition, soConsumerPosition
Methods inherited from class org.jctools.queues.atomic.MpscRelaxedAtomicArrayQueueProducerLimitField
lvProducerLimit, soProducerLimit
Methods inherited from class org.jctools.queues.atomic.MpscAtomicArrayQueueActiveCycleIdField
activeCycleIndex, casActiveCycleId, lvActiveCycleId, soActiveCycleId
Methods inherited from class java.util.AbstractQueue
add, addAll, element, remove
Methods inherited from class java.util.AbstractCollection
contains, containsAll, remove, removeAll, retainAll, toArray, toArray
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
Methods inherited from interface java.util.Collection
contains, containsAll, equals, hashCode, parallelStream, remove, removeAll, removeIf, retainAll, spliterator, stream, toArray, toArray, toArray
-
Field Details
-
mask
private final long mask -
capacity
private final int capacity -
cycleLength
private final int cycleLength -
cycleLengthLog2
private final int cycleLengthLog2 -
buffer
-
producerCycleClaim
-
positionOnCycleMask
private final int positionOnCycleMask -
cycleIdBitShift
private final int cycleIdBitShift -
maxCycleId
private final long maxCycleId
-
-
Constructor Details
-
MpscRelaxedAtomicArrayQueue
public MpscRelaxedAtomicArrayQueue(int capacity)
-
-
Method Details
-
iterator
- Specified by:
iterator
in interfaceCollection<E>
- Specified by:
iterator
in interfaceIterable<E>
- Specified by:
iterator
in classAbstractCollection<E>
-
positionOnCycle
private static int positionOnCycle(long producerCycleClaim, int positionOnCycleMask) -
cycleId
private static long cycleId(long producerCycleClaim, int cycleIdBitShift) -
producerPosition
private static long producerPosition(long cycleId, int positionWithinCycle, int cycleLengthLog2) -
calcElementOffset
private static int calcElementOffset(int cycle, int positionWithinCycle, int cycleLengthLog2) -
calcElementOffset
private static int calcElementOffset(long position, long mask) -
isBackPressured
private boolean isBackPressured(long producerPosition) -
rotateCycle
private void rotateCycle(AtomicLongArray producerCycleClaims, int activeCycle, long producerCycleClaim, int cycleIdBitShift, long maxCycleId) -
validateSlowProducerClaim
private void validateSlowProducerClaim(long cycleId, int positionOnCycle, int cycleLengthLog2) -
offer
Description copied from interface:MessagePassingQueue
Called from a producer thread subject to the restrictions appropriate to the implementation and according to theQueue.offer(Object)
interface. -
poll
Description copied from interface:MessagePassingQueue
Called from the consumer thread subject to the restrictions appropriate to the implementation and according to theQueue.poll()
interface. -
pollMaybeEmpty
-
peek
Description copied from interface:MessagePassingQueue
Called from the consumer thread subject to the restrictions appropriate to the implementation and according to theQueue.peek()
interface. -
size
public int size()Description copied from interface:MessagePassingQueue
This method's accuracy is subject to concurrent modifications happening as the size is estimated and as such is a best effort rather than absolute value. For some implementations this method may be O(n) rather than O(1).- Specified by:
size
in interfaceCollection<E>
- Specified by:
size
in interfaceMessagePassingQueue<E>
- Specified by:
size
in classAbstractCollection<E>
- Returns:
- number of messages in the queue, between 0 and
Integer.MAX_VALUE
but less or equals to capacity (if bounded).
-
clear
public void clear()Description copied from interface:MessagePassingQueue
Removes all items from the queue. Called from the consumer thread subject to the restrictions appropriate to the implementation and according to theCollection.clear()
interface.- Specified by:
clear
in interfaceCollection<E>
- Specified by:
clear
in interfaceMessagePassingQueue<E>
- Overrides:
clear
in classAbstractQueue<E>
-
isEmpty
public boolean isEmpty()Description copied from interface:MessagePassingQueue
This method's accuracy is subject to concurrent modifications happening as the observation is carried out.- Specified by:
isEmpty
in interfaceCollection<E>
- Specified by:
isEmpty
in interfaceMessagePassingQueue<E>
- Overrides:
isEmpty
in classAbstractCollection<E>
- Returns:
- true if empty, false otherwise
-
capacity
public int capacity()- Specified by:
capacity
in interfaceMessagePassingQueue<E>
- Returns:
- the capacity of this queue or
MessagePassingQueue.UNBOUNDED_CAPACITY
if not bounded
-
relaxedOffer
Description copied from interface:MessagePassingQueue
Called from a producer thread subject to the restrictions appropriate to the implementation. As opposed toQueue.offer(Object)
this method may return false without the queue being full.- Specified by:
relaxedOffer
in interfaceMessagePassingQueue<E>
- Parameters:
e
- notnull
, will throw NPE if it is- Returns:
- true if element was inserted into the queue, false if unable to offer
-
relaxedPoll
Description copied from interface:MessagePassingQueue
Called from the consumer thread subject to the restrictions appropriate to the implementation. As opposed toQueue.poll()
this method may returnnull
without the queue being empty.- Specified by:
relaxedPoll
in interfaceMessagePassingQueue<E>
- Returns:
- a message from the queue if one is available,
null
if unable to poll
-
relaxedPeek
Description copied from interface:MessagePassingQueue
Called from the consumer thread subject to the restrictions appropriate to the implementation. As opposed toQueue.peek()
this method may returnnull
without the queue being empty.- Specified by:
relaxedPeek
in interfaceMessagePassingQueue<E>
- Returns:
- a message from the queue if one is available,
null
if unable to peek
-
drain
Description copied from interface:MessagePassingQueue
Remove all available item from the queue and hand to consume. This should be semantically similar to:M m; while((m = relaxedPoll()) != null){ c.accept(m); }
There's no strong commitment to the queue being empty at the end of a drain. Called from a consumer thread subject to the restrictions appropriate to the implementation.WARNING: Explicit assumptions are made with regards to
MessagePassingQueue.Consumer.accept(T)
make sure you have read and understood these before using this method.- Specified by:
drain
in interfaceMessagePassingQueue<E>
- Returns:
- the number of polled elements
-
fill
Description copied from interface:MessagePassingQueue
Stuff the queue with elements from the supplier. Semantically similar to:while(relaxedOffer(s.get());
There's no strong commitment to the queue being full at the end of a fill. Called from a producer thread subject to the restrictions appropriate to the implementation.Unbounded queues will fill up the queue with a fixed amount rather than fill up to oblivion. WARNING: Explicit assumptions are made with regards to
MessagePassingQueue.Supplier.get()
make sure you have read and understood these before using this method.- Specified by:
fill
in interfaceMessagePassingQueue<E>
- Returns:
- the number of offered elements
-
drain
Description copied from interface:MessagePassingQueue
Remove up to limit elements from the queue and hand to consume. This should be semantically similar to:M m; int i = 0; for(;i < limit && (m = relaxedPoll()) != null; i++){ c.accept(m); } return i;
There's no strong commitment to the queue being empty at the end of a drain. Called from a consumer thread subject to the restrictions appropriate to the implementation.
WARNING: Explicit assumptions are made with regards to
MessagePassingQueue.Consumer.accept(T)
make sure you have read and understood these before using this method.- Specified by:
drain
in interfaceMessagePassingQueue<E>
- Returns:
- the number of polled elements
-
fill
Description copied from interface:MessagePassingQueue
Stuff the queue with up to limit elements from the supplier. Semantically similar to:for(int i=0; i < limit && relaxedOffer(s.get()); i++);
There's no strong commitment to the queue being full at the end of a fill. Called from a producer thread subject to the restrictions appropriate to the implementation. WARNING: Explicit assumptions are made with regards to
MessagePassingQueue.Supplier.get()
make sure you have read and understood these before using this method.- Specified by:
fill
in interfaceMessagePassingQueue<E>
- Returns:
- the number of offered elements
-
drain
public void drain(MessagePassingQueue.Consumer<E> c, MessagePassingQueue.WaitStrategy w, MessagePassingQueue.ExitCondition exit) Description copied from interface:MessagePassingQueue
Remove elements from the queue and hand to consume forever. Semantically similar to:int idleCounter = 0; while (exit.keepRunning()) { E e = relaxedPoll(); if(e==null){ idleCounter = wait.idle(idleCounter); continue; } idleCounter = 0; c.accept(e); }
Called from a consumer thread subject to the restrictions appropriate to the implementation.
WARNING: Explicit assumptions are made with regards to
MessagePassingQueue.Consumer.accept(T)
make sure you have read and understood these before using this method.- Specified by:
drain
in interfaceMessagePassingQueue<E>
-
fill
public void fill(MessagePassingQueue.Supplier<E> s, MessagePassingQueue.WaitStrategy w, MessagePassingQueue.ExitCondition exit) Description copied from interface:MessagePassingQueue
Stuff the queue with elements from the supplier forever. Semantically similar to:int idleCounter = 0; while (exit.keepRunning()) { E e = s.get(); while (!relaxedOffer(e)) { idleCounter = wait.idle(idleCounter); continue; } idleCounter = 0; }
Called from a producer thread subject to the restrictions appropriate to the implementation. The main difference being that implementors MUST assure room in the queue is available BEFORE calling
MessagePassingQueue.Supplier.get()
. WARNING: Explicit assumptions are made with regards toMessagePassingQueue.Supplier.get()
make sure you have read and understood these before using this method.- Specified by:
fill
in interfaceMessagePassingQueue<E>
-
toString
- Overrides:
toString
in classAbstractCollection<E>
-