1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
|
//! Test the "array of int" fast path in validity checking, and in particular whether it
//! points at the right array element.
use std::mem;
#[repr(C)]
union MaybeUninit<T: Copy> {
uninit: (),
init: T,
}
impl<T: Copy> MaybeUninit<T> {
const fn new(t: T) -> Self {
MaybeUninit { init: t }
}
}
const UNINIT_INT_0: [u32; 3] = unsafe {
//~^ ERROR it is undefined behavior to use this value
//~| invalid value at [0]
mem::transmute([
MaybeUninit { uninit: () },
// Constants chosen to achieve endianness-independent hex dump.
MaybeUninit::new(0x11111111),
MaybeUninit::new(0x22222222),
])
};
const UNINIT_INT_1: [u32; 3] = unsafe {
//~^ ERROR it is undefined behavior to use this value
//~| invalid value at [1]
mem::transmute([
MaybeUninit::new(0u8),
MaybeUninit::new(0u8),
MaybeUninit::new(0u8),
MaybeUninit::new(0u8),
MaybeUninit::new(1u8),
MaybeUninit { uninit: () },
MaybeUninit::new(1u8),
MaybeUninit::new(1u8),
MaybeUninit::new(2u8),
MaybeUninit::new(2u8),
MaybeUninit { uninit: () },
MaybeUninit::new(2u8),
])
};
const UNINIT_INT_2: [u32; 3] = unsafe {
//~^ ERROR it is undefined behavior to use this value
//~| invalid value at [2]
mem::transmute([
MaybeUninit::new(0u8),
MaybeUninit::new(0u8),
MaybeUninit::new(0u8),
MaybeUninit::new(0u8),
MaybeUninit::new(1u8),
MaybeUninit::new(1u8),
MaybeUninit::new(1u8),
MaybeUninit::new(1u8),
MaybeUninit::new(2u8),
MaybeUninit::new(2u8),
MaybeUninit::new(2u8),
MaybeUninit { uninit: () },
])
};
fn main() {}
|
