2021-07-03 12:18:13 -04:00
|
|
|
//@ check-pass
|
|
|
|
|
//! The presence of an `align(X)` annotation must be accounted for.
|
|
|
|
|
|
|
|
|
|
#![crate_type = "lib"]
|
|
|
|
|
#![feature(transmutability)]
|
|
|
|
|
#![allow(dead_code, incomplete_features, non_camel_case_types)]
|
|
|
|
|
|
|
|
|
|
mod assert {
|
2024-08-27 14:05:54 +00:00
|
|
|
use std::mem::{Assume, TransmuteFrom};
|
2021-07-03 12:18:13 -04:00
|
|
|
|
|
|
|
|
pub fn is_maybe_transmutable<Src, Dst>()
|
|
|
|
|
where
|
2024-08-27 14:05:54 +00:00
|
|
|
Dst: TransmuteFrom<Src, {
|
2022-08-18 19:39:14 +00:00
|
|
|
Assume {
|
|
|
|
|
alignment: true,
|
|
|
|
|
lifetimes: true,
|
|
|
|
|
safety: true,
|
|
|
|
|
validity: true,
|
|
|
|
|
}
|
|
|
|
|
}>
|
2021-07-03 12:18:13 -04:00
|
|
|
{}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
fn should_pad_explicitly_aligned_field() {
|
|
|
|
|
#[derive(Clone, Copy)] #[repr(u8)] enum V0u8 { V = 0 }
|
|
|
|
|
#[derive(Clone, Copy)] #[repr(u8)] enum V1u8 { V = 1 }
|
|
|
|
|
|
Compute transmutability from `rustc_target::abi::Layout`
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.).
2024-03-19 14:49:13 +00:00
|
|
|
#[repr(align(1))]
|
2021-07-03 12:18:13 -04:00
|
|
|
pub union Uninit {
|
|
|
|
|
a: (),
|
|
|
|
|
b: V1u8,
|
|
|
|
|
}
|
|
|
|
|
|
Compute transmutability from `rustc_target::abi::Layout`
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.).
2024-03-19 14:49:13 +00:00
|
|
|
#[repr(align(2))]
|
2021-07-03 12:18:13 -04:00
|
|
|
pub union align_2 {
|
|
|
|
|
a: V0u8,
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#[repr(C)] struct ImplicitlyPadded(align_2, V0u8);
|
|
|
|
|
#[repr(C)] struct ExplicitlyPadded(V0u8, Uninit, V0u8);
|
|
|
|
|
|
|
|
|
|
// An implementation that (incorrectly) does not place a padding byte after
|
|
|
|
|
// `align_2` will, incorrectly, reject the following transmutations.
|
|
|
|
|
assert::is_maybe_transmutable::<ImplicitlyPadded, ExplicitlyPadded>();
|
|
|
|
|
assert::is_maybe_transmutable::<ExplicitlyPadded, ImplicitlyPadded>();
|
|
|
|
|
}
|