pub struct MemBalancerTrigger {
min_heap_pages: usize,
max_heap_pages: usize,
current_heap_pages: AtomicUsize,
pending_pages: AtomicUsize,
stats: AtomicRefCell<MemBalancerStats>,
}Expand description
An implementation of MemBalancer (Optimal heap limits for reducing browser memory use, https://dl.acm.org/doi/10.1145/3563323) We use MemBalancer to decide a heap limit between the min heap and the max heap. The current implementation is a simplified version of mem balancer and it does not take collection/allocation speed into account, and uses a fixed constant instead.
Fields§
§min_heap_pages: usizeThe min heap size
max_heap_pages: usizeThe max heap size
current_heap_pages: AtomicUsizeThe current heap size
pending_pages: AtomicUsizeThe number of pending allocation pages. The allocation requests for them have failed, and a GC is triggered. We will need to take them into consideration so that the new heap size can accomodate those allocations.
stats: AtomicRefCell<MemBalancerStats>Statistics
Implementations§
Source§impl MemBalancerTrigger
impl MemBalancerTrigger
fn new(min_heap_pages: usize, max_heap_pages: usize) -> Self
fn access_stats<F>(&self, f: F)where
F: FnMut(&mut MemBalancerStats),
fn compute_new_heap_limit( &self, live: usize, extra_reserve: usize, stats: &mut MemBalancerStats, )
Trait Implementations§
Source§impl<VM: VMBinding> GCTriggerPolicy<VM> for MemBalancerTrigger
impl<VM: VMBinding> GCTriggerPolicy<VM> for MemBalancerTrigger
Source§fn is_gc_required(
&self,
space_full: bool,
space: Option<SpaceStats<'_, VM>>,
plan: &dyn Plan<VM = VM>,
) -> bool
fn is_gc_required( &self, space_full: bool, space: Option<SpaceStats<'_, VM>>, plan: &dyn Plan<VM = VM>, ) -> bool
Is a GC required now? The GC trigger may implement its own heuristics to decide when
a GC should be performed. However, we recommend the implementation to do its own checks
first, and always call
plan.collection_required(space_full, space) at the end as a fallback to see if the plan needs
to do a GC. Read moreSource§fn on_pending_allocation(&self, pages: usize)
fn on_pending_allocation(&self, pages: usize)
Inform the triggering policy that we have pending allocation.
Any GC trigger policy with dynamic heap size should take this into account when calculating a new heap size.
Failing to do so may result in unnecessay GCs, or result in an infinite loop if the new heap size
can never accomodate the pending allocation.
Source§fn on_gc_start(&self, mmtk: &'static MMTK<VM>)
fn on_gc_start(&self, mmtk: &'static MMTK<VM>)
Inform the triggering policy that a GC cycle starts. A GC cycle consists of one or more
GC pauses (see
Self::on_pause_start) plus any concurrent work in between the pauses.
For a stop-the-world GC, a GC cycle is just a single pause, and this is called at the same
time as Self::on_pause_start. For a concurrent GC that splits a cycle into multiple
pauses (e.g. an initial mark pause and a final mark pause with concurrent marking in
between), this is only called once per cycle, for the first pause in the cycle.Source§fn on_gc_release(&self, mmtk: &'static MMTK<VM>)
fn on_gc_release(&self, mmtk: &'static MMTK<VM>)
Inform the triggering policy that a GC is about to start the release work. This is called
in the global Release work packet. This means we assume a plan
do not schedule any work that reclaims memory before the global
Release work. The current plans
satisfy this assumption: they schedule other release work in plan.release().Source§fn on_gc_end(&self, mmtk: &'static MMTK<VM>)
fn on_gc_end(&self, mmtk: &'static MMTK<VM>)
Inform the triggering policy that a GC cycle ends. See
Self::on_gc_start for what
a GC cycle is. This is only called once per GC cycle, for the last pause in the cycle.Source§fn is_heap_full(&self, plan: &dyn Plan<VM = VM>) -> bool
fn is_heap_full(&self, plan: &dyn Plan<VM = VM>) -> bool
Is current heap full?
Source§fn get_current_heap_size_in_pages(&self) -> usize
fn get_current_heap_size_in_pages(&self) -> usize
Return the current heap size (in pages)
Source§fn get_max_heap_size_in_pages(&self) -> usize
fn get_max_heap_size_in_pages(&self) -> usize
Return the upper bound of heap size
Source§fn can_heap_size_grow(&self) -> bool
fn can_heap_size_grow(&self) -> bool
Can the heap size grow?
Source§fn on_pause_start(&self, _mmtk: &'static MMTK<VM>)
fn on_pause_start(&self, _mmtk: &'static MMTK<VM>)
Inform the triggering policy that a pause starts. For a concurrent GC, this is called once
for every STW pause in a GC cycle, not just once per cycle. See
Self::on_gc_start for the hook that is only called once per GC cycle.Source§fn on_pause_end(&self, _mmtk: &'static MMTK<VM>)
fn on_pause_end(&self, _mmtk: &'static MMTK<VM>)
Inform the triggering policy that a pause ends. For a concurrent GC, this is called once
for every STW pause in a GC cycle, not just once per cycle. See
Self::on_gc_end
for the hook that is only called once per GC cycle.Auto Trait Implementations§
impl !Freeze for MemBalancerTrigger
impl !RefUnwindSafe for MemBalancerTrigger
impl Send for MemBalancerTrigger
impl Sync for MemBalancerTrigger
impl Unpin for MemBalancerTrigger
impl UnwindSafe for MemBalancerTrigger
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Converts
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>, which can then be
downcast into Box<dyn ConcreteType> where ConcreteType implements Trait.§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Converts
Rc<Trait> (where Trait: Downcast) to Rc<Any>, which can then be further
downcast into Rc<ConcreteType> where ConcreteType implements Trait.§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Converts
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Converts
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.§impl<T> DowncastSend for T
impl<T> DowncastSend for T
§impl<T> DowncastSync for T
impl<T> DowncastSync for T
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more