2016-02-27 19:20:25 -06:00
|
|
|
// TODO(tsion): Remove this.
|
|
|
|
#![allow(unused_imports, dead_code, unused_variables)]
|
|
|
|
|
|
|
|
use byteorder;
|
|
|
|
use byteorder::ByteOrder;
|
2016-03-04 23:17:31 -06:00
|
|
|
use rustc::middle::const_eval;
|
|
|
|
use rustc::middle::def_id;
|
2015-12-17 14:03:01 -06:00
|
|
|
use rustc::middle::cstore::CrateStore;
|
2016-03-04 23:17:31 -06:00
|
|
|
use rustc::middle::ty::{self, TyCtxt};
|
2015-12-04 13:09:14 -06:00
|
|
|
use rustc::mir::repr::{self as mir, Mir};
|
2016-02-18 19:06:22 -06:00
|
|
|
use rustc::mir::mir_map::MirMap;
|
2016-02-27 19:20:25 -06:00
|
|
|
use std::collections::HashMap;
|
2016-02-28 01:07:03 -06:00
|
|
|
use std::error::Error;
|
|
|
|
use std::fmt;
|
|
|
|
use std::iter;
|
2015-11-12 17:11:41 -06:00
|
|
|
use syntax::ast::Attribute;
|
2015-11-12 15:50:58 -06:00
|
|
|
use syntax::attr::AttrMetaMethods;
|
|
|
|
|
2016-02-27 19:20:25 -06:00
|
|
|
const TRACE_EXECUTION: bool = true;
|
2015-11-20 15:32:39 -06:00
|
|
|
|
2016-02-27 19:20:25 -06:00
|
|
|
mod memory {
|
|
|
|
use byteorder;
|
|
|
|
use byteorder::ByteOrder;
|
|
|
|
use rustc::middle::ty;
|
|
|
|
use std::collections::HashMap;
|
|
|
|
use std::mem;
|
2016-03-04 23:17:31 -06:00
|
|
|
use std::ops::Add;
|
|
|
|
use std::ptr;
|
|
|
|
use super::{EvalError, EvalResult};
|
2015-11-12 15:50:58 -06:00
|
|
|
|
2016-02-27 19:20:25 -06:00
|
|
|
pub struct Memory {
|
|
|
|
next_id: u64,
|
2016-03-04 23:44:49 -06:00
|
|
|
alloc_map: HashMap<u64, Allocation>,
|
2016-02-27 19:20:25 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
#[derive(Copy, Clone, Debug, Eq, PartialEq)]
|
|
|
|
pub struct AllocId(u64);
|
|
|
|
|
2016-03-04 23:44:49 -06:00
|
|
|
// TODO(tsion): Shouldn't clone Allocation. (Audit the rest of the code.)
|
2016-02-27 19:20:25 -06:00
|
|
|
#[derive(Clone, Debug)]
|
2016-03-04 23:44:49 -06:00
|
|
|
pub struct Allocation {
|
2016-02-27 19:20:25 -06:00
|
|
|
pub bytes: Vec<u8>,
|
|
|
|
// TODO(tsion): relocations
|
|
|
|
// TODO(tsion): undef mask
|
|
|
|
}
|
|
|
|
|
|
|
|
#[derive(Clone, Debug, PartialEq, Eq)]
|
|
|
|
pub struct Pointer {
|
|
|
|
pub alloc_id: AllocId,
|
|
|
|
pub offset: usize,
|
|
|
|
pub repr: Repr,
|
|
|
|
}
|
|
|
|
|
2016-03-04 23:17:31 -06:00
|
|
|
#[derive(Clone, Debug, PartialEq, Eq)]
|
|
|
|
pub struct FieldRepr {
|
|
|
|
pub offset: usize,
|
|
|
|
pub repr: Repr,
|
|
|
|
}
|
|
|
|
|
2016-02-27 19:20:25 -06:00
|
|
|
#[derive(Clone, Debug, PartialEq, Eq)]
|
|
|
|
pub enum Repr {
|
|
|
|
Int,
|
2016-03-04 23:17:31 -06:00
|
|
|
Aggregate {
|
|
|
|
size: usize,
|
|
|
|
fields: Vec<FieldRepr>,
|
|
|
|
},
|
2016-02-27 19:20:25 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
impl Memory {
|
|
|
|
pub fn new() -> Self {
|
|
|
|
Memory { next_id: 0, alloc_map: HashMap::new() }
|
|
|
|
}
|
|
|
|
|
2016-03-04 23:17:31 -06:00
|
|
|
pub fn allocate_raw(&mut self, size: usize) -> AllocId {
|
2016-02-27 19:20:25 -06:00
|
|
|
let id = AllocId(self.next_id);
|
2016-03-04 23:44:49 -06:00
|
|
|
let alloc = Allocation { bytes: vec![0; size] };
|
|
|
|
self.alloc_map.insert(self.next_id, alloc);
|
2016-02-27 19:20:25 -06:00
|
|
|
self.next_id += 1;
|
|
|
|
id
|
|
|
|
}
|
|
|
|
|
2016-03-04 23:17:31 -06:00
|
|
|
pub fn allocate(&mut self, repr: Repr) -> Pointer {
|
|
|
|
Pointer {
|
|
|
|
alloc_id: self.allocate_raw(repr.size()),
|
|
|
|
offset: 0,
|
|
|
|
repr: repr,
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2016-02-27 19:20:25 -06:00
|
|
|
pub fn allocate_int(&mut self, n: i64) -> AllocId {
|
2016-03-04 23:17:31 -06:00
|
|
|
let id = self.allocate_raw(mem::size_of::<i64>());
|
2016-03-04 23:44:49 -06:00
|
|
|
byteorder::NativeEndian::write_i64(&mut self.get_mut(id).unwrap().bytes, n);
|
2016-02-27 19:20:25 -06:00
|
|
|
id
|
|
|
|
}
|
|
|
|
|
2016-03-04 23:44:49 -06:00
|
|
|
pub fn get(&self, id: AllocId) -> EvalResult<&Allocation> {
|
2016-03-04 23:17:31 -06:00
|
|
|
self.alloc_map.get(&id.0).ok_or(EvalError::DanglingPointerDeref)
|
2016-02-27 19:20:25 -06:00
|
|
|
}
|
|
|
|
|
2016-03-04 23:44:49 -06:00
|
|
|
pub fn get_mut(&mut self, id: AllocId) -> EvalResult<&mut Allocation> {
|
2016-03-04 23:17:31 -06:00
|
|
|
self.alloc_map.get_mut(&id.0).ok_or(EvalError::DanglingPointerDeref)
|
|
|
|
}
|
|
|
|
|
2016-03-05 00:23:37 -06:00
|
|
|
fn get_bytes(&self, ptr: &Pointer, size: usize) -> EvalResult<&[u8]> {
|
|
|
|
let alloc = try!(self.get(ptr.alloc_id));
|
|
|
|
try!(alloc.check_bytes(ptr.offset, ptr.offset + size));
|
|
|
|
Ok(&alloc.bytes[ptr.offset..ptr.offset + size])
|
|
|
|
}
|
|
|
|
|
|
|
|
fn get_bytes_mut(&mut self, ptr: &Pointer, size: usize) -> EvalResult<&mut [u8]> {
|
|
|
|
let alloc = try!(self.get_mut(ptr.alloc_id));
|
|
|
|
try!(alloc.check_bytes(ptr.offset, ptr.offset + size));
|
|
|
|
Ok(&mut alloc.bytes[ptr.offset..ptr.offset + size])
|
|
|
|
}
|
|
|
|
|
2016-03-04 23:17:31 -06:00
|
|
|
pub fn copy(&mut self, src: &Pointer, dest: &Pointer, size: usize) -> EvalResult<()> {
|
2016-03-05 00:23:37 -06:00
|
|
|
let src_bytes = try!(self.get_bytes_mut(src, size)).as_mut_ptr();
|
|
|
|
let dest_bytes = try!(self.get_bytes_mut(dest, size)).as_mut_ptr();
|
2016-03-04 23:17:31 -06:00
|
|
|
|
|
|
|
// SAFE: The above indexing would have panicked if there weren't at least `size` bytes
|
|
|
|
// behind `src` and `dest`. Also, we use the overlapping-safe `ptr::copy` if `src` and
|
|
|
|
// `dest` could possibly overlap.
|
|
|
|
unsafe {
|
|
|
|
if src.alloc_id == dest.alloc_id {
|
|
|
|
ptr::copy(src_bytes, dest_bytes, size);
|
|
|
|
} else {
|
|
|
|
ptr::copy_nonoverlapping(src_bytes, dest_bytes, size);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
Ok(())
|
2016-02-27 19:20:25 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2016-03-05 00:23:37 -06:00
|
|
|
impl Allocation {
|
|
|
|
fn check_bytes(&self, start: usize, end: usize) -> EvalResult<()> {
|
|
|
|
if start >= self.bytes.len() || end > self.bytes.len() {
|
|
|
|
return Err(EvalError::PointerOutOfBounds);
|
|
|
|
}
|
|
|
|
Ok(())
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2016-02-27 19:20:25 -06:00
|
|
|
impl Pointer {
|
2016-03-04 23:17:31 -06:00
|
|
|
pub fn offset(&self, i: usize) -> Self {
|
|
|
|
Pointer { offset: self.offset + i, ..self.clone() }
|
2016-02-27 19:20:25 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
impl Repr {
|
|
|
|
// TODO(tsion): Cache these outputs.
|
|
|
|
pub fn from_ty(ty: ty::Ty) -> Self {
|
|
|
|
match ty.sty {
|
|
|
|
ty::TyInt(_) => Repr::Int,
|
2016-03-04 23:17:31 -06:00
|
|
|
|
|
|
|
ty::TyTuple(ref fields) => {
|
|
|
|
let mut size = 0;
|
|
|
|
let fields = fields.iter().map(|ty| {
|
|
|
|
let repr = Repr::from_ty(ty);
|
|
|
|
let old_size = size;
|
|
|
|
size += repr.size();
|
|
|
|
FieldRepr { offset: old_size, repr: repr }
|
|
|
|
}).collect();
|
|
|
|
Repr::Aggregate { size: size, fields: fields }
|
|
|
|
},
|
|
|
|
|
2016-02-27 19:20:25 -06:00
|
|
|
_ => unimplemented!(),
|
|
|
|
}
|
|
|
|
}
|
2015-11-20 15:34:28 -06:00
|
|
|
|
2016-02-27 19:20:25 -06:00
|
|
|
pub fn size(&self) -> usize {
|
|
|
|
match *self {
|
|
|
|
Repr::Int => 8,
|
2016-03-04 23:17:31 -06:00
|
|
|
Repr::Aggregate { size, .. } => size,
|
2016-02-27 19:20:25 -06:00
|
|
|
}
|
2015-11-21 01:07:32 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2016-03-04 23:44:49 -06:00
|
|
|
use self::memory::{Pointer, Repr, Allocation};
|
2016-02-27 19:20:25 -06:00
|
|
|
|
2016-02-28 01:07:03 -06:00
|
|
|
#[derive(Clone, Debug)]
|
2016-03-04 23:17:31 -06:00
|
|
|
pub enum EvalError {
|
2016-03-05 00:23:37 -06:00
|
|
|
DanglingPointerDeref,
|
|
|
|
PointerOutOfBounds,
|
2016-03-04 23:17:31 -06:00
|
|
|
}
|
2016-02-28 01:07:03 -06:00
|
|
|
|
|
|
|
pub type EvalResult<T> = Result<T, EvalError>;
|
|
|
|
|
|
|
|
impl Error for EvalError {
|
|
|
|
fn description(&self) -> &str {
|
2016-03-05 00:23:37 -06:00
|
|
|
match *self {
|
|
|
|
EvalError::DanglingPointerDeref => "dangling pointer was dereferenced",
|
|
|
|
EvalError::PointerOutOfBounds => "pointer offset outside bounds of allocation",
|
|
|
|
}
|
2016-02-28 01:07:03 -06:00
|
|
|
}
|
|
|
|
|
2016-03-05 00:23:37 -06:00
|
|
|
fn cause(&self) -> Option<&Error> { None }
|
2016-02-28 01:07:03 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
impl fmt::Display for EvalError {
|
|
|
|
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
|
|
|
|
write!(f, "{}", self.description())
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2016-02-27 19:20:25 -06:00
|
|
|
// #[derive(Clone, Debug, PartialEq)]
|
|
|
|
// enum Value {
|
|
|
|
// Uninit,
|
|
|
|
// Bool(bool),
|
|
|
|
// Int(i64), // FIXME(tsion): Should be bit-width aware.
|
|
|
|
// Pointer(Pointer),
|
|
|
|
// Adt { variant: usize, data_ptr: Pointer },
|
|
|
|
// Func(def_id::DefId),
|
|
|
|
// }
|
2015-11-21 01:07:32 -06:00
|
|
|
|
2015-11-20 15:34:28 -06:00
|
|
|
/// A stack frame:
|
|
|
|
///
|
|
|
|
/// ```text
|
|
|
|
/// +-----------------------+
|
|
|
|
/// | Arg(0) |
|
|
|
|
/// | Arg(1) | arguments
|
|
|
|
/// | ... |
|
|
|
|
/// | Arg(num_args - 1) |
|
|
|
|
/// + - - - - - - - - - - - +
|
|
|
|
/// | Var(0) |
|
|
|
|
/// | Var(1) | variables
|
|
|
|
/// | ... |
|
|
|
|
/// | Var(num_vars - 1) |
|
|
|
|
/// + - - - - - - - - - - - +
|
|
|
|
/// | Temp(0) |
|
|
|
|
/// | Temp(1) | temporaries
|
|
|
|
/// | ... |
|
|
|
|
/// | Temp(num_temps - 1) |
|
|
|
|
/// + - - - - - - - - - - - +
|
|
|
|
/// | Aggregates | aggregates
|
|
|
|
/// +-----------------------+
|
|
|
|
/// ```
|
2016-02-27 19:20:25 -06:00
|
|
|
// #[derive(Debug)]
|
|
|
|
// struct Frame {
|
|
|
|
// /// A pointer to a stack cell to write the return value of the current call, if it's not a
|
|
|
|
// /// divering call.
|
|
|
|
// return_ptr: Option<Pointer>,
|
|
|
|
|
|
|
|
// offset: usize,
|
|
|
|
// num_args: usize,
|
|
|
|
// num_vars: usize,
|
|
|
|
// num_temps: usize,
|
|
|
|
// num_aggregate_fields: usize,
|
|
|
|
// }
|
|
|
|
|
|
|
|
// impl Frame {
|
|
|
|
// fn size(&self) -> usize {
|
|
|
|
// self.num_args + self.num_vars + self.num_temps + self.num_aggregate_fields
|
|
|
|
// }
|
|
|
|
|
|
|
|
// fn arg_offset(&self, i: usize) -> usize {
|
|
|
|
// self.offset + i
|
|
|
|
// }
|
|
|
|
|
|
|
|
// fn var_offset(&self, i: usize) -> usize {
|
|
|
|
// self.offset + self.num_args + i
|
|
|
|
// }
|
|
|
|
|
|
|
|
// fn temp_offset(&self, i: usize) -> usize {
|
|
|
|
// self.offset + self.num_args + self.num_vars + i
|
|
|
|
// }
|
|
|
|
// }
|
2015-11-19 07:07:47 -06:00
|
|
|
|
|
|
|
struct Interpreter<'a, 'tcx: 'a> {
|
2016-03-04 23:17:31 -06:00
|
|
|
tcx: &'a TyCtxt<'tcx>,
|
2015-11-19 07:07:47 -06:00
|
|
|
mir_map: &'a MirMap<'tcx>,
|
2016-02-27 19:20:25 -06:00
|
|
|
// value_stack: Vec<Value>,
|
|
|
|
// call_stack: Vec<Frame>,
|
|
|
|
memory: memory::Memory,
|
2016-03-04 23:17:31 -06:00
|
|
|
return_ptr: Option<Pointer>,
|
2015-11-16 15:22:27 -06:00
|
|
|
}
|
|
|
|
|
2015-11-19 07:07:47 -06:00
|
|
|
impl<'a, 'tcx> Interpreter<'a, 'tcx> {
|
2016-03-04 23:17:31 -06:00
|
|
|
fn new(tcx: &'a TyCtxt<'tcx>, mir_map: &'a MirMap<'tcx>) -> Self {
|
2015-11-12 15:50:58 -06:00
|
|
|
Interpreter {
|
2015-11-19 07:07:47 -06:00
|
|
|
tcx: tcx,
|
|
|
|
mir_map: mir_map,
|
2016-02-27 19:20:25 -06:00
|
|
|
// value_stack: vec![Value::Uninit], // Allocate a spot for the top-level return value.
|
|
|
|
// call_stack: Vec::new(),
|
|
|
|
memory: memory::Memory::new(),
|
2016-03-04 23:17:31 -06:00
|
|
|
return_ptr: None,
|
2015-11-12 15:50:58 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2016-02-27 19:20:25 -06:00
|
|
|
// fn push_stack_frame(&mut self, mir: &Mir, args: &[Value], return_ptr: Option<Pointer>) {
|
|
|
|
// let frame = Frame {
|
|
|
|
// return_ptr: return_ptr,
|
|
|
|
// offset: self.value_stack.len(),
|
|
|
|
// num_args: mir.arg_decls.len(),
|
|
|
|
// num_vars: mir.var_decls.len(),
|
|
|
|
// num_temps: mir.temp_decls.len(),
|
|
|
|
// num_aggregate_fields: 0,
|
|
|
|
// };
|
2015-11-16 15:22:27 -06:00
|
|
|
|
2016-02-27 19:20:25 -06:00
|
|
|
// self.value_stack.extend(iter::repeat(Value::Uninit).take(frame.size()));
|
2015-11-20 20:52:33 -06:00
|
|
|
|
2016-02-27 19:20:25 -06:00
|
|
|
// for (i, arg) in args.iter().enumerate() {
|
|
|
|
// self.value_stack[frame.arg_offset(i)] = arg.clone();
|
|
|
|
// }
|
2015-11-20 20:52:33 -06:00
|
|
|
|
2016-02-27 19:20:25 -06:00
|
|
|
// self.call_stack.push(frame);
|
|
|
|
// }
|
2015-11-19 03:23:50 -06:00
|
|
|
|
2016-02-27 19:20:25 -06:00
|
|
|
// fn pop_stack_frame(&mut self) {
|
|
|
|
// let frame = self.call_stack.pop().expect("tried to pop stack frame, but there were none");
|
|
|
|
// self.value_stack.truncate(frame.offset);
|
|
|
|
// }
|
2015-11-19 03:23:50 -06:00
|
|
|
|
2016-02-27 19:20:25 -06:00
|
|
|
// fn allocate_aggregate(&mut self, size: usize) -> Pointer {
|
|
|
|
// let frame = self.call_stack.last_mut().expect("missing call frame");
|
|
|
|
// frame.num_aggregate_fields += size;
|
2015-11-21 01:31:09 -06:00
|
|
|
|
2016-02-27 19:20:25 -06:00
|
|
|
// let ptr = Pointer::Stack(self.value_stack.len());
|
|
|
|
// self.value_stack.extend(iter::repeat(Value::Uninit).take(size));
|
|
|
|
// ptr
|
|
|
|
// }
|
2015-11-21 01:07:32 -06:00
|
|
|
|
2016-03-04 23:44:49 -06:00
|
|
|
fn call(&mut self, mir: &Mir, args: &[Allocation], return_ptr: Option<Pointer>) -> EvalResult<()> {
|
2016-03-04 23:17:31 -06:00
|
|
|
self.return_ptr = return_ptr;
|
2016-02-27 19:20:25 -06:00
|
|
|
// self.push_stack_frame(mir, args, return_ptr);
|
2015-11-19 03:23:50 -06:00
|
|
|
let mut block = mir::START_BLOCK;
|
|
|
|
|
|
|
|
loop {
|
2016-01-06 21:05:08 -06:00
|
|
|
if TRACE_EXECUTION { println!("Entering block: {:?}", block); }
|
2015-11-19 03:23:50 -06:00
|
|
|
let block_data = mir.basic_block_data(block);
|
2015-11-14 01:19:07 -06:00
|
|
|
|
2015-11-19 03:23:50 -06:00
|
|
|
for stmt in &block_data.statements {
|
2015-11-20 15:32:39 -06:00
|
|
|
if TRACE_EXECUTION { println!("{:?}", stmt); }
|
|
|
|
|
2015-11-19 03:23:50 -06:00
|
|
|
match stmt.kind {
|
2015-11-20 15:54:02 -06:00
|
|
|
mir::StatementKind::Assign(ref lvalue, ref rvalue) => {
|
2016-02-28 01:07:03 -06:00
|
|
|
let ptr = try!(self.lvalue_to_ptr(lvalue));
|
2016-03-04 23:17:31 -06:00
|
|
|
try!(self.eval_rvalue_into(rvalue, &ptr));
|
2015-11-19 03:23:50 -06:00
|
|
|
}
|
2015-11-12 15:50:58 -06:00
|
|
|
}
|
2015-11-19 03:23:50 -06:00
|
|
|
}
|
|
|
|
|
2016-01-06 21:05:08 -06:00
|
|
|
if TRACE_EXECUTION { println!("{:?}", block_data.terminator()); }
|
2015-11-20 15:32:39 -06:00
|
|
|
|
2016-01-06 21:05:08 -06:00
|
|
|
match *block_data.terminator() {
|
2015-11-20 15:54:02 -06:00
|
|
|
mir::Terminator::Return => break,
|
|
|
|
mir::Terminator::Goto { target } => block = target,
|
2015-11-19 03:23:50 -06:00
|
|
|
|
2016-02-27 19:20:25 -06:00
|
|
|
// mir::Terminator::Call { ref func, ref args, ref destination, .. } => {
|
|
|
|
// let ptr = destination.as_ref().map(|&(ref lv, _)| self.lvalue_to_ptr(lv));
|
|
|
|
// let func_val = self.operand_to_ptr(func);
|
|
|
|
|
|
|
|
// if let Value::Func(def_id) = func_val {
|
|
|
|
// let mir_data;
|
|
|
|
// let mir = match self.tcx.map.as_local_node_id(def_id) {
|
|
|
|
// Some(node_id) => self.mir_map.map.get(&node_id).unwrap(),
|
|
|
|
// None => {
|
|
|
|
// let cstore = &self.tcx.sess.cstore;
|
|
|
|
// mir_data = cstore.maybe_get_item_mir(self.tcx, def_id).unwrap();
|
|
|
|
// &mir_data
|
|
|
|
// }
|
|
|
|
// };
|
|
|
|
|
|
|
|
// let arg_vals: Vec<Value> =
|
|
|
|
// args.iter().map(|arg| self.operand_to_ptr(arg)).collect();
|
|
|
|
|
|
|
|
// self.call(mir, &arg_vals, ptr);
|
|
|
|
|
|
|
|
// if let Some((_, target)) = *destination {
|
|
|
|
// block = target;
|
|
|
|
// }
|
|
|
|
// } else {
|
|
|
|
// panic!("tried to call a non-function value: {:?}", func_val);
|
|
|
|
// }
|
|
|
|
// }
|
|
|
|
|
|
|
|
// mir::Terminator::If { ref cond, targets: (then_target, else_target) } => {
|
|
|
|
// match self.operand_to_ptr(cond) {
|
|
|
|
// Value::Bool(true) => block = then_target,
|
|
|
|
// Value::Bool(false) => block = else_target,
|
|
|
|
// cond_val => panic!("Non-boolean `if` condition value: {:?}", cond_val),
|
|
|
|
// }
|
|
|
|
// }
|
|
|
|
|
|
|
|
// mir::Terminator::SwitchInt { ref discr, ref values, ref targets, .. } => {
|
|
|
|
// let discr_val = self.read_lvalue(discr);
|
|
|
|
|
2016-02-27 22:10:10 -06:00
|
|
|
// let index = values.iter().position(|v| discr_val == self.const_to_ptr(v))
|
2016-02-27 19:20:25 -06:00
|
|
|
// .expect("discriminant matched no values");
|
|
|
|
|
|
|
|
// block = targets[index];
|
|
|
|
// }
|
|
|
|
|
|
|
|
// mir::Terminator::Switch { ref discr, ref targets, .. } => {
|
|
|
|
// let discr_val = self.read_lvalue(discr);
|
|
|
|
|
|
|
|
// if let Value::Adt { variant, .. } = discr_val {
|
|
|
|
// block = targets[variant];
|
|
|
|
// } else {
|
|
|
|
// panic!("Switch on non-Adt value: {:?}", discr_val);
|
|
|
|
// }
|
|
|
|
// }
|
2015-11-21 01:31:09 -06:00
|
|
|
|
2016-02-18 19:06:22 -06:00
|
|
|
mir::Terminator::Drop { target, .. } => {
|
|
|
|
// TODO: Handle destructors and dynamic drop.
|
|
|
|
block = target;
|
|
|
|
}
|
|
|
|
|
2016-01-07 16:08:53 -06:00
|
|
|
mir::Terminator::Resume => unimplemented!(),
|
2016-02-27 19:20:25 -06:00
|
|
|
_ => unimplemented!(),
|
2015-11-12 15:50:58 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2016-02-27 19:20:25 -06:00
|
|
|
// self.pop_stack_frame();
|
2016-02-28 01:07:03 -06:00
|
|
|
|
|
|
|
Ok(())
|
2015-11-14 01:19:07 -06:00
|
|
|
}
|
|
|
|
|
2016-02-28 01:07:03 -06:00
|
|
|
fn lvalue_to_ptr(&self, lvalue: &mir::Lvalue) -> EvalResult<Pointer> {
|
|
|
|
let ptr = match *lvalue {
|
2016-03-04 23:17:31 -06:00
|
|
|
mir::Lvalue::ReturnPointer =>
|
|
|
|
self.return_ptr.clone().expect("fn has no return pointer"),
|
2015-11-14 01:19:07 -06:00
|
|
|
_ => unimplemented!(),
|
2016-02-28 01:07:03 -06:00
|
|
|
};
|
|
|
|
|
|
|
|
Ok(ptr)
|
2016-02-27 19:20:25 -06:00
|
|
|
|
|
|
|
// let frame = self.call_stack.last().expect("missing call frame");
|
|
|
|
|
|
|
|
// match *lvalue {
|
|
|
|
// mir::Lvalue::ReturnPointer =>
|
|
|
|
// frame.return_ptr.expect("ReturnPointer used in a function with no return value"),
|
|
|
|
// mir::Lvalue::Arg(i) => Pointer::Stack(frame.arg_offset(i as usize)),
|
|
|
|
// mir::Lvalue::Var(i) => Pointer::Stack(frame.var_offset(i as usize)),
|
|
|
|
// mir::Lvalue::Temp(i) => Pointer::Stack(frame.temp_offset(i as usize)),
|
|
|
|
|
|
|
|
// mir::Lvalue::Projection(ref proj) => {
|
|
|
|
// let base_ptr = self.lvalue_to_ptr(&proj.base);
|
|
|
|
|
|
|
|
// match proj.elem {
|
|
|
|
// mir::ProjectionElem::Field(field, _) => {
|
|
|
|
// base_ptr.offset(field.index())
|
|
|
|
// }
|
|
|
|
|
|
|
|
// mir::ProjectionElem::Downcast(_, variant) => {
|
|
|
|
// let adt_val = self.read_pointer(base_ptr);
|
|
|
|
// if let Value::Adt { variant: actual_variant, data_ptr } = adt_val {
|
|
|
|
// debug_assert_eq!(variant, actual_variant);
|
|
|
|
// data_ptr
|
|
|
|
// } else {
|
|
|
|
// panic!("Downcast attempted on non-ADT: {:?}", adt_val)
|
|
|
|
// }
|
|
|
|
// }
|
|
|
|
|
|
|
|
// mir::ProjectionElem::Deref => {
|
|
|
|
// let ptr_val = self.read_pointer(base_ptr);
|
|
|
|
// if let Value::Pointer(ptr) = ptr_val {
|
|
|
|
// ptr
|
|
|
|
// } else {
|
|
|
|
// panic!("Deref attempted on non-pointer: {:?}", ptr_val)
|
|
|
|
// }
|
|
|
|
// }
|
|
|
|
|
|
|
|
// mir::ProjectionElem::Index(ref _operand) => unimplemented!(),
|
|
|
|
// mir::ProjectionElem::ConstantIndex { .. } => unimplemented!(),
|
|
|
|
// }
|
|
|
|
// }
|
|
|
|
|
|
|
|
// _ => unimplemented!(),
|
|
|
|
// }
|
2015-11-12 15:50:58 -06:00
|
|
|
}
|
|
|
|
|
2016-03-04 23:17:31 -06:00
|
|
|
fn eval_binary_op(&mut self, bin_op: mir::BinOp, left: Pointer, right: Pointer, dest: &Pointer) {
|
|
|
|
match (left.repr, right.repr, &dest.repr) {
|
|
|
|
(Repr::Int, Repr::Int, &Repr::Int) => {
|
2016-03-04 23:44:49 -06:00
|
|
|
let l = byteorder::NativeEndian::read_i64(&self.memory.get(left.alloc_id).unwrap().bytes);
|
|
|
|
let r = byteorder::NativeEndian::read_i64(&self.memory.get(right.alloc_id).unwrap().bytes);
|
2016-02-27 19:20:25 -06:00
|
|
|
let n = match bin_op {
|
|
|
|
mir::BinOp::Add => l + r,
|
|
|
|
mir::BinOp::Sub => l - r,
|
|
|
|
mir::BinOp::Mul => l * r,
|
|
|
|
mir::BinOp::Div => l / r,
|
|
|
|
mir::BinOp::Rem => l % r,
|
|
|
|
mir::BinOp::BitXor => l ^ r,
|
|
|
|
mir::BinOp::BitAnd => l & r,
|
|
|
|
mir::BinOp::BitOr => l | r,
|
|
|
|
mir::BinOp::Shl => l << r,
|
|
|
|
mir::BinOp::Shr => l >> r,
|
|
|
|
_ => unimplemented!(),
|
|
|
|
// mir::BinOp::Eq => Value::Bool(l == r),
|
|
|
|
// mir::BinOp::Lt => Value::Bool(l < r),
|
|
|
|
// mir::BinOp::Le => Value::Bool(l <= r),
|
|
|
|
// mir::BinOp::Ne => Value::Bool(l != r),
|
|
|
|
// mir::BinOp::Ge => Value::Bool(l >= r),
|
|
|
|
// mir::BinOp::Gt => Value::Bool(l > r),
|
|
|
|
};
|
2016-03-04 23:44:49 -06:00
|
|
|
byteorder::NativeEndian::write_i64(&mut self.memory.get_mut(dest.alloc_id).unwrap().bytes, n);
|
2015-11-20 15:54:02 -06:00
|
|
|
}
|
2016-03-04 23:17:31 -06:00
|
|
|
(ref l, ref r, ref o) =>
|
|
|
|
panic!("unhandled binary operation: {:?}({:?}, {:?}) into {:?}", bin_op, l, r, o),
|
2015-11-20 15:54:02 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2016-03-04 23:17:31 -06:00
|
|
|
fn eval_rvalue_into(&mut self, rvalue: &mir::Rvalue, dest: &Pointer) -> EvalResult<()> {
|
2015-11-12 16:13:35 -06:00
|
|
|
match *rvalue {
|
2016-02-27 19:20:25 -06:00
|
|
|
mir::Rvalue::Use(ref operand) => {
|
2016-03-04 23:17:31 -06:00
|
|
|
let src = try!(self.operand_to_ptr(operand));
|
|
|
|
try!(self.memory.copy(&src, dest, src.repr.size()));
|
2016-02-27 19:20:25 -06:00
|
|
|
}
|
2015-11-20 15:54:02 -06:00
|
|
|
|
|
|
|
mir::Rvalue::BinaryOp(bin_op, ref left, ref right) => {
|
2016-02-28 01:07:03 -06:00
|
|
|
let left_ptr = try!(self.operand_to_ptr(left));
|
|
|
|
let right_ptr = try!(self.operand_to_ptr(right));
|
2016-03-04 23:17:31 -06:00
|
|
|
self.eval_binary_op(bin_op, left_ptr, right_ptr, dest);
|
2015-11-12 17:24:43 -06:00
|
|
|
}
|
|
|
|
|
2015-11-20 15:54:02 -06:00
|
|
|
mir::Rvalue::UnaryOp(un_op, ref operand) => {
|
2016-02-28 01:07:03 -06:00
|
|
|
let ptr = try!(self.operand_to_ptr(operand));
|
2016-03-04 23:44:49 -06:00
|
|
|
let m = byteorder::NativeEndian::read_i64(&self.memory.get(ptr.alloc_id).unwrap().bytes);
|
2016-02-28 00:49:27 -06:00
|
|
|
let n = match (un_op, ptr.repr) {
|
|
|
|
(mir::UnOp::Not, Repr::Int) => !m,
|
|
|
|
(mir::UnOp::Neg, Repr::Int) => -m,
|
2016-03-04 23:17:31 -06:00
|
|
|
(_, ref p) => panic!("unhandled binary operation: {:?}({:?})", un_op, p),
|
2016-02-28 00:49:27 -06:00
|
|
|
};
|
2016-03-04 23:44:49 -06:00
|
|
|
byteorder::NativeEndian::write_i64(&mut self.memory.get_mut(dest.alloc_id).unwrap().bytes, n);
|
2016-03-04 23:17:31 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
mir::Rvalue::Aggregate(mir::AggregateKind::Tuple, ref operands) => {
|
|
|
|
match dest.repr {
|
|
|
|
Repr::Aggregate { ref fields, .. } => {
|
|
|
|
for (field, operand) in fields.iter().zip(operands) {
|
|
|
|
let src = try!(self.operand_to_ptr(operand));
|
|
|
|
try!(self.memory.copy(&src, &dest.offset(field.offset), src.repr.size()));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
_ => panic!("attempted to write tuple rvalue '{:?}' into non-aggregate pointer '{:?}'",
|
|
|
|
rvalue, dest)
|
|
|
|
}
|
2015-11-12 15:50:58 -06:00
|
|
|
}
|
2015-11-12 17:24:43 -06:00
|
|
|
|
2016-02-27 19:20:25 -06:00
|
|
|
// mir::Rvalue::Ref(_region, _kind, ref lvalue) => {
|
|
|
|
// Value::Pointer(self.lvalue_to_ptr(lvalue))
|
|
|
|
// }
|
2015-12-28 22:24:05 -06:00
|
|
|
|
2016-02-27 19:20:25 -06:00
|
|
|
// mir::Rvalue::Aggregate(mir::AggregateKind::Adt(ref adt_def, variant, _substs),
|
|
|
|
// ref operands) => {
|
|
|
|
// let max_fields = adt_def.variants
|
|
|
|
// .iter()
|
|
|
|
// .map(|v| v.fields.len())
|
|
|
|
// .max()
|
|
|
|
// .unwrap_or(0);
|
2015-11-21 01:07:32 -06:00
|
|
|
|
2016-02-27 19:20:25 -06:00
|
|
|
// let ptr = self.allocate_aggregate(max_fields);
|
2015-11-20 15:34:28 -06:00
|
|
|
|
2016-02-27 19:20:25 -06:00
|
|
|
// for (i, operand) in operands.iter().enumerate() {
|
|
|
|
// let val = self.operand_to_ptr(operand);
|
|
|
|
// self.write_pointer(ptr.offset(i), val);
|
|
|
|
// }
|
2015-11-21 01:07:32 -06:00
|
|
|
|
2016-02-27 19:20:25 -06:00
|
|
|
// Value::Adt { variant: variant, data_ptr: ptr }
|
|
|
|
// }
|
2015-11-20 15:34:28 -06:00
|
|
|
|
2015-12-18 22:22:34 -06:00
|
|
|
ref r => panic!("can't handle rvalue: {:?}", r),
|
2015-11-12 15:50:58 -06:00
|
|
|
}
|
2016-02-28 01:07:03 -06:00
|
|
|
|
|
|
|
Ok(())
|
2015-11-12 15:50:58 -06:00
|
|
|
}
|
|
|
|
|
2016-02-28 01:07:03 -06:00
|
|
|
fn operand_to_ptr(&mut self, op: &mir::Operand) -> EvalResult<Pointer> {
|
2015-11-12 15:50:58 -06:00
|
|
|
match *op {
|
2016-02-27 19:20:25 -06:00
|
|
|
mir::Operand::Consume(ref lvalue) => self.lvalue_to_ptr(lvalue),
|
2015-11-14 01:19:07 -06:00
|
|
|
|
2015-11-20 15:54:02 -06:00
|
|
|
mir::Operand::Constant(ref constant) => {
|
2015-11-12 15:50:58 -06:00
|
|
|
match constant.literal {
|
2016-02-28 01:07:03 -06:00
|
|
|
mir::Literal::Value { ref value } => Ok(self.const_to_ptr(value)),
|
2015-11-19 07:07:47 -06:00
|
|
|
|
2015-12-18 22:22:34 -06:00
|
|
|
mir::Literal::Item { def_id, kind, .. } => match kind {
|
2016-02-27 19:20:25 -06:00
|
|
|
// mir::ItemKind::Function | mir::ItemKind::Method => Value::Func(def_id),
|
2015-12-18 22:22:34 -06:00
|
|
|
_ => panic!("can't handle item literal: {:?}", constant.literal),
|
|
|
|
},
|
2015-11-12 15:50:58 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2015-11-12 17:44:29 -06:00
|
|
|
|
2016-02-27 22:10:10 -06:00
|
|
|
fn const_to_ptr(&mut self, const_val: &const_eval::ConstVal) -> Pointer {
|
2015-11-12 17:44:29 -06:00
|
|
|
match *const_val {
|
2015-11-20 15:54:02 -06:00
|
|
|
const_eval::ConstVal::Float(_f) => unimplemented!(),
|
2016-02-27 19:20:25 -06:00
|
|
|
const_eval::ConstVal::Int(i) => Pointer {
|
|
|
|
alloc_id: self.memory.allocate_int(i),
|
|
|
|
offset: 0,
|
|
|
|
repr: Repr::Int,
|
|
|
|
},
|
2015-11-20 15:54:02 -06:00
|
|
|
const_eval::ConstVal::Uint(_u) => unimplemented!(),
|
|
|
|
const_eval::ConstVal::Str(ref _s) => unimplemented!(),
|
|
|
|
const_eval::ConstVal::ByteStr(ref _bs) => unimplemented!(),
|
2016-02-27 19:20:25 -06:00
|
|
|
const_eval::ConstVal::Bool(b) => unimplemented!(),
|
2015-11-20 15:54:02 -06:00
|
|
|
const_eval::ConstVal::Struct(_node_id) => unimplemented!(),
|
|
|
|
const_eval::ConstVal::Tuple(_node_id) => unimplemented!(),
|
|
|
|
const_eval::ConstVal::Function(_def_id) => unimplemented!(),
|
2015-12-04 13:09:14 -06:00
|
|
|
const_eval::ConstVal::Array(_, _) => unimplemented!(),
|
|
|
|
const_eval::ConstVal::Repeat(_, _) => unimplemented!(),
|
2015-11-12 17:44:29 -06:00
|
|
|
}
|
|
|
|
}
|
2015-11-12 15:50:58 -06:00
|
|
|
}
|
|
|
|
|
2016-03-04 23:17:31 -06:00
|
|
|
pub fn interpret_start_points<'tcx>(tcx: &TyCtxt<'tcx>, mir_map: &MirMap<'tcx>) {
|
2016-02-18 19:06:22 -06:00
|
|
|
for (&id, mir) in &mir_map.map {
|
2015-11-12 15:50:58 -06:00
|
|
|
for attr in tcx.map.attrs(id) {
|
|
|
|
if attr.check_name("miri_run") {
|
2015-11-12 17:11:41 -06:00
|
|
|
let item = tcx.map.expect_item(id);
|
|
|
|
|
2015-11-12 15:50:58 -06:00
|
|
|
println!("Interpreting: {}", item.name);
|
2015-11-20 20:49:25 -06:00
|
|
|
|
2016-03-04 23:17:31 -06:00
|
|
|
let mut miri = Interpreter::new(tcx, mir_map);
|
2016-02-27 19:20:25 -06:00
|
|
|
let return_ptr = match mir.return_ty {
|
2016-03-04 23:17:31 -06:00
|
|
|
ty::FnConverging(ty) => Some(miri.memory.allocate(Repr::from_ty(ty))),
|
|
|
|
ty::FnDiverging => None,
|
2016-02-27 19:20:25 -06:00
|
|
|
};
|
2016-03-04 23:17:31 -06:00
|
|
|
miri.call(mir, &[], return_ptr.clone()).unwrap();
|
2015-11-12 17:11:41 -06:00
|
|
|
|
2016-03-04 23:17:31 -06:00
|
|
|
if let Some(ret) = return_ptr {
|
2016-03-04 23:44:49 -06:00
|
|
|
println!("Returned: {:?}\n", miri.memory.get(ret.alloc_id).unwrap());
|
2015-11-12 17:11:41 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fn check_expected(actual: &str, attr: &Attribute) -> bool {
|
|
|
|
if let Some(meta_items) = attr.meta_item_list() {
|
|
|
|
for meta_item in meta_items {
|
|
|
|
if meta_item.check_name("expected") {
|
|
|
|
let expected = meta_item.value_str().unwrap();
|
|
|
|
|
|
|
|
if actual == &expected[..] {
|
|
|
|
println!("Test passed!\n");
|
|
|
|
} else {
|
|
|
|
println!("Actual value:\t{}\nExpected value:\t{}\n", actual, expected);
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
2015-11-12 15:50:58 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2015-11-12 17:11:41 -06:00
|
|
|
|
|
|
|
false
|
2015-11-12 15:50:58 -06:00
|
|
|
}
|