Class MpscRelaxedAtomicArrayQueue<E>
- All Implemented Interfaces:
Iterable<E>, Collection<E>, Queue<E>, MessagePassingQueue<E>
-
Nested Class Summary
Nested ClassesModifier and TypeClassDescriptionprivate static final classNested classes/interfaces inherited from interface MessagePassingQueue
MessagePassingQueue.Consumer<T>, MessagePassingQueue.ExitCondition, MessagePassingQueue.Supplier<T>, MessagePassingQueue.WaitStrategy -
Field Summary
FieldsModifier and TypeFieldDescriptionprivate final AtomicReferenceArray<E> private final intprivate final intprivate final intprivate final intprivate final longprivate final longprivate final intprivate final AtomicLongArrayFields inherited from class MpscRelaxedAtomicArrayQueueL3Pad
p01, p02, p03, p04, p05, p06, p07, p10, p11, p12, p13, p14, p15, p16, p17Fields inherited from class MpscAtomicArrayQueueConsumerPositionField
consumerPositionFields inherited from class MpscRelaxedAtomicArrayQueueL2Pad
p00Fields inherited from interface MessagePassingQueue
UNBOUNDED_CAPACITY -
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionprivate 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) intRemove 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.intStuff 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.iterator()booleanCalled 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 EpollMaybeEmpty(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.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 voidrotateCycle(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.toString()private voidvalidateSlowProducerClaim(long cycleId, int positionOnCycle, int cycleLengthLog2) Methods inherited from class MpscAtomicArrayQueueConsumerPositionField
lvConsumerPosition, soConsumerPositionMethods inherited from class MpscRelaxedAtomicArrayQueueProducerLimitField
lvProducerLimit, soProducerLimitMethods inherited from class MpscAtomicArrayQueueActiveCycleIdField
activeCycleIndex, casActiveCycleId, lvActiveCycleId, soActiveCycleIdMethods inherited from class AbstractQueue
add, addAll, element, removeMethods inherited from class AbstractCollection
contains, containsAll, remove, removeAll, retainAll, toArray, toArrayMethods inherited from class Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitMethods inherited from interface 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
-
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:MessagePassingQueueCalled from a producer thread subject to the restrictions appropriate to the implementation and according to theQueue.offer(Object)interface. -
poll
Description copied from interface:MessagePassingQueueCalled from the consumer thread subject to the restrictions appropriate to the implementation and according to theQueue.poll()interface. -
pollMaybeEmpty
-
peek
Description copied from interface:MessagePassingQueueCalled 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: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 interfaceCollection<E>- Specified by:
sizein interfaceMessagePassingQueue<E>- Specified by:
sizein classAbstractCollection<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 interfaceCollection<E>- Specified by:
clearin interfaceMessagePassingQueue<E>- Overrides:
clearin classAbstractQueue<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 interfaceCollection<E>- Specified by:
isEmptyin interfaceMessagePassingQueue<E>- Overrides:
isEmptyin classAbstractCollection<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
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
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
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
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
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
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
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
- Overrides:
toStringin classAbstractCollection<E>
-