1 use rustc::middle::const_val;
2 use rustc::hir::def_id::DefId;
3 use rustc::mir::mir_map::MirMap;
4 use rustc::mir::repr as mir;
5 use rustc::traits::{self, ProjectionMode};
6 use rustc::ty::fold::TypeFoldable;
7 use rustc::ty::layout::{self, Layout, Size};
8 use rustc::ty::subst::{self, Subst, Substs};
9 use rustc::ty::{self, Ty, TyCtxt};
10 use rustc::util::nodemap::DefIdMap;
11 use std::cell::RefCell;
12 use std::ops::{Deref, DerefMut};
17 use syntax::codemap::{self, DUMMY_SP};
19 use error::{EvalError, EvalResult};
20 use memory::{Memory, Pointer};
21 use primval::{self, PrimVal};
23 struct GlobalEvalContext<'a, 'tcx: 'a> {
24 /// The results of the type checker, from rustc.
25 tcx: TyCtxt<'a, 'tcx, 'tcx>,
27 /// A mapping from NodeIds to Mir, from rustc. Only contains MIR for crate-local items.
28 mir_map: &'a MirMap<'tcx>,
30 /// A local cache from DefIds to Mir for non-crate-local items.
31 mir_cache: RefCell<DefIdMap<Rc<mir::Mir<'tcx>>>>,
33 /// The virtual memory system.
36 /// Another stack containing the type substitutions for the current function invocation. It
37 /// exists separately from `stack` because it must contain the `Substs` for a function while
38 /// *creating* the `Frame` for that same function.
39 substs_stack: Vec<&'tcx Substs<'tcx>>,
41 // TODO(solson): Merge with `substs_stack`. Also try restructuring `Frame` to accomodate.
42 /// A stack of the things necessary to print good strack traces:
43 /// * Function DefIds and Substs to print proper substituted function names.
44 /// * Spans pointing to specific function calls in the source.
45 name_stack: Vec<(DefId, &'tcx Substs<'tcx>, codemap::Span)>,
48 struct FnEvalContext<'a, 'b: 'a + 'mir, 'mir, 'tcx: 'b> {
49 gecx: &'a mut GlobalEvalContext<'b, 'tcx>,
51 /// The virtual call stack.
52 stack: Vec<Frame<'mir, 'tcx>>,
55 impl<'a, 'b, 'mir, 'tcx> Deref for FnEvalContext<'a, 'b, 'mir, 'tcx> {
56 type Target = GlobalEvalContext<'b, 'tcx>;
57 fn deref(&self) -> &Self::Target {
62 impl<'a, 'b, 'mir, 'tcx> DerefMut for FnEvalContext<'a, 'b, 'mir, 'tcx> {
63 fn deref_mut(&mut self) -> &mut Self::Target {
69 struct Frame<'a, 'tcx: 'a> {
70 /// The MIR for the function called on this frame.
71 mir: CachedMir<'a, 'tcx>,
73 /// The block this frame will execute when a function call returns back to this frame.
74 next_block: mir::BasicBlock,
76 /// A pointer for writing the return value of the current call if it's not a diverging call.
77 return_ptr: Option<Pointer>,
79 /// The list of locals for the current function, stored in order as
80 /// `[arguments..., variables..., temporaries...]`. The variables begin at `self.var_offset`
81 /// and the temporaries at `self.temp_offset`.
84 /// The offset of the first variable in `self.locals`.
87 /// The offset of the first temporary in `self.locals`.
91 #[derive(Copy, Clone, Debug, Eq, PartialEq)]
97 #[derive(Copy, Clone, Debug, Eq, PartialEq)]
101 // TODO(solson): Vtable(memory::AllocId),
102 DowncastVariant(usize),
106 enum CachedMir<'mir, 'tcx: 'mir> {
107 Ref(&'mir mir::Mir<'tcx>),
108 Owned(Rc<mir::Mir<'tcx>>)
111 /// Represents the action to be taken in the main loop as a result of executing a terminator.
112 enum TerminatorTarget {
113 /// Make a local jump to the given block.
114 Block(mir::BasicBlock),
116 /// Start executing from the new current frame. (For function calls.)
119 /// Stop executing the current frame and resume the previous frame.
123 impl<'a, 'tcx> GlobalEvalContext<'a, 'tcx> {
124 fn new(tcx: TyCtxt<'a, 'tcx, 'tcx>, mir_map: &'a MirMap<'tcx>) -> Self {
128 mir_cache: RefCell::new(DefIdMap()),
129 memory: Memory::new(tcx.sess
133 .expect("Session::target::uint_type was usize")/8),
134 substs_stack: Vec::new(),
135 name_stack: Vec::new(),
139 fn call(&mut self, mir: &mir::Mir<'tcx>) -> EvalResult<Option<Pointer>> {
140 let mut nested_fecx = FnEvalContext::new(self);
142 let return_ptr = match mir.return_ty {
143 ty::FnConverging(ty) => {
144 let size = nested_fecx.type_size(ty);
145 Some(nested_fecx.memory.allocate(size))
147 ty::FnDiverging => None,
150 let substs = nested_fecx.substs();
151 nested_fecx.push_stack_frame(CachedMir::Ref(mir), substs, return_ptr);
157 impl<'a, 'b, 'mir, 'tcx> FnEvalContext<'a, 'b, 'mir, 'tcx> {
158 fn new(gecx: &'a mut GlobalEvalContext<'b, 'tcx>) -> Self {
165 fn maybe_report<T>(&self, span: codemap::Span, r: EvalResult<T>) -> EvalResult<T> {
166 if let Err(ref e) = r {
167 let mut err = self.tcx.sess.struct_span_err(span, &e.to_string());
168 for &(def_id, substs, span) in self.name_stack.iter().rev() {
169 // FIXME(solson): Find a way to do this without this Display impl hack.
170 use rustc::util::ppaux;
172 struct Instance<'tcx>(DefId, &'tcx Substs<'tcx>);
173 impl<'tcx> fmt::Display for Instance<'tcx> {
174 fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
175 ppaux::parameterized(f, self.1, self.0, ppaux::Ns::Value, &[],
176 |tcx| tcx.lookup_item_type(self.0).generics)
179 err.span_note(span, &format!("inside call to {}", Instance(def_id, substs)));
186 fn run(&mut self) -> EvalResult<()> {
187 'outer: while !self.stack.is_empty() {
188 let mut current_block = self.frame().next_block;
189 let current_mir = self.mir();
192 trace!("// {:?}", current_block);
193 let block_data = current_mir.basic_block_data(current_block);
195 for stmt in &block_data.statements {
196 trace!("{:?}", stmt);
197 let mir::StatementKind::Assign(ref lvalue, ref rvalue) = stmt.kind;
198 let result = self.eval_assignment(lvalue, rvalue);
199 self.maybe_report(stmt.span, result)?;
202 let terminator = block_data.terminator();
203 trace!("{:?}", terminator.kind);
205 let result = self.eval_terminator(terminator);
206 match self.maybe_report(terminator.span, result)? {
207 TerminatorTarget::Block(block) => current_block = block,
208 TerminatorTarget::Return => {
209 self.pop_stack_frame();
210 self.name_stack.pop();
213 TerminatorTarget::Call => continue 'outer,
221 fn push_stack_frame(&mut self, mir: CachedMir<'mir, 'tcx>, substs: &'tcx Substs<'tcx>,
222 return_ptr: Option<Pointer>)
224 self.substs_stack.push(substs);
226 let arg_tys = mir.arg_decls.iter().map(|a| a.ty);
227 let var_tys = mir.var_decls.iter().map(|v| v.ty);
228 let temp_tys = mir.temp_decls.iter().map(|t| t.ty);
230 let locals: Vec<Pointer> = arg_tys.chain(var_tys).chain(temp_tys).map(|ty| {
231 let size = self.type_size(ty);
232 self.memory.allocate(size)
235 let num_args = mir.arg_decls.len();
236 let num_vars = mir.var_decls.len();
238 ::log_settings::settings().indentation += 1;
240 self.stack.push(Frame {
242 next_block: mir::START_BLOCK,
243 return_ptr: return_ptr,
245 var_offset: num_args,
246 temp_offset: num_args + num_vars,
250 fn pop_stack_frame(&mut self) {
251 ::log_settings::settings().indentation -= 1;
252 let _frame = self.stack.pop().expect("tried to pop a stack frame, but there were none");
253 // TODO(solson): Deallocate local variables.
254 self.substs_stack.pop();
257 fn eval_terminator(&mut self, terminator: &mir::Terminator<'tcx>)
258 -> EvalResult<TerminatorTarget> {
259 use rustc::mir::repr::TerminatorKind::*;
260 let target = match terminator.kind {
261 Return => TerminatorTarget::Return,
263 Goto { target } => TerminatorTarget::Block(target),
265 If { ref cond, targets: (then_target, else_target) } => {
266 let cond_ptr = self.eval_operand(cond)?;
267 let cond_val = self.memory.read_bool(cond_ptr)?;
268 TerminatorTarget::Block(if cond_val { then_target } else { else_target })
271 SwitchInt { ref discr, ref values, ref targets, .. } => {
272 let discr_ptr = self.eval_lvalue(discr)?.to_ptr();
273 let discr_size = self
274 .type_layout(self.lvalue_ty(discr))
275 .size(&self.tcx.data_layout)
277 let discr_val = self.memory.read_uint(discr_ptr, discr_size)?;
279 // Branch to the `otherwise` case by default, if no match is found.
280 let mut target_block = targets[targets.len() - 1];
282 for (index, val_const) in values.iter().enumerate() {
283 let ptr = self.const_to_ptr(val_const)?;
284 let val = self.memory.read_uint(ptr, discr_size)?;
285 if discr_val == val {
286 target_block = targets[index];
291 TerminatorTarget::Block(target_block)
294 Switch { ref discr, ref targets, adt_def } => {
295 let adt_ptr = self.eval_lvalue(discr)?.to_ptr();
296 let adt_ty = self.lvalue_ty(discr);
297 let discr_val = self.read_discriminant_value(adt_ptr, adt_ty)?;
298 let matching = adt_def.variants.iter()
299 .position(|v| discr_val == v.disr_val.to_u64_unchecked());
302 Some(i) => TerminatorTarget::Block(targets[i]),
303 None => return Err(EvalError::InvalidDiscriminant),
307 Call { ref func, ref args, ref destination, .. } => {
308 let mut return_ptr = None;
309 if let Some((ref lv, target)) = *destination {
310 self.frame_mut().next_block = target;
311 return_ptr = Some(self.eval_lvalue(lv)?.to_ptr());
314 let func_ty = self.operand_ty(func);
316 ty::TyFnDef(def_id, substs, fn_ty) => {
317 use syntax::abi::Abi;
319 Abi::RustIntrinsic => {
320 let name = self.tcx.item_name(def_id).as_str();
321 match fn_ty.sig.0.output {
322 ty::FnConverging(ty) => {
323 let size = self.type_size(ty);
324 let ret = return_ptr.unwrap();
325 self.call_intrinsic(&name, substs, args, ret, size)?
327 ty::FnDiverging => unimplemented!(),
332 match fn_ty.sig.0.output {
333 ty::FnConverging(ty) => {
334 let size = self.type_size(ty);
335 self.call_c_abi(def_id, args, return_ptr.unwrap(), size)?
337 ty::FnDiverging => unimplemented!(),
341 Abi::Rust | Abi::RustCall => {
342 // TODO(solson): Adjust the first argument when calling a Fn or
343 // FnMut closure via FnOnce::call_once.
345 // Only trait methods can have a Self parameter.
346 let (resolved_def_id, resolved_substs) = if substs.self_ty().is_some() {
347 self.trait_method(def_id, substs)
352 let mut arg_srcs = Vec::new();
354 let src = self.eval_operand(arg)?;
355 let src_ty = self.operand_ty(arg);
356 arg_srcs.push((src, src_ty));
359 if fn_ty.abi == Abi::RustCall && !args.is_empty() {
361 let last_arg = args.last().unwrap();
362 let last = self.eval_operand(last_arg)?;
363 let last_ty = self.operand_ty(last_arg);
364 let last_layout = self.type_layout(last_ty);
365 match (&last_ty.sty, last_layout) {
366 (&ty::TyTuple(fields),
367 &Layout::Univariant { ref variant, .. }) => {
368 let offsets = iter::once(0)
369 .chain(variant.offset_after_field.iter()
370 .map(|s| s.bytes()));
371 for (offset, ty) in offsets.zip(fields) {
372 let src = last.offset(offset as isize);
373 arg_srcs.push((src, ty));
376 ty => panic!("expected tuple as last argument in function with 'rust-call' ABI, got {:?}", ty),
380 let mir = self.load_mir(resolved_def_id);
381 self.name_stack.push((def_id, substs, terminator.span));
382 self.push_stack_frame(mir, resolved_substs, return_ptr);
384 for (i, (src, src_ty)) in arg_srcs.into_iter().enumerate() {
385 let dest = self.frame().locals[i];
386 self.move_(src, dest, src_ty)?;
389 TerminatorTarget::Call
392 abi => return Err(EvalError::Unimplemented(format!("can't handle function with {:?} ABI", abi))),
396 _ => return Err(EvalError::Unimplemented(format!("can't handle callee of type {:?}", func_ty))),
400 Drop { ref value, target, .. } => {
401 let ptr = self.eval_lvalue(value)?.to_ptr();
402 let ty = self.lvalue_ty(value);
404 TerminatorTarget::Block(target)
407 Resume => unimplemented!(),
413 fn drop(&mut self, ptr: Pointer, ty: Ty<'tcx>) -> EvalResult<()> {
414 if !self.type_needs_drop(ty) {
415 debug!("no need to drop {:?}", ty);
418 trace!("-need to drop {:?}", ty);
420 // TODO(solson): Call user-defined Drop::drop impls.
423 ty::TyBox(contents_ty) => {
424 match self.memory.read_ptr(ptr) {
425 Ok(contents_ptr) => {
426 self.drop(contents_ptr, contents_ty)?;
427 trace!("-deallocating box");
428 self.memory.deallocate(contents_ptr)?;
430 Err(EvalError::ReadBytesAsPointer) => {
431 let size = self.memory.pointer_size;
432 let possible_drop_fill = self.memory.read_bytes(ptr, size)?;
433 if possible_drop_fill.iter().all(|&b| b == mem::POST_DROP_U8) {
436 return Err(EvalError::ReadBytesAsPointer);
439 Err(e) => return Err(e),
443 // TODO(solson): Implement drop for other relevant types (e.g. aggregates).
448 // FIXME(solson): Trait objects (with no static size) probably get filled, too.
449 let size = self.type_size(ty);
450 self.memory.drop_fill(ptr, size)?;
455 fn read_discriminant_value(&self, adt_ptr: Pointer, adt_ty: Ty<'tcx>) -> EvalResult<u64> {
456 use rustc::ty::layout::Layout::*;
457 let adt_layout = self.type_layout(adt_ty);
459 let discr_val = match *adt_layout {
460 General { discr, .. } | CEnum { discr, .. } => {
461 let discr_size = discr.size().bytes();
462 self.memory.read_uint(adt_ptr, discr_size as usize)?
465 RawNullablePointer { nndiscr, .. } => {
466 self.read_nonnull_discriminant_value(adt_ptr, nndiscr)?
469 StructWrappedNullablePointer { nndiscr, ref discrfield, .. } => {
470 let offset = self.nonnull_offset(adt_ty, nndiscr, discrfield)?;
471 let nonnull = adt_ptr.offset(offset.bytes() as isize);
472 self.read_nonnull_discriminant_value(nonnull, nndiscr)?
475 // The discriminant_value intrinsic returns 0 for non-sum types.
476 Array { .. } | FatPointer { .. } | Scalar { .. } | Univariant { .. } |
483 fn read_nonnull_discriminant_value(&self, ptr: Pointer, nndiscr: u64) -> EvalResult<u64> {
484 let not_null = match self.memory.read_usize(ptr) {
486 Ok(_) | Err(EvalError::ReadPointerAsBytes) => true,
487 Err(e) => return Err(e),
489 assert!(nndiscr == 0 || nndiscr == 1);
490 Ok(if not_null { nndiscr } else { 1 - nndiscr })
496 substs: &'tcx Substs<'tcx>,
497 args: &[mir::Operand<'tcx>],
500 ) -> EvalResult<TerminatorTarget> {
501 let args_res: EvalResult<Vec<Pointer>> = args.iter()
502 .map(|arg| self.eval_operand(arg))
504 let args = args_res?;
507 // FIXME(solson): Handle different integer types correctly.
508 "add_with_overflow" => {
509 let ty = *substs.types.get(subst::FnSpace, 0);
510 let size = self.type_size(ty);
511 let left = self.memory.read_int(args[0], size)?;
512 let right = self.memory.read_int(args[1], size)?;
513 let (n, overflowed) = unsafe {
514 ::std::intrinsics::add_with_overflow::<i64>(left, right)
516 self.memory.write_int(dest, n, size)?;
517 self.memory.write_bool(dest.offset(size as isize), overflowed)?;
522 "copy_nonoverlapping" => {
523 let elem_ty = *substs.types.get(subst::FnSpace, 0);
524 let elem_size = self.type_size(elem_ty);
525 let src = self.memory.read_ptr(args[0])?;
526 let dest = self.memory.read_ptr(args[1])?;
527 let count = self.memory.read_isize(args[2])?;
528 self.memory.copy(src, dest, count as usize * elem_size)?;
531 "discriminant_value" => {
532 let ty = *substs.types.get(subst::FnSpace, 0);
533 let adt_ptr = self.memory.read_ptr(args[0])?;
534 let discr_val = self.read_discriminant_value(adt_ptr, ty)?;
535 self.memory.write_uint(dest, discr_val, dest_size)?;
539 let arg_ty = *substs.types.get(subst::FnSpace, 0);
540 let arg_size = self.type_size(arg_ty);
541 self.memory.drop_fill(args[0], arg_size)?;
544 "init" => self.memory.write_repeat(dest, 0, dest_size)?,
547 self.memory.write_int(dest, 1, dest_size)?;
551 let ty = *substs.types.get(subst::FnSpace, 0);
552 let ptr = self.memory.read_ptr(args[0])?;
553 self.move_(args[1], ptr, ty)?;
556 // FIXME(solson): Handle different integer types correctly.
557 "mul_with_overflow" => {
558 let ty = *substs.types.get(subst::FnSpace, 0);
559 let size = self.type_size(ty);
560 let left = self.memory.read_int(args[0], size)?;
561 let right = self.memory.read_int(args[1], size)?;
562 let (n, overflowed) = unsafe {
563 ::std::intrinsics::mul_with_overflow::<i64>(left, right)
565 self.memory.write_int(dest, n, size)?;
566 self.memory.write_bool(dest.offset(size as isize), overflowed)?;
570 let pointee_ty = *substs.types.get(subst::FnSpace, 0);
571 let pointee_size = self.type_size(pointee_ty) as isize;
572 let ptr_arg = args[0];
573 let offset = self.memory.read_isize(args[1])?;
575 match self.memory.read_ptr(ptr_arg) {
577 let result_ptr = ptr.offset(offset as isize * pointee_size);
578 self.memory.write_ptr(dest, result_ptr)?;
580 Err(EvalError::ReadBytesAsPointer) => {
581 let addr = self.memory.read_isize(ptr_arg)?;
582 let result_addr = addr + offset * pointee_size as i64;
583 self.memory.write_isize(dest, result_addr)?;
585 Err(e) => return Err(e),
589 // FIXME(solson): Handle different integer types correctly. Use primvals?
590 "overflowing_sub" => {
591 let ty = *substs.types.get(subst::FnSpace, 0);
592 let size = self.type_size(ty);
593 let left = self.memory.read_int(args[0], size)?;
594 let right = self.memory.read_int(args[1], size)?;
595 let n = left.wrapping_sub(right);
596 self.memory.write_int(dest, n, size)?;
600 let ty = *substs.types.get(subst::FnSpace, 0);
601 let size = self.type_size(ty) as u64;
602 self.memory.write_uint(dest, size, dest_size)?;
606 let ty = *substs.types.get(subst::FnSpace, 0);
607 if self.type_is_sized(ty) {
608 let size = self.type_size(ty) as u64;
609 self.memory.write_uint(dest, size, dest_size)?;
612 ty::TySlice(_) | ty::TyStr => {
613 let elem_ty = ty.sequence_element_type(self.tcx);
614 let elem_size = self.type_size(elem_ty) as u64;
615 let ptr_size = self.memory.pointer_size as isize;
616 let n = self.memory.read_usize(args[0].offset(ptr_size))?;
617 self.memory.write_uint(dest, n * elem_size, dest_size)?;
620 _ => return Err(EvalError::Unimplemented(format!("unimplemented: size_of_val::<{:?}>", ty))),
626 let ty = *substs.types.get(subst::FnSpace, 0);
627 self.move_(args[0], dest, ty)?;
629 "uninit" => self.memory.mark_definedness(dest, dest_size, false)?,
631 name => return Err(EvalError::Unimplemented(format!("unimplemented intrinsic: {}", name))),
634 // Since we pushed no stack frame, the main loop will act
635 // as if the call just completed and it's returning to the
637 Ok(TerminatorTarget::Call)
643 args: &[mir::Operand<'tcx>],
646 ) -> EvalResult<TerminatorTarget> {
647 let name = self.tcx.item_name(def_id);
648 let attrs = self.tcx.get_attrs(def_id);
649 let link_name = match attr::first_attr_value_str_by_name(&attrs, "link_name") {
650 Some(ln) => ln.clone(),
651 None => name.as_str(),
654 let args_res: EvalResult<Vec<Pointer>> = args.iter()
655 .map(|arg| self.eval_operand(arg))
657 let args = args_res?;
659 match &link_name[..] {
660 "__rust_allocate" => {
661 let size = self.memory.read_usize(args[0])?;
662 let ptr = self.memory.allocate(size as usize);
663 self.memory.write_ptr(dest, ptr)?;
666 "__rust_reallocate" => {
667 let ptr = self.memory.read_ptr(args[0])?;
668 let size = self.memory.read_usize(args[2])?;
669 self.memory.reallocate(ptr, size as usize)?;
670 self.memory.write_ptr(dest, ptr)?;
674 let left = self.memory.read_ptr(args[0])?;
675 let right = self.memory.read_ptr(args[1])?;
676 let n = self.memory.read_usize(args[2])? as usize;
679 let left_bytes = self.memory.read_bytes(left, n)?;
680 let right_bytes = self.memory.read_bytes(right, n)?;
682 use std::cmp::Ordering::*;
683 match left_bytes.cmp(right_bytes) {
690 self.memory.write_int(dest, result, dest_size)?;
693 _ => return Err(EvalError::Unimplemented(format!("can't call C ABI function: {}", link_name))),
696 // Since we pushed no stack frame, the main loop will act
697 // as if the call just completed and it's returning to the
699 Ok(TerminatorTarget::Call)
702 fn assign_fields<I: IntoIterator<Item = u64>>(
706 operands: &[mir::Operand<'tcx>],
707 ) -> EvalResult<()> {
708 for (offset, operand) in offsets.into_iter().zip(operands) {
709 let src = self.eval_operand(operand)?;
710 let src_ty = self.operand_ty(operand);
711 let field_dest = dest.offset(offset as isize);
712 self.move_(src, field_dest, src_ty)?;
717 fn eval_assignment(&mut self, lvalue: &mir::Lvalue<'tcx>, rvalue: &mir::Rvalue<'tcx>)
720 let dest = self.eval_lvalue(lvalue)?.to_ptr();
721 let dest_ty = self.lvalue_ty(lvalue);
722 let dest_layout = self.type_layout(dest_ty);
724 use rustc::mir::repr::Rvalue::*;
726 Use(ref operand) => {
727 let src = self.eval_operand(operand)?;
728 self.move_(src, dest, dest_ty)?;
731 BinaryOp(bin_op, ref left, ref right) => {
732 let left_ptr = self.eval_operand(left)?;
733 let left_ty = self.operand_ty(left);
734 let left_val = self.read_primval(left_ptr, left_ty)?;
736 let right_ptr = self.eval_operand(right)?;
737 let right_ty = self.operand_ty(right);
738 let right_val = self.read_primval(right_ptr, right_ty)?;
740 let val = primval::binary_op(bin_op, left_val, right_val)?;
741 self.memory.write_primval(dest, val)?;
744 UnaryOp(un_op, ref operand) => {
745 let ptr = self.eval_operand(operand)?;
746 let ty = self.operand_ty(operand);
747 let val = self.read_primval(ptr, ty)?;
748 self.memory.write_primval(dest, primval::unary_op(un_op, val)?)?;
751 Aggregate(ref kind, ref operands) => {
752 use rustc::ty::layout::Layout::*;
754 Univariant { ref variant, .. } => {
755 let offsets = iter::once(0)
756 .chain(variant.offset_after_field.iter().map(|s| s.bytes()));
757 self.assign_fields(dest, offsets, operands)?;
761 let elem_size = match dest_ty.sty {
762 ty::TyArray(elem_ty, _) => self.type_size(elem_ty) as u64,
763 _ => panic!("tried to assign {:?} to non-array type {:?}",
766 let offsets = (0..).map(|i| i * elem_size);
767 self.assign_fields(dest, offsets, operands)?;
770 General { discr, ref variants, .. } => {
771 if let mir::AggregateKind::Adt(adt_def, variant, _) = *kind {
772 let discr_val = adt_def.variants[variant].disr_val.to_u64_unchecked();
773 let discr_size = discr.size().bytes() as usize;
774 self.memory.write_uint(dest, discr_val, discr_size)?;
776 let offsets = variants[variant].offset_after_field.iter()
778 self.assign_fields(dest, offsets, operands)?;
780 panic!("tried to assign {:?} to Layout::General", kind);
784 RawNullablePointer { nndiscr, .. } => {
785 if let mir::AggregateKind::Adt(_, variant, _) = *kind {
786 if nndiscr == variant as u64 {
787 assert_eq!(operands.len(), 1);
788 let operand = &operands[0];
789 let src = self.eval_operand(operand)?;
790 let src_ty = self.operand_ty(operand);
791 self.move_(src, dest, src_ty)?;
793 assert_eq!(operands.len(), 0);
794 self.memory.write_isize(dest, 0)?;
797 panic!("tried to assign {:?} to Layout::RawNullablePointer", kind);
801 StructWrappedNullablePointer { nndiscr, ref nonnull, ref discrfield } => {
802 if let mir::AggregateKind::Adt(_, variant, _) = *kind {
803 if nndiscr == variant as u64 {
804 let offsets = iter::once(0)
805 .chain(nonnull.offset_after_field.iter().map(|s| s.bytes()));
806 try!(self.assign_fields(dest, offsets, operands));
808 assert_eq!(operands.len(), 0);
809 let offset = self.nonnull_offset(dest_ty, nndiscr, discrfield)?;
810 let dest = dest.offset(offset.bytes() as isize);
811 try!(self.memory.write_isize(dest, 0));
814 panic!("tried to assign {:?} to Layout::RawNullablePointer", kind);
818 CEnum { discr, signed, .. } => {
819 assert_eq!(operands.len(), 0);
820 if let mir::AggregateKind::Adt(adt_def, variant, _) = *kind {
821 let val = adt_def.variants[variant].disr_val.to_u64_unchecked();
822 let size = discr.size().bytes() as usize;
825 self.memory.write_int(dest, val as i64, size)?;
827 self.memory.write_uint(dest, val, size)?;
830 panic!("tried to assign {:?} to Layout::CEnum", kind);
834 _ => return Err(EvalError::Unimplemented(format!("can't handle destination layout {:?} when assigning {:?}", dest_layout, kind))),
838 Repeat(ref operand, _) => {
839 let (elem_size, length) = match dest_ty.sty {
840 ty::TyArray(elem_ty, n) => (self.type_size(elem_ty), n),
841 _ => panic!("tried to assign array-repeat to non-array type {:?}", dest_ty),
844 let src = self.eval_operand(operand)?;
846 let elem_dest = dest.offset((i * elem_size) as isize);
847 self.memory.copy(src, elem_dest, elem_size)?;
852 let src = self.eval_lvalue(lvalue)?;
853 let ty = self.lvalue_ty(lvalue);
854 let len = match ty.sty {
855 ty::TyArray(_, n) => n as u64,
856 ty::TySlice(_) => if let LvalueExtra::Length(n) = src.extra {
859 panic!("Rvalue::Len of a slice given non-slice pointer: {:?}", src);
861 _ => panic!("Rvalue::Len expected array or slice, got {:?}", ty),
863 self.memory.write_usize(dest, len)?;
866 Ref(_, _, ref lvalue) => {
867 let lv = self.eval_lvalue(lvalue)?;
868 self.memory.write_ptr(dest, lv.ptr)?;
870 LvalueExtra::None => {},
871 LvalueExtra::Length(len) => {
872 let len_ptr = dest.offset(self.memory.pointer_size as isize);
873 self.memory.write_usize(len_ptr, len)?;
875 LvalueExtra::DowncastVariant(..) =>
876 panic!("attempted to take a reference to an enum downcast lvalue"),
881 let size = self.type_size(ty);
882 let ptr = self.memory.allocate(size);
883 self.memory.write_ptr(dest, ptr)?;
886 Cast(kind, ref operand, dest_ty) => {
887 let src = self.eval_operand(operand)?;
888 let src_ty = self.operand_ty(operand);
890 use rustc::mir::repr::CastKind::*;
893 self.move_(src, dest, src_ty)?;
894 let src_pointee_ty = pointee_type(src_ty).unwrap();
895 let dest_pointee_ty = pointee_type(dest_ty).unwrap();
897 match (&src_pointee_ty.sty, &dest_pointee_ty.sty) {
898 (&ty::TyArray(_, length), &ty::TySlice(_)) => {
899 let len_ptr = dest.offset(self.memory.pointer_size as isize);
900 self.memory.write_usize(len_ptr, length as u64)?;
903 _ => return Err(EvalError::Unimplemented(format!("can't handle cast: {:?}", rvalue))),
908 // FIXME(solson): Wrong for almost everything.
909 let size = dest_layout.size(&self.tcx.data_layout).bytes() as usize;
910 self.memory.copy(src, dest, size)?;
913 _ => return Err(EvalError::Unimplemented(format!("can't handle cast: {:?}", rvalue))),
917 Slice { .. } => unimplemented!(),
918 InlineAsm { .. } => unimplemented!(),
924 fn nonnull_offset(&self, ty: Ty<'tcx>, nndiscr: u64, discrfield: &[u32]) -> EvalResult<Size> {
925 // Skip the constant 0 at the start meant for LLVM GEP.
926 let mut path = discrfield.iter().skip(1).map(|&i| i as usize);
928 // Handle the field index for the outer non-null variant.
929 let inner_ty = match ty.sty {
930 ty::TyEnum(adt_def, substs) => {
931 let variant = &adt_def.variants[nndiscr as usize];
932 let index = path.next().unwrap();
933 let field = &variant.fields[index];
934 field.ty(self.tcx, substs)
937 "non-enum for StructWrappedNullablePointer: {}",
942 self.field_path_offset(inner_ty, path)
945 fn field_path_offset<I: Iterator<Item = usize>>(&self, mut ty: Ty<'tcx>, path: I) -> EvalResult<Size> {
946 let mut offset = Size::from_bytes(0);
948 // Skip the initial 0 intended for LLVM GEP.
949 for field_index in path {
950 let field_offset = self.get_field_offset(ty, field_index)?;
951 ty = self.get_field_ty(ty, field_index)?;
952 offset = offset.checked_add(field_offset, &self.tcx.data_layout).unwrap();
958 fn get_field_ty(&self, ty: Ty<'tcx>, field_index: usize) -> EvalResult<Ty<'tcx>> {
960 ty::TyStruct(adt_def, substs) => {
961 Ok(adt_def.struct_variant().fields[field_index].ty(self.tcx, substs))
964 ty::TyRef(_, ty::TypeAndMut { ty, .. }) |
965 ty::TyRawPtr(ty::TypeAndMut { ty, .. }) |
967 assert_eq!(field_index, 0);
970 _ => Err(EvalError::Unimplemented(format!("can't handle type: {:?}", ty))),
974 fn get_field_offset(&self, ty: Ty<'tcx>, field_index: usize) -> EvalResult<Size> {
975 let layout = self.type_layout(ty);
977 use rustc::ty::layout::Layout::*;
979 Univariant { .. } => {
980 assert_eq!(field_index, 0);
981 Ok(Size::from_bytes(0))
983 FatPointer { .. } => {
984 let bytes = layout::FAT_PTR_ADDR * self.memory.pointer_size;
985 Ok(Size::from_bytes(bytes as u64))
987 _ => Err(EvalError::Unimplemented(format!("can't handle type: {:?}, with layout: {:?}", ty, layout))),
991 fn eval_operand(&mut self, op: &mir::Operand<'tcx>) -> EvalResult<Pointer> {
992 use rustc::mir::repr::Operand::*;
994 Consume(ref lvalue) => Ok(self.eval_lvalue(lvalue)?.to_ptr()),
995 Constant(mir::Constant { ref literal, .. }) => {
996 use rustc::mir::repr::Literal::*;
998 Value { ref value } => Ok(self.const_to_ptr(value)?),
999 Item { .. } => Err(EvalError::Unimplemented(format!("function pointers are unimplemented"))),
1000 Promoted { index } => {
1001 // TODO(solson): Mark constants and statics as read-only and cache their
1003 let current_mir = self.mir();
1004 let mir = ¤t_mir.promoted[index];
1005 self.gecx.call(mir).map(Option::unwrap)
1012 fn eval_lvalue(&mut self, lvalue: &mir::Lvalue<'tcx>) -> EvalResult<Lvalue> {
1013 use rustc::mir::repr::Lvalue::*;
1014 let ptr = match *lvalue {
1015 ReturnPointer => self.frame().return_ptr
1016 .expect("ReturnPointer used in a function with no return value"),
1017 Arg(i) => self.frame().locals[i as usize],
1018 Var(i) => self.frame().locals[self.frame().var_offset + i as usize],
1019 Temp(i) => self.frame().locals[self.frame().temp_offset + i as usize],
1022 // TODO(solson): Mark constants and statics as read-only and cache their values.
1023 let mir = self.load_mir(def_id);
1024 self.gecx.call(&mir)?.unwrap()
1027 Projection(ref proj) => {
1028 let base = self.eval_lvalue(&proj.base)?;
1029 let base_ty = self.lvalue_ty(&proj.base);
1030 let base_layout = self.type_layout(base_ty);
1032 use rustc::mir::repr::ProjectionElem::*;
1034 Field(field, _) => {
1035 use rustc::ty::layout::Layout::*;
1036 let variant = match *base_layout {
1037 Univariant { ref variant, .. } => variant,
1038 General { ref variants, .. } => {
1039 if let LvalueExtra::DowncastVariant(variant_idx) = base.extra {
1040 &variants[variant_idx]
1042 panic!("field access on enum had no variant index");
1045 RawNullablePointer { .. } => {
1046 assert_eq!(field.index(), 0);
1049 StructWrappedNullablePointer { ref nonnull, .. } => nonnull,
1050 _ => panic!("field access on non-product type: {:?}", base_layout),
1053 let offset = variant.field_offset(field.index()).bytes();
1054 base.ptr.offset(offset as isize)
1057 Downcast(_, variant) => {
1058 use rustc::ty::layout::Layout::*;
1059 match *base_layout {
1060 General { discr, .. } => {
1062 ptr: base.ptr.offset(discr.size().bytes() as isize),
1063 extra: LvalueExtra::DowncastVariant(variant),
1066 RawNullablePointer { .. } | StructWrappedNullablePointer { .. } => {
1069 _ => panic!("variant downcast on non-aggregate: {:?}", base_layout),
1074 let pointee_ty = pointee_type(base_ty).expect("Deref of non-pointer");
1075 let ptr = self.memory.read_ptr(base.ptr)?;
1076 let extra = match pointee_ty.sty {
1077 ty::TySlice(_) | ty::TyStr => {
1078 let len_ptr = base.ptr.offset(self.memory.pointer_size as isize);
1079 let len = self.memory.read_usize(len_ptr)?;
1080 LvalueExtra::Length(len)
1082 ty::TyTrait(_) => unimplemented!(),
1083 _ => LvalueExtra::None,
1085 return Ok(Lvalue { ptr: ptr, extra: extra });
1088 Index(ref operand) => {
1089 let elem_size = match base_ty.sty {
1090 ty::TyArray(elem_ty, _) |
1091 ty::TySlice(elem_ty) => self.type_size(elem_ty),
1092 _ => panic!("indexing expected an array or slice, got {:?}", base_ty),
1094 let n_ptr = self.eval_operand(operand)?;
1095 let n = self.memory.read_usize(n_ptr)?;
1096 base.ptr.offset(n as isize * elem_size as isize)
1099 ConstantIndex { .. } => unimplemented!(),
1104 Ok(Lvalue { ptr: ptr, extra: LvalueExtra::None })
1107 // TODO(solson): Try making const_to_primval instead.
1108 fn const_to_ptr(&mut self, const_val: &const_val::ConstVal) -> EvalResult<Pointer> {
1109 use rustc::middle::const_val::ConstVal::*;
1111 Float(_f) => unimplemented!(),
1113 // TODO(solson): Check int constant type.
1114 let ptr = self.memory.allocate(8);
1115 self.memory.write_uint(ptr, int.to_u64_unchecked(), 8)?;
1119 let psize = self.memory.pointer_size;
1120 let static_ptr = self.memory.allocate(s.len());
1121 let ptr = self.memory.allocate(psize * 2);
1122 self.memory.write_bytes(static_ptr, s.as_bytes())?;
1123 self.memory.write_ptr(ptr, static_ptr)?;
1124 self.memory.write_usize(ptr.offset(psize as isize), s.len() as u64)?;
1127 ByteStr(ref bs) => {
1128 let psize = self.memory.pointer_size;
1129 let static_ptr = self.memory.allocate(bs.len());
1130 let ptr = self.memory.allocate(psize);
1131 self.memory.write_bytes(static_ptr, bs)?;
1132 self.memory.write_ptr(ptr, static_ptr)?;
1136 let ptr = self.memory.allocate(1);
1137 self.memory.write_bool(ptr, b)?;
1140 Char(_c) => unimplemented!(),
1141 Struct(_node_id) => unimplemented!(),
1142 Tuple(_node_id) => unimplemented!(),
1143 Function(_def_id) => unimplemented!(),
1144 Array(_, _) => unimplemented!(),
1145 Repeat(_, _) => unimplemented!(),
1146 Dummy => unimplemented!(),
1150 fn lvalue_ty(&self, lvalue: &mir::Lvalue<'tcx>) -> Ty<'tcx> {
1151 self.monomorphize(self.mir().lvalue_ty(self.tcx, lvalue).to_ty(self.tcx))
1154 fn operand_ty(&self, operand: &mir::Operand<'tcx>) -> Ty<'tcx> {
1155 self.monomorphize(self.mir().operand_ty(self.tcx, operand))
1158 fn monomorphize(&self, ty: Ty<'tcx>) -> Ty<'tcx> {
1159 let substituted = ty.subst(self.tcx, self.substs());
1160 self.tcx.normalize_associated_type(&substituted)
1163 fn type_needs_drop(&self, ty: Ty<'tcx>) -> bool {
1164 self.tcx.type_needs_drop_given_env(ty, &self.tcx.empty_parameter_environment())
1167 fn move_(&mut self, src: Pointer, dest: Pointer, ty: Ty<'tcx>) -> EvalResult<()> {
1168 let size = self.type_size(ty);
1169 self.memory.copy(src, dest, size)?;
1170 if self.type_needs_drop(ty) {
1171 self.memory.drop_fill(src, size)?;
1176 fn type_is_sized(&self, ty: Ty<'tcx>) -> bool {
1177 ty.is_sized(self.tcx, &self.tcx.empty_parameter_environment(), DUMMY_SP)
1180 fn type_size(&self, ty: Ty<'tcx>) -> usize {
1181 self.type_layout(ty).size(&self.tcx.data_layout).bytes() as usize
1184 fn type_layout(&self, ty: Ty<'tcx>) -> &'tcx Layout {
1185 // TODO(solson): Is this inefficient? Needs investigation.
1186 let ty = self.monomorphize(ty);
1188 self.tcx.normalizing_infer_ctxt(ProjectionMode::Any).enter(|infcx| {
1189 // TODO(solson): Report this error properly.
1190 ty.layout(&infcx).unwrap()
1194 pub fn read_primval(&mut self, ptr: Pointer, ty: Ty<'tcx>) -> EvalResult<PrimVal> {
1195 use syntax::ast::{IntTy, UintTy};
1196 let val = match (self.memory.pointer_size, &ty.sty) {
1197 (_, &ty::TyBool) => PrimVal::Bool(self.memory.read_bool(ptr)?),
1198 (_, &ty::TyInt(IntTy::I8)) => PrimVal::I8(self.memory.read_int(ptr, 1)? as i8),
1199 (2, &ty::TyInt(IntTy::Is)) |
1200 (_, &ty::TyInt(IntTy::I16)) => PrimVal::I16(self.memory.read_int(ptr, 2)? as i16),
1201 (4, &ty::TyInt(IntTy::Is)) |
1202 (_, &ty::TyInt(IntTy::I32)) => PrimVal::I32(self.memory.read_int(ptr, 4)? as i32),
1203 (8, &ty::TyInt(IntTy::Is)) |
1204 (_, &ty::TyInt(IntTy::I64)) => PrimVal::I64(self.memory.read_int(ptr, 8)? as i64),
1205 (_, &ty::TyUint(UintTy::U8)) => PrimVal::U8(self.memory.read_uint(ptr, 1)? as u8),
1206 (2, &ty::TyUint(UintTy::Us)) |
1207 (_, &ty::TyUint(UintTy::U16)) => PrimVal::U16(self.memory.read_uint(ptr, 2)? as u16),
1208 (4, &ty::TyUint(UintTy::Us)) |
1209 (_, &ty::TyUint(UintTy::U32)) => PrimVal::U32(self.memory.read_uint(ptr, 4)? as u32),
1210 (8, &ty::TyUint(UintTy::Us)) |
1211 (_, &ty::TyUint(UintTy::U64)) => PrimVal::U64(self.memory.read_uint(ptr, 8)? as u64),
1213 (_, &ty::TyRef(_, ty::TypeAndMut { ty, .. })) |
1214 (_, &ty::TyRawPtr(ty::TypeAndMut { ty, .. })) => {
1215 if self.type_is_sized(ty) {
1216 match self.memory.read_ptr(ptr) {
1217 Ok(p) => PrimVal::AbstractPtr(p),
1218 Err(EvalError::ReadBytesAsPointer) => {
1219 PrimVal::IntegerPtr(self.memory.read_usize(ptr)?)
1221 Err(e) => return Err(e),
1224 return Err(EvalError::Unimplemented(format!("unimplemented: primitive read of fat pointer type: {:?}", ty)));
1228 _ => panic!("primitive read of non-primitive type: {:?}", ty),
1233 fn frame(&self) -> &Frame<'mir, 'tcx> {
1234 self.stack.last().expect("no call frames exist")
1237 fn frame_mut(&mut self) -> &mut Frame<'mir, 'tcx> {
1238 self.stack.last_mut().expect("no call frames exist")
1241 fn mir(&self) -> CachedMir<'mir, 'tcx> {
1242 self.frame().mir.clone()
1245 fn substs(&self) -> &'tcx Substs<'tcx> {
1246 self.substs_stack.last().cloned().unwrap_or_else(|| self.tcx.mk_substs(Substs::empty()))
1249 fn load_mir(&self, def_id: DefId) -> CachedMir<'mir, 'tcx> {
1250 match self.tcx.map.as_local_node_id(def_id) {
1251 Some(node_id) => CachedMir::Ref(self.mir_map.map.get(&node_id).unwrap()),
1253 let mut mir_cache = self.mir_cache.borrow_mut();
1254 if let Some(mir) = mir_cache.get(&def_id) {
1255 return CachedMir::Owned(mir.clone());
1258 let cs = &self.tcx.sess.cstore;
1259 let mir = cs.maybe_get_item_mir(self.tcx, def_id).unwrap_or_else(|| {
1260 panic!("no mir for {:?}", def_id);
1262 let cached = Rc::new(mir);
1263 mir_cache.insert(def_id, cached.clone());
1264 CachedMir::Owned(cached)
1269 fn fulfill_obligation(&self, trait_ref: ty::PolyTraitRef<'tcx>) -> traits::Vtable<'tcx, ()> {
1270 // Do the initial selection for the obligation. This yields the shallow result we are
1271 // looking for -- that is, what specific impl.
1272 self.tcx.normalizing_infer_ctxt(ProjectionMode::Any).enter(|infcx| {
1273 let mut selcx = traits::SelectionContext::new(&infcx);
1275 let obligation = traits::Obligation::new(
1276 traits::ObligationCause::misc(DUMMY_SP, ast::DUMMY_NODE_ID),
1277 trait_ref.to_poly_trait_predicate(),
1279 let selection = selcx.select(&obligation).unwrap().unwrap();
1281 // Currently, we use a fulfillment context to completely resolve all nested obligations.
1282 // This is because they can inform the inference of the impl's type parameters.
1283 let mut fulfill_cx = traits::FulfillmentContext::new();
1284 let vtable = selection.map(|predicate| {
1285 fulfill_cx.register_predicate_obligation(&infcx, predicate);
1287 infcx.drain_fulfillment_cx_or_panic(DUMMY_SP, &mut fulfill_cx, &vtable)
1291 /// Trait method, which has to be resolved to an impl method.
1292 pub fn trait_method(
1295 substs: &'tcx Substs<'tcx>
1296 ) -> (DefId, &'tcx Substs<'tcx>) {
1297 let method_item = self.tcx.impl_or_trait_item(def_id);
1298 let trait_id = method_item.container().id();
1299 let trait_ref = ty::Binder(substs.to_trait_ref(self.tcx, trait_id));
1300 match self.fulfill_obligation(trait_ref) {
1301 traits::VtableImpl(vtable_impl) => {
1302 let impl_did = vtable_impl.impl_def_id;
1303 let mname = self.tcx.item_name(def_id);
1304 // Create a concatenated set of substitutions which includes those from the impl
1305 // and those from the method:
1306 let impl_substs = vtable_impl.substs.with_method_from(substs);
1307 let substs = self.tcx.mk_substs(impl_substs);
1308 let mth = get_impl_method(self.tcx, impl_did, substs, mname);
1310 (mth.method.def_id, mth.substs)
1313 traits::VtableClosure(vtable_closure) =>
1314 (vtable_closure.closure_def_id, vtable_closure.substs.func_substs),
1316 traits::VtableFnPointer(_fn_ty) => {
1317 let _trait_closure_kind = self.tcx.lang_items.fn_trait_kind(trait_id).unwrap();
1319 // let llfn = trans_fn_pointer_shim(ccx, trait_closure_kind, fn_ty);
1321 // let method_ty = def_ty(tcx, def_id, substs);
1322 // let fn_ptr_ty = match method_ty.sty {
1323 // ty::TyFnDef(_, _, fty) => tcx.mk_ty(ty::TyFnPtr(fty)),
1324 // _ => unreachable!("expected fn item type, found {}",
1327 // Callee::ptr(immediate_rvalue(llfn, fn_ptr_ty))
1330 traits::VtableObject(ref _data) => {
1333 // data: Virtual(traits::get_vtable_index_of_object_method(
1334 // tcx, data, def_id)),
1335 // ty: def_ty(tcx, def_id, substs)
1338 vtable => unreachable!("resolved vtable bad vtable {:?} in trans", vtable),
1343 fn pointee_type(ptr_ty: ty::Ty) -> Option<ty::Ty> {
1345 ty::TyRef(_, ty::TypeAndMut { ty, .. }) |
1346 ty::TyRawPtr(ty::TypeAndMut { ty, .. }) |
1355 fn to_ptr(self) -> Pointer {
1356 assert_eq!(self.extra, LvalueExtra::None);
1361 impl<'mir, 'tcx: 'mir> Deref for CachedMir<'mir, 'tcx> {
1362 type Target = mir::Mir<'tcx>;
1363 fn deref(&self) -> &mir::Mir<'tcx> {
1365 CachedMir::Ref(r) => r,
1366 CachedMir::Owned(ref rc) => rc,
1372 pub struct ImplMethod<'tcx> {
1373 pub method: Rc<ty::Method<'tcx>>,
1374 pub substs: &'tcx Substs<'tcx>,
1375 pub is_provided: bool,
1378 /// Locates the applicable definition of a method, given its name.
1379 pub fn get_impl_method<'a, 'tcx>(
1380 tcx: TyCtxt<'a, 'tcx, 'tcx>,
1382 substs: &'tcx Substs<'tcx>,
1384 ) -> ImplMethod<'tcx> {
1385 assert!(!substs.types.needs_infer());
1387 let trait_def_id = tcx.trait_id_of_impl(impl_def_id).unwrap();
1388 let trait_def = tcx.lookup_trait_def(trait_def_id);
1390 match trait_def.ancestors(impl_def_id).fn_defs(tcx, name).next() {
1391 Some(node_item) => {
1392 let substs = tcx.normalizing_infer_ctxt(ProjectionMode::Any).enter(|infcx| {
1393 let substs = traits::translate_substs(&infcx, impl_def_id,
1394 substs, node_item.node);
1395 tcx.lift(&substs).unwrap_or_else(|| {
1396 bug!("trans::meth::get_impl_method: translate_substs \
1397 returned {:?} which contains inference types/regions",
1402 method: node_item.item,
1404 is_provided: node_item.node.is_from_trait(),
1408 bug!("method {:?} not found in {:?}", name, impl_def_id)
1413 pub fn interpret_start_points<'a, 'tcx>(
1414 tcx: TyCtxt<'a, 'tcx, 'tcx>,
1415 mir_map: &MirMap<'tcx>,
1417 let initial_indentation = ::log_settings::settings().indentation;
1418 for (&id, mir) in &mir_map.map {
1419 for attr in tcx.map.attrs(id) {
1420 use syntax::attr::AttrMetaMethods;
1421 if attr.check_name("miri_run") {
1422 let item = tcx.map.expect_item(id);
1424 ::log_settings::settings().indentation = initial_indentation;
1426 debug!("Interpreting: {}", item.name);
1428 let mut gecx = GlobalEvalContext::new(tcx, mir_map);
1429 match gecx.call(mir) {
1430 Ok(Some(return_ptr)) => if log_enabled!(::log::LogLevel::Debug) {
1431 gecx.memory.dump(return_ptr.alloc_id);
1433 Ok(None) => warn!("diverging function returned"),
1435 // TODO(solson): Detect whether the error was already reported or not.
1436 // tcx.sess.err(&e.to_string());
1444 // TODO(solson): Upstream these methods into rustc::ty::layout.
1447 fn size(self) -> Size;
1450 impl IntegerExt for layout::Integer {
1451 fn size(self) -> Size {
1452 use rustc::ty::layout::Integer::*;
1454 I1 | I8 => Size::from_bits(8),
1455 I16 => Size::from_bits(16),
1456 I32 => Size::from_bits(32),
1457 I64 => Size::from_bits(64),
1463 fn field_offset(&self, index: usize) -> Size;
1466 impl StructExt for layout::Struct {
1467 fn field_offset(&self, index: usize) -> Size {
1471 self.offset_after_field[index - 1]