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 use std::collections::HashMap;
27 struct GlobalEvalContext<'a, 'tcx: 'a> {
28 /// The results of the type checker, from rustc.
29 tcx: TyCtxt<'a, 'tcx, 'tcx>,
31 /// A mapping from NodeIds to Mir, from rustc. Only contains MIR for crate-local items.
32 mir_map: &'a MirMap<'tcx>,
34 /// A local cache from DefIds to Mir for non-crate-local items.
35 mir_cache: RefCell<DefIdMap<Rc<mir::Mir<'tcx>>>>,
37 /// The virtual memory system.
40 /// Precomputed statics, constants and promoteds
41 statics: HashMap<ConstantId<'tcx>, Pointer>,
44 struct FnEvalContext<'a, 'b: 'a + 'mir, 'mir, 'tcx: 'b> {
45 gecx: &'a mut GlobalEvalContext<'b, 'tcx>,
47 /// The virtual call stack.
48 stack: Vec<Frame<'mir, 'tcx>>,
51 impl<'a, 'b, 'mir, 'tcx> Deref for FnEvalContext<'a, 'b, 'mir, 'tcx> {
52 type Target = GlobalEvalContext<'b, 'tcx>;
53 fn deref(&self) -> &Self::Target {
58 impl<'a, 'b, 'mir, 'tcx> DerefMut for FnEvalContext<'a, 'b, 'mir, 'tcx> {
59 fn deref_mut(&mut self) -> &mut Self::Target {
65 struct Frame<'a, 'tcx: 'a> {
66 /// The def_id of the current function
69 /// The span of the call site
72 /// type substitutions for the current function invocation
73 substs: &'tcx Substs<'tcx>,
75 /// The MIR for the function called on this frame.
76 mir: CachedMir<'a, 'tcx>,
78 /// The block that is currently executed (or will be executed after the above call stacks return)
79 next_block: mir::BasicBlock,
81 /// A pointer for writing the return value of the current call if it's not a diverging call.
82 return_ptr: Option<Pointer>,
84 /// The list of locals for the current function, stored in order as
85 /// `[arguments..., variables..., temporaries...]`. The variables begin at `self.var_offset`
86 /// and the temporaries at `self.temp_offset`.
89 /// The offset of the first variable in `self.locals`.
92 /// The offset of the first temporary in `self.locals`.
95 /// The index of the currently evaluated statment
99 #[derive(Copy, Clone, Debug, Eq, PartialEq)]
105 #[derive(Copy, Clone, Debug, Eq, PartialEq)]
109 // TODO(solson): Vtable(memory::AllocId),
110 DowncastVariant(usize),
114 enum CachedMir<'mir, 'tcx: 'mir> {
115 Ref(&'mir mir::Mir<'tcx>),
116 Owned(Rc<mir::Mir<'tcx>>)
119 /// Represents the action to be taken in the main loop as a result of executing a terminator.
120 enum TerminatorTarget {
121 /// Make a local jump to the next block
124 /// Start executing from the new current frame. (For function calls.)
127 /// Stop executing the current frame and resume the previous frame.
131 #[derive(Clone, Debug, Eq, PartialEq, Hash)]
132 struct ConstantId<'tcx> {
134 substs: &'tcx Substs<'tcx>,
138 #[derive(Clone, Debug, Eq, PartialEq, Hash)]
144 impl<'a, 'tcx> GlobalEvalContext<'a, 'tcx> {
145 fn new(tcx: TyCtxt<'a, 'tcx, 'tcx>, mir_map: &'a MirMap<'tcx>) -> Self {
149 mir_cache: RefCell::new(DefIdMap()),
150 memory: Memory::new(tcx.sess
154 .expect("Session::target::uint_type was usize")/8),
155 statics: HashMap::new(),
159 fn call(&mut self, mir: &mir::Mir<'tcx>, def_id: DefId) -> EvalResult<Option<Pointer>> {
160 let substs = self.tcx.mk_substs(subst::Substs::empty());
161 let return_ptr = self.alloc_ret_ptr(mir.return_ty, substs);
163 let mut nested_fecx = FnEvalContext::new(self);
165 nested_fecx.push_stack_frame(def_id, mir.span, CachedMir::Ref(mir), substs, None);
167 nested_fecx.frame_mut().return_ptr = return_ptr;
173 fn alloc_ret_ptr(&mut self, output_ty: ty::FnOutput<'tcx>, substs: &'tcx Substs<'tcx>) -> Option<Pointer> {
175 ty::FnConverging(ty) => {
176 let size = self.type_size(ty, substs);
177 Some(self.memory.allocate(size))
179 ty::FnDiverging => None,
183 // TODO(solson): Try making const_to_primval instead.
184 fn const_to_ptr(&mut self, const_val: &const_val::ConstVal) -> EvalResult<Pointer> {
185 use rustc::middle::const_val::ConstVal::*;
187 Float(_f) => unimplemented!(),
189 // TODO(solson): Check int constant type.
190 let ptr = self.memory.allocate(8);
191 self.memory.write_uint(ptr, int.to_u64_unchecked(), 8)?;
195 let psize = self.memory.pointer_size;
196 let static_ptr = self.memory.allocate(s.len());
197 let ptr = self.memory.allocate(psize * 2);
198 self.memory.write_bytes(static_ptr, s.as_bytes())?;
199 self.memory.write_ptr(ptr, static_ptr)?;
200 self.memory.write_usize(ptr.offset(psize as isize), s.len() as u64)?;
204 let psize = self.memory.pointer_size;
205 let static_ptr = self.memory.allocate(bs.len());
206 let ptr = self.memory.allocate(psize);
207 self.memory.write_bytes(static_ptr, bs)?;
208 self.memory.write_ptr(ptr, static_ptr)?;
212 let ptr = self.memory.allocate(1);
213 self.memory.write_bool(ptr, b)?;
216 Char(_c) => unimplemented!(),
217 Struct(_node_id) => unimplemented!(),
218 Tuple(_node_id) => unimplemented!(),
219 Function(_def_id) => unimplemented!(),
220 Array(_, _) => unimplemented!(),
221 Repeat(_, _) => unimplemented!(),
222 Dummy => unimplemented!(),
226 fn type_needs_drop(&self, ty: Ty<'tcx>) -> bool {
227 self.tcx.type_needs_drop_given_env(ty, &self.tcx.empty_parameter_environment())
230 fn type_is_sized(&self, ty: Ty<'tcx>) -> bool {
231 ty.is_sized(self.tcx, &self.tcx.empty_parameter_environment(), DUMMY_SP)
234 fn fulfill_obligation(&self, trait_ref: ty::PolyTraitRef<'tcx>) -> traits::Vtable<'tcx, ()> {
235 // Do the initial selection for the obligation. This yields the shallow result we are
236 // looking for -- that is, what specific impl.
237 self.tcx.normalizing_infer_ctxt(ProjectionMode::Any).enter(|infcx| {
238 let mut selcx = traits::SelectionContext::new(&infcx);
240 let obligation = traits::Obligation::new(
241 traits::ObligationCause::misc(DUMMY_SP, ast::DUMMY_NODE_ID),
242 trait_ref.to_poly_trait_predicate(),
244 let selection = selcx.select(&obligation).unwrap().unwrap();
246 // Currently, we use a fulfillment context to completely resolve all nested obligations.
247 // This is because they can inform the inference of the impl's type parameters.
248 let mut fulfill_cx = traits::FulfillmentContext::new();
249 let vtable = selection.map(|predicate| {
250 fulfill_cx.register_predicate_obligation(&infcx, predicate);
252 infcx.drain_fulfillment_cx_or_panic(DUMMY_SP, &mut fulfill_cx, &vtable)
256 /// Trait method, which has to be resolved to an impl method.
260 substs: &'tcx Substs<'tcx>
261 ) -> (DefId, &'tcx Substs<'tcx>) {
262 let method_item = self.tcx.impl_or_trait_item(def_id);
263 let trait_id = method_item.container().id();
264 let trait_ref = ty::Binder(substs.to_trait_ref(self.tcx, trait_id));
265 match self.fulfill_obligation(trait_ref) {
266 traits::VtableImpl(vtable_impl) => {
267 let impl_did = vtable_impl.impl_def_id;
268 let mname = self.tcx.item_name(def_id);
269 // Create a concatenated set of substitutions which includes those from the impl
270 // and those from the method:
271 let impl_substs = vtable_impl.substs.with_method_from(substs);
272 let substs = self.tcx.mk_substs(impl_substs);
273 let mth = get_impl_method(self.tcx, impl_did, substs, mname);
275 (mth.method.def_id, mth.substs)
278 traits::VtableClosure(vtable_closure) =>
279 (vtable_closure.closure_def_id, vtable_closure.substs.func_substs),
281 traits::VtableFnPointer(_fn_ty) => {
282 let _trait_closure_kind = self.tcx.lang_items.fn_trait_kind(trait_id).unwrap();
284 // let llfn = trans_fn_pointer_shim(ccx, trait_closure_kind, fn_ty);
286 // let method_ty = def_ty(tcx, def_id, substs);
287 // let fn_ptr_ty = match method_ty.sty {
288 // ty::TyFnDef(_, _, fty) => tcx.mk_ty(ty::TyFnPtr(fty)),
289 // _ => unreachable!("expected fn item type, found {}",
292 // Callee::ptr(immediate_rvalue(llfn, fn_ptr_ty))
295 traits::VtableObject(ref _data) => {
298 // data: Virtual(traits::get_vtable_index_of_object_method(
299 // tcx, data, def_id)),
300 // ty: def_ty(tcx, def_id, substs)
303 vtable => unreachable!("resolved vtable bad vtable {:?} in trans", vtable),
307 fn load_mir(&self, def_id: DefId) -> CachedMir<'a, 'tcx> {
308 match self.tcx.map.as_local_node_id(def_id) {
309 Some(node_id) => CachedMir::Ref(self.mir_map.map.get(&node_id).unwrap()),
311 let mut mir_cache = self.mir_cache.borrow_mut();
312 if let Some(mir) = mir_cache.get(&def_id) {
313 return CachedMir::Owned(mir.clone());
316 let cs = &self.tcx.sess.cstore;
317 let mir = cs.maybe_get_item_mir(self.tcx, def_id).unwrap_or_else(|| {
318 panic!("no mir for {:?}", def_id);
320 let cached = Rc::new(mir);
321 mir_cache.insert(def_id, cached.clone());
322 CachedMir::Owned(cached)
327 fn monomorphize(&self, ty: Ty<'tcx>, substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
328 let substituted = ty.subst(self.tcx, substs);
329 self.tcx.normalize_associated_type(&substituted)
332 fn type_size(&self, ty: Ty<'tcx>, substs: &'tcx Substs<'tcx>) -> usize {
333 self.type_layout(ty, substs).size(&self.tcx.data_layout).bytes() as usize
336 fn type_layout(&self, ty: Ty<'tcx>, substs: &'tcx Substs<'tcx>) -> &'tcx Layout {
337 // TODO(solson): Is this inefficient? Needs investigation.
338 let ty = self.monomorphize(ty, substs);
340 self.tcx.normalizing_infer_ctxt(ProjectionMode::Any).enter(|infcx| {
341 // TODO(solson): Report this error properly.
342 ty.layout(&infcx).unwrap()
347 impl<'a, 'b, 'mir, 'tcx> FnEvalContext<'a, 'b, 'mir, 'tcx> {
348 fn new(gecx: &'a mut GlobalEvalContext<'b, 'tcx>) -> Self {
357 fn report(&self, e: &EvalError) {
358 let stmt = self.frame().stmt;
359 let block = self.basic_block();
360 let span = if stmt < block.statements.len() {
361 block.statements[stmt].span
363 block.terminator().span
365 let mut err = self.tcx.sess.struct_span_err(span, &e.to_string());
366 for &Frame{ def_id, substs, span, .. } in self.stack.iter().rev() {
367 // FIXME(solson): Find a way to do this without this Display impl hack.
368 use rustc::util::ppaux;
370 struct Instance<'tcx>(DefId, &'tcx Substs<'tcx>);
371 impl<'tcx> fmt::Display for Instance<'tcx> {
372 fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
373 ppaux::parameterized(f, self.1, self.0, ppaux::Ns::Value, &[],
374 |tcx| tcx.lookup_item_type(self.0).generics)
377 err.span_note(span, &format!("inside call to {}", Instance(def_id, substs)));
382 fn maybe_report<T>(&self, r: EvalResult<T>) -> EvalResult<T> {
383 if let Err(ref e) = r {
389 fn run(&mut self) -> EvalResult<()> {
390 let mut stepper = stepper::Stepper::new(self);
391 let mut done = false;
393 use self::stepper::Event::*;
394 stepper.step(|event| match event {
395 Block(b) => trace!("// {:?}", b),
396 Assignment(a) => trace!("{:?}", a),
397 Terminator(t) => trace!("{:?}", t.kind),
405 fn push_stack_frame(&mut self, def_id: DefId, span: codemap::Span, mir: CachedMir<'mir, 'tcx>, substs: &'tcx Substs<'tcx>,
406 return_ptr: Option<Pointer>)
408 let arg_tys = mir.arg_decls.iter().map(|a| a.ty);
409 let var_tys = mir.var_decls.iter().map(|v| v.ty);
410 let temp_tys = mir.temp_decls.iter().map(|t| t.ty);
412 let num_args = mir.arg_decls.len();
413 let num_vars = mir.var_decls.len();
415 ::log_settings::settings().indentation += 1;
417 self.stack.push(Frame {
419 next_block: mir::START_BLOCK,
420 return_ptr: return_ptr,
422 var_offset: num_args,
423 temp_offset: num_args + num_vars,
430 let locals: Vec<Pointer> = arg_tys.chain(var_tys).chain(temp_tys).map(|ty| {
431 let size = self.type_size(ty);
432 self.memory.allocate(size)
435 self.frame_mut().locals = locals;
438 fn pop_stack_frame(&mut self) {
439 ::log_settings::settings().indentation -= 1;
440 let _frame = self.stack.pop().expect("tried to pop a stack frame, but there were none");
441 // TODO(solson): Deallocate local variables.
444 fn eval_terminator(&mut self, terminator: &mir::Terminator<'tcx>)
445 -> EvalResult<TerminatorTarget> {
446 use rustc::mir::repr::TerminatorKind::*;
447 let target = match terminator.kind {
448 Return => TerminatorTarget::Return,
451 self.frame_mut().next_block = target;
452 TerminatorTarget::Block
455 If { ref cond, targets: (then_target, else_target) } => {
456 let cond_ptr = self.eval_operand(cond)?;
457 let cond_val = self.memory.read_bool(cond_ptr)?;
458 self.frame_mut().next_block = if cond_val { then_target } else { else_target };
459 TerminatorTarget::Block
462 SwitchInt { ref discr, ref values, ref targets, .. } => {
463 let discr_ptr = self.eval_lvalue(discr)?.to_ptr();
464 let discr_size = self
465 .type_layout(self.lvalue_ty(discr))
466 .size(&self.tcx.data_layout)
468 let discr_val = self.memory.read_uint(discr_ptr, discr_size)?;
470 // Branch to the `otherwise` case by default, if no match is found.
471 let mut target_block = targets[targets.len() - 1];
473 for (index, val_const) in values.iter().enumerate() {
474 let ptr = self.const_to_ptr(val_const)?;
475 let val = self.memory.read_uint(ptr, discr_size)?;
476 if discr_val == val {
477 target_block = targets[index];
482 self.frame_mut().next_block = target_block;
483 TerminatorTarget::Block
486 Switch { ref discr, ref targets, adt_def } => {
487 let adt_ptr = self.eval_lvalue(discr)?.to_ptr();
488 let adt_ty = self.lvalue_ty(discr);
489 let discr_val = self.read_discriminant_value(adt_ptr, adt_ty)?;
490 let matching = adt_def.variants.iter()
491 .position(|v| discr_val == v.disr_val.to_u64_unchecked());
495 self.frame_mut().next_block = targets[i];
496 TerminatorTarget::Block
498 None => return Err(EvalError::InvalidDiscriminant),
502 Call { ref func, ref args, ref destination, .. } => {
503 let mut return_ptr = None;
504 if let Some((ref lv, target)) = *destination {
505 self.frame_mut().next_block = target;
506 return_ptr = Some(self.eval_lvalue(lv)?.to_ptr());
509 let func_ty = self.operand_ty(func);
511 ty::TyFnDef(def_id, substs, fn_ty) => {
512 use syntax::abi::Abi;
514 Abi::RustIntrinsic => {
515 let name = self.tcx.item_name(def_id).as_str();
516 match fn_ty.sig.0.output {
517 ty::FnConverging(ty) => {
518 let size = self.type_size(ty);
519 let ret = return_ptr.unwrap();
520 self.call_intrinsic(&name, substs, args, ret, size)?
522 ty::FnDiverging => unimplemented!(),
527 match fn_ty.sig.0.output {
528 ty::FnConverging(ty) => {
529 let size = self.type_size(ty);
530 self.call_c_abi(def_id, args, return_ptr.unwrap(), size)?
532 ty::FnDiverging => unimplemented!(),
536 Abi::Rust | Abi::RustCall => {
537 // TODO(solson): Adjust the first argument when calling a Fn or
538 // FnMut closure via FnOnce::call_once.
540 // Only trait methods can have a Self parameter.
541 let (resolved_def_id, resolved_substs) = if substs.self_ty().is_some() {
542 self.trait_method(def_id, substs)
547 let mut arg_srcs = Vec::new();
549 let src = self.eval_operand(arg)?;
550 let src_ty = self.operand_ty(arg);
551 arg_srcs.push((src, src_ty));
554 if fn_ty.abi == Abi::RustCall && !args.is_empty() {
556 let last_arg = args.last().unwrap();
557 let last = self.eval_operand(last_arg)?;
558 let last_ty = self.operand_ty(last_arg);
559 let last_layout = self.type_layout(last_ty);
560 match (&last_ty.sty, last_layout) {
561 (&ty::TyTuple(fields),
562 &Layout::Univariant { ref variant, .. }) => {
563 let offsets = iter::once(0)
564 .chain(variant.offset_after_field.iter()
565 .map(|s| s.bytes()));
566 for (offset, ty) in offsets.zip(fields) {
567 let src = last.offset(offset as isize);
568 arg_srcs.push((src, ty));
571 ty => panic!("expected tuple as last argument in function with 'rust-call' ABI, got {:?}", ty),
575 let mir = self.load_mir(resolved_def_id);
576 self.push_stack_frame(def_id, terminator.span, mir, resolved_substs, return_ptr);
578 for (i, (src, src_ty)) in arg_srcs.into_iter().enumerate() {
579 let dest = self.frame().locals[i];
580 self.move_(src, dest, src_ty)?;
583 TerminatorTarget::Call
586 abi => return Err(EvalError::Unimplemented(format!("can't handle function with {:?} ABI", abi))),
590 _ => return Err(EvalError::Unimplemented(format!("can't handle callee of type {:?}", func_ty))),
594 Drop { ref value, target, .. } => {
595 let ptr = self.eval_lvalue(value)?.to_ptr();
596 let ty = self.lvalue_ty(value);
598 self.frame_mut().next_block = target;
599 TerminatorTarget::Block
602 Resume => unimplemented!(),
608 fn drop(&mut self, ptr: Pointer, ty: Ty<'tcx>) -> EvalResult<()> {
609 if !self.type_needs_drop(ty) {
610 debug!("no need to drop {:?}", ty);
613 trace!("-need to drop {:?}", ty);
615 // TODO(solson): Call user-defined Drop::drop impls.
618 ty::TyBox(contents_ty) => {
619 match self.memory.read_ptr(ptr) {
620 Ok(contents_ptr) => {
621 self.drop(contents_ptr, contents_ty)?;
622 trace!("-deallocating box");
623 self.memory.deallocate(contents_ptr)?;
625 Err(EvalError::ReadBytesAsPointer) => {
626 let size = self.memory.pointer_size;
627 let possible_drop_fill = self.memory.read_bytes(ptr, size)?;
628 if possible_drop_fill.iter().all(|&b| b == mem::POST_DROP_U8) {
631 return Err(EvalError::ReadBytesAsPointer);
634 Err(e) => return Err(e),
638 // TODO(solson): Implement drop for other relevant types (e.g. aggregates).
643 // FIXME(solson): Trait objects (with no static size) probably get filled, too.
644 let size = self.type_size(ty);
645 self.memory.drop_fill(ptr, size)?;
650 fn read_discriminant_value(&self, adt_ptr: Pointer, adt_ty: Ty<'tcx>) -> EvalResult<u64> {
651 use rustc::ty::layout::Layout::*;
652 let adt_layout = self.type_layout(adt_ty);
654 let discr_val = match *adt_layout {
655 General { discr, .. } | CEnum { discr, .. } => {
656 let discr_size = discr.size().bytes();
657 self.memory.read_uint(adt_ptr, discr_size as usize)?
660 RawNullablePointer { nndiscr, .. } => {
661 self.read_nonnull_discriminant_value(adt_ptr, nndiscr)?
664 StructWrappedNullablePointer { nndiscr, ref discrfield, .. } => {
665 let offset = self.nonnull_offset(adt_ty, nndiscr, discrfield)?;
666 let nonnull = adt_ptr.offset(offset.bytes() as isize);
667 self.read_nonnull_discriminant_value(nonnull, nndiscr)?
670 // The discriminant_value intrinsic returns 0 for non-sum types.
671 Array { .. } | FatPointer { .. } | Scalar { .. } | Univariant { .. } |
678 fn read_nonnull_discriminant_value(&self, ptr: Pointer, nndiscr: u64) -> EvalResult<u64> {
679 let not_null = match self.memory.read_usize(ptr) {
681 Ok(_) | Err(EvalError::ReadPointerAsBytes) => true,
682 Err(e) => return Err(e),
684 assert!(nndiscr == 0 || nndiscr == 1);
685 Ok(if not_null { nndiscr } else { 1 - nndiscr })
691 substs: &'tcx Substs<'tcx>,
692 args: &[mir::Operand<'tcx>],
695 ) -> EvalResult<TerminatorTarget> {
696 let args_res: EvalResult<Vec<Pointer>> = args.iter()
697 .map(|arg| self.eval_operand(arg))
699 let args = args_res?;
702 // FIXME(solson): Handle different integer types correctly.
703 "add_with_overflow" => {
704 let ty = *substs.types.get(subst::FnSpace, 0);
705 let size = self.type_size(ty);
706 let left = self.memory.read_int(args[0], size)?;
707 let right = self.memory.read_int(args[1], size)?;
708 let (n, overflowed) = unsafe {
709 ::std::intrinsics::add_with_overflow::<i64>(left, right)
711 self.memory.write_int(dest, n, size)?;
712 self.memory.write_bool(dest.offset(size as isize), overflowed)?;
717 "copy_nonoverlapping" => {
718 let elem_ty = *substs.types.get(subst::FnSpace, 0);
719 let elem_size = self.type_size(elem_ty);
720 let src = self.memory.read_ptr(args[0])?;
721 let dest = self.memory.read_ptr(args[1])?;
722 let count = self.memory.read_isize(args[2])?;
723 self.memory.copy(src, dest, count as usize * elem_size)?;
726 "discriminant_value" => {
727 let ty = *substs.types.get(subst::FnSpace, 0);
728 let adt_ptr = self.memory.read_ptr(args[0])?;
729 let discr_val = self.read_discriminant_value(adt_ptr, ty)?;
730 self.memory.write_uint(dest, discr_val, dest_size)?;
734 let arg_ty = *substs.types.get(subst::FnSpace, 0);
735 let arg_size = self.type_size(arg_ty);
736 self.memory.drop_fill(args[0], arg_size)?;
739 "init" => self.memory.write_repeat(dest, 0, dest_size)?,
742 self.memory.write_int(dest, 1, dest_size)?;
746 let ty = *substs.types.get(subst::FnSpace, 0);
747 let ptr = self.memory.read_ptr(args[0])?;
748 self.move_(args[1], ptr, ty)?;
751 // FIXME(solson): Handle different integer types correctly.
752 "mul_with_overflow" => {
753 let ty = *substs.types.get(subst::FnSpace, 0);
754 let size = self.type_size(ty);
755 let left = self.memory.read_int(args[0], size)?;
756 let right = self.memory.read_int(args[1], size)?;
757 let (n, overflowed) = unsafe {
758 ::std::intrinsics::mul_with_overflow::<i64>(left, right)
760 self.memory.write_int(dest, n, size)?;
761 self.memory.write_bool(dest.offset(size as isize), overflowed)?;
765 let pointee_ty = *substs.types.get(subst::FnSpace, 0);
766 let pointee_size = self.type_size(pointee_ty) as isize;
767 let ptr_arg = args[0];
768 let offset = self.memory.read_isize(args[1])?;
770 match self.memory.read_ptr(ptr_arg) {
772 let result_ptr = ptr.offset(offset as isize * pointee_size);
773 self.memory.write_ptr(dest, result_ptr)?;
775 Err(EvalError::ReadBytesAsPointer) => {
776 let addr = self.memory.read_isize(ptr_arg)?;
777 let result_addr = addr + offset * pointee_size as i64;
778 self.memory.write_isize(dest, result_addr)?;
780 Err(e) => return Err(e),
784 // FIXME(solson): Handle different integer types correctly. Use primvals?
785 "overflowing_sub" => {
786 let ty = *substs.types.get(subst::FnSpace, 0);
787 let size = self.type_size(ty);
788 let left = self.memory.read_int(args[0], size)?;
789 let right = self.memory.read_int(args[1], size)?;
790 let n = left.wrapping_sub(right);
791 self.memory.write_int(dest, n, size)?;
795 let ty = *substs.types.get(subst::FnSpace, 0);
796 let size = self.type_size(ty) as u64;
797 self.memory.write_uint(dest, size, dest_size)?;
801 let ty = *substs.types.get(subst::FnSpace, 0);
802 if self.type_is_sized(ty) {
803 let size = self.type_size(ty) as u64;
804 self.memory.write_uint(dest, size, dest_size)?;
807 ty::TySlice(_) | ty::TyStr => {
808 let elem_ty = ty.sequence_element_type(self.tcx);
809 let elem_size = self.type_size(elem_ty) as u64;
810 let ptr_size = self.memory.pointer_size as isize;
811 let n = self.memory.read_usize(args[0].offset(ptr_size))?;
812 self.memory.write_uint(dest, n * elem_size, dest_size)?;
815 _ => return Err(EvalError::Unimplemented(format!("unimplemented: size_of_val::<{:?}>", ty))),
821 let ty = *substs.types.get(subst::FnSpace, 0);
822 self.move_(args[0], dest, ty)?;
824 "uninit" => self.memory.mark_definedness(dest, dest_size, false)?,
826 name => return Err(EvalError::Unimplemented(format!("unimplemented intrinsic: {}", name))),
829 // Since we pushed no stack frame, the main loop will act
830 // as if the call just completed and it's returning to the
832 Ok(TerminatorTarget::Call)
838 args: &[mir::Operand<'tcx>],
841 ) -> EvalResult<TerminatorTarget> {
842 let name = self.tcx.item_name(def_id);
843 let attrs = self.tcx.get_attrs(def_id);
844 let link_name = match attr::first_attr_value_str_by_name(&attrs, "link_name") {
845 Some(ln) => ln.clone(),
846 None => name.as_str(),
849 let args_res: EvalResult<Vec<Pointer>> = args.iter()
850 .map(|arg| self.eval_operand(arg))
852 let args = args_res?;
854 match &link_name[..] {
855 "__rust_allocate" => {
856 let size = self.memory.read_usize(args[0])?;
857 let ptr = self.memory.allocate(size as usize);
858 self.memory.write_ptr(dest, ptr)?;
861 "__rust_reallocate" => {
862 let ptr = self.memory.read_ptr(args[0])?;
863 let size = self.memory.read_usize(args[2])?;
864 self.memory.reallocate(ptr, size as usize)?;
865 self.memory.write_ptr(dest, ptr)?;
869 let left = self.memory.read_ptr(args[0])?;
870 let right = self.memory.read_ptr(args[1])?;
871 let n = self.memory.read_usize(args[2])? as usize;
874 let left_bytes = self.memory.read_bytes(left, n)?;
875 let right_bytes = self.memory.read_bytes(right, n)?;
877 use std::cmp::Ordering::*;
878 match left_bytes.cmp(right_bytes) {
885 self.memory.write_int(dest, result, dest_size)?;
888 _ => return Err(EvalError::Unimplemented(format!("can't call C ABI function: {}", link_name))),
891 // Since we pushed no stack frame, the main loop will act
892 // as if the call just completed and it's returning to the
894 Ok(TerminatorTarget::Call)
897 fn assign_fields<I: IntoIterator<Item = u64>>(
901 operands: &[mir::Operand<'tcx>],
902 ) -> EvalResult<()> {
903 for (offset, operand) in offsets.into_iter().zip(operands) {
904 let src = self.eval_operand(operand)?;
905 let src_ty = self.operand_ty(operand);
906 let field_dest = dest.offset(offset as isize);
907 self.move_(src, field_dest, src_ty)?;
912 fn eval_assignment(&mut self, lvalue: &mir::Lvalue<'tcx>, rvalue: &mir::Rvalue<'tcx>)
915 let dest = self.eval_lvalue(lvalue)?.to_ptr();
916 let dest_ty = self.lvalue_ty(lvalue);
917 let dest_layout = self.type_layout(dest_ty);
919 use rustc::mir::repr::Rvalue::*;
921 Use(ref operand) => {
922 let src = self.eval_operand(operand)?;
923 self.move_(src, dest, dest_ty)?;
926 BinaryOp(bin_op, ref left, ref right) => {
927 let left_ptr = self.eval_operand(left)?;
928 let left_ty = self.operand_ty(left);
929 let left_val = self.read_primval(left_ptr, left_ty)?;
931 let right_ptr = self.eval_operand(right)?;
932 let right_ty = self.operand_ty(right);
933 let right_val = self.read_primval(right_ptr, right_ty)?;
935 let val = primval::binary_op(bin_op, left_val, right_val)?;
936 self.memory.write_primval(dest, val)?;
939 UnaryOp(un_op, ref operand) => {
940 let ptr = self.eval_operand(operand)?;
941 let ty = self.operand_ty(operand);
942 let val = self.read_primval(ptr, ty)?;
943 self.memory.write_primval(dest, primval::unary_op(un_op, val)?)?;
946 Aggregate(ref kind, ref operands) => {
947 use rustc::ty::layout::Layout::*;
949 Univariant { ref variant, .. } => {
950 let offsets = iter::once(0)
951 .chain(variant.offset_after_field.iter().map(|s| s.bytes()));
952 self.assign_fields(dest, offsets, operands)?;
956 let elem_size = match dest_ty.sty {
957 ty::TyArray(elem_ty, _) => self.type_size(elem_ty) as u64,
958 _ => panic!("tried to assign {:?} to non-array type {:?}",
961 let offsets = (0..).map(|i| i * elem_size);
962 self.assign_fields(dest, offsets, operands)?;
965 General { discr, ref variants, .. } => {
966 if let mir::AggregateKind::Adt(adt_def, variant, _) = *kind {
967 let discr_val = adt_def.variants[variant].disr_val.to_u64_unchecked();
968 let discr_size = discr.size().bytes() as usize;
969 self.memory.write_uint(dest, discr_val, discr_size)?;
971 let offsets = variants[variant].offset_after_field.iter()
973 self.assign_fields(dest, offsets, operands)?;
975 panic!("tried to assign {:?} to Layout::General", kind);
979 RawNullablePointer { nndiscr, .. } => {
980 if let mir::AggregateKind::Adt(_, variant, _) = *kind {
981 if nndiscr == variant as u64 {
982 assert_eq!(operands.len(), 1);
983 let operand = &operands[0];
984 let src = self.eval_operand(operand)?;
985 let src_ty = self.operand_ty(operand);
986 self.move_(src, dest, src_ty)?;
988 assert_eq!(operands.len(), 0);
989 self.memory.write_isize(dest, 0)?;
992 panic!("tried to assign {:?} to Layout::RawNullablePointer", kind);
996 StructWrappedNullablePointer { nndiscr, ref nonnull, ref discrfield } => {
997 if let mir::AggregateKind::Adt(_, variant, _) = *kind {
998 if nndiscr == variant as u64 {
999 let offsets = iter::once(0)
1000 .chain(nonnull.offset_after_field.iter().map(|s| s.bytes()));
1001 try!(self.assign_fields(dest, offsets, operands));
1003 assert_eq!(operands.len(), 0);
1004 let offset = self.nonnull_offset(dest_ty, nndiscr, discrfield)?;
1005 let dest = dest.offset(offset.bytes() as isize);
1006 try!(self.memory.write_isize(dest, 0));
1009 panic!("tried to assign {:?} to Layout::RawNullablePointer", kind);
1013 CEnum { discr, signed, .. } => {
1014 assert_eq!(operands.len(), 0);
1015 if let mir::AggregateKind::Adt(adt_def, variant, _) = *kind {
1016 let val = adt_def.variants[variant].disr_val.to_u64_unchecked();
1017 let size = discr.size().bytes() as usize;
1020 self.memory.write_int(dest, val as i64, size)?;
1022 self.memory.write_uint(dest, val, size)?;
1025 panic!("tried to assign {:?} to Layout::CEnum", kind);
1029 _ => return Err(EvalError::Unimplemented(format!("can't handle destination layout {:?} when assigning {:?}", dest_layout, kind))),
1033 Repeat(ref operand, _) => {
1034 let (elem_size, length) = match dest_ty.sty {
1035 ty::TyArray(elem_ty, n) => (self.type_size(elem_ty), n),
1036 _ => panic!("tried to assign array-repeat to non-array type {:?}", dest_ty),
1039 let src = self.eval_operand(operand)?;
1040 for i in 0..length {
1041 let elem_dest = dest.offset((i * elem_size) as isize);
1042 self.memory.copy(src, elem_dest, elem_size)?;
1046 Len(ref lvalue) => {
1047 let src = self.eval_lvalue(lvalue)?;
1048 let ty = self.lvalue_ty(lvalue);
1049 let len = match ty.sty {
1050 ty::TyArray(_, n) => n as u64,
1051 ty::TySlice(_) => if let LvalueExtra::Length(n) = src.extra {
1054 panic!("Rvalue::Len of a slice given non-slice pointer: {:?}", src);
1056 _ => panic!("Rvalue::Len expected array or slice, got {:?}", ty),
1058 self.memory.write_usize(dest, len)?;
1061 Ref(_, _, ref lvalue) => {
1062 let lv = self.eval_lvalue(lvalue)?;
1063 self.memory.write_ptr(dest, lv.ptr)?;
1065 LvalueExtra::None => {},
1066 LvalueExtra::Length(len) => {
1067 let len_ptr = dest.offset(self.memory.pointer_size as isize);
1068 self.memory.write_usize(len_ptr, len)?;
1070 LvalueExtra::DowncastVariant(..) =>
1071 panic!("attempted to take a reference to an enum downcast lvalue"),
1076 let size = self.type_size(ty);
1077 let ptr = self.memory.allocate(size);
1078 self.memory.write_ptr(dest, ptr)?;
1081 Cast(kind, ref operand, dest_ty) => {
1082 let src = self.eval_operand(operand)?;
1083 let src_ty = self.operand_ty(operand);
1085 use rustc::mir::repr::CastKind::*;
1088 self.move_(src, dest, src_ty)?;
1089 let src_pointee_ty = pointee_type(src_ty).unwrap();
1090 let dest_pointee_ty = pointee_type(dest_ty).unwrap();
1092 match (&src_pointee_ty.sty, &dest_pointee_ty.sty) {
1093 (&ty::TyArray(_, length), &ty::TySlice(_)) => {
1094 let len_ptr = dest.offset(self.memory.pointer_size as isize);
1095 self.memory.write_usize(len_ptr, length as u64)?;
1098 _ => return Err(EvalError::Unimplemented(format!("can't handle cast: {:?}", rvalue))),
1103 // FIXME(solson): Wrong for almost everything.
1104 let size = dest_layout.size(&self.tcx.data_layout).bytes() as usize;
1105 self.memory.copy(src, dest, size)?;
1108 _ => return Err(EvalError::Unimplemented(format!("can't handle cast: {:?}", rvalue))),
1112 Slice { .. } => unimplemented!(),
1113 InlineAsm { .. } => unimplemented!(),
1119 fn nonnull_offset(&self, ty: Ty<'tcx>, nndiscr: u64, discrfield: &[u32]) -> EvalResult<Size> {
1120 // Skip the constant 0 at the start meant for LLVM GEP.
1121 let mut path = discrfield.iter().skip(1).map(|&i| i as usize);
1123 // Handle the field index for the outer non-null variant.
1124 let inner_ty = match ty.sty {
1125 ty::TyEnum(adt_def, substs) => {
1126 let variant = &adt_def.variants[nndiscr as usize];
1127 let index = path.next().unwrap();
1128 let field = &variant.fields[index];
1129 field.ty(self.tcx, substs)
1132 "non-enum for StructWrappedNullablePointer: {}",
1137 self.field_path_offset(inner_ty, path)
1140 fn field_path_offset<I: Iterator<Item = usize>>(&self, mut ty: Ty<'tcx>, path: I) -> EvalResult<Size> {
1141 let mut offset = Size::from_bytes(0);
1143 // Skip the initial 0 intended for LLVM GEP.
1144 for field_index in path {
1145 let field_offset = self.get_field_offset(ty, field_index)?;
1146 ty = self.get_field_ty(ty, field_index)?;
1147 offset = offset.checked_add(field_offset, &self.tcx.data_layout).unwrap();
1153 fn get_field_ty(&self, ty: Ty<'tcx>, field_index: usize) -> EvalResult<Ty<'tcx>> {
1155 ty::TyStruct(adt_def, substs) => {
1156 Ok(adt_def.struct_variant().fields[field_index].ty(self.tcx, substs))
1159 ty::TyRef(_, ty::TypeAndMut { ty, .. }) |
1160 ty::TyRawPtr(ty::TypeAndMut { ty, .. }) |
1162 assert_eq!(field_index, 0);
1165 _ => Err(EvalError::Unimplemented(format!("can't handle type: {:?}", ty))),
1169 fn get_field_offset(&self, ty: Ty<'tcx>, field_index: usize) -> EvalResult<Size> {
1170 let layout = self.type_layout(ty);
1172 use rustc::ty::layout::Layout::*;
1174 Univariant { .. } => {
1175 assert_eq!(field_index, 0);
1176 Ok(Size::from_bytes(0))
1178 FatPointer { .. } => {
1179 let bytes = layout::FAT_PTR_ADDR * self.memory.pointer_size;
1180 Ok(Size::from_bytes(bytes as u64))
1182 _ => Err(EvalError::Unimplemented(format!("can't handle type: {:?}, with layout: {:?}", ty, layout))),
1186 fn eval_operand(&mut self, op: &mir::Operand<'tcx>) -> EvalResult<Pointer> {
1187 use rustc::mir::repr::Operand::*;
1189 Consume(ref lvalue) => Ok(self.eval_lvalue(lvalue)?.to_ptr()),
1190 Constant(mir::Constant { ref literal, .. }) => {
1191 use rustc::mir::repr::Literal::*;
1193 Value { ref value } => Ok(self.const_to_ptr(value)?),
1194 Item { def_id, substs } => {
1195 let item_ty = self.tcx.lookup_item_type(def_id).subst(self.tcx, substs);
1196 if item_ty.ty.is_fn() {
1197 Err(EvalError::Unimplemented("unimplemented: mentions of function items".to_string()))
1199 let cid = ConstantId {
1202 kind: ConstantKind::Static,
1204 Ok(*self.statics.get(&cid).expect("static should have been cached (rvalue)"))
1207 Promoted { index } => {
1208 let cid = ConstantId {
1209 def_id: self.frame().def_id,
1210 substs: self.substs(),
1211 kind: ConstantKind::Promoted(index),
1213 Ok(*self.statics.get(&cid).expect("a promoted constant hasn't been precomputed"))
1220 fn eval_lvalue(&mut self, lvalue: &mir::Lvalue<'tcx>) -> EvalResult<Lvalue> {
1221 use rustc::mir::repr::Lvalue::*;
1222 let ptr = match *lvalue {
1223 ReturnPointer => self.frame().return_ptr
1224 .expect("ReturnPointer used in a function with no return value"),
1225 Arg(i) => self.frame().locals[i as usize],
1226 Var(i) => self.frame().locals[self.frame().var_offset + i as usize],
1227 Temp(i) => self.frame().locals[self.frame().temp_offset + i as usize],
1230 let substs = self.tcx.mk_substs(subst::Substs::empty());
1231 let cid = ConstantId {
1234 kind: ConstantKind::Static,
1236 *self.gecx.statics.get(&cid).expect("static should have been cached (lvalue)")
1239 Projection(ref proj) => {
1240 let base = self.eval_lvalue(&proj.base)?;
1241 let base_ty = self.lvalue_ty(&proj.base);
1242 let base_layout = self.type_layout(base_ty);
1244 use rustc::mir::repr::ProjectionElem::*;
1246 Field(field, _) => {
1247 use rustc::ty::layout::Layout::*;
1248 let variant = match *base_layout {
1249 Univariant { ref variant, .. } => variant,
1250 General { ref variants, .. } => {
1251 if let LvalueExtra::DowncastVariant(variant_idx) = base.extra {
1252 &variants[variant_idx]
1254 panic!("field access on enum had no variant index");
1257 RawNullablePointer { .. } => {
1258 assert_eq!(field.index(), 0);
1261 StructWrappedNullablePointer { ref nonnull, .. } => nonnull,
1262 _ => panic!("field access on non-product type: {:?}", base_layout),
1265 let offset = variant.field_offset(field.index()).bytes();
1266 base.ptr.offset(offset as isize)
1269 Downcast(_, variant) => {
1270 use rustc::ty::layout::Layout::*;
1271 match *base_layout {
1272 General { discr, .. } => {
1274 ptr: base.ptr.offset(discr.size().bytes() as isize),
1275 extra: LvalueExtra::DowncastVariant(variant),
1278 RawNullablePointer { .. } | StructWrappedNullablePointer { .. } => {
1281 _ => panic!("variant downcast on non-aggregate: {:?}", base_layout),
1286 let pointee_ty = pointee_type(base_ty).expect("Deref of non-pointer");
1287 let ptr = self.memory.read_ptr(base.ptr)?;
1288 let extra = match pointee_ty.sty {
1289 ty::TySlice(_) | ty::TyStr => {
1290 let len_ptr = base.ptr.offset(self.memory.pointer_size as isize);
1291 let len = self.memory.read_usize(len_ptr)?;
1292 LvalueExtra::Length(len)
1294 ty::TyTrait(_) => unimplemented!(),
1295 _ => LvalueExtra::None,
1297 return Ok(Lvalue { ptr: ptr, extra: extra });
1300 Index(ref operand) => {
1301 let elem_size = match base_ty.sty {
1302 ty::TyArray(elem_ty, _) |
1303 ty::TySlice(elem_ty) => self.type_size(elem_ty),
1304 _ => panic!("indexing expected an array or slice, got {:?}", base_ty),
1306 let n_ptr = self.eval_operand(operand)?;
1307 let n = self.memory.read_usize(n_ptr)?;
1308 base.ptr.offset(n as isize * elem_size as isize)
1311 ConstantIndex { .. } => unimplemented!(),
1316 Ok(Lvalue { ptr: ptr, extra: LvalueExtra::None })
1319 fn lvalue_ty(&self, lvalue: &mir::Lvalue<'tcx>) -> Ty<'tcx> {
1320 self.monomorphize(self.mir().lvalue_ty(self.tcx, lvalue).to_ty(self.tcx))
1323 fn operand_ty(&self, operand: &mir::Operand<'tcx>) -> Ty<'tcx> {
1324 self.monomorphize(self.mir().operand_ty(self.tcx, operand))
1327 fn monomorphize(&self, ty: Ty<'tcx>) -> Ty<'tcx> {
1328 self.gecx.monomorphize(ty, self.substs())
1331 fn move_(&mut self, src: Pointer, dest: Pointer, ty: Ty<'tcx>) -> EvalResult<()> {
1332 let size = self.type_size(ty);
1333 self.memory.copy(src, dest, size)?;
1334 if self.type_needs_drop(ty) {
1335 self.memory.drop_fill(src, size)?;
1340 fn type_size(&self, ty: Ty<'tcx>) -> usize {
1341 self.gecx.type_size(ty, self.substs())
1344 fn type_layout(&self, ty: Ty<'tcx>) -> &'tcx Layout {
1345 self.gecx.type_layout(ty, self.substs())
1348 pub fn read_primval(&mut self, ptr: Pointer, ty: Ty<'tcx>) -> EvalResult<PrimVal> {
1349 use syntax::ast::{IntTy, UintTy};
1350 let val = match (self.memory.pointer_size, &ty.sty) {
1351 (_, &ty::TyBool) => PrimVal::Bool(self.memory.read_bool(ptr)?),
1352 (_, &ty::TyInt(IntTy::I8)) => PrimVal::I8(self.memory.read_int(ptr, 1)? as i8),
1353 (2, &ty::TyInt(IntTy::Is)) |
1354 (_, &ty::TyInt(IntTy::I16)) => PrimVal::I16(self.memory.read_int(ptr, 2)? as i16),
1355 (4, &ty::TyInt(IntTy::Is)) |
1356 (_, &ty::TyInt(IntTy::I32)) => PrimVal::I32(self.memory.read_int(ptr, 4)? as i32),
1357 (8, &ty::TyInt(IntTy::Is)) |
1358 (_, &ty::TyInt(IntTy::I64)) => PrimVal::I64(self.memory.read_int(ptr, 8)? as i64),
1359 (_, &ty::TyUint(UintTy::U8)) => PrimVal::U8(self.memory.read_uint(ptr, 1)? as u8),
1360 (2, &ty::TyUint(UintTy::Us)) |
1361 (_, &ty::TyUint(UintTy::U16)) => PrimVal::U16(self.memory.read_uint(ptr, 2)? as u16),
1362 (4, &ty::TyUint(UintTy::Us)) |
1363 (_, &ty::TyUint(UintTy::U32)) => PrimVal::U32(self.memory.read_uint(ptr, 4)? as u32),
1364 (8, &ty::TyUint(UintTy::Us)) |
1365 (_, &ty::TyUint(UintTy::U64)) => PrimVal::U64(self.memory.read_uint(ptr, 8)? as u64),
1367 (_, &ty::TyRef(_, ty::TypeAndMut { ty, .. })) |
1368 (_, &ty::TyRawPtr(ty::TypeAndMut { ty, .. })) => {
1369 if self.type_is_sized(ty) {
1370 match self.memory.read_ptr(ptr) {
1371 Ok(p) => PrimVal::AbstractPtr(p),
1372 Err(EvalError::ReadBytesAsPointer) => {
1373 PrimVal::IntegerPtr(self.memory.read_usize(ptr)?)
1375 Err(e) => return Err(e),
1378 return Err(EvalError::Unimplemented(format!("unimplemented: primitive read of fat pointer type: {:?}", ty)));
1382 _ => panic!("primitive read of non-primitive type: {:?}", ty),
1387 fn frame(&self) -> &Frame<'mir, 'tcx> {
1388 self.stack.last().expect("no call frames exist")
1391 fn basic_block(&self) -> &mir::BasicBlockData<'tcx> {
1392 let frame = self.frame();
1393 frame.mir.basic_block_data(frame.next_block)
1396 fn frame_mut(&mut self) -> &mut Frame<'mir, 'tcx> {
1397 self.stack.last_mut().expect("no call frames exist")
1400 fn mir(&self) -> CachedMir<'mir, 'tcx> {
1401 self.frame().mir.clone()
1404 fn substs(&self) -> &'tcx Substs<'tcx> {
1409 fn pointee_type(ptr_ty: ty::Ty) -> Option<ty::Ty> {
1411 ty::TyRef(_, ty::TypeAndMut { ty, .. }) |
1412 ty::TyRawPtr(ty::TypeAndMut { ty, .. }) |
1421 fn to_ptr(self) -> Pointer {
1422 assert_eq!(self.extra, LvalueExtra::None);
1427 impl<'mir, 'tcx: 'mir> Deref for CachedMir<'mir, 'tcx> {
1428 type Target = mir::Mir<'tcx>;
1429 fn deref(&self) -> &mir::Mir<'tcx> {
1431 CachedMir::Ref(r) => r,
1432 CachedMir::Owned(ref rc) => rc,
1438 pub struct ImplMethod<'tcx> {
1439 pub method: Rc<ty::Method<'tcx>>,
1440 pub substs: &'tcx Substs<'tcx>,
1441 pub is_provided: bool,
1444 /// Locates the applicable definition of a method, given its name.
1445 pub fn get_impl_method<'a, 'tcx>(
1446 tcx: TyCtxt<'a, 'tcx, 'tcx>,
1448 substs: &'tcx Substs<'tcx>,
1450 ) -> ImplMethod<'tcx> {
1451 assert!(!substs.types.needs_infer());
1453 let trait_def_id = tcx.trait_id_of_impl(impl_def_id).unwrap();
1454 let trait_def = tcx.lookup_trait_def(trait_def_id);
1456 match trait_def.ancestors(impl_def_id).fn_defs(tcx, name).next() {
1457 Some(node_item) => {
1458 let substs = tcx.normalizing_infer_ctxt(ProjectionMode::Any).enter(|infcx| {
1459 let substs = traits::translate_substs(&infcx, impl_def_id,
1460 substs, node_item.node);
1461 tcx.lift(&substs).unwrap_or_else(|| {
1462 bug!("trans::meth::get_impl_method: translate_substs \
1463 returned {:?} which contains inference types/regions",
1468 method: node_item.item,
1470 is_provided: node_item.node.is_from_trait(),
1474 bug!("method {:?} not found in {:?}", name, impl_def_id)
1479 pub fn interpret_start_points<'a, 'tcx>(
1480 tcx: TyCtxt<'a, 'tcx, 'tcx>,
1481 mir_map: &MirMap<'tcx>,
1483 let initial_indentation = ::log_settings::settings().indentation;
1484 for (&id, mir) in &mir_map.map {
1485 for attr in tcx.map.attrs(id) {
1486 use syntax::attr::AttrMetaMethods;
1487 if attr.check_name("miri_run") {
1488 let item = tcx.map.expect_item(id);
1490 ::log_settings::settings().indentation = initial_indentation;
1492 debug!("Interpreting: {}", item.name);
1494 let mut gecx = GlobalEvalContext::new(tcx, mir_map);
1495 match gecx.call(mir, tcx.map.local_def_id(id)) {
1496 Ok(Some(return_ptr)) => if log_enabled!(::log::LogLevel::Debug) {
1497 gecx.memory.dump(return_ptr.alloc_id);
1499 Ok(None) => warn!("diverging function returned"),
1501 // TODO(solson): Detect whether the error was already reported or not.
1502 // tcx.sess.err(&e.to_string());
1510 // TODO(solson): Upstream these methods into rustc::ty::layout.
1513 fn size(self) -> Size;
1516 impl IntegerExt for layout::Integer {
1517 fn size(self) -> Size {
1518 use rustc::ty::layout::Integer::*;
1520 I1 | I8 => Size::from_bits(8),
1521 I16 => Size::from_bits(16),
1522 I32 => Size::from_bits(32),
1523 I64 => Size::from_bits(64),
1529 fn field_offset(&self, index: usize) -> Size;
1532 impl StructExt for layout::Struct {
1533 fn field_offset(&self, index: usize) -> Size {
1537 self.offset_after_field[index - 1]