-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathexec.rs
411 lines (377 loc) · 16.1 KB
/
exec.rs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
use std::cell::RefCell;
use std::collections::HashMap;
use std::fmt::{Debug, Error, Formatter};
use std::ops::{Add, Deref, DerefMut};
use crate::lang::func::FnRef;
use crate::lang::inst::{BinOp, Inst};
use crate::lang::Program;
use crate::lang::util::MutRc;
use crate::lang::value::{Const, GlobalVarRef, Symbol, SymbolRef, Type, Typed, Value};
use crate::vm::mem::{FrameRef, MemSpace, Reg, RegFile, Stack};
use crate::vm::stat::Counter;
pub struct Machine {
global: HashMap<GlobalVarRef, Reg>,
stack: Stack,
count: Counter,
}
impl Machine {
pub fn new() -> Self {
Machine {
global: Default::default(),
stack: Stack::new(),
count: Counter::new(),
}
}
pub fn run(&mut self, pro: &Program) -> Result<VmRcd, RuntimeErr> {
// Initialize global variable
pro.vars.iter().for_each(|var| {
let mut reg = Reg::from(&var.ty);
var.init.map(|init| reg.set_const(init));
self.global.insert(var.clone(), reg);
});
// Find program entrance and run that function
match pro.func.iter().find(|func| &func.name == "main") {
Some(main) => { self.call(main, vec![])?; }
None => self.err(format!("cannot find program entrance"))?
}
// Collect machine statistics
let mut global: Vec<_> = self.global.iter()
.map(|(v, r)| (v.clone(), r.clone())).collect();
global.sort_by_cached_key(|(v, _)| v.name.clone());
let count = self.count;
// Clear machine state for this program
self.global.clear();
self.stack.clear();
self.count.reset();
Ok(VmRcd { global, count })
}
fn call(&mut self, func: &FnRef, arg: Vec<Reg>) -> Result<Option<Reg>, RuntimeErr> {
// Pass arguments to parameters
let ref mut file: RegFile = func.param.iter().zip(arg.into_iter())
.map(|(p, r)| { (p.borrow().clone(), r) }).collect();
// Push a new frame to stack
if self.stack.len() >= 256 {
self.err(format!("stack overflow"))?
}
self.stack.push_frame(func);
let frame = self.stack.top();
// Walk the CFG
let mut next_blk = func.ent.borrow().clone();
loop {
// Assign values to phi destinations
for phi in next_blk.inst.borrow().iter() {
match phi.as_ref() {
Inst::Phi { src, dst } => {
let src = &src.iter()
.find(|(b, _)| b.borrow().deref() == &frame.borrow().block).unwrap().1;
let val = match src.borrow().deref() {
Value::Var(sym) => file[sym].clone(),
Value::Const(c) => Reg::Val(*c)
};
self.reg_to_dst(val, dst, file)
}
_ => break
}
}
// Transfer to the new block and execute the remaining instructions
let cur_blk = next_blk.clone();
frame.borrow_mut().block = cur_blk.clone();
for instr in cur_blk.inst.borrow().iter() {
self.count.count(instr.as_ref());
match instr.as_ref() {
Inst::Phi { src: _, dst: _ } => {}
Inst::Mov { src, dst } => {
let reg = self.reg_from_src(src, file);
self.reg_to_dst(reg, dst, file);
}
Inst::Un { op, opd, dst } => {
let opd = self.reg_from_src(opd, file).get_const();
let res = Reg::Val(op.eval(opd));
self.reg_to_dst(res, dst, file);
}
Inst::Bin { op, fst, snd, dst } => self.exec_bin(*op, fst, snd, dst, file),
Inst::Call { func, arg, dst } => {
let arg: Vec<_> = arg.iter().map(|a| self.reg_from_src(a, file)).collect();
let res = self.call(func, arg)?;
dst.as_ref().map(|dst| self.reg_to_dst(res.unwrap(), dst, file));
}
Inst::Ret { val } => {
let res = val.as_ref().map(|val| self.reg_from_src(val, file));
self.stack.pop_frame();
return Ok(res);
}
Inst::Jmp { tgt } => {
next_blk = tgt.borrow().clone();
frame.borrow_mut().instr = 0;
break;
}
Inst::Br { cond, tr, fls } => {
let cond = self.reg_from_src(cond, file).get_const();
let cond = if let Const::I1(b) = cond { b } else { unreachable!() };
next_blk = if cond { tr.borrow().clone() } else { fls.borrow().clone() };
frame.borrow_mut().instr = 0;
break;
}
Inst::Alloc { dst } => {
let ptr = self.stack.alloc(dst.borrow().get_type().tgt_type().size());
self.reg_to_dst(ptr, dst, file);
}
Inst::New { dst, len } => self.exec_new(dst, len, file),
Inst::Ptr { base, off, ind, dst } =>
self.exec_ptr(base, off, ind, dst, file)?,
Inst::Ld { ptr, dst } => self.exec_ld(ptr, dst, file)?,
Inst::St { src, ptr } => self.exec_st(src, ptr, file)?
}
frame.borrow_mut().instr += 1;
}
}
}
fn exec_st(&mut self, src: &RefCell<Value>, ptr: &RefCell<Value>, file: &RegFile)
-> Result<(), RuntimeErr>
{
let ptr_reg = self.reg_from_src(ptr, file);
let src_ty = src.borrow().get_type();
let src = self.reg_from_src(src, file);
match ptr_reg {
Reg::Ptr { base, off } => {
let mem_end = off + src_ty.size();
match base.as_ref() {
None => self.err(format!("dereference of null pointer"))?,
Some(MemSpace::Stack(addr)) => match self.stack.get_mem_mut(*addr) {
Some(mem) if mem_end <= mem.len() => Self::write_by_type(mem, off, src),
Some(_) => self.err(format!("memory access out of bound"))?,
None => self.err(format!("stack space does not exist"))?
}
Some(MemSpace::Heap(mem)) => {
if mem_end <= mem.borrow().len() {
Self::write_by_type(mem.borrow_mut().deref_mut(), off, src)
} else {
self.err(format!("memory access out of bound"))?
}
}
}
}
Reg::Val(_) => unreachable!()
}
Ok(())
}
fn write_by_type(mem: &mut Vec<u8>, addr: usize, src: Reg) {
match src {
Reg::Val(Const::I1(c)) => Self::write(mem, addr, c),
Reg::Val(Const::I8(c)) => Self::write(mem, addr, c),
Reg::Val(Const::I16(c)) => Self::write(mem, addr, c),
Reg::Val(Const::I32(c)) => Self::write(mem, addr, c),
Reg::Val(Const::I64(c)) => Self::write(mem, addr, c),
ptr if ptr.is_ptr() => Self::write(mem, addr, ptr),
_ => unreachable!()
}
}
fn write<T>(mem: &mut Vec<u8>, addr: usize, val: T) {
let ptr = &mut mem[addr] as *mut u8 as *mut T;
unsafe { *ptr = val }
}
fn exec_ld(&mut self, ptr: &RefCell<Value>, dst: &RefCell<SymbolRef>, file: &mut RegFile)
-> Result<(), RuntimeErr>
{
let ptr_reg = self.reg_from_src(ptr, file);
let ref dst_ty = dst.borrow().get_type();
match ptr_reg {
Reg::Ptr { base, off } => {
let mem_end = off + dst_ty.size();
match base.as_ref() {
None => self.err(format!("dereference of null pointer"))?,
Some(MemSpace::Stack(addr)) => match self.stack.get_mem(*addr) {
Some(mem) if mem_end <= mem.len() => {
let reg = Self::read_by_type(mem, off, dst_ty);
self.reg_to_dst(reg, dst, file);
}
Some(_) => self.err(format!("memory access out of bound"))?,
None => self.err(format!("stack space does not exist"))?
}
Some(MemSpace::Heap(mem)) => {
if mem_end <= mem.borrow().len() {
let reg = Self::read_by_type(mem.borrow().deref(), off, dst_ty);
self.reg_to_dst(reg, dst, file);
} else {
self.err(format!("memory access out of bound"))?
}
}
}
}
Reg::Val(_) => unreachable!()
}
Ok(())
}
fn read_by_type(mem: &Vec<u8>, addr: usize, ty: &Type) -> Reg {
match ty {
Type::I(1) => Reg::Val(Const::I1(Self::read::<bool>(mem, addr))),
Type::I(8) => Reg::Val(Const::I8(Self::read::<i8>(mem, addr))),
Type::I(16) => Reg::Val(Const::I16(Self::read::<i16>(mem, addr))),
Type::I(32) => Reg::Val(Const::I32(Self::read::<i32>(mem, addr))),
Type::I(64) => Reg::Val(Const::I64(Self::read::<i64>(mem, addr))),
Type::Ptr(_) => Self::read::<Reg>(mem, addr),
_ => unreachable!()
}
}
fn read<T: Clone>(mem: &Vec<u8>, addr: usize) -> T {
let ptr = &mem[addr] as *const u8 as *const T;
unsafe { (*ptr).clone() }
}
fn exec_bin(&mut self, op: BinOp, fst: &RefCell<Value>, snd: &RefCell<Value>,
dst: &RefCell<SymbolRef>, file: &mut RegFile)
{
let fst = self.reg_from_src(fst, file);
let snd = self.reg_from_src(snd, file);
let res = if fst.is_val() { // use built-in constant evaluation function
Reg::Val(op.eval(fst.get_const(), snd.get_const()))
} else {
match op {
BinOp::Eq => Reg::Val(Const::I1(fst == snd)),
BinOp::Ne => Reg::Val(Const::I1(fst != snd)),
BinOp::Lt => Reg::Val(Const::I1(fst < snd)),
BinOp::Le => Reg::Val(Const::I1(fst <= snd)),
BinOp::Gt => Reg::Val(Const::I1(fst > snd)),
BinOp::Ge => Reg::Val(Const::I1(fst >= snd)),
_ => unreachable!()
}
};
self.reg_to_dst(res, dst, file);
}
fn exec_new(&mut self, dst: &RefCell<SymbolRef>, len: &Option<RefCell<Value>>,
file: &mut RegFile)
{
// Compute size of heap space to be dynamically allocated
let mut size = dst.borrow().get_type().tgt_type().size();
len.as_ref().map(|len| {
let len = self.reg_from_src(len, file).get_const();
let len = if let Const::I64(c) = len { c } else { unreachable!() };
size *= len as usize;
});
// Allocate heap space
// This space will be handled by the mutable reference counter. No garbage collector is
// needed in this VM.
let space = MutRc::new(vec![0; size]);
let ptr = Reg::Ptr {
base: Some(MemSpace::Heap(space)),
off: 0,
};
self.reg_to_dst(ptr, dst, file);
}
fn exec_ptr(&mut self, base: &RefCell<Value>, off: &Option<RefCell<Value>>,
ind: &Vec<RefCell<Value>>, dst: &RefCell<SymbolRef>, file: &mut RegFile)
-> Result<(), RuntimeErr>
{
// Compute pointer offset outside target value
let mut tgt_ty = base.borrow().get_type().tgt_type();
let mut size_off = 0;
off.as_ref().map(|off| {
let off = self.reg_from_src(off, file).get_const();
let off = if let Const::I64(c) = off { c } else { unreachable!() };
size_off += off as usize * tgt_ty.size();
});
// Compute element offset inside aggregate
for idx in ind {
let idx = self.reg_from_src(idx, file).get_const();
let idx = if let Const::I64(c) = idx { c as usize } else { unreachable!() };
match tgt_ty.orig().clone() {
Type::Array { elem, len } => {
if idx >= len {
self.err(format!("index {} out of bound {}", idx, len))?
}
size_off += elem.size() * idx;
tgt_ty = elem.deref().clone();
}
Type::Struct { field } => {
// indices into struct are checked at irc time, impossible to be out of
// bound
size_off += field[..idx].iter().map(|f| f.size()).fold(0, Add::add);
tgt_ty = field[idx].clone();
}
_ => unreachable!()
}
}
// Store the new address
let mut addr = self.reg_from_src(base, file);
addr.set_off(addr.get_off() + size_off);
self.reg_to_dst(addr, dst, file);
Ok(())
}
fn reg_from_src(&self, src: &RefCell<Value>, file: &RegFile) -> Reg {
match src.borrow().deref() {
Value::Var(sym) if sym.is_local_var() => match file.get(sym) {
Some(reg) => reg.clone(),
None => panic!("value {:?} undefined", src.borrow().deref())
},
Value::Var(sym) => if let Symbol::Global(g) = sym.as_ref() {
self.global[g].clone()
} else { unreachable!() }
Value::Const(c) => Reg::Val(*c)
}
}
fn reg_to_dst(&mut self, reg: Reg, dst: &RefCell<SymbolRef>, file: &mut RegFile) {
match dst.borrow().as_ref() {
sym if sym.is_local_var() => { file.insert(dst.borrow().clone(), reg); }
Symbol::Global(g) => { *self.global.get_mut(g).unwrap() = reg; }
_ => unreachable!()
}
}
fn err(&self, msg: String) -> Result<(), RuntimeErr> {
Err(RuntimeErr { msg, frame: self.stack.unwind() })
}
}
/// Record of VM when executing this program
pub struct VmRcd {
pub global: Vec<(GlobalVarRef, Reg)>,
pub count: Counter,
}
impl Debug for VmRcd {
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error> {
writeln!(f, "program terminated")?;
writeln!(f, "instructions: {} time: {}", self.count.num, self.count.time)?;
if !self.global.is_empty() {
writeln!(f, "\nglobal variables: ")?;
for (g, r) in self.global.iter() {
write!(f, "@{} = ", g.name)?;
match r {
Reg::Val(v) => writeln!(f, "{}", v.to_string())?,
Reg::Ptr { base: _, off: _ } => writeln!(f, "{}", g.ty.to_string())?
}
}
}
Ok(())
}
}
pub struct RuntimeErr {
msg: String,
frame: Vec<FrameRef>,
}
impl Debug for RuntimeErr {
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error> {
writeln!(f, "runtime error: {}", self.msg)?;
writeln!(f, "call stack: ")?;
for (i, frame) in self.frame.iter().rev().enumerate() {
writeln!(f, "{} @{}, %{:?}, #{}", i, frame.borrow().func.name,
frame.borrow().block.name, frame.borrow().instr)?;
}
Ok(())
}
}
#[test]
fn test_exec() {
use crate::irc::lex::Lexer;
use crate::irc::parse::Parser;
use crate::irc::build::Builder;
use crate::vm::exec::Machine;
use std::fs::File;
use std::convert::TryFrom;
use std::io::Read;
let mut file = File::open("test/example.ir").unwrap();
let lexer = Lexer::try_from(&mut file as &mut dyn Read).unwrap();
let parser = Parser::new(lexer);
let tree = parser.parse().unwrap();
let builder = Builder::new(tree);
let mut pro = builder.build().unwrap();
let mut mach = Machine::new();
let rcd = mach.run(&mut pro).unwrap();
println!("{:?}", rcd);
}