pub enum OptCost {
Cheap = 0,
Medium = 1,
Heavy = 2,
}Expand description
How expensive an optimization pass is to RUN on the live path — the lever the
tiered optimizer uses to decide WHEN (at which hotness tier) to pay for it.
Orthogonal to MemClass (which is about the OUTPUT’s memory cost). The derived
Ord makes a tier gate a single comparison: Cheap < Medium < Heavy is exactly
the tier-inclusion order T1 ⊂ T2 ⊂ T3.
Variants§
Cheap = 0
A single structural sweep, no fixpoint (inline, DCE, TCO).
Medium = 1
A whole-function analysis or one bounded fixpoint (GVN, LICM, oracle, fusion, the capped PE-light fixpoint).
Heavy = 2
A cloning / region-growing pass (the full PE fixpoint, unroll, scalarize, recursion unfold, equality saturation).
Trait Implementations§
impl Copy for OptCost
impl Eq for OptCost
Source§impl Ord for OptCost
impl Ord for OptCost
1.21.0 (const: unstable) · Source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Compares and returns the maximum of two values. Read more
Source§impl PartialOrd for OptCost
impl PartialOrd for OptCost
impl StructuralPartialEq for OptCost
Auto Trait Implementations§
impl Freeze for OptCost
impl RefUnwindSafe for OptCost
impl Send for OptCost
impl Sync for OptCost
impl Unpin for OptCost
impl UnsafeUnpin for OptCost
impl UnwindSafe for OptCost
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