Enum RegallocAlgorithm 

#[non_exhaustive]
pub enum RegallocAlgorithm {
    Backtracking,
}

Possible register allocator algorithms for the Cranelift codegen backend.

Variants (Non-exhaustive)

Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.

Backtracking

Generates the fastest possible code, but may take longer.

This algorithm performs “backtracking”, which means that it may undo its earlier work and retry as it discovers conflicts. This results in better register utilization, producing fewer spills and moves, but can cause super-linear compile runtime.

Trait Implementations

impl Clone for RegallocAlgorithm

fn clone(&self) -> RegallocAlgorithm

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for RegallocAlgorithm

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq for RegallocAlgorithm

fn eq(&self, other: &RegallocAlgorithm) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for RegallocAlgorithm

impl Eq for RegallocAlgorithm

impl StructuralPartialEq for RegallocAlgorithm