62 lines
1.7 KiB
Rust
62 lines
1.7 KiB
Rust
//! Compilation backend pipeline: optimized IR to VCode / binemit.
|
|
|
|
use crate::ir::Function;
|
|
use crate::machinst::*;
|
|
use crate::timing;
|
|
|
|
use log::debug;
|
|
use regalloc::{allocate_registers, RegAllocAlgorithm};
|
|
|
|
/// Compile the given function down to VCode with allocated registers, ready
|
|
/// for binary emission.
|
|
pub fn compile<B: LowerBackend>(
|
|
f: &Function,
|
|
b: &B,
|
|
abi: Box<dyn ABIBody<I = B::MInst>>,
|
|
) -> VCode<B::MInst>
|
|
where
|
|
B::MInst: ShowWithRRU,
|
|
{
|
|
// This lowers the CL IR.
|
|
let mut vcode = Lower::new(f, abi).lower(b);
|
|
|
|
let universe = &B::MInst::reg_universe(vcode.flags());
|
|
|
|
debug!("vcode from lowering: \n{}", vcode.show_rru(Some(universe)));
|
|
|
|
// Perform register allocation.
|
|
// TODO: select register allocation algorithm from flags.
|
|
let algorithm = RegAllocAlgorithm::Backtracking;
|
|
let result = {
|
|
let _tt = timing::regalloc();
|
|
allocate_registers(
|
|
&mut vcode, algorithm, universe, /*request_block_annotations=*/ false,
|
|
)
|
|
.map_err(|err| {
|
|
debug!(
|
|
"Register allocation error for vcode\n{}\nError: {:?}",
|
|
vcode.show_rru(Some(universe)),
|
|
err
|
|
);
|
|
err
|
|
})
|
|
.expect("register allocation")
|
|
};
|
|
|
|
// Reorder vcode into final order and copy out final instruction sequence
|
|
// all at once. This also inserts prologues/epilogues.
|
|
vcode.replace_insns_from_regalloc(result);
|
|
|
|
vcode.remove_redundant_branches();
|
|
|
|
// Do final passes over code to finalize branches.
|
|
vcode.finalize_branches();
|
|
|
|
debug!(
|
|
"vcode after regalloc: final version:\n{}",
|
|
vcode.show_rru(Some(universe))
|
|
);
|
|
|
|
vcode
|
|
}
|