Struct CardTable 

pub struct CardTable { /* private fields */ }

Card-based write barrier for large heaps

Divides the heap into cards and tracks which cards contain cross-generational references

Implementations

impl CardTable

pub fn new(heap_start: *const u8, heap_size: usize, card_size: usize) -> Self

pub fn mark_card_dirty(&self, address: *const u8)

Mark a card as dirty due to a cross-generational reference

pub fn get_dirty_cards(&self) -> Vec<usize>

Get all dirty cards for scanning

pub fn clear_dirty_cards(&self)

Clear all dirty cards (typically after scanning)

pub fn card_to_address_range( &self, card_index: usize, ) -> Option<(*const u8, *const u8)>

Convert a card index to an address range

pub fn stats(&self) -> CardTableStats

Get card table statistics