io.netty.util.internal

Class SpscLinkedAtomicQueue<E>

java.lang.Object

java.util.AbstractCollection<E>

java.util.AbstractQueue<E>

io.netty.util.internal.SpscLinkedAtomicQueue<E>

Type Parameters:

E -

All Implemented Interfaces:

Iterable<E>, Collection<E>, Queue<E>

public final class SpscLinkedAtomicQueue<E>
extends AbstractQueue<E>

Forked from JCTools. This is a weakened version of the MPSC algorithm as presented on 1024 Cores by D. Vyukov. The original has been adapted to Java and it's quirks with regards to memory model and layout:

1. As this is an SPSC we have no need for XCHG, an ordered store is enough.

The queue is initialized with a stub node which is set to both the producer and consumer node references. From this point follow the notes on offer/poll.

Constructor Summary

Constructors

Constructor and Description
SpscLinkedAtomicQueue()

Method Summary

Methods

Modifier and Type	Method and Description
boolean	isEmpty() IMPLEMENTATION NOTES: Queue is empty when producerNode is the same as consumerNode.
Iterator<E>	iterator()
protected LinkedQueueAtomicNode<E>	lpConsumerNode()
protected LinkedQueueAtomicNode<E>	lpProducerNode()
protected LinkedQueueAtomicNode<E>	lvConsumerNode()
protected LinkedQueueAtomicNode<E>	lvProducerNode()
boolean	offer(E nextValue) IMPLEMENTATION NOTES: Offer is allowed from a SINGLE thread.
E	peek()
E	poll() IMPLEMENTATION NOTES: Poll is allowed from a SINGLE thread.
int	size() IMPLEMENTATION NOTES: This is an O(n) operation as we run through all the nodes and count them.
protected void	spConsumerNode(LinkedQueueAtomicNode<E> node)
protected void	spProducerNode(LinkedQueueAtomicNode<E> node)
protected LinkedQueueAtomicNode<E>	xchgProducerNode(LinkedQueueAtomicNode<E> node)

Methods inherited from class java.util.AbstractQueue

add, addAll, clear, element, remove

Methods inherited from class java.util.AbstractCollection

contains, containsAll, remove, removeAll, retainAll, toArray, toArray, toString

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, remove, removeAll, retainAll, toArray, toArray

Constructor Detail

SpscLinkedAtomicQueue

public SpscLinkedAtomicQueue()

Method Detail

offer

public boolean offer(E nextValue)

IMPLEMENTATION NOTES:
Offer is allowed from a SINGLE thread.
Offer allocates a new node (holding the offered value) and:

1. Sets that node as the producerNode.next
2. Sets the new node as the producerNode

From this follows that producerNode.next is always null and for all other nodes node.next is not null.

See Also:

MessagePassingQueue.offer(Object), Queue.offer(java.lang.Object)

poll

public E poll()

IMPLEMENTATION NOTES:
Poll is allowed from a SINGLE thread.
Poll reads the next node from the consumerNode and:

1. If it is null, the queue is empty.
2. If it is not null set it as the consumer node and return it's now evacuated value.

This means the consumerNode.value is always null, which is also the starting point for the queue. Because null values are not allowed to be offered this is the only node with it's value set to null at any one time.

peek

public E peek()

lvProducerNode

protected final LinkedQueueAtomicNode<E> lvProducerNode()

lpProducerNode

protected final LinkedQueueAtomicNode<E> lpProducerNode()

spProducerNode

protected final void spProducerNode(LinkedQueueAtomicNode<E> node)

xchgProducerNode

protected final LinkedQueueAtomicNode<E> xchgProducerNode(LinkedQueueAtomicNode<E> node)

lvConsumerNode

protected final LinkedQueueAtomicNode<E> lvConsumerNode()

lpConsumerNode

protected final LinkedQueueAtomicNode<E> lpConsumerNode()

spConsumerNode

protected final void spConsumerNode(LinkedQueueAtomicNode<E> node)

iterator

public final Iterator<E> iterator()

Specified by:

iterator in interface Iterable<E>

Specified by:

iterator in interface Collection<E>

Specified by:

iterator in class AbstractCollection<E>

size

public final int size()

IMPLEMENTATION NOTES:
This is an O(n) operation as we run through all the nodes and count them.

Specified by:

size in interface Collection<E>

Specified by:

size in class AbstractCollection<E>

See Also:

Collection.size()

isEmpty

public final boolean isEmpty()

IMPLEMENTATION NOTES:
Queue is empty when producerNode is the same as consumerNode. An alternative implementation would be to observe the producerNode.value is null, which also means an empty queue because only the consumerNode.value is allowed to be null.

Specified by:

isEmpty in interface Collection<E>

Overrides:

isEmpty in class AbstractCollection<E>

See Also:

MessagePassingQueue.isEmpty()