2020-04-02 16:09:20 -05:00
|
|
|
use std::convert::{TryFrom, TryInto};
|
2020-03-28 09:43:47 -05:00
|
|
|
use std::mem;
|
2020-04-17 07:19:26 -05:00
|
|
|
use std::num::NonZeroUsize;
|
2020-09-06 17:08:41 -05:00
|
|
|
use std::time::Duration;
|
2020-03-23 13:57:40 -05:00
|
|
|
|
2020-03-30 04:07:32 -05:00
|
|
|
use log::trace;
|
|
|
|
|
2020-03-01 03:26:24 -06:00
|
|
|
use rustc_hir::def_id::{DefId, CRATE_DEF_INDEX};
|
2021-05-16 04:28:01 -05:00
|
|
|
use rustc_middle::mir;
|
2021-09-06 10:05:48 -05:00
|
|
|
use rustc_middle::ty::{
|
|
|
|
self,
|
|
|
|
layout::{LayoutOf, TyAndLayout},
|
|
|
|
List, TyCtxt,
|
|
|
|
};
|
2021-06-06 02:25:16 -05:00
|
|
|
use rustc_span::Symbol;
|
2021-09-06 10:05:48 -05:00
|
|
|
use rustc_target::abi::{Align, FieldsShape, Size, Variants};
|
2021-01-21 20:45:39 -06:00
|
|
|
use rustc_target::spec::abi::Abi;
|
2018-10-19 02:51:04 -05:00
|
|
|
|
2019-06-30 16:28:24 -05:00
|
|
|
use rand::RngCore;
|
|
|
|
|
2018-11-01 02:56:41 -05:00
|
|
|
use crate::*;
|
2018-10-19 02:51:04 -05:00
|
|
|
|
2020-04-01 18:55:52 -05:00
|
|
|
impl<'mir, 'tcx: 'mir> EvalContextExt<'mir, 'tcx> for crate::MiriEvalContext<'mir, 'tcx> {}
|
2019-02-15 19:29:38 -06:00
|
|
|
|
2019-04-14 20:02:55 -05:00
|
|
|
/// Gets an instance for a path.
|
2020-03-09 03:38:33 -05:00
|
|
|
fn try_resolve_did<'mir, 'tcx>(tcx: TyCtxt<'tcx>, path: &[&str]) -> Option<DefId> {
|
2021-07-02 03:08:27 -05:00
|
|
|
tcx.crates(()).iter().find(|&&krate| tcx.crate_name(krate).as_str() == path[0]).and_then(
|
2021-05-16 04:28:01 -05:00
|
|
|
|krate| {
|
2019-12-23 05:56:23 -06:00
|
|
|
let krate = DefId { krate: *krate, index: CRATE_DEF_INDEX };
|
2022-01-09 07:50:03 -06:00
|
|
|
let mut items = tcx.module_children(krate);
|
2019-04-14 20:02:55 -05:00
|
|
|
let mut path_it = path.iter().skip(1).peekable();
|
2018-10-19 02:51:04 -05:00
|
|
|
|
2019-04-14 20:02:55 -05:00
|
|
|
while let Some(segment) = path_it.next() {
|
|
|
|
for item in mem::replace(&mut items, Default::default()).iter() {
|
|
|
|
if item.ident.name.as_str() == *segment {
|
|
|
|
if path_it.peek().is_none() {
|
2019-12-23 05:56:23 -06:00
|
|
|
return Some(item.res.def_id());
|
2018-10-19 02:51:04 -05:00
|
|
|
}
|
2019-04-14 20:02:55 -05:00
|
|
|
|
2022-01-09 07:50:03 -06:00
|
|
|
items = tcx.module_children(item.res.def_id());
|
2019-04-14 20:02:55 -05:00
|
|
|
break;
|
2018-10-19 02:51:04 -05:00
|
|
|
}
|
|
|
|
}
|
2019-04-14 20:02:55 -05:00
|
|
|
}
|
|
|
|
None
|
2021-05-16 04:28:01 -05:00
|
|
|
},
|
|
|
|
)
|
2019-04-14 20:02:55 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
pub trait EvalContextExt<'mir, 'tcx: 'mir>: crate::MiriEvalContextExt<'mir, 'tcx> {
|
2019-11-19 07:51:08 -06:00
|
|
|
/// Gets an instance for a path.
|
2020-03-09 03:38:33 -05:00
|
|
|
fn resolve_path(&self, path: &[&str]) -> ty::Instance<'tcx> {
|
|
|
|
let did = try_resolve_did(self.eval_context_ref().tcx.tcx, path)
|
|
|
|
.unwrap_or_else(|| panic!("failed to find required Rust item: {:?}", path));
|
|
|
|
ty::Instance::mono(self.eval_context_ref().tcx.tcx, did)
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Evaluates the scalar at the specified path. Returns Some(val)
|
|
|
|
/// if the path could be resolved, and None otherwise
|
2021-07-15 13:33:08 -05:00
|
|
|
fn eval_path_scalar(&mut self, path: &[&str]) -> InterpResult<'tcx, Scalar<Tag>> {
|
2020-03-09 03:38:33 -05:00
|
|
|
let this = self.eval_context_mut();
|
|
|
|
let instance = this.resolve_path(path);
|
|
|
|
let cid = GlobalId { instance, promoted: None };
|
2020-09-20 06:13:57 -05:00
|
|
|
let const_val = this.eval_to_allocation(cid)?;
|
2021-02-19 18:00:00 -06:00
|
|
|
let const_val = this.read_scalar(&const_val.into())?;
|
2021-07-15 13:33:08 -05:00
|
|
|
return Ok(const_val.check_init()?);
|
2020-03-09 03:38:33 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
/// Helper function to get a `libc` constant as a `Scalar`.
|
|
|
|
fn eval_libc(&mut self, name: &str) -> InterpResult<'tcx, Scalar<Tag>> {
|
2021-07-15 13:33:08 -05:00
|
|
|
self.eval_context_mut().eval_path_scalar(&["libc", name])
|
2020-03-09 03:38:33 -05:00
|
|
|
}
|
|
|
|
|
2020-03-31 10:26:32 -05:00
|
|
|
/// Helper function to get a `libc` constant as an `i32`.
|
|
|
|
fn eval_libc_i32(&mut self, name: &str) -> InterpResult<'tcx, i32> {
|
|
|
|
// TODO: Cache the result.
|
|
|
|
self.eval_libc(name)?.to_i32()
|
|
|
|
}
|
|
|
|
|
2020-03-28 13:42:22 -05:00
|
|
|
/// Helper function to get a `windows` constant as a `Scalar`.
|
2020-03-31 10:26:32 -05:00
|
|
|
fn eval_windows(&mut self, module: &str, name: &str) -> InterpResult<'tcx, Scalar<Tag>> {
|
2021-07-15 13:33:08 -05:00
|
|
|
self.eval_context_mut().eval_path_scalar(&["std", "sys", "windows", module, name])
|
2020-03-28 13:42:22 -05:00
|
|
|
}
|
|
|
|
|
2021-08-22 11:07:01 -05:00
|
|
|
/// Helper function to get a `windows` constant as a `u64`.
|
2020-03-31 10:26:32 -05:00
|
|
|
fn eval_windows_u64(&mut self, module: &str, name: &str) -> InterpResult<'tcx, u64> {
|
2020-03-26 05:41:31 -05:00
|
|
|
// TODO: Cache the result.
|
2020-03-31 10:26:32 -05:00
|
|
|
self.eval_windows(module, name)?.to_u64()
|
2020-03-09 03:38:33 -05:00
|
|
|
}
|
|
|
|
|
2020-03-30 03:23:04 -05:00
|
|
|
/// Helper function to get the `TyAndLayout` of a `libc` type
|
|
|
|
fn libc_ty_layout(&mut self, name: &str) -> InterpResult<'tcx, TyAndLayout<'tcx>> {
|
2020-03-09 03:38:33 -05:00
|
|
|
let this = self.eval_context_mut();
|
2020-07-23 03:40:13 -05:00
|
|
|
let ty = this.resolve_path(&["libc", name]).ty(*this.tcx, ty::ParamEnv::reveal_all());
|
2020-03-09 03:38:33 -05:00
|
|
|
this.layout_of(ty)
|
2018-10-19 02:51:04 -05:00
|
|
|
}
|
2018-11-05 09:05:17 -06:00
|
|
|
|
2020-03-31 10:26:32 -05:00
|
|
|
/// Helper function to get the `TyAndLayout` of a `windows` type
|
|
|
|
fn windows_ty_layout(&mut self, name: &str) -> InterpResult<'tcx, TyAndLayout<'tcx>> {
|
|
|
|
let this = self.eval_context_mut();
|
2021-05-16 04:28:01 -05:00
|
|
|
let ty = this
|
|
|
|
.resolve_path(&["std", "sys", "windows", "c", name])
|
|
|
|
.ty(*this.tcx, ty::ParamEnv::reveal_all());
|
2020-03-31 10:26:32 -05:00
|
|
|
this.layout_of(ty)
|
|
|
|
}
|
|
|
|
|
2019-07-05 02:56:42 -05:00
|
|
|
/// Write a 0 of the appropriate size to `dest`.
|
2021-02-19 18:00:00 -06:00
|
|
|
fn write_null(&mut self, dest: &PlaceTy<'tcx, Tag>) -> InterpResult<'tcx> {
|
2019-07-05 02:56:42 -05:00
|
|
|
self.eval_context_mut().write_scalar(Scalar::from_int(0, dest.layout.size), dest)
|
|
|
|
}
|
|
|
|
|
2021-07-15 13:33:08 -05:00
|
|
|
/// Test if this pointer equals 0.
|
|
|
|
fn ptr_is_null(&self, ptr: Pointer<Option<Tag>>) -> InterpResult<'tcx, bool> {
|
2019-07-05 02:56:42 -05:00
|
|
|
let this = self.eval_context_ref();
|
2020-03-29 03:01:31 -05:00
|
|
|
let null = Scalar::null_ptr(this);
|
2021-07-15 13:33:08 -05:00
|
|
|
this.ptr_eq(Scalar::from_maybe_pointer(ptr, this), null)
|
2019-07-05 02:56:42 -05:00
|
|
|
}
|
|
|
|
|
2019-07-21 04:56:10 -05:00
|
|
|
/// Get the `Place` for a local
|
|
|
|
fn local_place(&mut self, local: mir::Local) -> InterpResult<'tcx, PlaceTy<'tcx, Tag>> {
|
|
|
|
let this = self.eval_context_mut();
|
2020-01-15 12:27:21 -06:00
|
|
|
let place = mir::Place { local: local, projection: List::empty() };
|
2020-04-01 12:40:10 -05:00
|
|
|
this.eval_place(place)
|
2019-07-21 04:56:10 -05:00
|
|
|
}
|
|
|
|
|
2019-06-30 16:28:24 -05:00
|
|
|
/// Generate some random bytes, and write them to `dest`.
|
2021-07-15 13:33:08 -05:00
|
|
|
fn gen_random(&mut self, ptr: Pointer<Option<Tag>>, len: u64) -> InterpResult<'tcx> {
|
2019-08-04 08:21:17 -05:00
|
|
|
// Some programs pass in a null pointer and a length of 0
|
|
|
|
// to their platform's random-generation function (e.g. getrandom())
|
|
|
|
// on Linux. For compatibility with these programs, we don't perform
|
|
|
|
// any additional checks - it's okay if the pointer is invalid,
|
|
|
|
// since we wouldn't actually be writing to it.
|
|
|
|
if len == 0 {
|
2019-08-04 09:13:29 -05:00
|
|
|
return Ok(());
|
2019-08-04 08:21:17 -05:00
|
|
|
}
|
2019-06-30 16:28:24 -05:00
|
|
|
let this = self.eval_context_mut();
|
2019-06-30 16:32:25 -05:00
|
|
|
|
2020-03-17 09:18:53 -05:00
|
|
|
let mut data = vec![0; usize::try_from(len).unwrap()];
|
2019-08-19 10:43:09 -05:00
|
|
|
|
2021-05-14 01:40:07 -05:00
|
|
|
if this.machine.communicate() {
|
2019-08-19 10:43:09 -05:00
|
|
|
// Fill the buffer using the host's rng.
|
2019-08-20 10:47:38 -05:00
|
|
|
getrandom::getrandom(&mut data)
|
2020-03-09 03:38:33 -05:00
|
|
|
.map_err(|err| err_unsup_format!("host getrandom failed: {}", err))?;
|
2019-12-23 05:56:23 -06:00
|
|
|
} else {
|
2019-10-17 21:11:50 -05:00
|
|
|
let rng = this.memory.extra.rng.get_mut();
|
2019-08-19 10:43:09 -05:00
|
|
|
rng.fill_bytes(&mut data);
|
|
|
|
}
|
2019-07-23 14:38:53 -05:00
|
|
|
|
2019-10-22 03:13:11 -05:00
|
|
|
this.memory.write_bytes(ptr, data.iter().copied())
|
2019-06-30 16:28:24 -05:00
|
|
|
}
|
|
|
|
|
2019-11-28 16:42:10 -06:00
|
|
|
/// Call a function: Push the stack frame and pass the arguments.
|
|
|
|
/// For now, arguments must be scalars (so that the caller does not have to know the layout).
|
|
|
|
fn call_function(
|
|
|
|
&mut self,
|
|
|
|
f: ty::Instance<'tcx>,
|
2021-03-14 09:30:37 -05:00
|
|
|
caller_abi: Abi,
|
2019-11-29 04:17:44 -06:00
|
|
|
args: &[Immediate<Tag>],
|
2021-02-19 18:00:00 -06:00
|
|
|
dest: Option<&PlaceTy<'tcx, Tag>>,
|
2019-11-28 16:42:10 -06:00
|
|
|
stack_pop: StackPopCleanup,
|
|
|
|
) -> InterpResult<'tcx> {
|
|
|
|
let this = self.eval_context_mut();
|
2021-03-14 09:30:37 -05:00
|
|
|
let param_env = ty::ParamEnv::reveal_all(); // in Miri this is always the param_env we use... and this.param_env is private.
|
|
|
|
let callee_abi = f.ty(*this.tcx, param_env).fn_sig(*this.tcx).abi();
|
2021-05-29 12:36:06 -05:00
|
|
|
if this.machine.enforce_abi && callee_abi != caller_abi {
|
2021-05-16 04:28:01 -05:00
|
|
|
throw_ub_format!(
|
|
|
|
"calling a function with ABI {} using caller ABI {}",
|
|
|
|
callee_abi.name(),
|
|
|
|
caller_abi.name()
|
|
|
|
)
|
2021-03-14 09:30:37 -05:00
|
|
|
}
|
2019-11-28 16:42:10 -06:00
|
|
|
|
|
|
|
// Push frame.
|
2019-12-08 03:32:50 -06:00
|
|
|
let mir = &*this.load_mir(f.def, None)?;
|
2020-03-30 15:54:49 -05:00
|
|
|
this.push_stack_frame(f, mir, dest, stack_pop)?;
|
2019-11-28 16:42:10 -06:00
|
|
|
|
|
|
|
// Initialize arguments.
|
|
|
|
let mut callee_args = this.frame().body.args_iter();
|
|
|
|
for arg in args {
|
|
|
|
let callee_arg = this.local_place(
|
2021-05-16 04:28:01 -05:00
|
|
|
callee_args
|
|
|
|
.next()
|
|
|
|
.ok_or_else(|| err_ub_format!("callee has fewer arguments than expected"))?,
|
2019-11-28 16:42:10 -06:00
|
|
|
)?;
|
2021-02-19 18:00:00 -06:00
|
|
|
this.write_immediate(*arg, &callee_arg)?;
|
2019-11-28 16:42:10 -06:00
|
|
|
}
|
2021-03-14 09:38:22 -05:00
|
|
|
if callee_args.next().is_some() {
|
|
|
|
throw_ub_format!("callee has more arguments than expected");
|
|
|
|
}
|
2019-11-28 16:42:10 -06:00
|
|
|
|
|
|
|
Ok(())
|
|
|
|
}
|
|
|
|
|
2021-07-15 13:33:08 -05:00
|
|
|
/// Visits the memory covered by `place`, sensitive to freezing: the 2nd parameter
|
|
|
|
/// of `action` will be true if this is frozen, false if this is in an `UnsafeCell`.
|
|
|
|
/// The range is relative to `place`.
|
|
|
|
///
|
|
|
|
/// Assumes that the `place` has a proper pointer in it.
|
2018-11-07 09:56:25 -06:00
|
|
|
fn visit_freeze_sensitive(
|
2018-11-05 09:05:17 -06:00
|
|
|
&self,
|
2021-02-19 18:00:00 -06:00
|
|
|
place: &MPlaceTy<'tcx, Tag>,
|
2018-11-05 09:05:17 -06:00
|
|
|
size: Size,
|
2021-07-15 13:33:08 -05:00
|
|
|
mut action: impl FnMut(AllocRange, bool) -> InterpResult<'tcx>,
|
2019-06-08 15:14:47 -05:00
|
|
|
) -> InterpResult<'tcx> {
|
2018-12-11 07:16:58 -06:00
|
|
|
let this = self.eval_context_ref();
|
2018-11-05 09:05:17 -06:00
|
|
|
trace!("visit_frozen(place={:?}, size={:?})", *place, size);
|
2019-12-23 05:56:23 -06:00
|
|
|
debug_assert_eq!(
|
|
|
|
size,
|
2018-12-11 07:16:58 -06:00
|
|
|
this.size_and_align_of_mplace(place)?
|
2019-12-23 05:56:23 -06:00
|
|
|
.map(|(size, _)| size)
|
|
|
|
.unwrap_or_else(|| place.layout.size)
|
2018-11-05 09:05:17 -06:00
|
|
|
);
|
2019-02-15 19:29:38 -06:00
|
|
|
// Store how far we proceeded into the place so far. Everything to the left of
|
2018-11-05 09:05:17 -06:00
|
|
|
// this offset has already been handled, in the sense that the frozen parts
|
|
|
|
// have had `action` called on them.
|
2021-07-15 13:33:08 -05:00
|
|
|
let ptr = place.ptr.into_pointer_or_addr().unwrap();
|
|
|
|
let start_offset = ptr.into_parts().1 as Size; // we just compare offsets, the abs. value never matters
|
|
|
|
let mut cur_offset = start_offset;
|
2018-11-05 09:05:17 -06:00
|
|
|
// Called when we detected an `UnsafeCell` at the given offset and size.
|
2021-07-15 13:33:08 -05:00
|
|
|
// Calls `action` and advances `cur_ptr`.
|
|
|
|
let mut unsafe_cell_action = |unsafe_cell_ptr: Pointer<Option<Tag>>,
|
|
|
|
unsafe_cell_size: Size| {
|
|
|
|
let unsafe_cell_ptr = unsafe_cell_ptr.into_pointer_or_addr().unwrap();
|
|
|
|
debug_assert_eq!(unsafe_cell_ptr.provenance, ptr.provenance);
|
2018-11-05 09:05:17 -06:00
|
|
|
// We assume that we are given the fields in increasing offset order,
|
|
|
|
// and nothing else changes.
|
2021-07-15 13:33:08 -05:00
|
|
|
let unsafe_cell_offset = unsafe_cell_ptr.into_parts().1 as Size; // we just compare offsets, the abs. value never matters
|
|
|
|
assert!(unsafe_cell_offset >= cur_offset);
|
|
|
|
let frozen_size = unsafe_cell_offset - cur_offset;
|
|
|
|
// Everything between the cur_ptr and this `UnsafeCell` is frozen.
|
2018-11-05 09:05:17 -06:00
|
|
|
if frozen_size != Size::ZERO {
|
2021-07-15 13:33:08 -05:00
|
|
|
action(alloc_range(cur_offset - start_offset, frozen_size), /*frozen*/ true)?;
|
2018-11-07 09:56:25 -06:00
|
|
|
}
|
2021-07-15 13:33:08 -05:00
|
|
|
cur_offset += frozen_size;
|
2018-11-07 09:56:25 -06:00
|
|
|
// This `UnsafeCell` is NOT frozen.
|
|
|
|
if unsafe_cell_size != Size::ZERO {
|
2021-07-15 13:33:08 -05:00
|
|
|
action(
|
|
|
|
alloc_range(cur_offset - start_offset, unsafe_cell_size),
|
|
|
|
/*frozen*/ false,
|
|
|
|
)?;
|
2018-11-05 09:05:17 -06:00
|
|
|
}
|
2021-07-15 13:33:08 -05:00
|
|
|
cur_offset += unsafe_cell_size;
|
2018-11-05 09:05:17 -06:00
|
|
|
// Done
|
|
|
|
Ok(())
|
|
|
|
};
|
|
|
|
// Run a visitor
|
|
|
|
{
|
|
|
|
let mut visitor = UnsafeCellVisitor {
|
2018-12-11 07:16:58 -06:00
|
|
|
ecx: this,
|
2018-11-05 09:05:17 -06:00
|
|
|
unsafe_cell_action: |place| {
|
|
|
|
trace!("unsafe_cell_action on {:?}", place.ptr);
|
|
|
|
// We need a size to go on.
|
2019-12-23 05:56:23 -06:00
|
|
|
let unsafe_cell_size = this
|
2021-02-19 18:00:00 -06:00
|
|
|
.size_and_align_of_mplace(&place)?
|
2018-11-23 02:46:51 -06:00
|
|
|
.map(|(size, _)| size)
|
2018-11-05 09:05:17 -06:00
|
|
|
// for extern types, just cover what we can
|
2018-11-23 02:46:51 -06:00
|
|
|
.unwrap_or_else(|| place.layout.size);
|
2018-11-06 10:46:54 -06:00
|
|
|
// Now handle this `UnsafeCell`, unless it is empty.
|
|
|
|
if unsafe_cell_size != Size::ZERO {
|
2018-11-07 09:56:25 -06:00
|
|
|
unsafe_cell_action(place.ptr, unsafe_cell_size)
|
2018-11-06 10:46:54 -06:00
|
|
|
} else {
|
|
|
|
Ok(())
|
|
|
|
}
|
2018-11-05 09:05:17 -06:00
|
|
|
},
|
|
|
|
};
|
|
|
|
visitor.visit_value(place)?;
|
|
|
|
}
|
|
|
|
// The part between the end_ptr and the end of the place is also frozen.
|
|
|
|
// So pretend there is a 0-sized `UnsafeCell` at the end.
|
2021-07-15 13:33:08 -05:00
|
|
|
unsafe_cell_action(place.ptr.wrapping_offset(size, this), Size::ZERO)?;
|
2018-11-05 09:05:17 -06:00
|
|
|
// Done!
|
|
|
|
return Ok(());
|
|
|
|
|
|
|
|
/// Visiting the memory covered by a `MemPlace`, being aware of
|
|
|
|
/// whether we are inside an `UnsafeCell` or not.
|
2019-06-13 01:52:04 -05:00
|
|
|
struct UnsafeCellVisitor<'ecx, 'mir, 'tcx, F>
|
2019-12-23 05:56:23 -06:00
|
|
|
where
|
2021-02-19 18:00:00 -06:00
|
|
|
F: FnMut(&MPlaceTy<'tcx, Tag>) -> InterpResult<'tcx>,
|
2018-11-05 09:05:17 -06:00
|
|
|
{
|
2019-06-13 01:52:04 -05:00
|
|
|
ecx: &'ecx MiriEvalContext<'mir, 'tcx>,
|
2018-11-05 09:05:17 -06:00
|
|
|
unsafe_cell_action: F,
|
|
|
|
}
|
|
|
|
|
2020-04-01 18:55:52 -05:00
|
|
|
impl<'ecx, 'mir, 'tcx: 'mir, F> ValueVisitor<'mir, 'tcx, Evaluator<'mir, 'tcx>>
|
2019-12-23 05:56:23 -06:00
|
|
|
for UnsafeCellVisitor<'ecx, 'mir, 'tcx, F>
|
2018-11-05 09:05:17 -06:00
|
|
|
where
|
2021-02-19 18:00:00 -06:00
|
|
|
F: FnMut(&MPlaceTy<'tcx, Tag>) -> InterpResult<'tcx>,
|
2018-11-05 09:05:17 -06:00
|
|
|
{
|
2019-04-15 08:36:09 -05:00
|
|
|
type V = MPlaceTy<'tcx, Tag>;
|
2018-11-05 09:05:17 -06:00
|
|
|
|
|
|
|
#[inline(always)]
|
2019-06-13 01:52:04 -05:00
|
|
|
fn ecx(&self) -> &MiriEvalContext<'mir, 'tcx> {
|
2018-11-05 09:05:17 -06:00
|
|
|
&self.ecx
|
|
|
|
}
|
|
|
|
|
2019-02-15 19:29:38 -06:00
|
|
|
// Hook to detect `UnsafeCell`.
|
2021-02-19 18:00:00 -06:00
|
|
|
fn visit_value(&mut self, v: &MPlaceTy<'tcx, Tag>) -> InterpResult<'tcx> {
|
2018-11-05 09:05:17 -06:00
|
|
|
trace!("UnsafeCellVisitor: {:?} {:?}", *v, v.layout.ty);
|
2020-09-04 15:03:45 -05:00
|
|
|
let is_unsafe_cell = match v.layout.ty.kind() {
|
2019-12-23 05:56:23 -06:00
|
|
|
ty::Adt(adt, _) =>
|
|
|
|
Some(adt.did) == self.ecx.tcx.lang_items().unsafe_cell_type(),
|
2018-11-05 09:05:17 -06:00
|
|
|
_ => false,
|
|
|
|
};
|
|
|
|
if is_unsafe_cell {
|
|
|
|
// We do not have to recurse further, this is an `UnsafeCell`.
|
|
|
|
(self.unsafe_cell_action)(v)
|
|
|
|
} else if self.ecx.type_is_freeze(v.layout.ty) {
|
|
|
|
// This is `Freeze`, there cannot be an `UnsafeCell`
|
|
|
|
Ok(())
|
2020-06-13 04:30:31 -05:00
|
|
|
} else if matches!(v.layout.fields, FieldsShape::Union(..)) {
|
|
|
|
// A (non-frozen) union. We fall back to whatever the type says.
|
|
|
|
(self.unsafe_cell_action)(v)
|
2018-11-05 09:05:17 -06:00
|
|
|
} else {
|
2019-08-28 11:41:30 -05:00
|
|
|
// We want to not actually read from memory for this visit. So, before
|
|
|
|
// walking this value, we have to make sure it is not a
|
|
|
|
// `Variants::Multiple`.
|
|
|
|
match v.layout.variants {
|
2020-04-02 17:05:35 -05:00
|
|
|
Variants::Multiple { .. } => {
|
2019-08-28 11:41:30 -05:00
|
|
|
// A multi-variant enum, or generator, or so.
|
|
|
|
// Treat this like a union: without reading from memory,
|
|
|
|
// we cannot determine the variant we are in. Reading from
|
|
|
|
// memory would be subject to Stacked Borrows rules, leading
|
|
|
|
// to all sorts of "funny" recursion.
|
2019-08-28 11:45:10 -05:00
|
|
|
// We only end up here if the type is *not* freeze, so we just call the
|
|
|
|
// `UnsafeCell` action.
|
|
|
|
(self.unsafe_cell_action)(v)
|
2019-08-28 11:41:30 -05:00
|
|
|
}
|
2020-04-02 17:05:35 -05:00
|
|
|
Variants::Single { .. } => {
|
2019-08-28 11:45:10 -05:00
|
|
|
// Proceed further, try to find where exactly that `UnsafeCell`
|
|
|
|
// is hiding.
|
2019-08-28 11:41:30 -05:00
|
|
|
self.walk_value(v)
|
|
|
|
}
|
|
|
|
}
|
2018-11-05 09:05:17 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-02-15 19:29:38 -06:00
|
|
|
// Make sure we visit aggregrates in increasing offset order.
|
2018-11-06 10:46:54 -06:00
|
|
|
fn visit_aggregate(
|
|
|
|
&mut self,
|
2021-02-19 18:00:00 -06:00
|
|
|
place: &MPlaceTy<'tcx, Tag>,
|
2019-12-23 05:56:23 -06:00
|
|
|
fields: impl Iterator<Item = InterpResult<'tcx, MPlaceTy<'tcx, Tag>>>,
|
2019-06-08 15:14:47 -05:00
|
|
|
) -> InterpResult<'tcx> {
|
2018-11-06 10:46:54 -06:00
|
|
|
match place.layout.fields {
|
2020-04-02 17:05:35 -05:00
|
|
|
FieldsShape::Array { .. } => {
|
2018-11-06 10:46:54 -06:00
|
|
|
// For the array layout, we know the iterator will yield sorted elements so
|
|
|
|
// we can avoid the allocation.
|
|
|
|
self.walk_aggregate(place, fields)
|
|
|
|
}
|
2020-04-02 17:05:35 -05:00
|
|
|
FieldsShape::Arbitrary { .. } => {
|
2018-11-06 10:46:54 -06:00
|
|
|
// Gather the subplaces and sort them before visiting.
|
2019-12-23 05:56:23 -06:00
|
|
|
let mut places =
|
|
|
|
fields.collect::<InterpResult<'tcx, Vec<MPlaceTy<'tcx, Tag>>>>()?;
|
2021-07-15 13:33:08 -05:00
|
|
|
// we just compare offsets, the abs. value never matters
|
|
|
|
places.sort_by_key(|place| {
|
|
|
|
place.ptr.into_pointer_or_addr().unwrap().into_parts().1 as Size
|
|
|
|
});
|
2018-11-06 10:46:54 -06:00
|
|
|
self.walk_aggregate(place, places.into_iter().map(Ok))
|
|
|
|
}
|
2020-04-17 07:19:26 -05:00
|
|
|
FieldsShape::Union { .. } | FieldsShape::Primitive => {
|
2018-11-06 10:46:54 -06:00
|
|
|
// Uh, what?
|
2020-04-17 07:19:26 -05:00
|
|
|
bug!("unions/primitives are not aggregates we should ever visit")
|
2018-11-06 10:46:54 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2021-05-16 04:28:01 -05:00
|
|
|
fn visit_union(
|
|
|
|
&mut self,
|
|
|
|
_v: &MPlaceTy<'tcx, Tag>,
|
|
|
|
_fields: NonZeroUsize,
|
|
|
|
) -> InterpResult<'tcx> {
|
2020-06-13 04:30:31 -05:00
|
|
|
bug!("we should have already handled unions in `visit_value`")
|
2018-11-05 09:05:17 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2019-10-11 04:17:43 -05:00
|
|
|
|
2020-03-31 10:26:32 -05:00
|
|
|
// Writes several `ImmTy`s contiguously into memory. This is useful when you have to pack
|
2019-10-12 19:48:18 -05:00
|
|
|
// different values into a struct.
|
2019-10-14 09:08:39 -05:00
|
|
|
fn write_packed_immediates(
|
2019-10-08 15:06:14 -05:00
|
|
|
&mut self,
|
2021-02-19 18:00:00 -06:00
|
|
|
place: &MPlaceTy<'tcx, Tag>,
|
2019-10-11 00:55:32 -05:00
|
|
|
imms: &[ImmTy<'tcx, Tag>],
|
2019-10-08 15:06:14 -05:00
|
|
|
) -> InterpResult<'tcx> {
|
|
|
|
let this = self.eval_context_mut();
|
|
|
|
|
|
|
|
let mut offset = Size::from_bytes(0);
|
|
|
|
|
2019-10-14 09:08:39 -05:00
|
|
|
for &imm in imms {
|
2021-07-15 13:33:08 -05:00
|
|
|
this.write_immediate(
|
2019-10-14 09:08:39 -05:00
|
|
|
*imm,
|
2021-07-15 13:33:08 -05:00
|
|
|
&place.offset(offset, MemPlaceMeta::None, imm.layout, &*this.tcx)?.into(),
|
2019-10-08 15:06:14 -05:00
|
|
|
)?;
|
2019-10-14 09:08:39 -05:00
|
|
|
offset += imm.layout.size;
|
2019-10-08 15:06:14 -05:00
|
|
|
}
|
2019-10-14 15:36:15 -05:00
|
|
|
Ok(())
|
|
|
|
}
|
2019-10-08 15:06:14 -05:00
|
|
|
|
2019-10-14 15:36:15 -05:00
|
|
|
/// Helper function used inside the shims of foreign functions to check that isolation is
|
|
|
|
/// disabled. It returns an error using the `name` of the foreign function if this is not the
|
|
|
|
/// case.
|
2020-02-23 11:44:40 -06:00
|
|
|
fn check_no_isolation(&self, name: &str) -> InterpResult<'tcx> {
|
2021-05-14 01:40:07 -05:00
|
|
|
if !self.eval_context_ref().machine.communicate() {
|
|
|
|
self.reject_in_isolation(name, RejectOpWith::Abort)?;
|
2019-10-14 15:36:15 -05:00
|
|
|
}
|
2019-10-08 15:06:14 -05:00
|
|
|
Ok(())
|
|
|
|
}
|
2020-08-08 08:21:04 -05:00
|
|
|
|
2021-05-14 01:40:07 -05:00
|
|
|
/// Helper function used inside the shims of foreign functions which reject the op
|
|
|
|
/// when isolation is enabled. It is used to print a warning/backtrace about the rejection.
|
|
|
|
fn reject_in_isolation(&self, op_name: &str, reject_with: RejectOpWith) -> InterpResult<'tcx> {
|
|
|
|
let this = self.eval_context_ref();
|
|
|
|
match reject_with {
|
|
|
|
RejectOpWith::Abort => isolation_abort_error(op_name),
|
|
|
|
RejectOpWith::WarningWithoutBacktrace => {
|
|
|
|
this.tcx
|
|
|
|
.sess
|
2021-06-15 19:33:18 -05:00
|
|
|
.warn(&format!("{} was made to return an error due to isolation", op_name));
|
2021-05-14 01:40:07 -05:00
|
|
|
Ok(())
|
|
|
|
}
|
|
|
|
RejectOpWith::Warning => {
|
|
|
|
register_diagnostic(NonHaltingDiagnostic::RejectedIsolatedOp(op_name.to_string()));
|
|
|
|
Ok(())
|
|
|
|
}
|
|
|
|
RejectOpWith::NoWarning => Ok(()), // no warning
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2020-03-22 02:51:15 -05:00
|
|
|
/// Helper function used inside the shims of foreign functions to assert that the target OS
|
|
|
|
/// is `target_os`. It panics showing a message with the `name` of the foreign function
|
2020-02-22 08:02:25 -06:00
|
|
|
/// if this is not the case.
|
2020-03-22 02:51:15 -05:00
|
|
|
fn assert_target_os(&self, target_os: &str, name: &str) {
|
2020-02-22 08:02:25 -06:00
|
|
|
assert_eq!(
|
2020-11-11 03:29:10 -06:00
|
|
|
self.eval_context_ref().tcx.sess.target.os,
|
2020-03-22 02:51:15 -05:00
|
|
|
target_os,
|
|
|
|
"`{}` is only available on the `{}` target OS",
|
2020-02-22 08:02:25 -06:00
|
|
|
name,
|
2020-03-22 02:51:15 -05:00
|
|
|
target_os,
|
2020-02-22 08:02:25 -06:00
|
|
|
)
|
2020-02-08 12:29:26 -06:00
|
|
|
}
|
2019-10-13 15:26:03 -05:00
|
|
|
|
2020-08-31 21:29:09 -05:00
|
|
|
/// Get last error variable as a place, lazily allocating thread-local storage for it if
|
|
|
|
/// necessary.
|
|
|
|
fn last_error_place(&mut self) -> InterpResult<'tcx, MPlaceTy<'tcx, Tag>> {
|
|
|
|
let this = self.eval_context_mut();
|
|
|
|
if let Some(errno_place) = this.active_thread_ref().last_error {
|
|
|
|
Ok(errno_place)
|
|
|
|
} else {
|
2020-09-02 20:58:41 -05:00
|
|
|
// Allocate new place, set initial value to 0.
|
2020-08-31 21:29:09 -05:00
|
|
|
let errno_layout = this.machine.layouts.u32;
|
2021-07-04 08:59:55 -05:00
|
|
|
let errno_place = this.allocate(errno_layout, MiriMemoryKind::Machine.into())?;
|
2021-02-19 18:00:00 -06:00
|
|
|
this.write_scalar(Scalar::from_u32(0), &errno_place.into())?;
|
2020-08-31 21:29:09 -05:00
|
|
|
this.active_thread_mut().last_error = Some(errno_place);
|
|
|
|
Ok(errno_place)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-10-19 14:00:44 -05:00
|
|
|
/// Sets the last error variable.
|
2019-10-12 20:44:45 -05:00
|
|
|
fn set_last_error(&mut self, scalar: Scalar<Tag>) -> InterpResult<'tcx> {
|
|
|
|
let this = self.eval_context_mut();
|
2020-08-31 21:29:09 -05:00
|
|
|
let errno_place = this.last_error_place()?;
|
2021-02-19 18:00:00 -06:00
|
|
|
this.write_scalar(scalar, &errno_place.into())
|
2019-10-12 20:44:45 -05:00
|
|
|
}
|
|
|
|
|
2019-10-19 14:00:44 -05:00
|
|
|
/// Gets the last error variable.
|
2020-08-31 21:29:09 -05:00
|
|
|
fn get_last_error(&mut self) -> InterpResult<'tcx, Scalar<Tag>> {
|
|
|
|
let this = self.eval_context_mut();
|
|
|
|
let errno_place = this.last_error_place()?;
|
2021-02-19 18:00:00 -06:00
|
|
|
this.read_scalar(&errno_place.into())?.check_init()
|
2019-10-12 20:44:45 -05:00
|
|
|
}
|
|
|
|
|
2021-06-09 08:28:35 -05:00
|
|
|
/// Sets the last OS error using a `std::io::ErrorKind`. This function tries to produce the most
|
2019-10-18 14:33:25 -05:00
|
|
|
/// similar OS error from the `std::io::ErrorKind` and sets it as the last OS error.
|
2021-06-09 08:28:35 -05:00
|
|
|
fn set_last_error_from_io_error(&mut self, err_kind: std::io::ErrorKind) -> InterpResult<'tcx> {
|
2019-10-17 20:29:30 -05:00
|
|
|
use std::io::ErrorKind::*;
|
|
|
|
let this = self.eval_context_mut();
|
2020-10-14 12:16:00 -05:00
|
|
|
let target = &this.tcx.sess.target;
|
2020-11-11 03:29:10 -06:00
|
|
|
let target_os = &target.os;
|
2021-05-03 02:57:13 -05:00
|
|
|
let last_error = if target.families.contains(&"unix".to_owned()) {
|
2021-06-09 08:28:35 -05:00
|
|
|
this.eval_libc(match err_kind {
|
2019-10-17 20:29:30 -05:00
|
|
|
ConnectionRefused => "ECONNREFUSED",
|
|
|
|
ConnectionReset => "ECONNRESET",
|
|
|
|
PermissionDenied => "EPERM",
|
|
|
|
BrokenPipe => "EPIPE",
|
|
|
|
NotConnected => "ENOTCONN",
|
|
|
|
ConnectionAborted => "ECONNABORTED",
|
|
|
|
AddrNotAvailable => "EADDRNOTAVAIL",
|
|
|
|
AddrInUse => "EADDRINUSE",
|
|
|
|
NotFound => "ENOENT",
|
|
|
|
Interrupted => "EINTR",
|
|
|
|
InvalidInput => "EINVAL",
|
|
|
|
TimedOut => "ETIMEDOUT",
|
|
|
|
AlreadyExists => "EEXIST",
|
|
|
|
WouldBlock => "EWOULDBLOCK",
|
2019-12-23 05:56:23 -06:00
|
|
|
_ => {
|
2021-06-09 08:28:35 -05:00
|
|
|
throw_unsup_format!(
|
2021-06-09 11:21:23 -05:00
|
|
|
"io error {:?} cannot be translated into a raw os error",
|
2021-06-09 08:28:35 -05:00
|
|
|
err_kind
|
|
|
|
)
|
2019-12-23 05:56:23 -06:00
|
|
|
}
|
2019-10-17 20:29:30 -05:00
|
|
|
})?
|
2021-05-03 02:57:13 -05:00
|
|
|
} else if target.families.contains(&"windows".to_owned()) {
|
2020-03-28 13:42:22 -05:00
|
|
|
// FIXME: we have to finish implementing the Windows equivalent of this.
|
2021-05-16 04:28:01 -05:00
|
|
|
this.eval_windows(
|
|
|
|
"c",
|
2021-06-09 08:28:35 -05:00
|
|
|
match err_kind {
|
2021-05-16 04:28:01 -05:00
|
|
|
NotFound => "ERROR_FILE_NOT_FOUND",
|
2021-06-09 11:21:23 -05:00
|
|
|
PermissionDenied => "ERROR_ACCESS_DENIED",
|
2021-07-11 07:18:44 -05:00
|
|
|
_ =>
|
|
|
|
throw_unsup_format!(
|
|
|
|
"io error {:?} cannot be translated into a raw os error",
|
|
|
|
err_kind
|
|
|
|
),
|
2021-05-16 04:28:01 -05:00
|
|
|
},
|
|
|
|
)?
|
2020-03-29 08:46:13 -05:00
|
|
|
} else {
|
2021-05-16 04:28:01 -05:00
|
|
|
throw_unsup_format!(
|
|
|
|
"setting the last OS error from an io::Error is unsupported for {}.",
|
|
|
|
target_os
|
|
|
|
)
|
2019-10-17 20:29:30 -05:00
|
|
|
};
|
|
|
|
this.set_last_error(last_error)
|
2019-10-12 20:44:45 -05:00
|
|
|
}
|
2019-10-16 21:37:35 -05:00
|
|
|
|
|
|
|
/// Helper function that consumes an `std::io::Result<T>` and returns an
|
2019-10-18 14:33:25 -05:00
|
|
|
/// `InterpResult<'tcx,T>::Ok` instead. In case the result is an error, this function returns
|
|
|
|
/// `Ok(-1)` and sets the last OS error accordingly.
|
2019-10-16 21:37:35 -05:00
|
|
|
///
|
|
|
|
/// This function uses `T: From<i32>` instead of `i32` directly because some IO related
|
2019-10-24 03:23:44 -05:00
|
|
|
/// functions return different integer types (like `read`, that returns an `i64`).
|
2019-10-18 14:33:25 -05:00
|
|
|
fn try_unwrap_io_result<T: From<i32>>(
|
2019-10-16 21:37:35 -05:00
|
|
|
&mut self,
|
|
|
|
result: std::io::Result<T>,
|
|
|
|
) -> InterpResult<'tcx, T> {
|
|
|
|
match result {
|
|
|
|
Ok(ok) => Ok(ok),
|
|
|
|
Err(e) => {
|
2021-06-09 08:28:35 -05:00
|
|
|
self.eval_context_mut().set_last_error_from_io_error(e.kind())?;
|
2019-10-16 21:37:35 -05:00
|
|
|
Ok((-1).into())
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2020-07-23 10:50:45 -05:00
|
|
|
|
2020-06-28 02:23:01 -05:00
|
|
|
fn read_scalar_at_offset(
|
|
|
|
&self,
|
2021-02-19 18:00:00 -06:00
|
|
|
op: &OpTy<'tcx, Tag>,
|
2020-06-28 02:23:01 -05:00
|
|
|
offset: u64,
|
|
|
|
layout: TyAndLayout<'tcx>,
|
|
|
|
) -> InterpResult<'tcx, ScalarMaybeUninit<Tag>> {
|
|
|
|
let this = self.eval_context_ref();
|
|
|
|
let op_place = this.deref_operand(op)?;
|
|
|
|
let offset = Size::from_bytes(offset);
|
|
|
|
// Ensure that the following read at an offset is within bounds
|
|
|
|
assert!(op_place.layout.size >= offset + layout.size);
|
|
|
|
let value_place = op_place.offset(offset, MemPlaceMeta::None, layout, this)?;
|
2021-02-19 18:00:00 -06:00
|
|
|
this.read_scalar(&value_place.into())
|
2020-06-28 02:23:01 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
fn write_scalar_at_offset(
|
|
|
|
&mut self,
|
2021-02-19 18:00:00 -06:00
|
|
|
op: &OpTy<'tcx, Tag>,
|
2020-06-28 02:23:01 -05:00
|
|
|
offset: u64,
|
|
|
|
value: impl Into<ScalarMaybeUninit<Tag>>,
|
|
|
|
layout: TyAndLayout<'tcx>,
|
|
|
|
) -> InterpResult<'tcx, ()> {
|
|
|
|
let this = self.eval_context_mut();
|
|
|
|
let op_place = this.deref_operand(op)?;
|
|
|
|
let offset = Size::from_bytes(offset);
|
|
|
|
// Ensure that the following read at an offset is within bounds
|
|
|
|
assert!(op_place.layout.size >= offset + layout.size);
|
|
|
|
let value_place = op_place.offset(offset, MemPlaceMeta::None, layout, this)?;
|
2021-02-19 18:00:00 -06:00
|
|
|
this.write_scalar(value, &value_place.into())
|
2020-06-28 02:23:01 -05:00
|
|
|
}
|
2020-09-06 17:08:41 -05:00
|
|
|
|
2020-09-07 10:54:39 -05:00
|
|
|
/// Parse a `timespec` struct and return it as a `std::time::Duration`. It returns `None`
|
|
|
|
/// if the value in the `timespec` struct is invalid. Some libc functions will return
|
|
|
|
/// `EINVAL` in this case.
|
2021-07-15 13:33:08 -05:00
|
|
|
fn read_timespec(&mut self, tp: &MPlaceTy<'tcx, Tag>) -> InterpResult<'tcx, Option<Duration>> {
|
2020-09-06 17:08:41 -05:00
|
|
|
let this = self.eval_context_mut();
|
2021-02-19 18:00:00 -06:00
|
|
|
let seconds_place = this.mplace_field(&tp, 0)?;
|
|
|
|
let seconds_scalar = this.read_scalar(&seconds_place.into())?;
|
2020-09-06 17:08:41 -05:00
|
|
|
let seconds = seconds_scalar.to_machine_isize(this)?;
|
2021-02-19 18:00:00 -06:00
|
|
|
let nanoseconds_place = this.mplace_field(&tp, 1)?;
|
|
|
|
let nanoseconds_scalar = this.read_scalar(&nanoseconds_place.into())?;
|
2020-09-06 17:08:41 -05:00
|
|
|
let nanoseconds = nanoseconds_scalar.to_machine_isize(this)?;
|
|
|
|
|
2020-09-07 15:09:34 -05:00
|
|
|
Ok(try {
|
2020-09-07 10:54:39 -05:00
|
|
|
// tv_sec must be non-negative.
|
2020-09-07 11:31:28 -05:00
|
|
|
let seconds: u64 = seconds.try_into().ok()?;
|
|
|
|
// tv_nsec must be non-negative.
|
|
|
|
let nanoseconds: u32 = nanoseconds.try_into().ok()?;
|
|
|
|
if nanoseconds >= 1_000_000_000 {
|
2020-09-07 10:54:39 -05:00
|
|
|
// tv_nsec must not be greater than 999,999,999.
|
2020-09-07 15:09:34 -05:00
|
|
|
None?
|
2020-09-06 17:08:41 -05:00
|
|
|
}
|
2020-09-07 15:09:34 -05:00
|
|
|
Duration::new(seconds, nanoseconds)
|
|
|
|
})
|
2020-09-06 17:08:41 -05:00
|
|
|
}
|
2021-05-17 07:31:59 -05:00
|
|
|
|
2021-07-15 13:33:08 -05:00
|
|
|
fn read_c_str<'a>(&'a self, ptr: Pointer<Option<Tag>>) -> InterpResult<'tcx, &'a [u8]>
|
2021-05-17 07:31:59 -05:00
|
|
|
where
|
|
|
|
'tcx: 'a,
|
|
|
|
'mir: 'a,
|
|
|
|
{
|
|
|
|
let this = self.eval_context_ref();
|
|
|
|
let size1 = Size::from_bytes(1);
|
|
|
|
|
|
|
|
// Step 1: determine the length.
|
|
|
|
let mut len = Size::ZERO;
|
|
|
|
loop {
|
2021-05-17 06:50:45 -05:00
|
|
|
// FIXME: We are re-getting the allocation each time around the loop.
|
|
|
|
// Would be nice if we could somehow "extend" an existing AllocRange.
|
|
|
|
let alloc = this.memory.get(ptr.offset(len, this)?.into(), size1, Align::ONE)?.unwrap(); // not a ZST, so we will get a result
|
|
|
|
let byte = alloc.read_scalar(alloc_range(Size::ZERO, size1))?.to_u8()?;
|
2021-05-17 07:31:59 -05:00
|
|
|
if byte == 0 {
|
|
|
|
break;
|
|
|
|
} else {
|
|
|
|
len = len + size1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Step 2: get the bytes.
|
|
|
|
this.memory.read_bytes(ptr.into(), len)
|
|
|
|
}
|
|
|
|
|
2021-07-15 13:33:08 -05:00
|
|
|
fn read_wide_str(&self, mut ptr: Pointer<Option<Tag>>) -> InterpResult<'tcx, Vec<u16>> {
|
2021-05-17 07:31:59 -05:00
|
|
|
let this = self.eval_context_ref();
|
|
|
|
let size2 = Size::from_bytes(2);
|
2021-05-17 06:50:45 -05:00
|
|
|
let align2 = Align::from_bytes(2).unwrap();
|
2021-05-17 07:31:59 -05:00
|
|
|
|
|
|
|
let mut wchars = Vec::new();
|
|
|
|
loop {
|
2021-05-17 06:50:45 -05:00
|
|
|
// FIXME: We are re-getting the allocation each time around the loop.
|
|
|
|
// Would be nice if we could somehow "extend" an existing AllocRange.
|
|
|
|
let alloc = this.memory.get(ptr.into(), size2, align2)?.unwrap(); // not a ZST, so we will get a result
|
|
|
|
let wchar = alloc.read_scalar(alloc_range(Size::ZERO, size2))?.to_u16()?;
|
2021-05-17 07:31:59 -05:00
|
|
|
if wchar == 0 {
|
|
|
|
break;
|
|
|
|
} else {
|
|
|
|
wchars.push(wchar);
|
|
|
|
ptr = ptr.offset(size2, this)?;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
Ok(wchars)
|
|
|
|
}
|
2021-05-30 07:38:52 -05:00
|
|
|
|
|
|
|
/// Check that the ABI is what we expect.
|
|
|
|
fn check_abi<'a>(&self, abi: Abi, exp_abi: Abi) -> InterpResult<'a, ()> {
|
|
|
|
if self.eval_context_ref().machine.enforce_abi && abi != exp_abi {
|
|
|
|
throw_ub_format!(
|
|
|
|
"calling a function with ABI {} using caller ABI {}",
|
|
|
|
exp_abi.name(),
|
|
|
|
abi.name()
|
|
|
|
)
|
|
|
|
}
|
|
|
|
Ok(())
|
|
|
|
}
|
2021-06-03 04:58:24 -05:00
|
|
|
|
2021-06-05 22:21:20 -05:00
|
|
|
fn frame_in_std(&self) -> bool {
|
2021-06-03 04:58:24 -05:00
|
|
|
let this = self.eval_context_ref();
|
2021-06-03 08:26:11 -05:00
|
|
|
this.tcx.lang_items().start_fn().map_or(false, |start_fn| {
|
|
|
|
this.tcx.def_path(this.frame().instance.def_id()).krate
|
|
|
|
== this.tcx.def_path(start_fn).krate
|
|
|
|
})
|
2021-06-03 04:58:24 -05:00
|
|
|
}
|
2021-05-26 18:29:01 -05:00
|
|
|
|
|
|
|
/// Handler that should be called when unsupported functionality is encountered.
|
|
|
|
/// This function will either panic within the context of the emulated application
|
|
|
|
/// or return an error in the Miri process context
|
|
|
|
///
|
|
|
|
/// Return value of `Ok(bool)` indicates whether execution should continue.
|
|
|
|
fn handle_unsupported<S: AsRef<str>>(&mut self, error_msg: S) -> InterpResult<'tcx, ()> {
|
|
|
|
let this = self.eval_context_mut();
|
|
|
|
if this.machine.panic_on_unsupported {
|
|
|
|
// message is slightly different here to make automated analysis easier
|
|
|
|
let error_msg = format!("unsupported Miri functionality: {}", error_msg.as_ref());
|
|
|
|
this.start_panic(error_msg.as_ref(), StackPopUnwind::Skip)?;
|
|
|
|
return Ok(());
|
|
|
|
} else {
|
|
|
|
throw_unsup_format!("{}", error_msg.as_ref());
|
|
|
|
}
|
|
|
|
}
|
2021-06-06 02:25:16 -05:00
|
|
|
|
|
|
|
fn check_abi_and_shim_symbol_clash(
|
|
|
|
&mut self,
|
|
|
|
abi: Abi,
|
|
|
|
exp_abi: Abi,
|
|
|
|
link_name: Symbol,
|
|
|
|
) -> InterpResult<'tcx, ()> {
|
|
|
|
self.check_abi(abi, exp_abi)?;
|
2021-11-29 11:48:04 -06:00
|
|
|
if let Some((body, _)) = self.eval_context_mut().lookup_exported_symbol(link_name)? {
|
2021-06-06 02:25:16 -05:00
|
|
|
throw_machine_stop!(TerminationInfo::SymbolShimClashing {
|
|
|
|
link_name,
|
|
|
|
span: body.span.data(),
|
|
|
|
})
|
|
|
|
}
|
|
|
|
Ok(())
|
|
|
|
}
|
|
|
|
|
|
|
|
fn check_shim<'a, const N: usize>(
|
|
|
|
&mut self,
|
|
|
|
abi: Abi,
|
|
|
|
exp_abi: Abi,
|
|
|
|
link_name: Symbol,
|
|
|
|
args: &'a [OpTy<'tcx, Tag>],
|
|
|
|
) -> InterpResult<'tcx, &'a [OpTy<'tcx, Tag>; N]>
|
|
|
|
where
|
|
|
|
&'a [OpTy<'tcx, Tag>; N]: TryFrom<&'a [OpTy<'tcx, Tag>]>,
|
|
|
|
{
|
|
|
|
self.check_abi_and_shim_symbol_clash(abi, exp_abi, link_name)?;
|
|
|
|
check_arg_count(args)
|
|
|
|
}
|
2021-07-15 13:33:08 -05:00
|
|
|
|
|
|
|
/// Mark a machine allocation that was just created as immutable.
|
|
|
|
fn mark_immutable(&mut self, mplace: &MemPlace<Tag>) {
|
|
|
|
let this = self.eval_context_mut();
|
|
|
|
this.memory
|
|
|
|
.mark_immutable(mplace.ptr.into_pointer_or_addr().unwrap().provenance.alloc_id)
|
|
|
|
.unwrap();
|
|
|
|
}
|
2019-10-17 10:21:06 -05:00
|
|
|
}
|
2019-10-17 21:20:05 -05:00
|
|
|
|
2020-04-02 16:09:20 -05:00
|
|
|
/// Check that the number of args is what we expect.
|
2021-05-16 04:28:01 -05:00
|
|
|
pub fn check_arg_count<'a, 'tcx, const N: usize>(
|
|
|
|
args: &'a [OpTy<'tcx, Tag>],
|
|
|
|
) -> InterpResult<'tcx, &'a [OpTy<'tcx, Tag>; N]>
|
|
|
|
where
|
|
|
|
&'a [OpTy<'tcx, Tag>; N]: TryFrom<&'a [OpTy<'tcx, Tag>]>,
|
|
|
|
{
|
2020-04-02 16:09:20 -05:00
|
|
|
if let Ok(ops) = args.try_into() {
|
|
|
|
return Ok(ops);
|
|
|
|
}
|
2020-05-04 13:24:22 -05:00
|
|
|
throw_ub_format!("incorrect number of arguments: got {}, expected {}", args.len(), N)
|
2020-04-02 16:09:20 -05:00
|
|
|
}
|
|
|
|
|
2021-05-14 01:40:07 -05:00
|
|
|
pub fn isolation_abort_error(name: &str) -> InterpResult<'static> {
|
2020-08-08 08:21:04 -05:00
|
|
|
throw_machine_stop!(TerminationInfo::UnsupportedInIsolation(format!(
|
2020-10-03 04:38:16 -05:00
|
|
|
"{} not available when isolation is enabled",
|
2020-08-08 08:21:04 -05:00
|
|
|
name,
|
|
|
|
)))
|
|
|
|
}
|
|
|
|
|
2019-11-30 14:09:52 -06:00
|
|
|
pub fn immty_from_int_checked<'tcx>(
|
|
|
|
int: impl Into<i128>,
|
2020-03-30 03:23:04 -05:00
|
|
|
layout: TyAndLayout<'tcx>,
|
2019-11-30 14:09:52 -06:00
|
|
|
) -> InterpResult<'tcx, ImmTy<'tcx, Tag>> {
|
|
|
|
let int = int.into();
|
2020-03-01 03:26:24 -06:00
|
|
|
Ok(ImmTy::try_from_int(int, layout).ok_or_else(|| {
|
2020-03-09 03:38:33 -05:00
|
|
|
err_unsup_format!("signed value {:#x} does not fit in {} bits", int, layout.size.bits())
|
2020-03-01 03:26:24 -06:00
|
|
|
})?)
|
2019-11-30 14:09:52 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
pub fn immty_from_uint_checked<'tcx>(
|
|
|
|
int: impl Into<u128>,
|
2020-03-30 03:23:04 -05:00
|
|
|
layout: TyAndLayout<'tcx>,
|
2019-11-30 14:09:52 -06:00
|
|
|
) -> InterpResult<'tcx, ImmTy<'tcx, Tag>> {
|
|
|
|
let int = int.into();
|
2020-03-01 03:26:24 -06:00
|
|
|
Ok(ImmTy::try_from_uint(int, layout).ok_or_else(|| {
|
2020-03-09 03:38:33 -05:00
|
|
|
err_unsup_format!("unsigned value {:#x} does not fit in {} bits", int, layout.size.bits())
|
2020-03-01 03:26:24 -06:00
|
|
|
})?)
|
2019-11-30 14:09:52 -06:00
|
|
|
}
|