221 lines
7.5 KiB
Rust
221 lines
7.5 KiB
Rust
use std::collections::HashMap;
|
|
|
|
use crate::{
|
|
compiler::{arch::riscv::Reg, create_program, Addr},
|
|
ir::{
|
|
arch::riscv64::{RV64Instruction as AI, RegRef},
|
|
IRLInstruction as IRI, IRLProgram, Len, Size,
|
|
},
|
|
};
|
|
|
|
use super::{LinkerInstruction as LI, *};
|
|
|
|
fn align(s: &Size) -> i32 {
|
|
(*s as i32 - 1).div_euclid(8) + 1
|
|
}
|
|
|
|
fn mov_mem(
|
|
v: &mut Vec<LI>,
|
|
src: Reg,
|
|
src_offset: i32,
|
|
dest: Reg,
|
|
dest_offset: i32,
|
|
temp: Reg,
|
|
mut len: Len,
|
|
) {
|
|
let mut off = 0;
|
|
for width in width::MAIN.iter().rev().copied() {
|
|
let wl = width::len(width);
|
|
while len >= wl {
|
|
v.extend([
|
|
LI::Load {
|
|
width,
|
|
dest: temp,
|
|
offset: src_offset + off,
|
|
base: src,
|
|
},
|
|
LI::Store {
|
|
width,
|
|
src: temp,
|
|
offset: dest_offset + off,
|
|
base: dest,
|
|
},
|
|
]);
|
|
len -= wl;
|
|
off += wl as i32;
|
|
}
|
|
}
|
|
}
|
|
|
|
pub fn compile(program: IRLProgram) -> (Vec<u8>, Option<Addr>) {
|
|
let mut fns = Vec::new();
|
|
let mut data = Vec::new();
|
|
for (sym, d) in program.ro_data() {
|
|
data.push((d.clone(), *sym));
|
|
}
|
|
for (sym, f) in program.fns() {
|
|
let mut v = Vec::new();
|
|
let mut stack = HashMap::new();
|
|
let mut stack_len = 0;
|
|
let mut stack_ra = None;
|
|
let mut stack_rva = None;
|
|
if f.makes_call {
|
|
// return addr
|
|
stack_ra = Some(stack_len);
|
|
stack_len += 8;
|
|
}
|
|
for (id, s) in &f.stack {
|
|
stack.insert(id, stack_len);
|
|
stack_len += align(s);
|
|
}
|
|
for (id, s) in f.args.iter().rev() {
|
|
stack.insert(id, stack_len);
|
|
stack_len += align(s);
|
|
}
|
|
if f.ret_size > 0 {
|
|
stack_rva = Some(stack_len);
|
|
stack_len += align(&f.ret_size);
|
|
}
|
|
v.push(LI::addi(sp, sp, -stack_len));
|
|
let has_stack = stack_len > 0;
|
|
if has_stack {
|
|
if let Some(stack_ra) = stack_ra {
|
|
v.push(LI::sd(ra, stack_ra, sp));
|
|
}
|
|
}
|
|
for i in &f.instructions {
|
|
match i {
|
|
IRI::Mv { dest, src } => todo!(),
|
|
IRI::Ref { dest, src } => todo!(),
|
|
IRI::LoadAddr { dest, offset, src } => {
|
|
v.extend([
|
|
LI::La {
|
|
dest: t0,
|
|
src: *src,
|
|
},
|
|
LI::sd(t0, stack[dest] + *offset as i32, sp),
|
|
]);
|
|
}
|
|
IRI::LoadData {
|
|
dest,
|
|
offset,
|
|
src,
|
|
len,
|
|
} => {
|
|
v.push(LI::La {
|
|
dest: t0,
|
|
src: *src,
|
|
});
|
|
mov_mem(&mut v, t0, 0, sp, stack[dest] + *offset as i32, t1, *len);
|
|
}
|
|
IRI::Call { dest, f, args } => {
|
|
let mut offset = 0;
|
|
if let Some((dest, s)) = dest {
|
|
offset -= align(s);
|
|
v.push(LI::addi(t0, sp, stack[&dest]));
|
|
v.push(LI::sd(t0, offset, sp))
|
|
}
|
|
for (arg, s) in args {
|
|
let bs = align(s);
|
|
offset -= bs;
|
|
mov_mem(&mut v, sp, stack[arg], sp, offset, t0, bs as Len);
|
|
}
|
|
v.push(LI::Call(*f));
|
|
}
|
|
IRI::AsmBlock { args, instructions } => {
|
|
for (reg, var) in args {
|
|
v.push(LI::addi(*reg, sp, stack[var]));
|
|
}
|
|
fn r(rr: RegRef) -> Reg {
|
|
match rr {
|
|
RegRef::Var(var_ident) => todo!(),
|
|
RegRef::Reg(reg) => reg,
|
|
}
|
|
}
|
|
for i in instructions {
|
|
match *i {
|
|
AI::Ecall => v.push(LI::Ecall),
|
|
AI::Li { dest, imm } => v.push(LI::Li { dest: r(dest), imm }),
|
|
AI::Mv { dest, src } => v.push(LI::Mv {
|
|
dest: r(dest),
|
|
src: r(src),
|
|
}),
|
|
AI::La { dest, src } => todo!(),
|
|
AI::Load {
|
|
width,
|
|
dest,
|
|
base,
|
|
offset,
|
|
} => v.push(LI::Load {
|
|
width,
|
|
dest: r(dest),
|
|
offset: offset as i32,
|
|
base: r(base),
|
|
}),
|
|
AI::Store {
|
|
width,
|
|
src,
|
|
base,
|
|
offset,
|
|
} => v.push(LI::Store {
|
|
width,
|
|
src: r(src),
|
|
offset: offset as i32,
|
|
base: r(base),
|
|
}),
|
|
AI::Op {
|
|
op,
|
|
funct,
|
|
dest,
|
|
src1,
|
|
src2,
|
|
} => v.push(LI::Op {
|
|
op,
|
|
funct,
|
|
dest: r(dest),
|
|
src1: r(src1),
|
|
src2: r(src2),
|
|
}),
|
|
AI::OpImm { op, dest, src, imm } => v.push(LI::OpImm {
|
|
op,
|
|
dest: r(dest),
|
|
src: r(src),
|
|
imm: imm as i32,
|
|
}),
|
|
AI::OpImmF7 {
|
|
op,
|
|
funct,
|
|
dest,
|
|
src,
|
|
imm,
|
|
} => v.push(LI::OpImmF7 {
|
|
op,
|
|
funct,
|
|
dest: r(dest),
|
|
src: r(src),
|
|
imm: imm as i32,
|
|
}),
|
|
}
|
|
}
|
|
}
|
|
IRI::Ret { src } => {
|
|
let Some(rva) = stack_rva else {
|
|
panic!("no return value address on stack!")
|
|
};
|
|
v.push(LI::ld(t0, rva, sp));
|
|
mov_mem(&mut v, sp, stack[src], t0, 0, t1, align(&f.ret_size) as u32);
|
|
}
|
|
}
|
|
}
|
|
if has_stack {
|
|
if let Some(stack_ra) = stack_ra {
|
|
v.push(LI::ld(ra, stack_ra, sp));
|
|
}
|
|
v.push(LI::addi(sp, sp, stack_len));
|
|
}
|
|
v.push(LI::Ret);
|
|
fns.push((v, *sym));
|
|
}
|
|
create_program(fns, data, Some(program.entry()), &program)
|
|
}
|