1 // Copyright 2018 The Rust Project Developers. See the COPYRIGHT
2 // file at the top-level directory of this distribution and at
3 // http://rust-lang.org/COPYRIGHT.
5 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
6 // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
7 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
8 // option. This file may not be copied, modified, or distributed
9 // except according to those terms.
11 //! The memory subsystem.
13 //! Generally, we use `Pointer` to denote memory addresses. However, some operations
14 //! have a "size"-like parameter, and they take `Scalar` for the address because
15 //! if the size is 0, then the pointer can also be a (properly aligned, non-NULL)
16 //! integer. It is crucial that these operations call `check_align` *before*
17 //! short-circuiting the empty case!
19 use std::collections::VecDeque;
23 use rustc::ty::{self, Instance, ParamEnv, query::TyCtxtAt};
24 use rustc::ty::layout::{Align, TargetDataLayout, Size, HasDataLayout};
25 pub use rustc::mir::interpret::{truncate, write_target_uint, read_target_uint};
26 use rustc_data_structures::fx::{FxHashSet, FxHashMap};
28 use syntax::ast::Mutability;
31 Pointer, AllocId, Allocation, GlobalId, AllocationExtra,
32 EvalResult, Scalar, EvalErrorKind, AllocType, PointerArithmetic,
33 Machine, AllocMap, MayLeak, ErrorHandled, InboundsCheck,
36 #[derive(Debug, PartialEq, Eq, Copy, Clone, Hash)]
37 pub enum MemoryKind<T> {
38 /// Error if deallocated except during a stack pop
40 /// Error if ever deallocated
42 /// Additional memory kinds a machine wishes to distinguish from the builtin ones
46 impl<T: MayLeak> MayLeak for MemoryKind<T> {
48 fn may_leak(self) -> bool {
50 MemoryKind::Stack => false,
51 MemoryKind::Vtable => true,
52 MemoryKind::Machine(k) => k.may_leak()
57 // `Memory` has to depend on the `Machine` because some of its operations
58 // (e.g. `get`) call a `Machine` hook.
59 pub struct Memory<'a, 'mir, 'tcx: 'a + 'mir, M: Machine<'a, 'mir, 'tcx>> {
60 /// Allocations local to this instance of the miri engine. The kind
61 /// helps ensure that the same mechanism is used for allocation and
62 /// deallocation. When an allocation is not found here, it is a
63 /// static and looked up in the `tcx` for read access. Some machines may
64 /// have to mutate this map even on a read-only access to a static (because
65 /// they do pointer provenance tracking and the allocations in `tcx` have
66 /// the wrong type), so we let the machine override this type.
67 /// Either way, if the machine allows writing to a static, doing so will
68 /// create a copy of the static allocation here.
69 alloc_map: M::MemoryMap,
71 /// To be able to compare pointers with NULL, and to check alignment for accesses
72 /// to ZSTs (where pointers may dangle), we keep track of the size even for allocations
73 /// that do not exist any more.
74 dead_alloc_map: FxHashMap<AllocId, (Size, Align)>,
76 /// Lets us implement `HasDataLayout`, which is awfully convenient.
77 pub(super) tcx: TyCtxtAt<'a, 'tcx, 'tcx>,
80 impl<'a, 'mir, 'tcx, M: Machine<'a, 'mir, 'tcx>> HasDataLayout
81 for Memory<'a, 'mir, 'tcx, M>
84 fn data_layout(&self) -> &TargetDataLayout {
89 // FIXME: Really we shouldn't clone memory, ever. Snapshot machinery should instead
90 // carefully copy only the reachable parts.
91 impl<'a, 'mir, 'tcx: 'a + 'mir, M: Machine<'a, 'mir, 'tcx>>
92 Clone for Memory<'a, 'mir, 'tcx, M>
94 fn clone(&self) -> Self {
96 alloc_map: self.alloc_map.clone(),
97 dead_alloc_map: self.dead_alloc_map.clone(),
103 impl<'a, 'mir, 'tcx, M: Machine<'a, 'mir, 'tcx>> Memory<'a, 'mir, 'tcx, M> {
104 pub fn new(tcx: TyCtxtAt<'a, 'tcx, 'tcx>) -> Self {
106 alloc_map: Default::default(),
107 dead_alloc_map: FxHashMap::default(),
112 pub fn create_fn_alloc(&mut self, instance: Instance<'tcx>) -> Pointer {
113 Pointer::from(self.tcx.alloc_map.lock().create_fn_alloc(instance))
116 pub fn allocate_static_bytes(&mut self, bytes: &[u8]) -> Pointer {
117 Pointer::from(self.tcx.allocate_bytes(bytes))
120 pub fn allocate_with(
122 alloc: Allocation<M::PointerTag, M::AllocExtra>,
123 kind: MemoryKind<M::MemoryKinds>,
124 ) -> EvalResult<'tcx, AllocId> {
125 let id = self.tcx.alloc_map.lock().reserve();
126 self.alloc_map.insert(id, (kind, alloc));
134 kind: MemoryKind<M::MemoryKinds>,
135 ) -> EvalResult<'tcx, Pointer> {
136 Ok(Pointer::from(self.allocate_with(Allocation::undef(size, align), kind)?))
141 ptr: Pointer<M::PointerTag>,
146 kind: MemoryKind<M::MemoryKinds>,
147 ) -> EvalResult<'tcx, Pointer> {
148 if ptr.offset.bytes() != 0 {
149 return err!(ReallocateNonBasePtr);
152 // For simplicities' sake, we implement reallocate as "alloc, copy, dealloc".
153 // This happens so rarely, the perf advantage is outweighed by the maintenance cost.
154 let new_ptr = self.allocate(new_size, new_align, kind)?;
158 new_ptr.with_default_tag().into(),
160 old_size.min(new_size),
161 /*nonoverlapping*/ true,
163 self.deallocate(ptr, Some((old_size, old_align)), kind)?;
168 /// Deallocate a local, or do nothing if that local has been made into a static
169 pub fn deallocate_local(&mut self, ptr: Pointer<M::PointerTag>) -> EvalResult<'tcx> {
170 // The allocation might be already removed by static interning.
171 // This can only really happen in the CTFE instance, not in miri.
172 if self.alloc_map.contains_key(&ptr.alloc_id) {
173 self.deallocate(ptr, None, MemoryKind::Stack)
181 ptr: Pointer<M::PointerTag>,
182 size_and_align: Option<(Size, Align)>,
183 kind: MemoryKind<M::MemoryKinds>,
184 ) -> EvalResult<'tcx> {
185 trace!("deallocating: {}", ptr.alloc_id);
187 if ptr.offset.bytes() != 0 {
188 return err!(DeallocateNonBasePtr);
191 let (alloc_kind, mut alloc) = match self.alloc_map.remove(&ptr.alloc_id) {
192 Some(alloc) => alloc,
194 // Deallocating static memory -- always an error
195 return match self.tcx.alloc_map.lock().get(ptr.alloc_id) {
196 Some(AllocType::Function(..)) => err!(DeallocatedWrongMemoryKind(
197 "function".to_string(),
198 format!("{:?}", kind),
200 Some(AllocType::Static(..)) |
201 Some(AllocType::Memory(..)) => err!(DeallocatedWrongMemoryKind(
202 "static".to_string(),
203 format!("{:?}", kind),
205 None => err!(DoubleFree)
210 if alloc_kind != kind {
211 return err!(DeallocatedWrongMemoryKind(
212 format!("{:?}", alloc_kind),
213 format!("{:?}", kind),
216 if let Some((size, align)) = size_and_align {
217 if size.bytes() != alloc.bytes.len() as u64 || align != alloc.align {
218 let bytes = Size::from_bytes(alloc.bytes.len() as u64);
219 return err!(IncorrectAllocationInformation(size,
226 // Let the machine take some extra action
227 let size = Size::from_bytes(alloc.bytes.len() as u64);
228 AllocationExtra::memory_deallocated(&mut alloc, ptr, size)?;
230 // Don't forget to remember size and align of this now-dead allocation
231 let old = self.dead_alloc_map.insert(
233 (Size::from_bytes(alloc.bytes.len() as u64), alloc.align)
236 bug!("Nothing can be deallocated twice");
242 /// Check that the pointer is aligned AND non-NULL. This supports ZSTs in two ways:
243 /// You can pass a scalar, and a `Pointer` does not have to actually still be allocated.
246 ptr: Scalar<M::PointerTag>,
247 required_align: Align
248 ) -> EvalResult<'tcx> {
249 // Check non-NULL/Undef, extract offset
250 let (offset, alloc_align) = match ptr {
251 Scalar::Ptr(ptr) => {
252 // check this is not NULL -- which we can ensure only if this is in-bounds
253 // of some (potentially dead) allocation.
254 let align = self.check_bounds_ptr_maybe_dead(ptr)?;
255 (ptr.offset.bytes(), align)
257 Scalar::Bits { bits, size } => {
258 assert_eq!(size as u64, self.pointer_size().bytes());
259 assert!(bits < (1u128 << self.pointer_size().bits()));
260 // check this is not NULL
262 return err!(InvalidNullPointerUsage);
264 // the "base address" is 0 and hence always aligned
265 (bits as u64, required_align)
269 if alloc_align.bytes() < required_align.bytes() {
270 return err!(AlignmentCheckFailed {
272 required: required_align,
275 if offset % required_align.bytes() == 0 {
278 let has = offset % required_align.bytes();
279 err!(AlignmentCheckFailed {
280 has: Align::from_bytes(has).unwrap(),
281 required: required_align,
286 /// Check if the pointer is "in-bounds". Notice that a pointer pointing at the end
287 /// of an allocation (i.e., at the first *inaccessible* location) *is* considered
288 /// in-bounds! This follows C's/LLVM's rules.
289 /// This function also works for deallocated allocations.
290 /// Use `.get(ptr.alloc_id)?.check_bounds_ptr(ptr)` if you want to force the allocation
291 /// to still be live.
292 /// If you want to check bounds before doing a memory access, better first obtain
293 /// an `Allocation` and call `check_bounds`.
294 pub fn check_bounds_ptr_maybe_dead(
296 ptr: Pointer<M::PointerTag>,
297 ) -> EvalResult<'tcx, Align> {
298 let (allocation_size, align) = self.get_size_and_align(ptr.alloc_id);
299 ptr.check_in_alloc(allocation_size, InboundsCheck::MaybeDead)?;
304 /// Allocation accessors
305 impl<'a, 'mir, 'tcx, M: Machine<'a, 'mir, 'tcx>> Memory<'a, 'mir, 'tcx, M> {
306 /// Helper function to obtain the global (tcx) allocation for a static.
307 /// This attempts to return a reference to an existing allocation if
308 /// one can be found in `tcx`. That, however, is only possible if `tcx` and
309 /// this machine use the same pointer tag, so it is indirected through
310 /// `M::static_with_default_tag`.
312 tcx: TyCtxtAt<'a, 'tcx, 'tcx>,
314 ) -> EvalResult<'tcx, Cow<'tcx, Allocation<M::PointerTag, M::AllocExtra>>> {
315 let alloc = tcx.alloc_map.lock().get(id);
316 let def_id = match alloc {
317 Some(AllocType::Memory(mem)) => {
318 // We got tcx memory. Let the machine figure out whether and how to
319 // turn that into memory with the right pointer tag.
320 return Ok(M::adjust_static_allocation(mem))
322 Some(AllocType::Function(..)) => {
323 return err!(DerefFunctionPointer)
325 Some(AllocType::Static(did)) => {
329 return err!(DanglingPointerDeref),
331 // We got a "lazy" static that has not been computed yet, do some work
332 trace!("static_alloc: Need to compute {:?}", def_id);
333 if tcx.is_foreign_item(def_id) {
334 return M::find_foreign_static(tcx, def_id);
336 let instance = Instance::mono(tcx.tcx, def_id);
341 // use the raw query here to break validation cycles. Later uses of the static will call the
343 tcx.const_eval_raw(ty::ParamEnv::reveal_all().and(gid)).map_err(|err| {
344 // no need to report anything, the const_eval call takes care of that for statics
345 assert!(tcx.is_static(def_id).is_some());
347 ErrorHandled::Reported => EvalErrorKind::ReferencedConstant.into(),
348 ErrorHandled::TooGeneric => EvalErrorKind::TooGeneric.into(),
351 let allocation = tcx.alloc_map.lock().unwrap_memory(raw_const.alloc_id);
352 // We got tcx memory. Let the machine figure out whether and how to
353 // turn that into memory with the right pointer tag.
354 M::adjust_static_allocation(allocation)
358 pub fn get(&self, id: AllocId) -> EvalResult<'tcx, &Allocation<M::PointerTag, M::AllocExtra>> {
359 // The error type of the inner closure here is somewhat funny. We have two
360 // ways of "erroring": An actual error, or because we got a reference from
361 // `get_static_alloc` that we can actually use directly without inserting anything anywhere.
362 // So the error type is `EvalResult<'tcx, &Allocation<M::PointerTag>>`.
363 let a = self.alloc_map.get_or(id, || {
364 let alloc = Self::get_static_alloc(self.tcx, id).map_err(Err)?;
366 Cow::Borrowed(alloc) => {
367 // We got a ref, cheaply return that as an "error" so that the
368 // map does not get mutated.
371 Cow::Owned(alloc) => {
372 // Need to put it into the map and return a ref to that
373 let kind = M::STATIC_KIND.expect(
374 "I got an owned allocation that I have to copy but the machine does \
375 not expect that to happen"
377 Ok((MemoryKind::Machine(kind), alloc))
381 // Now unpack that funny error type
391 ) -> EvalResult<'tcx, &mut Allocation<M::PointerTag, M::AllocExtra>> {
393 let a = self.alloc_map.get_mut_or(id, || {
394 // Need to make a copy, even if `get_static_alloc` is able
395 // to give us a cheap reference.
396 let alloc = Self::get_static_alloc(tcx, id)?;
397 if alloc.mutability == Mutability::Immutable {
398 return err!(ModifiedConstantMemory);
400 let kind = M::STATIC_KIND.expect(
401 "An allocation is being mutated but the machine does not expect that to happen"
403 Ok((MemoryKind::Machine(kind), alloc.into_owned()))
405 // Unpack the error type manually because type inference doesn't
406 // work otherwise (and we cannot help it because `impl Trait`)
411 if a.mutability == Mutability::Immutable {
412 return err!(ModifiedConstantMemory);
419 pub fn get_size_and_align(&self, id: AllocId) -> (Size, Align) {
420 if let Ok(alloc) = self.get(id) {
421 return (Size::from_bytes(alloc.bytes.len() as u64), alloc.align);
423 // Could also be a fn ptr or extern static
424 match self.tcx.alloc_map.lock().get(id) {
425 Some(AllocType::Function(..)) => (Size::ZERO, Align::from_bytes(1).unwrap()),
426 Some(AllocType::Static(did)) => {
427 // The only way `get` couldn't have worked here is if this is an extern static
428 assert!(self.tcx.is_foreign_item(did));
429 // Use size and align of the type
430 let ty = self.tcx.type_of(did);
431 let layout = self.tcx.layout_of(ParamEnv::empty().and(ty)).unwrap();
432 (layout.size, layout.align.abi)
435 // Must be a deallocated pointer
436 *self.dead_alloc_map.get(&id).expect(
437 "allocation missing in dead_alloc_map"
443 pub fn get_fn(&self, ptr: Pointer<M::PointerTag>) -> EvalResult<'tcx, Instance<'tcx>> {
444 if ptr.offset.bytes() != 0 {
445 return err!(InvalidFunctionPointer);
447 trace!("reading fn ptr: {}", ptr.alloc_id);
448 match self.tcx.alloc_map.lock().get(ptr.alloc_id) {
449 Some(AllocType::Function(instance)) => Ok(instance),
450 _ => Err(EvalErrorKind::ExecuteMemory.into()),
454 pub fn mark_immutable(&mut self, id: AllocId) -> EvalResult<'tcx> {
455 self.get_mut(id)?.mutability = Mutability::Immutable;
459 /// For debugging, print an allocation and all allocations it points to, recursively.
460 pub fn dump_alloc(&self, id: AllocId) {
461 self.dump_allocs(vec![id]);
464 fn dump_alloc_helper<Tag, Extra>(
466 allocs_seen: &mut FxHashSet<AllocId>,
467 allocs_to_print: &mut VecDeque<AllocId>,
469 alloc: &Allocation<Tag, Extra>,
474 let prefix_len = msg.len();
475 let mut relocations = vec![];
477 for i in 0..(alloc.bytes.len() as u64) {
478 let i = Size::from_bytes(i);
479 if let Some(&(_, target_id)) = alloc.relocations.get(&i) {
480 if allocs_seen.insert(target_id) {
481 allocs_to_print.push_back(target_id);
483 relocations.push((i, target_id));
485 if alloc.undef_mask.is_range_defined(i, i + Size::from_bytes(1)).is_ok() {
486 // this `as usize` is fine, since `i` came from a `usize`
487 write!(msg, "{:02x} ", alloc.bytes[i.bytes() as usize]).unwrap();
494 "{}({} bytes, alignment {}){}",
501 if !relocations.is_empty() {
503 write!(msg, "{:1$}", "", prefix_len).unwrap(); // Print spaces.
504 let mut pos = Size::ZERO;
505 let relocation_width = (self.pointer_size().bytes() - 1) * 3;
506 for (i, target_id) in relocations {
507 // this `as usize` is fine, since we can't print more chars than `usize::MAX`
508 write!(msg, "{:1$}", "", ((i - pos) * 3).bytes() as usize).unwrap();
509 let target = format!("({})", target_id);
510 // this `as usize` is fine, since we can't print more chars than `usize::MAX`
511 write!(msg, "└{0:─^1$}┘ ", target, relocation_width as usize).unwrap();
512 pos = i + self.pointer_size();
518 /// For debugging, print a list of allocations and all allocations they point to, recursively.
519 pub fn dump_allocs(&self, mut allocs: Vec<AllocId>) {
520 if !log_enabled!(::log::Level::Trace) {
525 let mut allocs_to_print = VecDeque::from(allocs);
526 let mut allocs_seen = FxHashSet::default();
528 while let Some(id) = allocs_to_print.pop_front() {
529 let msg = format!("Alloc {:<5} ", format!("{}:", id));
532 match self.alloc_map.get_or(id, || Err(())) {
533 Ok((kind, alloc)) => {
534 let extra = match kind {
535 MemoryKind::Stack => " (stack)".to_owned(),
536 MemoryKind::Vtable => " (vtable)".to_owned(),
537 MemoryKind::Machine(m) => format!(" ({:?})", m),
539 self.dump_alloc_helper(
540 &mut allocs_seen, &mut allocs_to_print,
546 match self.tcx.alloc_map.lock().get(id) {
547 Some(AllocType::Memory(alloc)) => {
548 self.dump_alloc_helper(
549 &mut allocs_seen, &mut allocs_to_print,
550 msg, alloc, " (immutable)".to_owned()
553 Some(AllocType::Function(func)) => {
554 trace!("{} {}", msg, func);
556 Some(AllocType::Static(did)) => {
557 trace!("{} {:?}", msg, did);
560 trace!("{} (deallocated)", msg);
569 pub fn leak_report(&self) -> usize {
570 trace!("### LEAK REPORT ###");
571 let leaks: Vec<_> = self.alloc_map.filter_map_collect(|&id, &(kind, _)| {
572 if kind.may_leak() { None } else { Some(id) }
575 self.dump_allocs(leaks);
579 /// This is used by [priroda](https://github.com/oli-obk/priroda)
580 pub fn alloc_map(&self) -> &M::MemoryMap {
586 impl<'a, 'mir, 'tcx, M: Machine<'a, 'mir, 'tcx>> Memory<'a, 'mir, 'tcx, M> {
589 ptr: Scalar<M::PointerTag>,
591 ) -> EvalResult<'tcx, &[u8]> {
592 if size.bytes() == 0 {
595 let ptr = ptr.to_ptr()?;
596 self.get(ptr.alloc_id)?.get_bytes(self, ptr, size)
601 /// Interning (for CTFE)
602 impl<'a, 'mir, 'tcx, M> Memory<'a, 'mir, 'tcx, M>
604 M: Machine<'a, 'mir, 'tcx, PointerTag=(), AllocExtra=()>,
605 M::MemoryMap: AllocMap<AllocId, (MemoryKind<M::MemoryKinds>, Allocation)>,
607 /// mark an allocation as static and initialized, either mutable or not
608 pub fn intern_static(
611 mutability: Mutability,
612 ) -> EvalResult<'tcx> {
614 "mark_static_initialized {:?}, mutability: {:?}",
619 let (kind, mut alloc) = self.alloc_map.remove(&alloc_id).unwrap();
621 MemoryKind::Machine(_) => bug!("Static cannot refer to machine memory"),
622 MemoryKind::Stack | MemoryKind::Vtable => {},
624 // ensure llvm knows not to put this into immutable memory
625 alloc.mutability = mutability;
626 let alloc = self.tcx.intern_const_alloc(alloc);
627 self.tcx.alloc_map.lock().set_id_memory(alloc_id, alloc);
628 // recurse into inner allocations
629 for &(_, alloc) in alloc.relocations.values() {
630 // FIXME: Reusing the mutability here is likely incorrect. It is originally
631 // determined via `is_freeze`, and data is considered frozen if there is no
632 // `UnsafeCell` *immediately* in that data -- however, this search stops
633 // at references. So whenever we follow a reference, we should likely
634 // assume immutability -- and we should make sure that the compiler
635 // does not permit code that would break this!
636 if self.alloc_map.contains_key(&alloc) {
637 // Not yet interned, so proceed recursively
638 self.intern_static(alloc, mutability)?;
639 } else if self.dead_alloc_map.contains_key(&alloc) {
641 return err!(ValidationFailure(
642 "encountered dangling pointer in final constant".into(),
650 /// Reading and writing
651 impl<'a, 'mir, 'tcx, M: Machine<'a, 'mir, 'tcx>> Memory<'a, 'mir, 'tcx, M> {
654 src: Scalar<M::PointerTag>,
656 dest: Scalar<M::PointerTag>,
659 nonoverlapping: bool,
660 ) -> EvalResult<'tcx> {
661 self.copy_repeatedly(src, src_align, dest, dest_align, size, 1, nonoverlapping)
664 pub fn copy_repeatedly(
666 src: Scalar<M::PointerTag>,
668 dest: Scalar<M::PointerTag>,
672 nonoverlapping: bool,
673 ) -> EvalResult<'tcx> {
674 self.check_align(src, src_align)?;
675 self.check_align(dest, dest_align)?;
676 if size.bytes() == 0 {
677 // Nothing to do for ZST, other than checking alignment and
678 // non-NULLness which already happened.
681 let src = src.to_ptr()?;
682 let dest = dest.to_ptr()?;
684 // first copy the relocations to a temporary buffer, because
685 // `get_bytes_mut` will clear the relocations, which is correct,
686 // since we don't want to keep any relocations at the target.
687 // (`get_bytes_with_undef_and_ptr` below checks that there are no
688 // relocations overlapping the edges; those would not be handled correctly).
690 let relocations = self.get(src.alloc_id)?.relocations(self, src, size);
691 let mut new_relocations = Vec::with_capacity(relocations.len() * (length as usize));
693 new_relocations.extend(
696 .map(|&(offset, reloc)| {
697 (offset + dest.offset - src.offset + (i * size * relocations.len() as u64),
706 let tcx = self.tcx.tcx;
708 // This checks relocation edges on the src.
709 let src_bytes = self.get(src.alloc_id)?
710 .get_bytes_with_undef_and_ptr(&tcx, src, size)?
712 let dest_bytes = self.get_mut(dest.alloc_id)?
713 .get_bytes_mut(&tcx, dest, size * length)?
716 // SAFE: The above indexing would have panicked if there weren't at least `size` bytes
717 // behind `src` and `dest`. Also, we use the overlapping-safe `ptr::copy` if `src` and
718 // `dest` could possibly overlap.
719 // The pointers above remain valid even if the `HashMap` table is moved around because they
720 // point into the `Vec` storing the bytes.
722 assert_eq!(size.bytes() as usize as u64, size.bytes());
723 if src.alloc_id == dest.alloc_id {
725 if (src.offset <= dest.offset && src.offset + size > dest.offset) ||
726 (dest.offset <= src.offset && dest.offset + size > src.offset)
728 return err!(Intrinsic(
729 "copy_nonoverlapping called on overlapping ranges".to_string(),
736 dest_bytes.offset((size.bytes() * i) as isize),
737 size.bytes() as usize);
741 ptr::copy_nonoverlapping(src_bytes,
742 dest_bytes.offset((size.bytes() * i) as isize),
743 size.bytes() as usize);
748 // copy definedness to the destination
749 self.copy_undef_mask(src, dest, size, length)?;
750 // copy the relocations to the destination
751 self.get_mut(dest.alloc_id)?.relocations.insert_presorted(relocations);
758 impl<'a, 'mir, 'tcx, M: Machine<'a, 'mir, 'tcx>> Memory<'a, 'mir, 'tcx, M> {
759 // FIXME: Add a fast version for the common, nonoverlapping case
762 src: Pointer<M::PointerTag>,
763 dest: Pointer<M::PointerTag>,
766 ) -> EvalResult<'tcx> {
767 // The bits have to be saved locally before writing to dest in case src and dest overlap.
768 assert_eq!(size.bytes() as usize as u64, size.bytes());
770 let undef_mask = self.get(src.alloc_id)?.undef_mask.clone();
771 let dest_allocation = self.get_mut(dest.alloc_id)?;
773 for i in 0..size.bytes() {
774 let defined = undef_mask.get(src.offset + Size::from_bytes(i));
777 dest_allocation.undef_mask.set(
778 dest.offset + Size::from_bytes(i + (size.bytes() * j)),