|
1 | 1 | // Copyright Kani Contributors
|
2 | 2 | // SPDX-License-Identifier: Apache-2.0 OR MIT
|
3 | 3 |
|
4 |
| -//! This module introduces the Arbitrary trait as well as implementation for the Invariant trait. |
5 |
| -use crate::{any_raw, assume, Invariant}; |
| 4 | +//! This module introduces the Arbitrary trait as well as implementation for primitive types and |
| 5 | +//! other std containers. |
| 6 | +use std::num::*; |
6 | 7 |
|
7 | 8 | /// This trait should be used to generate symbolic variables that represent any valid value of
|
8 | 9 | /// its type.
|
9 | 10 | pub trait Arbitrary {
|
10 | 11 | fn any() -> Self;
|
11 | 12 | }
|
12 | 13 |
|
13 |
| -impl<T> Arbitrary for T |
14 |
| -where |
15 |
| - T: Invariant, |
16 |
| -{ |
17 |
| - default fn any() -> Self { |
18 |
| - let value = unsafe { any_raw::<T>() }; |
19 |
| - assume(value.is_valid()); |
20 |
| - value |
| 14 | +/// The given type can be represented by an unconstrained symbolic value of size_of::<T>. |
| 15 | +macro_rules! trivial_arbitrary { |
| 16 | + ( $type: ty ) => { |
| 17 | + impl Arbitrary for $type { |
| 18 | + #[inline(always)] |
| 19 | + fn any() -> Self { |
| 20 | + unsafe { crate::any_raw_internal::<$type>() } |
| 21 | + } |
| 22 | + } |
| 23 | + }; |
| 24 | +} |
| 25 | + |
| 26 | +trivial_arbitrary!(u8); |
| 27 | +trivial_arbitrary!(u16); |
| 28 | +trivial_arbitrary!(u32); |
| 29 | +trivial_arbitrary!(u64); |
| 30 | +trivial_arbitrary!(u128); |
| 31 | +trivial_arbitrary!(usize); |
| 32 | + |
| 33 | +trivial_arbitrary!(i8); |
| 34 | +trivial_arbitrary!(i16); |
| 35 | +trivial_arbitrary!(i32); |
| 36 | +trivial_arbitrary!(i64); |
| 37 | +trivial_arbitrary!(i128); |
| 38 | +trivial_arbitrary!(isize); |
| 39 | + |
| 40 | +// We do not constraint floating points values per type spec. Users must add assumptions to their |
| 41 | +// verification code if they want to eliminate NaN, infinite, or subnormal. |
| 42 | +trivial_arbitrary!(f32); |
| 43 | +trivial_arbitrary!(f64); |
| 44 | + |
| 45 | +trivial_arbitrary!(()); |
| 46 | + |
| 47 | +impl Arbitrary for bool { |
| 48 | + #[inline(always)] |
| 49 | + fn any() -> Self { |
| 50 | + let byte = u8::any(); |
| 51 | + byte == 0 |
| 52 | + } |
| 53 | +} |
| 54 | + |
| 55 | +/// Validate that a char is not outside the ranges [0x0, 0xD7FF] and [0xE000, 0x10FFFF] |
| 56 | +/// Ref: <https://doc.rust-lang.org/stable/nomicon/what-unsafe-does.html> |
| 57 | +impl Arbitrary for char { |
| 58 | + #[inline(always)] |
| 59 | + fn any() -> Self { |
| 60 | + // Generate an arbitrary u32 and constrain it to make it a valid representation of char. |
| 61 | + let val = u32::any(); |
| 62 | + crate::assume(val <= 0xD7FF || (0xE000..=0x10FFFF).contains(&val)); |
| 63 | + unsafe { char::from_u32_unchecked(val) } |
21 | 64 | }
|
22 | 65 | }
|
23 | 66 |
|
| 67 | +macro_rules! nonzero_arbitrary { |
| 68 | + ( $type: ty, $base: ty ) => { |
| 69 | + impl Arbitrary for $type { |
| 70 | + #[inline(always)] |
| 71 | + fn any() -> Self { |
| 72 | + let val = <$base>::any(); |
| 73 | + crate::assume(val != 0); |
| 74 | + unsafe { <$type>::new_unchecked(val) } |
| 75 | + } |
| 76 | + } |
| 77 | + }; |
| 78 | +} |
| 79 | + |
| 80 | +nonzero_arbitrary!(NonZeroU8, u8); |
| 81 | +nonzero_arbitrary!(NonZeroU16, u16); |
| 82 | +nonzero_arbitrary!(NonZeroU32, u32); |
| 83 | +nonzero_arbitrary!(NonZeroU64, u64); |
| 84 | +nonzero_arbitrary!(NonZeroU128, u128); |
| 85 | +nonzero_arbitrary!(NonZeroUsize, usize); |
| 86 | + |
| 87 | +nonzero_arbitrary!(NonZeroI8, i8); |
| 88 | +nonzero_arbitrary!(NonZeroI16, i16); |
| 89 | +nonzero_arbitrary!(NonZeroI32, i32); |
| 90 | +nonzero_arbitrary!(NonZeroI64, i64); |
| 91 | +nonzero_arbitrary!(NonZeroI128, i128); |
| 92 | +nonzero_arbitrary!(NonZeroIsize, isize); |
| 93 | + |
24 | 94 | impl<T, const N: usize> Arbitrary for [T; N]
|
25 | 95 | where
|
26 | 96 | T: Arbitrary,
|
27 | 97 | {
|
28 | 98 | fn any() -> Self {
|
29 |
| - // The "correct way" would be to MaybeUninit but there is performance penalty. |
30 |
| - let mut data: [T; N] = unsafe { crate::any_raw() }; |
31 |
| - |
32 |
| - for elem in &mut data[..] { |
33 |
| - *elem = T::any(); |
34 |
| - } |
35 |
| - |
36 |
| - data |
| 99 | + [(); N].map(|_| T::any()) |
37 | 100 | }
|
38 | 101 | }
|
39 | 102 |
|
|
0 commit comments