2024-02-26 16:49:25 +00:00
|
|
|
error[E0277]: `[String; 0]` cannot be safely transmuted into `()`
|
|
|
|
|
--> $DIR/should_require_well_defined_layout.rs:25:52
|
2021-07-03 12:18:13 -04:00
|
|
|
|
|
|
|
|
|
LL | assert::is_maybe_transmutable::<repr_rust, ()>();
|
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
|
|
|
| ^^ analyzing the transmutability of `[String; 0]` is not yet supported
|
2021-07-03 12:18:13 -04:00
|
|
|
|
|
|
|
|
|
note: required by a bound in `is_maybe_transmutable`
|
2024-02-26 16:49:25 +00:00
|
|
|
--> $DIR/should_require_well_defined_layout.rs:12:14
|
2021-07-03 12:18:13 -04:00
|
|
|
|
|
2022-08-18 19:39:14 +00:00
|
|
|
LL | pub fn is_maybe_transmutable<Src, Dst>()
|
2023-02-21 05:21:07 +00:00
|
|
|
| --------------------- required by a bound in this function
|
2022-08-18 19:39:14 +00:00
|
|
|
LL | where
|
2024-08-27 14:05:54 +00:00
|
|
|
LL | Dst: TransmuteFrom<Src, {
|
2022-08-18 19:39:14 +00:00
|
|
|
| ______________^
|
|
|
|
|
LL | | Assume::ALIGNMENT
|
|
|
|
|
LL | | .and(Assume::LIFETIMES)
|
|
|
|
|
LL | | .and(Assume::SAFETY)
|
|
|
|
|
LL | | .and(Assume::VALIDITY)
|
|
|
|
|
LL | | }>
|
|
|
|
|
| |__________^ required by this bound in `is_maybe_transmutable`
|
2021-07-03 12:18:13 -04:00
|
|
|
|
2024-02-26 16:49:25 +00:00
|
|
|
error[E0277]: `u128` cannot be safely transmuted into `[String; 0]`
|
|
|
|
|
--> $DIR/should_require_well_defined_layout.rs:26:47
|
2021-07-03 12:18:13 -04:00
|
|
|
|
|
|
|
|
|
LL | assert::is_maybe_transmutable::<u128, repr_rust>();
|
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
|
|
|
| ^^^^^^^^^ analyzing the transmutability of `[String; 0]` is not yet supported
|
2021-07-03 12:18:13 -04:00
|
|
|
|
|
|
|
|
|
note: required by a bound in `is_maybe_transmutable`
|
2024-02-26 16:49:25 +00:00
|
|
|
--> $DIR/should_require_well_defined_layout.rs:12:14
|
2021-07-03 12:18:13 -04:00
|
|
|
|
|
2022-08-18 19:39:14 +00:00
|
|
|
LL | pub fn is_maybe_transmutable<Src, Dst>()
|
2023-02-21 05:21:07 +00:00
|
|
|
| --------------------- required by a bound in this function
|
2022-08-18 19:39:14 +00:00
|
|
|
LL | where
|
2024-08-27 14:05:54 +00:00
|
|
|
LL | Dst: TransmuteFrom<Src, {
|
2022-08-18 19:39:14 +00:00
|
|
|
| ______________^
|
|
|
|
|
LL | | Assume::ALIGNMENT
|
|
|
|
|
LL | | .and(Assume::LIFETIMES)
|
|
|
|
|
LL | | .and(Assume::SAFETY)
|
|
|
|
|
LL | | .and(Assume::VALIDITY)
|
|
|
|
|
LL | | }>
|
|
|
|
|
| |__________^ required by this bound in `is_maybe_transmutable`
|
2021-07-03 12:18:13 -04:00
|
|
|
|
2024-02-26 16:49:25 +00:00
|
|
|
error[E0277]: `[String; 1]` cannot be safely transmuted into `()`
|
|
|
|
|
--> $DIR/should_require_well_defined_layout.rs:31:52
|
2021-07-03 12:18:13 -04:00
|
|
|
|
|
|
|
|
|
LL | assert::is_maybe_transmutable::<repr_rust, ()>();
|
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
|
|
|
| ^^ analyzing the transmutability of `[String; 1]` is not yet supported
|
2021-07-03 12:18:13 -04:00
|
|
|
|
|
|
|
|
|
note: required by a bound in `is_maybe_transmutable`
|
2024-02-26 16:49:25 +00:00
|
|
|
--> $DIR/should_require_well_defined_layout.rs:12:14
|
2021-07-03 12:18:13 -04:00
|
|
|
|
|
2022-08-18 19:39:14 +00:00
|
|
|
LL | pub fn is_maybe_transmutable<Src, Dst>()
|
2023-02-21 05:21:07 +00:00
|
|
|
| --------------------- required by a bound in this function
|
2022-08-18 19:39:14 +00:00
|
|
|
LL | where
|
2024-08-27 14:05:54 +00:00
|
|
|
LL | Dst: TransmuteFrom<Src, {
|
2022-08-18 19:39:14 +00:00
|
|
|
| ______________^
|
|
|
|
|
LL | | Assume::ALIGNMENT
|
|
|
|
|
LL | | .and(Assume::LIFETIMES)
|
|
|
|
|
LL | | .and(Assume::SAFETY)
|
|
|
|
|
LL | | .and(Assume::VALIDITY)
|
|
|
|
|
LL | | }>
|
|
|
|
|
| |__________^ required by this bound in `is_maybe_transmutable`
|
2021-07-03 12:18:13 -04:00
|
|
|
|
2024-02-26 16:49:25 +00:00
|
|
|
error[E0277]: `u128` cannot be safely transmuted into `[String; 1]`
|
|
|
|
|
--> $DIR/should_require_well_defined_layout.rs:32:47
|
2021-07-03 12:18:13 -04:00
|
|
|
|
|
|
|
|
|
LL | assert::is_maybe_transmutable::<u128, repr_rust>();
|
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
|
|
|
| ^^^^^^^^^ analyzing the transmutability of `[String; 1]` is not yet supported
|
2021-07-03 12:18:13 -04:00
|
|
|
|
|
|
|
|
|
note: required by a bound in `is_maybe_transmutable`
|
2024-02-26 16:49:25 +00:00
|
|
|
--> $DIR/should_require_well_defined_layout.rs:12:14
|
2021-07-03 12:18:13 -04:00
|
|
|
|
|
2022-08-18 19:39:14 +00:00
|
|
|
LL | pub fn is_maybe_transmutable<Src, Dst>()
|
2023-02-21 05:21:07 +00:00
|
|
|
| --------------------- required by a bound in this function
|
2022-08-18 19:39:14 +00:00
|
|
|
LL | where
|
2024-08-27 14:05:54 +00:00
|
|
|
LL | Dst: TransmuteFrom<Src, {
|
2022-08-18 19:39:14 +00:00
|
|
|
| ______________^
|
|
|
|
|
LL | | Assume::ALIGNMENT
|
|
|
|
|
LL | | .and(Assume::LIFETIMES)
|
|
|
|
|
LL | | .and(Assume::SAFETY)
|
|
|
|
|
LL | | .and(Assume::VALIDITY)
|
|
|
|
|
LL | | }>
|
|
|
|
|
| |__________^ required by this bound in `is_maybe_transmutable`
|
2021-07-03 12:18:13 -04:00
|
|
|
|
2024-02-26 16:49:25 +00:00
|
|
|
error[E0277]: `[String; 2]` cannot be safely transmuted into `()`
|
|
|
|
|
--> $DIR/should_require_well_defined_layout.rs:37:52
|
2021-07-03 12:18:13 -04:00
|
|
|
|
|
|
|
|
|
LL | assert::is_maybe_transmutable::<repr_rust, ()>();
|
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
|
|
|
| ^^ analyzing the transmutability of `[String; 2]` is not yet supported
|
2021-07-03 12:18:13 -04:00
|
|
|
|
|
|
|
|
|
note: required by a bound in `is_maybe_transmutable`
|
2024-02-26 16:49:25 +00:00
|
|
|
--> $DIR/should_require_well_defined_layout.rs:12:14
|
2021-07-03 12:18:13 -04:00
|
|
|
|
|
2022-08-18 19:39:14 +00:00
|
|
|
LL | pub fn is_maybe_transmutable<Src, Dst>()
|
2023-02-21 05:21:07 +00:00
|
|
|
| --------------------- required by a bound in this function
|
2022-08-18 19:39:14 +00:00
|
|
|
LL | where
|
2024-08-27 14:05:54 +00:00
|
|
|
LL | Dst: TransmuteFrom<Src, {
|
2022-08-18 19:39:14 +00:00
|
|
|
| ______________^
|
|
|
|
|
LL | | Assume::ALIGNMENT
|
|
|
|
|
LL | | .and(Assume::LIFETIMES)
|
|
|
|
|
LL | | .and(Assume::SAFETY)
|
|
|
|
|
LL | | .and(Assume::VALIDITY)
|
|
|
|
|
LL | | }>
|
|
|
|
|
| |__________^ required by this bound in `is_maybe_transmutable`
|
2021-07-03 12:18:13 -04:00
|
|
|
|
2024-02-26 16:49:25 +00:00
|
|
|
error[E0277]: `u128` cannot be safely transmuted into `[String; 2]`
|
|
|
|
|
--> $DIR/should_require_well_defined_layout.rs:38:47
|
2021-07-03 12:18:13 -04:00
|
|
|
|
|
|
|
|
|
LL | assert::is_maybe_transmutable::<u128, repr_rust>();
|
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
|
|
|
| ^^^^^^^^^ analyzing the transmutability of `[String; 2]` is not yet supported
|
2021-07-03 12:18:13 -04:00
|
|
|
|
|
|
|
|
|
note: required by a bound in `is_maybe_transmutable`
|
2024-02-26 16:49:25 +00:00
|
|
|
--> $DIR/should_require_well_defined_layout.rs:12:14
|
2021-07-03 12:18:13 -04:00
|
|
|
|
|
2022-08-18 19:39:14 +00:00
|
|
|
LL | pub fn is_maybe_transmutable<Src, Dst>()
|
2023-02-21 05:21:07 +00:00
|
|
|
| --------------------- required by a bound in this function
|
2022-08-18 19:39:14 +00:00
|
|
|
LL | where
|
2024-08-27 14:05:54 +00:00
|
|
|
LL | Dst: TransmuteFrom<Src, {
|
2022-08-18 19:39:14 +00:00
|
|
|
| ______________^
|
|
|
|
|
LL | | Assume::ALIGNMENT
|
|
|
|
|
LL | | .and(Assume::LIFETIMES)
|
|
|
|
|
LL | | .and(Assume::SAFETY)
|
|
|
|
|
LL | | .and(Assume::VALIDITY)
|
|
|
|
|
LL | | }>
|
|
|
|
|
| |__________^ required by this bound in `is_maybe_transmutable`
|
2021-07-03 12:18:13 -04:00
|
|
|
|
|
|
|
|
error: aborting due to 6 previous errors
|
|
|
|
|
|
|
|
|
|
For more information about this error, try `rustc --explain E0277`.
|