You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
132 lines
4.4 KiB
132 lines
4.4 KiB
4 years ago
|
use crate::asm::data::literal::Addr;
|
||
|
use crate::asm::instr::Op;
|
||
|
use crate::runtime::fault::Fault;
|
||
|
use crate::runtime::frame::StackFrame;
|
||
|
use crate::runtime::run_thread::RunThread;
|
||
|
|
||
|
pub type CyclesSpent = usize;
|
||
|
|
||
|
pub struct EvalRes {
|
||
|
pub cycles: u8,
|
||
|
pub advance: i64,
|
||
|
}
|
||
|
|
||
|
impl RunThread {
|
||
|
// TODO unit tests
|
||
|
pub fn eval_op(&mut self) -> Result<EvalRes, Fault> {
|
||
|
let mut cycles = 1;
|
||
|
let mut advance = 1;
|
||
|
|
||
|
let frame = &mut self.frame;
|
||
|
|
||
|
let op = self.program.read(frame.pc);
|
||
|
|
||
|
debug!("------------------------");
|
||
|
debug!("{} | {:?}", frame.pc, op);
|
||
|
|
||
|
/* Operations can be given different execution times when run in slow mode. */
|
||
|
/* Presently, all that do anything use 1 cycle. */
|
||
|
|
||
|
match op {
|
||
|
Op::Nop => {}
|
||
|
Op::FarLabel(_) | Op::Routine(_) => {
|
||
|
/* this is nop, but without any cost - just markers */
|
||
|
cycles = 0;
|
||
|
}
|
||
|
Op::Barrier(msg) => {
|
||
|
return Err(Fault::Barrier {
|
||
|
msg: msg.clone().unwrap_or_else(|| "No msg".into())
|
||
|
});
|
||
|
}
|
||
|
Op::Fault(msg) => {
|
||
|
return Err(Fault::FaultInstr {
|
||
|
msg: msg.clone().unwrap_or_else(|| "No msg".into())
|
||
|
});
|
||
|
}
|
||
|
Op::FarJump(name) => {
|
||
|
debug!("Far jump to {}", name);
|
||
|
match self.program.find_far_label(name) {
|
||
|
Ok(pos) => {
|
||
|
debug!("label is at {}", pos);
|
||
|
self.frame.pc = pos;
|
||
|
}
|
||
|
Err(e) => {
|
||
|
return Err(e);
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
Op::Call(name, args) => {
|
||
|
debug!("Call routine {}", name);
|
||
|
match self.program.find_routine(name) {
|
||
|
Ok(pos) => {
|
||
|
debug!("routine is at {}", pos);
|
||
|
|
||
|
let mut values = Vec::with_capacity(args.len());
|
||
|
for arg in args {
|
||
|
values.push(self.frame.read(*arg)?);
|
||
|
}
|
||
|
|
||
|
let mut frame2 = StackFrame::new(pos, &values);
|
||
|
std::mem::swap(&mut self.frame, &mut frame2);
|
||
|
self.call_stack.push(frame2);
|
||
|
advance = 0;
|
||
|
}
|
||
|
Err(e) => {
|
||
|
return Err(e);
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
Op::Ret(retvals) => {
|
||
|
match self.call_stack.pop() {
|
||
|
Some(previous) => {
|
||
|
let mut values = Vec::with_capacity(retvals.len());
|
||
|
for arg in retvals {
|
||
|
values.push(frame.read(*arg)?);
|
||
|
}
|
||
|
*frame = previous;
|
||
|
frame.set_retvals(&values);
|
||
|
advance = 1; // advance past the call
|
||
|
}
|
||
|
None => {
|
||
|
return Err(Fault::CallStackUnderflow);
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
Op::Skip(val) => {
|
||
|
let steps = frame.read(*val)?;
|
||
|
advance = i64::from_ne_bytes(steps.to_ne_bytes());
|
||
|
self.program.validate_jump(frame.pc, Addr((frame.pc.0 as i64 + advance) as u64))?;
|
||
|
}
|
||
|
Op::SkipIf(cond, val) => {
|
||
|
if frame.status.test(*cond) {
|
||
|
let steps = frame.read(*val)?;
|
||
|
advance = i64::from_ne_bytes(steps.to_ne_bytes());
|
||
|
self.program.validate_jump(frame.pc, Addr((frame.pc.0 as i64 + advance) as u64))?;
|
||
|
}
|
||
|
}
|
||
|
Op::Move { dst, src } => {
|
||
|
frame.status.clear();
|
||
|
let val = frame.read(*src)?;
|
||
|
frame.status.update(val);
|
||
|
frame.write(*dst, val)?;
|
||
|
}
|
||
|
Op::Extension(xop) => {
|
||
|
xop.execute(&self.program, &mut self.call_stack, frame)?;
|
||
|
}
|
||
|
Op::StoreStatus { dst } => {
|
||
|
let packed = frame.status.store();
|
||
|
frame.write(*dst, packed)?;
|
||
|
}
|
||
|
Op::LoadStatus { src } => {
|
||
|
let x = frame.read(*src)?;
|
||
|
frame.status.load(x);
|
||
|
}
|
||
|
}
|
||
|
|
||
|
Ok(EvalRes {
|
||
|
cycles,
|
||
|
advance,
|
||
|
})
|
||
|
}
|
||
|
}
|