3 #![allow(overflowing_literals)]
5 // Test that we cleanup dynamic sized Box<[D]> properly when D has a
8 // ignore-emscripten no threads support
11 use std::sync::atomic::{AtomicUsize, Ordering};
13 static LOG: AtomicUsize = AtomicUsize::new(0);
19 println!("Dropping {}", self.0);
20 let old = LOG.load(Ordering::SeqCst);
21 let _ = LOG.compare_exchange(
23 old << 4 | self.0 as usize,
31 fn die() -> D { panic!("Oh no"); }
32 let g = thread::spawn(|| {
33 let _b1: Box<[D; 4]> = Box::new([D( 1), D( 2), D( 3), D( 4)]);
34 let _b2: Box<[D; 4]> = Box::new([D( 5), D( 6), D( 7), D( 8)]);
35 let _b3: Box<[D; 4]> = Box::new([D( 9), D(10), die(), D(12)]);
36 let _b4: Box<[D; 4]> = Box::new([D(13), D(14), D(15), D(16)]);
38 assert!(g.join().is_err());
40 // When the panic occurs, we will be in the midst of constructing
41 // the input to `_b3`. Therefore, we drop the elements of the
42 // partially filled array first, before we get around to dropping
43 // the elements of `_b1` and _b2`.
45 // Issue 23222: The order in which the elements actually get
46 // dropped is a little funky. See similar notes in nested-vec-3;
47 // in essence, I would not be surprised if we change the ordering
48 // given in `expect` in the future.
50 let expect = 0x__A_9__5_6_7_8__1_2_3_4;
51 let actual = LOG.load(Ordering::SeqCst);
52 assert!(actual == expect, "expect: 0x{:x} actual: 0x{:x}", expect, actual);