Class ConflictLockGraph

src/detector/lock/mod.rs:858–860

forall relation(a, b), relation(c, d): if b and c are probably/possibly deadlock, then add edge between relation(a, b) and relation(c, d). The cycles in the graph may be conflictlock bugs.

            "std::sync::Condvar::notify".to_owned(),
            notify_span,
            wait_notify_locks,
        )
    } else {
        CondvarDeadlockDiagnosis::new(
            "parking_lot::Condvar::wait".to_owned(),
            wait_span,