Enum RuleKind 

pub enum RuleKind {
    Simplify,
    Lower,
}

What a rule rewrites into.

The two kinds are matched by the same trie and verified by the same obligation, and the only thing that separates them is what the replacement is written in. Keeping them one language rather than two is the whole reason spec/09-optimizer.md section 9.3 and spec/10-backend.md section 10.2 ask for a rule DSL at all, because a rewrite and a lowering are the same claim about two terms and there is no reason to say it twice.

Variants

Simplify

IR to IR. The replacement is IR, so a rewrite can be applied over and over and the result is still something later rules match. spec/optimizer/13-rewrite-rules.md.

Lower

IR to machine. The replacement is a machine term, so a lowering is the last thing that happens to a value and nothing matches what it produces. spec/10-backend.md.

Implementations

impl RuleKind

pub const fn as_str(self) -> &'static str

The keyword that introduces a rule of this kind.

Trait Implementations

impl Clone for RuleKind

fn clone(&self) -> RuleKind

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for RuleKind

impl Debug for RuleKind

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

Formats the value using the given formatter.

impl Display for RuleKind

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

Formats the value using the given formatter.

impl Eq for RuleKind

impl PartialEq for RuleKind

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for RuleKind