// Copyright rustc Contributors
// Adapted from rustc: https://github.com/rust-lang/rust/tree/5f98537eb7b5f42c246a52c550813c3cff336069/src/test/ui/generator/conditional-drop.rs

// SPDX-License-Identifier: Apache-2.0 OR MIT

// Modifications Copyright Kani Contributors
// See GitHub history for details.

// run-pass

// revisions: default nomiropt
//[nomiropt]compile-flags: -Z mir-opt-level=0

#![feature(generators, generator_trait)]

use std::ops::Generator;
use std::pin::Pin;
use std::sync::atomic::{AtomicUsize, Ordering};

static A: AtomicUsize = AtomicUsize::new(0);

struct B;

impl Drop for B {
    fn drop(&mut self) {
        A.fetch_add(1, Ordering::SeqCst);
    }
}

fn test() -> bool {
    true
}
fn test2() -> bool {
    false
}

#[kani::proof]
fn main() {
    t1();
    t2();
}

fn t1() {
    let mut a = || {
        let b = B;
        if test() {
            drop(b);
        }
        yield;
    };

    let n = A.load(Ordering::SeqCst);
    Pin::new(&mut a).resume(());
    assert_eq!(A.load(Ordering::SeqCst), n + 1);
    Pin::new(&mut a).resume(());
    assert_eq!(A.load(Ordering::SeqCst), n + 1);
}

fn t2() {
    let mut a = || {
        let b = B;
        if test2() {
            drop(b);
        }
        yield;
    };

    let n = A.load(Ordering::SeqCst);
    Pin::new(&mut a).resume(());
    assert_eq!(A.load(Ordering::SeqCst), n);
    Pin::new(&mut a).resume(());
    assert_eq!(A.load(Ordering::SeqCst), n + 1);
}