| Package | Description |
|---|---|
| org.jctools.queues |
This package aims to fill a gap in current JDK implementations in offering lock free (wait free where possible)
queues for inter-thread message passing with finer grained guarantees and an emphasis on performance.
At the time of writing the only lock free queue available in the JDK is ConcurrentLinkedQueue which is an unbounded multi-producer, multi-consumer queue which
is further encumbered by the need to implement the full range of Queue methods. |
| org.jctools.util |
| Modifier and Type | Class | Description |
|---|---|---|
class |
CircularArrayOffsetCalculator |
|
class |
IndexedQueueSizeUtil |
|
static interface |
IndexedQueueSizeUtil.IndexedQueue |
|
class |
MessagePassingQueueUtil |
|
class |
PaddedCircularArrayOffsetCalculator |
| Modifier and Type | Interface | Description |
|---|---|---|
interface |
PortableJvmInfo |
JVM Information that is standard and available on all JVMs (i.e.
|
class |
Pow2 |
Power of 2 utility functions.
|
class |
RangeUtil |
|
class |
UnsafeAccess |
Why should we resort to using Unsafe?
To construct class fields which allow volatile/ordered/plain access: This requirement is covered by AtomicReferenceFieldUpdater and similar but their performance is arguably worse than the DIY approach
(depending on JVM version) while Unsafe intrinsification is a far lesser challenge for JIT compilers. |
interface |
UnsafeJvmInfo |
|
class |
UnsafeRefArrayAccess |
A concurrent access enabling class used by circular array based queues this class exposes an offset computation
method along with differently memory fenced load/store methods into the underlying array.
|
Copyright © 2013–2017. All rights reserved.