74 lines
1.7 KiB
Rust
74 lines
1.7 KiB
Rust
|
// Copyright 2017 The Rust Project Developers. See the COPYRIGHT
|
||
|
|
// file at the top-level directory of this distribution and at
|
||
|
|
// http://rust-lang.org/COPYRIGHT.
|
||
|
|
//
|
||
|
|
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
|
||
|
|
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
|
||
|
|
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
|
||
|
|
// option. This file may not be copied, modified, or distributed
|
||
|
|
// except according to those terms.
|
||
|
|
|
||
|
|
#![feature(generators, generator_trait)]
|
||
|
|
|
||
|
|
use std::ops::Generator;
|
||
|
|
use std::sync::atomic::{AtomicUsize, ATOMIC_USIZE_INIT, Ordering};
|
||
|
|
|
||
|
|
static A: AtomicUsize = ATOMIC_USIZE_INIT;
|
||
|
|
|
||
|
|
struct B;
|
||
|
|
|
||
|
|
impl Drop for B {
|
||
|
|
fn drop(&mut self) {
|
||
|
|
A.fetch_add(1, Ordering::SeqCst);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
fn main() {
|
||
|
|
t1();
|
||
|
|
t2();
|
||
|
|
t3();
|
||
|
|
}
|
||
|
|
|
||
|
|
fn t1() {
|
||
|
|
let b = B;
|
||
|
|
let mut foo = || {
|
||
|
|
yield;
|
||
|
|
drop(b);
|
||
|
|
};
|
||
|
|
|
||
|
|
let n = A.load(Ordering::SeqCst);
|
||
|
|
drop(foo.resume(()));
|
||
|
|
assert_eq!(A.load(Ordering::SeqCst), n);
|
||
|
|
drop(foo);
|
||
|
|
assert_eq!(A.load(Ordering::SeqCst), n + 1);
|
||
|
|
}
|
||
|
|
|
||
|
|
fn t2() {
|
||
|
|
let b = B;
|
||
|
|
let mut foo = || {
|
||
|
|
yield b;
|
||
|
|
};
|
||
|
|
|
||
|
|
let n = A.load(Ordering::SeqCst);
|
||
|
|
drop(foo.resume(()));
|
||
|
|
assert_eq!(A.load(Ordering::SeqCst), n + 1);
|
||
|
|
drop(foo);
|
||
|
|
assert_eq!(A.load(Ordering::SeqCst), n + 1);
|
||
|
|
}
|
||
|
|
|
||
|
|
fn t3() {
|
||
|
|
let b = B;
|
||
|
|
let mut foo = || {
|
||
|
|
let _: () = gen arg; // TODO: this line should not be necessary
|
||
|
|
yield;
|
||
|
|
drop(b);
|
||
|
|
};
|
||
|
|
|
||
|
|
let n = A.load(Ordering::SeqCst);
|
||
|
|
assert_eq!(A.load(Ordering::SeqCst), n);
|
||
|
|
drop(foo);
|
||
|
|
// TODO: we should assert n+1 here, not n
|
||
|
|
// assert_eq!(A.load(Ordering::SeqCst), n + 1);
|
||
|
|
assert_eq!(A.load(Ordering::SeqCst), n);
|
||
|
|
}
|