|
Class Summary |
| AddressDeque |
This supports unsynchronized enqueuing and dequeuing of addresses |
| AddressPairDeque |
This supports unsynchronized enqueuing and dequeuing of
address pairs |
| AddressTripleDeque |
This supports unsynchronized enqueuing and dequeuing of
address triples |
| Deque |
Class that defines a doubly-linked double-ended queue (deque). |
| LocalDeque |
Note this may perform poorly when being used as a FIFO structure with
insertHead and pop operations operating on the same buffer. |
| LocalQueue |
This class implements a local (unsynchronized) queue. |
| LocalSSB |
This class implements a local (unsynchronized) sequential
store buffer. |
| ObjectReferenceBuffer |
This class is a combination of a Deque and a TraceStep, designed to include
intelligent processing of child references as objects are scanned. |
| ObjectReferenceDeque |
This supports unsynchronized enqueuing and dequeuing of
object references |
| SharedDeque |
This supports unsynchronized enqueuing and dequeuing of buffers
for shared use. |
| SortSharedDeque |
This supports unsynchronized enqueuing and dequeuing of buffers
for shared use. |
| SortTODAddressStack |
This supports unsynchronized pushing and popping of addresses. |
| SortTODObjectReferenceStack |
This supports unsynchronized pushing and popping of object
references. |
| SortTODSharedDeque |
This class specializes SortSharedQueue to sort objects according to
their time of death (TOD). |
| TraceBuffer |
This supports unsynchronized enqueuing and dequeuing of tracing data
and bulk processing of the buffer. |
| WriteBuffer |
This supports unsynchronized insertion of write buffer values. |