pub enum Tier {
T0 = 0,
T1 = 1,
T2 = 2,
T3 = 3,
}Expand description
A hotness tier — how much optimization budget a unit has earned (HOTSWAP §4.1).
Each tier pays for strictly more than the one below; T3 with an all-on config
reproduces today’s whole-program optimize_for_run, bit-for-bit (the
compatibility + soundness anchor). The mechanism that escalates a unit through
the tiers (call/back-edge counters, thresholds) lives in the VM; this is just
the policy the optimizer reads.
Variants§
T0 = 0
Baseline: raw parse → bytecode, no optimization.
T1 = 1
Warm: Cheap opts.
T2 = 2
Hot: Cheap + Medium opts (PE-light).
T3 = 3
Very-hot: every opt (PE-full, unroll, recursion unfold).
Implementations§
Trait Implementations§
Source§impl Ord for Tier
impl Ord for Tier
Source§impl PartialOrd for Tier
impl PartialOrd for Tier
impl Copy for Tier
impl Eq for Tier
impl StructuralPartialEq for Tier
Auto Trait Implementations§
impl Freeze for Tier
impl RefUnwindSafe for Tier
impl Send for Tier
impl Sync for Tier
impl Unpin for Tier
impl UnsafeUnpin for Tier
impl UnwindSafe for Tier
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.