Struct cretonne_codegen::Context

pub struct Context {
    pub func: Function,
    pub cfg: ControlFlowGraph,
    pub domtree: DominatorTree,
    pub regalloc: Context,
    pub loop_analysis: LoopAnalysis,
}

Persistent data structures and compilation pipeline.

Fields

func: Function

The function we're compiling.

cfg: ControlFlowGraph

The control flow graph of func.

domtree: DominatorTree

Dominator tree for func.

regalloc: Context

Register allocation context.

loop_analysis: LoopAnalysis

Loop analysis of func.

Methods

impl Context

pub fn new() -> Self

Allocate a new compilation context.

The returned instance should be reused for compiling multiple functions in order to avoid needless allocator thrashing.

pub fn for_function(func: Function) -> Self

Allocate a new compilation context with an existing Function.

The returned instance should be reused for compiling multiple functions in order to avoid needless allocator thrashing.

pub fn clear(&mut self)

Clear all data structures in this context.

pub fn compile(&mut self, isa: &TargetIsa) -> Result<CodeOffset, CtonError>

Compile the function.

Run the function through all the passes necessary to generate code for the target ISA represented by isa. This does not include the final step of emitting machine code into a code sink.

Returns the size of the function's code.

pub fn emit_to_memory(
    &self,
    mem: *mut u8,
    relocs: &mut RelocSink,
    traps: &mut TrapSink,
    isa: &TargetIsa
)

Emit machine code directly into raw memory.

Write all of the function's machine code to the memory at mem. The size of the machine code is returned by compile above.

The machine code is not relocated. Instead, any relocations are emitted into relocs.

pub fn verify<'a, FOI: Into<FlagsOrIsa<'a>>>(&self, fisa: FOI) -> Result

Run the verifier on the function.

Also check that the dominator tree and control flow graph are consistent with the function.

pub fn verify_if<'a, FOI: Into<FlagsOrIsa<'a>>>(&self, fisa: FOI) -> CtonResult

Run the verifier only if the enable_verifier setting is true.

pub fn verify_locations(&self, isa: &TargetIsa) -> Result

Run the locations verifier on the function.

pub fn verify_locations_if(&self, isa: &TargetIsa) -> CtonResult

Run the locations verifier only if the enable_verifier setting is true.

pub fn dce<'a, FOI: Into<FlagsOrIsa<'a>>>(&mut self, fisa: FOI) -> CtonResult

Perform dead-code elimination on the function.

pub fn preopt(&mut self, isa: &TargetIsa) -> CtonResult

Perform pre-legalization rewrites on the function.

pub fn legalize(&mut self, isa: &TargetIsa) -> CtonResult

Run the legalizer for isa on the function.

pub fn postopt(&mut self, isa: &TargetIsa) -> CtonResult

Perform post-legalization rewrites on the function.

pub fn compute_cfg(&mut self)

Compute the control flow graph.

pub fn compute_domtree(&mut self)

Compute dominator tree.

pub fn compute_loop_analysis(&mut self)

Compute the loop analysis.

pub fn flowgraph(&mut self)

Compute the control flow graph and dominator tree.

pub fn simple_gvn<'a, FOI: Into<FlagsOrIsa<'a>>>(
    &mut self,
    fisa: FOI
) -> CtonResult

Perform simple GVN on the function.

pub fn licm<'a, FOI: Into<FlagsOrIsa<'a>>>(&mut self, fisa: FOI) -> CtonResult

Perform LICM on the function.

pub fn eliminate_unreachable_code<'a, FOI>(&mut self, fisa: FOI) -> CtonResult where
    FOI: Into<FlagsOrIsa<'a>>, 

Perform unreachable code elimination.

pub fn regalloc(&mut self, isa: &TargetIsa) -> CtonResult

Run the register allocator.

pub fn prologue_epilogue(&mut self, isa: &TargetIsa) -> CtonResult

Insert prologue and epilogues after computing the stack frame layout.

pub fn relax_branches(
    &mut self,
    isa: &TargetIsa
) -> Result<CodeOffset, CtonError>

Run the branch relaxation pass and return the final code size.

Trait Implementations