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.
350 lines
14 KiB
350 lines
14 KiB
use crate::run_thread::{ThreadToken, RunThread};
|
|
use asm::instr::{Op, Cond};
|
|
use crate::fault::Fault;
|
|
use crate::frame::StackFrame;
|
|
use asm::data::literal::{Value, is_positive, is_negative, Addr};
|
|
use std::ops::{Rem, BitXor, Shl};
|
|
use num_traits::PrimInt;
|
|
|
|
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 mut 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::Mov(dst, src) => {
|
|
frame.status.clear();
|
|
let val = frame.read(*src)?;
|
|
frame.status.zero = (val == 0);
|
|
frame.status.positive = is_positive(val);
|
|
frame.status.negative = is_negative(val);
|
|
frame.write(*dst, val)?;
|
|
}
|
|
Op::Cmp(a, b) => {
|
|
frame.status.clear();
|
|
let a = frame.read(*a)?;
|
|
let b = frame.read(*b)?;
|
|
frame.status.equal = a == b;
|
|
frame.status.zero = a == 0 && b == 0;
|
|
frame.status.lower = a < b;
|
|
frame.status.greater = a > b;
|
|
frame.status.positive = is_positive(a) && is_positive(b);
|
|
frame.status.negative = is_negative(a) && is_negative(b);
|
|
}
|
|
Op::Inc(reg) => {
|
|
frame.status.clear();
|
|
let mut val = frame.read(reg.as_rd())?;
|
|
val = val.wrapping_add(1);
|
|
frame.status.overflow = (val == 0);
|
|
frame.status.zero = (val == 0);
|
|
frame.status.positive = is_positive(val);
|
|
frame.status.negative = is_negative(val);
|
|
frame.write(*reg, val)?;
|
|
}
|
|
Op::Dec(reg) => {
|
|
frame.status.clear();
|
|
let mut val = frame.read(reg.as_rd())?;
|
|
frame.status.overflow = (val == 0); // will overflow
|
|
val = val.wrapping_sub(1);
|
|
frame.status.zero = (val == 0);
|
|
frame.status.positive = is_positive(val);
|
|
frame.status.negative = is_negative(val);
|
|
frame.write(*reg, val)?;
|
|
}
|
|
Op::Add(dst, src) => {
|
|
frame.status.clear();
|
|
let mut a = frame.read(dst.as_rd())?;
|
|
let mut b = frame.read(*src)?;
|
|
let (val, ov) = if let Some(v) = a.checked_add(b) {
|
|
(v, false)
|
|
} else {
|
|
(a.wrapping_add(b), true)
|
|
};
|
|
frame.status.zero = (val == 0);
|
|
frame.status.positive = is_positive(val);
|
|
frame.status.negative = is_negative(val);
|
|
frame.status.overflow = ov;
|
|
frame.write(*dst, val)?;
|
|
}
|
|
Op::Sub(dst, src) => {
|
|
frame.status.clear();
|
|
let mut a = frame.read(dst.as_rd())?;
|
|
let mut b = frame.read(*src)?;
|
|
let (val, ov) = if let Some(v) = a.checked_sub(b) {
|
|
(v, false)
|
|
} else {
|
|
(a.wrapping_sub(b), true)
|
|
};
|
|
frame.status.zero = (val == 0);
|
|
frame.status.positive = is_positive(val);
|
|
frame.status.negative = is_negative(val);
|
|
frame.status.overflow = ov;
|
|
frame.write(*dst, val)?;
|
|
}
|
|
Op::Mul(dst, src) => {
|
|
frame.status.clear();
|
|
let mut a = frame.read(dst.as_rd())?;
|
|
let mut b = frame.read(*src)?;
|
|
let (val, ov) = if let Some(v) = a.checked_mul(b) {
|
|
(v, false)
|
|
} else {
|
|
(a.wrapping_mul(b), true)
|
|
};
|
|
frame.status.zero = (val == 0);
|
|
frame.status.positive = is_positive(val);
|
|
frame.status.negative = is_negative(val);
|
|
frame.status.overflow = ov;
|
|
frame.write(*dst, val)?;
|
|
}
|
|
Op::Div(dst, src) => {
|
|
frame.status.clear();
|
|
let mut a = frame.read(dst.as_rd())?;
|
|
let mut b = frame.read(*src)?;
|
|
if b == 0 {
|
|
frame.status.overflow = true;
|
|
// TODO ?
|
|
} else {
|
|
let (val, ov) = if let Some(v) = a.checked_div(b) {
|
|
(v, false)
|
|
} else {
|
|
(a.wrapping_div(b), true)
|
|
};
|
|
frame.status.zero = (val == 0);
|
|
frame.status.positive = is_positive(val);
|
|
frame.status.negative = is_negative(val);
|
|
frame.status.overflow = ov;
|
|
frame.write(*dst, val)?;
|
|
}
|
|
}
|
|
Op::Mod(dst, src) => {
|
|
frame.status.clear();
|
|
let mut a = frame.read(dst.as_rd())?;
|
|
let mut b = frame.read(*src)?;
|
|
if b == 0 {
|
|
frame.status.overflow = true;
|
|
// TODO ?
|
|
} else {
|
|
let (val, ov) = if let Some(v) = a.checked_rem(b) {
|
|
(v, false)
|
|
} else {
|
|
(a.wrapping_rem(b), true)
|
|
};
|
|
frame.status.zero = (val == 0);
|
|
frame.status.positive = is_positive(val);
|
|
frame.status.negative = is_negative(val);
|
|
frame.status.overflow = ov;
|
|
frame.write(*dst, val)?;
|
|
}
|
|
}
|
|
Op::DivRem(dst, remptr, src) => {
|
|
frame.status.clear();
|
|
let mut a = frame.read(dst.as_rd())?;
|
|
let mut b = frame.read(*src)?;
|
|
if b == 0 {
|
|
frame.status.overflow = true;
|
|
// TODO ?
|
|
} else {
|
|
let (val, rem, ov) = if let Some(v) = a.checked_div(b) {
|
|
(v, a.rem(b), false)
|
|
} else {
|
|
(a.wrapping_div(b), a.wrapping_rem(b), true)
|
|
};
|
|
frame.status.zero = (val == 0);
|
|
frame.status.positive = is_positive(val);
|
|
frame.status.negative = is_negative(val);
|
|
frame.status.overflow = ov;
|
|
frame.write(*dst, val)?;
|
|
frame.write(*remptr, rem)?;
|
|
}
|
|
}
|
|
Op::And(dst, src) => {
|
|
frame.status.clear();
|
|
let mut val = frame.read(dst.as_rd())?;
|
|
let mut b = frame.read(*src)?;
|
|
val &= b;
|
|
frame.status.zero = (val == 0);
|
|
frame.status.positive = is_positive(val);
|
|
frame.status.negative = is_negative(val);
|
|
frame.write(*dst, val)?;
|
|
}
|
|
Op::Or(dst, src) => {
|
|
frame.status.clear();
|
|
let mut val = frame.read(dst.as_rd())?;
|
|
let mut b = frame.read(*src)?;
|
|
val |= b;
|
|
frame.status.zero = (val == 0);
|
|
frame.status.positive = is_positive(val);
|
|
frame.status.negative = is_negative(val);
|
|
frame.write(*dst, val)?;
|
|
}
|
|
Op::Xor(dst, src) => {
|
|
frame.status.clear();
|
|
let mut val = frame.read(dst.as_rd())?;
|
|
let mut b = frame.read(*src)?;
|
|
val ^= b;
|
|
frame.status.zero = (val == 0);
|
|
frame.status.positive = is_positive(val);
|
|
frame.status.negative = is_negative(val);
|
|
frame.write(*dst, val)?;
|
|
}
|
|
Op::Cpl(dst) => {
|
|
frame.status.clear();
|
|
let mut val = frame.read(dst.as_rd())?;
|
|
val = !val;
|
|
frame.status.zero = (val == 0);
|
|
frame.status.positive = is_positive(val);
|
|
frame.status.negative = is_negative(val);
|
|
frame.write(*dst, val)?;
|
|
}
|
|
Op::Rol(dst, num) => {
|
|
frame.status.clear();
|
|
let mut val = frame.read(dst.as_rd())?;
|
|
let mut b = frame.read(*num)?;
|
|
val = val.rotate_left(b as u32); // FIXME check overflow
|
|
frame.status.zero = (val == 0);
|
|
frame.status.positive = is_positive(val);
|
|
frame.status.negative = is_negative(val);
|
|
frame.write(*dst, val)?;
|
|
}
|
|
Op::Ror(dst, num) => {
|
|
frame.status.clear();
|
|
let mut val = frame.read(dst.as_rd())?;
|
|
let mut b = frame.read(*num)?;
|
|
val = val.rotate_right(b as u32); // FIXME check overflow
|
|
frame.status.zero = (val == 0);
|
|
frame.status.positive = is_positive(val);
|
|
frame.status.negative = is_negative(val);
|
|
frame.write(*dst, val)?;
|
|
}
|
|
Op::Lsl(dst, num) => {
|
|
frame.status.clear();
|
|
let mut val = frame.read(dst.as_rd())?;
|
|
let mut b = frame.read(*num)?;
|
|
val = val << b;
|
|
frame.status.zero = (val == 0);
|
|
frame.status.positive = is_positive(val);
|
|
frame.status.negative = is_negative(val);
|
|
frame.write(*dst, val)?;
|
|
}
|
|
Op::Lsr(dst, num) => {
|
|
frame.status.clear();
|
|
let mut val = frame.read(dst.as_rd())?;
|
|
let mut b = frame.read(*num)?;
|
|
val = val >> b;
|
|
frame.status.zero = (val == 0);
|
|
frame.status.positive = is_positive(val);
|
|
frame.status.negative = is_negative(val);
|
|
frame.write(*dst, val)?;
|
|
}
|
|
Op::Asr(dst, num) => {
|
|
frame.status.clear();
|
|
let mut val = frame.read(dst.as_rd())?;
|
|
let mut b = frame.read(*num)?;
|
|
val = val.signed_shr(b as u32); // FIXME check overflow
|
|
frame.status.zero = (val == 0);
|
|
frame.status.positive = is_positive(val);
|
|
frame.status.negative = is_negative(val);
|
|
frame.write(*dst, val)?;
|
|
}
|
|
}
|
|
|
|
Ok(EvalRes {
|
|
cycles,
|
|
advance,
|
|
})
|
|
}
|
|
}
|
|
|