2019-06-30 03:59:42 -05:00
|
|
|
use std::cell::RefCell;
|
2020-03-02 15:36:15 -06:00
|
|
|
use std::collections::hash_map::Entry;
|
2019-06-20 14:21:47 -05:00
|
|
|
|
2020-03-30 04:07:32 -05:00
|
|
|
use log::trace;
|
2019-06-28 03:16:10 -05:00
|
|
|
use rand::Rng;
|
|
|
|
|
2020-03-02 15:36:15 -06:00
|
|
|
use rustc_data_structures::fx::FxHashMap;
|
2021-05-16 04:28:01 -05:00
|
|
|
use rustc_target::abi::{HasDataLayout, Size};
|
2019-06-20 14:21:47 -05:00
|
|
|
|
2020-06-27 06:19:35 -05:00
|
|
|
use crate::*;
|
2019-06-24 16:34:38 -05:00
|
|
|
|
|
|
|
pub type MemoryExtra = RefCell<GlobalState>;
|
|
|
|
|
2019-06-20 14:21:47 -05:00
|
|
|
#[derive(Clone, Debug)]
|
|
|
|
pub struct GlobalState {
|
2019-06-24 16:34:38 -05:00
|
|
|
/// This is used as a map between the address of each allocation and its `AllocId`.
|
|
|
|
/// It is always sorted
|
2022-04-01 13:10:24 -05:00
|
|
|
int_to_ptr_map: Vec<(u64, AllocId)>,
|
2019-06-30 03:59:42 -05:00
|
|
|
/// The base address for each allocation. We cannot put that into
|
|
|
|
/// `AllocExtra` because function pointers also have a base address, and
|
|
|
|
/// they do not have an `AllocExtra`.
|
|
|
|
/// This is the inverse of `int_to_ptr_map`.
|
2022-04-01 13:10:24 -05:00
|
|
|
base_addr: FxHashMap<AllocId, u64>,
|
2019-06-24 16:34:38 -05:00
|
|
|
/// This is used as a memory address when a new pointer is casted to an integer. It
|
|
|
|
/// is always larger than any address that was previously made part of a block.
|
2022-04-01 13:10:24 -05:00
|
|
|
next_base_addr: u64,
|
|
|
|
/// Whether to enforce "strict provenance" rules. Enabling this means int2ptr casts return
|
|
|
|
/// pointers with an invalid provenance, i.e., not valid for any memory access.
|
|
|
|
strict_provenance: bool,
|
2019-06-20 14:21:47 -05:00
|
|
|
}
|
|
|
|
|
2022-04-01 13:10:24 -05:00
|
|
|
impl GlobalState {
|
|
|
|
pub fn new(config: &MiriConfig) -> Self {
|
2019-06-20 14:21:47 -05:00
|
|
|
GlobalState {
|
2019-06-24 10:03:16 -05:00
|
|
|
int_to_ptr_map: Vec::default(),
|
2020-03-02 15:36:15 -06:00
|
|
|
base_addr: FxHashMap::default(),
|
2019-06-29 06:33:47 -05:00
|
|
|
next_base_addr: STACK_ADDR,
|
2022-04-01 13:10:24 -05:00
|
|
|
strict_provenance: config.strict_provenance,
|
2019-06-20 14:21:47 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2019-06-24 16:34:38 -05:00
|
|
|
|
|
|
|
impl<'mir, 'tcx> GlobalState {
|
2021-07-15 13:33:08 -05:00
|
|
|
pub fn ptr_from_addr(
|
|
|
|
addr: u64,
|
2020-04-01 18:55:52 -05:00
|
|
|
memory: &Memory<'mir, 'tcx, Evaluator<'mir, 'tcx>>,
|
2021-07-15 13:33:08 -05:00
|
|
|
) -> Pointer<Option<Tag>> {
|
|
|
|
trace!("Casting 0x{:x} to a pointer", addr);
|
2019-06-24 16:34:38 -05:00
|
|
|
let global_state = memory.extra.intptrcast.borrow();
|
2021-07-15 13:33:08 -05:00
|
|
|
|
2022-04-01 13:10:24 -05:00
|
|
|
if global_state.strict_provenance {
|
|
|
|
return Pointer::new(None, Size::from_bytes(addr));
|
|
|
|
}
|
|
|
|
|
|
|
|
let pos = global_state.int_to_ptr_map.binary_search_by_key(&addr, |(addr, _)| *addr);
|
2021-07-15 13:33:08 -05:00
|
|
|
let alloc_id = match pos {
|
|
|
|
Ok(pos) => Some(global_state.int_to_ptr_map[pos].1),
|
|
|
|
Err(0) => None,
|
2019-06-24 16:34:38 -05:00
|
|
|
Err(pos) => {
|
2019-06-25 14:07:23 -05:00
|
|
|
// This is the largest of the adresses smaller than `int`,
|
2019-06-24 16:34:38 -05:00
|
|
|
// i.e. the greatest lower bound (glb)
|
|
|
|
let (glb, alloc_id) = global_state.int_to_ptr_map[pos - 1];
|
2021-07-15 13:33:08 -05:00
|
|
|
// This never overflows because `addr >= glb`
|
|
|
|
let offset = addr - glb;
|
|
|
|
// If the offset exceeds the size of the allocation, don't use this `alloc_id`.
|
|
|
|
if offset
|
|
|
|
<= memory.get_size_and_align(alloc_id, AllocCheck::MaybeDead).unwrap().0.bytes()
|
|
|
|
{
|
|
|
|
Some(alloc_id)
|
2019-06-24 16:34:38 -05:00
|
|
|
} else {
|
2021-07-15 13:33:08 -05:00
|
|
|
None
|
2019-09-05 11:17:58 -05:00
|
|
|
}
|
2019-06-24 16:34:38 -05:00
|
|
|
}
|
2021-07-15 13:33:08 -05:00
|
|
|
};
|
|
|
|
// Pointers created from integers are untagged.
|
|
|
|
Pointer::new(
|
|
|
|
alloc_id.map(|alloc_id| Tag { alloc_id, sb: SbTag::Untagged }),
|
|
|
|
Size::from_bytes(addr),
|
|
|
|
)
|
2019-06-24 16:34:38 -05:00
|
|
|
}
|
|
|
|
|
2021-07-15 13:33:08 -05:00
|
|
|
fn alloc_base_addr(
|
2020-04-01 18:55:52 -05:00
|
|
|
memory: &Memory<'mir, 'tcx, Evaluator<'mir, 'tcx>>,
|
2021-07-15 13:33:08 -05:00
|
|
|
alloc_id: AllocId,
|
|
|
|
) -> u64 {
|
2019-06-24 16:34:38 -05:00
|
|
|
let mut global_state = memory.extra.intptrcast.borrow_mut();
|
2019-06-30 03:59:42 -05:00
|
|
|
let global_state = &mut *global_state;
|
2019-06-24 16:34:38 -05:00
|
|
|
|
2021-07-15 13:33:08 -05:00
|
|
|
match global_state.base_addr.entry(alloc_id) {
|
2019-06-30 03:59:42 -05:00
|
|
|
Entry::Occupied(entry) => *entry.get(),
|
|
|
|
Entry::Vacant(entry) => {
|
2021-07-15 13:33:08 -05:00
|
|
|
// There is nothing wrong with a raw pointer being cast to an integer only after
|
|
|
|
// it became dangling. Hence `MaybeDead`.
|
|
|
|
let (size, align) =
|
|
|
|
memory.get_size_and_align(alloc_id, AllocCheck::MaybeDead).unwrap();
|
|
|
|
|
2019-06-25 14:07:23 -05:00
|
|
|
// This allocation does not have a base address yet, pick one.
|
2019-06-28 03:16:10 -05:00
|
|
|
// Leave some space to the previous allocation, to give it some chance to be less aligned.
|
|
|
|
let slack = {
|
2019-07-23 14:38:53 -05:00
|
|
|
let mut rng = memory.extra.rng.borrow_mut();
|
2019-06-28 03:23:29 -05:00
|
|
|
// This means that `(global_state.next_base_addr + slack) % 16` is uniformly distributed.
|
2021-04-04 04:45:09 -05:00
|
|
|
rng.gen_range(0..16)
|
2019-06-28 03:16:10 -05:00
|
|
|
};
|
|
|
|
// From next_base_addr + slack, round up to adjust for alignment.
|
2019-07-23 16:43:37 -05:00
|
|
|
let base_addr = global_state.next_base_addr.checked_add(slack).unwrap();
|
|
|
|
let base_addr = Self::align_addr(base_addr, align.bytes());
|
2019-06-30 03:59:42 -05:00
|
|
|
entry.insert(base_addr);
|
2019-06-30 14:06:32 -05:00
|
|
|
trace!(
|
2021-07-15 13:33:08 -05:00
|
|
|
"Assigning base address {:#x} to allocation {:?} (size: {}, align: {}, slack: {})",
|
2019-12-23 05:56:23 -06:00
|
|
|
base_addr,
|
2021-07-15 13:33:08 -05:00
|
|
|
alloc_id,
|
|
|
|
size.bytes(),
|
2019-12-23 05:56:23 -06:00
|
|
|
align.bytes(),
|
2021-07-15 13:33:08 -05:00
|
|
|
slack,
|
2019-06-30 14:06:32 -05:00
|
|
|
);
|
2019-06-28 03:16:10 -05:00
|
|
|
|
2021-12-03 14:57:37 -06:00
|
|
|
// Remember next base address. Leave a gap of at least 1 to avoid two zero-sized allocations
|
|
|
|
// having the same base address, and to avoid ambiguous provenance for the address between two
|
2021-12-05 19:33:20 -06:00
|
|
|
// allocations (also see https://github.com/rust-lang/unsafe-code-guidelines/issues/313).
|
|
|
|
let size_plus_1 = size.bytes().checked_add(1).unwrap();
|
|
|
|
global_state.next_base_addr = base_addr.checked_add(size_plus_1).unwrap();
|
2019-06-24 16:34:38 -05:00
|
|
|
// Given that `next_base_addr` increases in each allocation, pushing the
|
|
|
|
// corresponding tuple keeps `int_to_ptr_map` sorted
|
2021-07-15 13:33:08 -05:00
|
|
|
global_state.int_to_ptr_map.push((base_addr, alloc_id));
|
2019-06-24 16:34:38 -05:00
|
|
|
|
|
|
|
base_addr
|
|
|
|
}
|
2021-07-15 13:33:08 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Convert a relative (tcx) pointer to an absolute address.
|
|
|
|
pub fn rel_ptr_to_addr(
|
|
|
|
memory: &Memory<'mir, 'tcx, Evaluator<'mir, 'tcx>>,
|
|
|
|
ptr: Pointer<AllocId>,
|
|
|
|
) -> u64 {
|
|
|
|
let (alloc_id, offset) = ptr.into_parts(); // offset is relative
|
|
|
|
let base_addr = GlobalState::alloc_base_addr(memory, alloc_id);
|
2019-06-24 16:34:38 -05:00
|
|
|
|
2019-07-03 02:32:21 -05:00
|
|
|
// Add offset with the right kind of pointer-overflowing arithmetic.
|
|
|
|
let dl = memory.data_layout();
|
2021-07-15 13:33:08 -05:00
|
|
|
dl.overflowing_offset(base_addr, offset.bytes()).0
|
|
|
|
}
|
|
|
|
|
|
|
|
pub fn abs_ptr_to_rel(
|
|
|
|
memory: &Memory<'mir, 'tcx, Evaluator<'mir, 'tcx>>,
|
|
|
|
ptr: Pointer<Tag>,
|
|
|
|
) -> Size {
|
|
|
|
let (tag, addr) = ptr.into_parts(); // addr is absolute
|
|
|
|
let base_addr = GlobalState::alloc_base_addr(memory, tag.alloc_id);
|
|
|
|
|
|
|
|
// Wrapping "addr - base_addr"
|
|
|
|
let dl = memory.data_layout();
|
|
|
|
let neg_base_addr = (base_addr as i64).wrapping_neg();
|
|
|
|
Size::from_bytes(dl.overflowing_signed_offset(addr.bytes(), neg_base_addr).0)
|
2019-06-24 16:34:38 -05:00
|
|
|
}
|
2019-06-25 14:07:23 -05:00
|
|
|
|
|
|
|
/// Shifts `addr` to make it aligned with `align` by rounding `addr` to the smallest multiple
|
2019-06-28 03:16:10 -05:00
|
|
|
/// of `align` that is larger or equal to `addr`
|
2019-06-25 14:07:23 -05:00
|
|
|
fn align_addr(addr: u64, align: u64) -> u64 {
|
2019-06-28 03:24:16 -05:00
|
|
|
match addr % align {
|
|
|
|
0 => addr,
|
2019-12-23 05:56:23 -06:00
|
|
|
rem => addr.checked_add(align).unwrap() - rem,
|
2019-06-28 03:16:10 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#[cfg(test)]
|
|
|
|
mod tests {
|
|
|
|
use super::*;
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn test_align_addr() {
|
|
|
|
assert_eq!(GlobalState::align_addr(37, 4), 40);
|
|
|
|
assert_eq!(GlobalState::align_addr(44, 4), 44);
|
2019-06-25 14:07:23 -05:00
|
|
|
}
|
2019-06-24 16:34:38 -05:00
|
|
|
}
|