Class MpscRelaxedAtomicArrayQueue<E>
- java.lang.Object
-
- java.util.AbstractCollection<E>
-
- java.util.AbstractQueue<E>
-
- org.jctools.queues.atomic.MpscAtomicArrayQueueL0Pad<E>
-
- org.jctools.queues.atomic.MpscAtomicArrayQueueActiveCycleIdField<E>
-
- org.jctools.queues.atomic.MpscRelaxedAtomicArrayQueueMidPad<E>
-
- org.jctools.queues.atomic.MpscRelaxedAtomicArrayQueueProducerLimitField<E>
-
- org.jctools.queues.atomic.MpscRelaxedAtomicArrayQueueL2Pad<E>
-
- org.jctools.queues.atomic.MpscAtomicArrayQueueConsumerPositionField<E>
-
- org.jctools.queues.atomic.MpscRelaxedAtomicArrayQueueL3Pad<E>
-
- org.jctools.queues.atomic.MpscRelaxedAtomicArrayQueue<E>
-
- All Implemented Interfaces:
java.lang.Iterable<E>,java.util.Collection<E>,java.util.Queue<E>,MessagePassingQueue<E>
public final class MpscRelaxedAtomicArrayQueue<E> extends MpscRelaxedAtomicArrayQueueL3Pad<E> implements MessagePassingQueue<E>
-
-
Nested Class Summary
Nested Classes Modifier and Type Class Description private static classMpscRelaxedAtomicArrayQueue.AtomicLongArrayAccess-
Nested classes/interfaces inherited from interface org.jctools.queues.MessagePassingQueue
MessagePassingQueue.Consumer<T>, MessagePassingQueue.ExitCondition, MessagePassingQueue.Supplier<T>, MessagePassingQueue.WaitStrategy
-
-
Field Summary
Fields Modifier and Type Field Description private java.util.concurrent.atomic.AtomicReferenceArray<E>bufferprivate intcapacityprivate intcycleIdBitShiftprivate intcycleLengthprivate intcycleLengthLog2private longmaskprivate longmaxCycleIdprivate intpositionOnCycleMaskprivate java.util.concurrent.atomic.AtomicLongArrayproducerCycleClaim-
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 Constructor Description MpscRelaxedAtomicArrayQueue(int capacity)
-
Method Summary
All Methods Static Methods Instance Methods Concrete Methods Modifier and Type Method Description private static intcalcElementOffset(int cycle, int positionWithinCycle, int cycleLengthLog2)private static intcalcElementOffset(long position, long mask)intcapacity()voidclear()Removes all items from the queue.private static longcycleId(long producerCycleClaim, int cycleIdBitShift)intdrain(MessagePassingQueue.Consumer<E> c)Remove all available item from the queue and hand to consume.intdrain(MessagePassingQueue.Consumer<E> c, int limit)Remove up to limit elements from the queue and hand to consume.voiddrain(MessagePassingQueue.Consumer<E> c, MessagePassingQueue.WaitStrategy w, MessagePassingQueue.ExitCondition exit)Remove elements from the queue and hand to consume forever.intfill(MessagePassingQueue.Supplier<E> s)Stuff the queue with elements from the supplier.intfill(MessagePassingQueue.Supplier<E> s, int limit)Stuff the queue with up to limit elements from the supplier.voidfill(MessagePassingQueue.Supplier<E> s, MessagePassingQueue.WaitStrategy w, MessagePassingQueue.ExitCondition exit)Stuff the queue with elements from the supplier forever.private booleanisBackPressured(long producerPosition)booleanisEmpty()This method's accuracy is subject to concurrent modifications happening as the observation is carried out.java.util.Iterator<E>iterator()booleanoffer(E e)Called from a producer thread subject to the restrictions appropriate to the implementation and according to theQueue.offer(Object)interface.Epeek()Called from the consumer thread subject to the restrictions appropriate to the implementation and according to theQueue.peek()interface.Epoll()Called from the consumer thread subject to the restrictions appropriate to the implementation and according to theQueue.poll()interface.private EpollMaybeEmpty(java.util.concurrent.atomic.AtomicReferenceArray<E> buffer, int offset, long consumerPosition)private static intpositionOnCycle(long producerCycleClaim, int positionOnCycleMask)private static longproducerPosition(long cycleId, int positionWithinCycle, int cycleLengthLog2)booleanrelaxedOffer(E e)Called from a producer thread subject to the restrictions appropriate to the implementation.ErelaxedPeek()Called from the consumer thread subject to the restrictions appropriate to the implementation.ErelaxedPoll()Called from the consumer thread subject to the restrictions appropriate to the implementation.private voidrotateCycle(java.util.concurrent.atomic.AtomicLongArray producerCycleClaims, int activeCycle, long producerCycleClaim, int cycleIdBitShift, long maxCycleId)intsize()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.java.lang.StringtoString()private voidvalidateSlowProducerClaim(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.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
-
-
-
-
Field Detail
-
mask
private final long mask
-
capacity
private final int capacity
-
cycleLength
private final int cycleLength
-
cycleLengthLog2
private final int cycleLengthLog2
-
buffer
private final java.util.concurrent.atomic.AtomicReferenceArray<E> buffer
-
producerCycleClaim
private final java.util.concurrent.atomic.AtomicLongArray producerCycleClaim
-
positionOnCycleMask
private final int positionOnCycleMask
-
cycleIdBitShift
private final int cycleIdBitShift
-
maxCycleId
private final long maxCycleId
-
-
Method Detail
-
iterator
public java.util.Iterator<E> iterator()
-
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(java.util.concurrent.atomic.AtomicLongArray producerCycleClaims, int activeCycle, long producerCycleClaim, int cycleIdBitShift, long maxCycleId)
-
validateSlowProducerClaim
private void validateSlowProducerClaim(long cycleId, int positionOnCycle, int cycleLengthLog2)
-
offer
public boolean offer(E e)
Description copied from interface:MessagePassingQueueCalled from a producer thread subject to the restrictions appropriate to the implementation and according to theQueue.offer(Object)interface.- Specified by:
offerin interfaceMessagePassingQueue<E>- Specified by:
offerin interfacejava.util.Queue<E>- Parameters:
e- notnull, will throw NPE if it is- Returns:
- true if element was inserted into the queue, false iff full
-
poll
public E poll()
Description copied from interface:MessagePassingQueueCalled from the consumer thread subject to the restrictions appropriate to the implementation and according to theQueue.poll()interface.- Specified by:
pollin interfaceMessagePassingQueue<E>- Specified by:
pollin interfacejava.util.Queue<E>- Returns:
- a message from the queue if one is available,
nulliff empty
-
pollMaybeEmpty
private E pollMaybeEmpty(java.util.concurrent.atomic.AtomicReferenceArray<E> buffer, int offset, long consumerPosition)
-
peek
public E peek()
Description copied from interface:MessagePassingQueueCalled from the consumer thread subject to the restrictions appropriate to the implementation and according to theQueue.peek()interface.- Specified by:
peekin interfaceMessagePassingQueue<E>- Specified by:
peekin interfacejava.util.Queue<E>- Returns:
- a message from the queue if one is available,
nulliff empty
-
size
public int size()
Description copied from interface:MessagePassingQueueThis 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:
sizein interfacejava.util.Collection<E>- Specified by:
sizein interfaceMessagePassingQueue<E>- Specified by:
sizein classjava.util.AbstractCollection<E>- Returns:
- number of messages in the queue, between 0 and
Integer.MAX_VALUEbut less or equals to capacity (if bounded).
-
clear
public void clear()
Description copied from interface:MessagePassingQueueRemoves 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:
clearin interfacejava.util.Collection<E>- Specified by:
clearin interfaceMessagePassingQueue<E>- Overrides:
clearin classjava.util.AbstractQueue<E>
-
isEmpty
public boolean isEmpty()
Description copied from interface:MessagePassingQueueThis method's accuracy is subject to concurrent modifications happening as the observation is carried out.- Specified by:
isEmptyin interfacejava.util.Collection<E>- Specified by:
isEmptyin interfaceMessagePassingQueue<E>- Overrides:
isEmptyin classjava.util.AbstractCollection<E>- Returns:
- true if empty, false otherwise
-
capacity
public int capacity()
- Specified by:
capacityin interfaceMessagePassingQueue<E>- Returns:
- the capacity of this queue or
MessagePassingQueue.UNBOUNDED_CAPACITYif not bounded
-
relaxedOffer
public boolean relaxedOffer(E e)
Description copied from interface:MessagePassingQueueCalled 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:
relaxedOfferin 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
public E relaxedPoll()
Description copied from interface:MessagePassingQueueCalled from the consumer thread subject to the restrictions appropriate to the implementation. As opposed toQueue.poll()this method may returnnullwithout the queue being empty.- Specified by:
relaxedPollin interfaceMessagePassingQueue<E>- Returns:
- a message from the queue if one is available,
nullif unable to poll
-
relaxedPeek
public E relaxedPeek()
Description copied from interface:MessagePassingQueueCalled from the consumer thread subject to the restrictions appropriate to the implementation. As opposed toQueue.peek()this method may returnnullwithout the queue being empty.- Specified by:
relaxedPeekin interfaceMessagePassingQueue<E>- Returns:
- a message from the queue if one is available,
nullif unable to peek
-
drain
public int drain(MessagePassingQueue.Consumer<E> c)
Description copied from interface:MessagePassingQueueRemove 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:
drainin interfaceMessagePassingQueue<E>- Returns:
- the number of polled elements
-
fill
public int fill(MessagePassingQueue.Supplier<E> s)
Description copied from interface:MessagePassingQueueStuff 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:
fillin interfaceMessagePassingQueue<E>- Returns:
- the number of offered elements
-
drain
public int drain(MessagePassingQueue.Consumer<E> c, int limit)
Description copied from interface:MessagePassingQueueRemove 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:
drainin interfaceMessagePassingQueue<E>- Returns:
- the number of polled elements
-
fill
public int fill(MessagePassingQueue.Supplier<E> s, int limit)
Description copied from interface:MessagePassingQueueStuff 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:
fillin 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:MessagePassingQueueRemove 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:
drainin interfaceMessagePassingQueue<E>
-
fill
public void fill(MessagePassingQueue.Supplier<E> s, MessagePassingQueue.WaitStrategy w, MessagePassingQueue.ExitCondition exit)
Description copied from interface:MessagePassingQueueStuff 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:
fillin interfaceMessagePassingQueue<E>
-
toString
public java.lang.String toString()
- Overrides:
toStringin classjava.util.AbstractCollection<E>
-
-