In its first step of computing transmutability, `rustc_transmutability` constructs a byte-level representation of type layout (`Tree`). Previously, this representation was computed for ADTs by inspecting the ADT definition and performing our own layout computations. This process was error-prone, verbose, and limited our ability to analyze many types (particularly default-repr types). In this PR, we instead construct `Tree`s from `rustc_target::abi::Layout`s. This helps ensure that layout optimizations are reflected our analyses, and increases the kinds of types we can now analyze, including: - default repr ADTs - transparent unions - `UnsafeCell`-containing types Overall, this PR expands the expressvity of `rustc_transmutability` to be much closer to the transmutability analysis performed by miri. Future PRs will work to close the remaining gaps (e.g., support for `Box`, raw pointers, `NonZero*`, coroutines, etc.).
84 lines
2.2 KiB
Rust
84 lines
2.2 KiB
Rust
//@ check-pass
|
|
//! A struct must have a well-defined layout to participate in a transmutation.
|
|
|
|
#![crate_type = "lib"]
|
|
#![feature(transmutability)]
|
|
#![allow(dead_code, incomplete_features, non_camel_case_types)]
|
|
|
|
mod assert {
|
|
use std::mem::{Assume, BikeshedIntrinsicFrom};
|
|
|
|
pub fn is_maybe_transmutable<Src, Dst>()
|
|
where
|
|
Dst: BikeshedIntrinsicFrom<Src, {
|
|
Assume {
|
|
alignment: true,
|
|
lifetimes: true,
|
|
safety: true,
|
|
validity: true,
|
|
}
|
|
}>
|
|
{}
|
|
}
|
|
|
|
fn should_accept_repr_rust()
|
|
{
|
|
fn unit() {
|
|
struct repr_rust;
|
|
assert::is_maybe_transmutable::<repr_rust, ()>();
|
|
assert::is_maybe_transmutable::<u128, repr_rust>();
|
|
}
|
|
|
|
fn tuple() {
|
|
struct repr_rust();
|
|
assert::is_maybe_transmutable::<repr_rust, ()>();
|
|
assert::is_maybe_transmutable::<u128, repr_rust>();
|
|
}
|
|
|
|
fn braces() {
|
|
struct repr_rust{}
|
|
assert::is_maybe_transmutable::<repr_rust, ()>();
|
|
assert::is_maybe_transmutable::<u128, repr_rust>();
|
|
}
|
|
|
|
fn aligned() {
|
|
#[repr(align(1))] struct repr_rust{}
|
|
assert::is_maybe_transmutable::<repr_rust, ()>();
|
|
assert::is_maybe_transmutable::<u128, repr_rust>();
|
|
}
|
|
|
|
fn packed() {
|
|
#[repr(packed)] struct repr_rust{}
|
|
assert::is_maybe_transmutable::<repr_rust, ()>();
|
|
assert::is_maybe_transmutable::<u128, repr_rust>();
|
|
}
|
|
|
|
fn nested() {
|
|
struct repr_rust;
|
|
#[repr(C)] struct repr_c(repr_rust);
|
|
assert::is_maybe_transmutable::<repr_c, ()>();
|
|
assert::is_maybe_transmutable::<u128, repr_c>();
|
|
}
|
|
}
|
|
|
|
fn should_accept_repr_c()
|
|
{
|
|
fn unit() {
|
|
#[repr(C)] struct repr_c;
|
|
assert::is_maybe_transmutable::<repr_c, ()>();
|
|
assert::is_maybe_transmutable::<i128, repr_c>();
|
|
}
|
|
|
|
fn tuple() {
|
|
#[repr(C)] struct repr_c();
|
|
assert::is_maybe_transmutable::<repr_c, ()>();
|
|
assert::is_maybe_transmutable::<i128, repr_c>();
|
|
}
|
|
|
|
fn braces() {
|
|
#[repr(C)] struct repr_c{}
|
|
assert::is_maybe_transmutable::<repr_c, ()>();
|
|
assert::is_maybe_transmutable::<i128, repr_c>();
|
|
}
|
|
}
|