public final class CardTable extends Object
When looking for roots into the young space, the whole old space need not be searched for pointers, only the parts of the old space covered by dirty cards. (The card table works in concert with the FirstObjectTable to find objects that cross onto memory covered by a card.)
At each pointer store the card corresponding to the destination of the store is dirtied. At each collection, the dirty cards are scanned and the corresponding memory examined for pointers to the young space. When the memory has been scanned, the corresponding card is cleaned.
Implementation notes:
Modifier and Type | Class and Description |
---|---|
static class |
CardTable.TestingBackDoor |
static interface |
CardTable.Visitor
An interface for visitors to a card remembered set table.
|
Modifier and Type | Field and Description |
---|---|
static org.graalvm.word.LocationIdentity |
CARD_REMEMBERED_SET_LOCATION
A LocationIdentity to distinguish card locations from other locations.
|