1 // Copyright 2015 The Rust Project Developers. See the COPYRIGHT
2 // file at the top-level directory of this distribution and at
3 // http://rust-lang.org/COPYRIGHT.
5 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
6 // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
7 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
8 // option. This file may not be copied, modified, or distributed
9 // except according to those terms.
11 // Test that we cleanup a fixed size Box<[D; k]> properly when D has a
17 use std::sync::atomic::{AtomicUsize, Ordering};
19 static LOG: AtomicUsize = AtomicUsize::new(0);
25 println!("Dropping {}", self.0);
26 let old = LOG.load(Ordering::SeqCst);
27 LOG.compare_and_swap(old, old << 4 | self.0 as usize, Ordering::SeqCst);
32 fn die() -> D { panic!("Oh no"); }
33 let g = thread::spawn(|| {
34 let _b1: Box<[D; 4]> = Box::new([D( 1), D( 2), D( 3), D( 4)]);
35 let _b2: Box<[D; 4]> = Box::new([D( 5), D( 6), D( 7), D( 8)]);
36 let _b3: Box<[D; 4]> = Box::new([D( 9), D(10), die(), D(12)]);
37 let _b4: Box<[D; 4]> = Box::new([D(13), D(14), D(15), D(16)]);
39 assert!(g.join().is_err());
41 // When the panic occurs, we will be in the midst of constructing
42 // the input to `_b3`. Therefore, we drop the elements of the
43 // partially filled array first, before we get around to dropping
44 // the elements of `_b1` and _b2`.
46 // Issue 23222: The order in which the elements actually get
47 // dropped is a little funky. See similar notes in nested-vec-3;
48 // in essence, I would not be surprised if we change the ordering
49 // given in `expect` in the future.
51 let expect = 0x__A_9__5_6_7_8__1_2_3_4;
52 let actual = LOG.load(Ordering::SeqCst);
53 assert!(actual == expect, "expect: 0x{:x} actual: 0x{:x}", expect, actual);