Skip to content

Latest commit

 

History

History
133 lines (94 loc) · 7.91 KB

core-transmutation.md

File metadata and controls

133 lines (94 loc) · 7.91 KB

Challenge: Preconditions for core transmuting methods

Status

[Open | Resolved | Expired]: Open

Dates

Start date:

End date:

Goal

Confirm the correctness of value transmutations performed by libcore, including those transmutations exposed as public methods provided by libcore.

To keep the goal somewhat manageable, it excludes some classes of code (e.g. utf8-validation, async tasks, and others); see the assumptions for the full list of excluded categories.

Details

Motivating Example

There are several calls to these unsafe methods within the code of safe methods exported libcore itself, so having clear and verifiable safety contracts is critical for verifying the safety of the safe methods that invoke them.

For example, std::slice::align_to (which unsafely converts any slice &[T] into a tuple (&[T], &[U], &[T]) composed of a prefix, a maximal sequence of values of type U, and a suffix) just says for its safety that “all the usual caveats pertaining to transmute::<T, U> also apply here”, but the documentation for transmute is frankly (and rightfully) scary.

Part 1: the two intrinsics

The public unsafe intrinsic transmute<T, U> takes a value of type T and reinterprets it to have type U, with the sole (statically-enforced) restriction being that the types T and U must have the same size. The unstable intrinsic transmute_unchecked is similar, except that it removes the static size restriction, treating violations of it as undefined behavior.

What is the right way to encode the preconditions of the two transmutation intrinsics?

If one is solely concerned about safety: The Rustonomicon lists several ways that transmutation can yield undefined behavior. Encoding a correct safety contract for transmute is crucial.

If one is concerned about proving functional correctness, then reasoning about transmutation will require reasoning about the byte representation of values to justify that the reinterpretation of the value’s bytes for satisfying the pending proof obligation associated with the output value.

Part 2: unsafe APIs with validity constraints

There are unsafe methods (which are defined by libcore and reexported by libstd) have the effect of a transmutation between a (sequence of) T and a (sequence of) U. Come up with an appropriate safety contract for each of them; they should usually be something less arduous for callers than transmute itself (we hope).

Part 3: unsafe APIs with richer constraints

Similar to part 2, there are also unsafe methods, but now the safety condition is more complicated, such as “is valid ascii character” or "is valid unicode scalar value."

Part 4: safe APIs

These are safe APIs that call into the unsafe API's from parts 1 through 3 above. Now our final goal is to prove that they actually are safe, despite calling transmute or transmute-related methods in their implementations.

Assumptions

For this challenge, the following assumptions are acceptable:

We are not attempting to validate all details of the memory model for this challenge; for example, you do not need to worry about whether we are using the Stacked Borrows or Tree Borrows aliasing models. Likewise, you do not need to validate the provenance-related API in std::ptr.

You are allowed, but not required, to leverage the unstable Transmutability trait under development as part of your solution. This is a libstd-internal feature for auditing whether a given transmutation is safe. (It seems like something tools should try to leverage in some way; but it is also experimental.) Note that if you need to add new impls of Transmutability, then those new impl’s need to be accepted by (and landed in) the upstream Rust project before your solutiokn can be considered completed. See also rust-lang#99571

You do not need to verify the correctness of the transmute calls in the unit tests embedded in libcore, though it would be great to do so!

To keep the goal somewhat manageable, we are omitting the following classes of code from the acceptance criteria for this challenge:

  • utf8-validation (such as str::from_utf8_unchecked)
  • the provenance-related API in std::ptr (such as addr, or without_provenance)
  • the num methods (from modules like core::num::f64, core::num::i32, etc)
  • pointer-metadata and vtable APIs (from modules like core::ptr::metadata)
  • async rust runtime/task API (from core::task)
  • core-internal specialization methods (such as traits like RangeIteratorImpl with methods prefixed with "spec_")
  • core-internal __iterator_get_unchecked calls
  • value output formatting machinery (from std::fmt::rt) You do not need to verify those (potentially indirect) uses of transmute, unless you need to establish the safety/correctness of some of those methods in order to verify some other type in this list. (That is, you cannot assume them to be safe nor correct in your verification of other methods listed here.) We expect to issue future challenges tailored to each of the categories of transmutation uses listed above.

Success Criteria

A new entry to the specification book is created explaining the relevant patterns for verifying code that calls transmute.

At least 35 of the following 47 intrinsics and functions (i.e. approximately 75%) have been annotated with contracts, and, for non-intrinsics, had their bodies verified.

Function Location
transmute_unchecked core::intrinsics
transmute core::intrinsics
MaybeUninit<T>::array_assume_init core::mem
MaybeUninit<[T; N]>::transpose core::mem
<[MaybeUninit<T>; N]>::transpose core::mem
<[T; N] as IntoIterator>::into_iter core::array::iter
BorrowedBuf::unfilled core::io::borrowed_buf
BorrowedCursor::reborrow core::io::borrowed_buf
str::as_bytes core::str
from_u32_unchecked core::char::convert
char_try_from_u32 core::char::convert
Ipv6Addr::new core::net::ip_addr
Ipv6Addr::segments core::net::ip_addr
align_offset core::ptr
Alignment::new_unchecked core::ptr::alignment
MaybeUninit<T>::copy_from_slice core::mem
str::as_bytes_mut core::str
<Filter<I,P> as Iterator>::next_chunk core::iter::adapters
<FilterMap<I,F> as Iterator>::next_chunk core::iter::adapters
try_from_fn core::array
iter_next_chunk core::array
from_u32_unchecked core::char
AsciiChar::from_u8_unchecked core::ascii_char
memchr_aligned core::slice::memchr
<[T]>::align_to_mut core::slice
run_utf8_validation core::str::validations
<[T]>::align_to core::slice
is_aligned_to core::const_ptr
is_aligned_to core::mut_ptr
Alignment::new core::ptr::alignment
Layout::from_size_align core::alloc::layout
Layout::from_size_align_unchecked core::alloc::layout
make_ascii_lowercase core::str
make_ascii_uppercase core::str
<char as Step>::forward_checked core::iter::range
<Chars as Iterator>::next core::str::iter
<Chars as DoubleEndedIterator>::next_back core::str::iter
char::encode_utf16_raw core::char
<char as Step>::backward_unchecked core::iter::range
<char as Step>::forward_unchecked core::iter::range
AsciiChar::from_u8 core::ascii_char
char::as_ascii core::char
<[T]>::as_simd_mut core::slice
<[T]>::as_simd core::slice
memrchr core::slice::memchr
do_count_chars str::count
  • All solutions to verification challenges need to satisfy the criteria established in the challenge book (TODO: Add link) in addition to the ones listed below