Snyk has a proof-of-concept or detailed explanation of how to exploit this vulnerability.
The probability is the direct output of the EPSS model, and conveys an overall sense of the threat of exploitation in the wild. The percentile measures the EPSS probability relative to all known EPSS scores. Note: This data is updated daily, relying on the latest available EPSS model version. Check out the EPSS documentation for more details.
In a few clicks we can analyze your entire application and see what components are vulnerable in your application, and suggest you quick fixes.
Test your applicationsUpgrade rcu_cell
to version 0.1.10 or higher.
rcu_cell is an a lockless rcu cell implementation.
Affected versions of this package are vulnerable to Race Condition. It unconditionally implements Send/Sync for RcuCell<T>
. This allows users to send T: !Send
to other threads (while T
enclosed within RcuCell<T>
), and allows users to concurrently access T: !Sync
by using the APIs of RcuCell<T>
that provide access to &T
. This can result in memory corruption caused by data races.
# Run the below program in debug mode use rcu_cell::RcuCell;
use std::rc::Rc; use std::sync::Arc; use std::thread;
fn main() { //
Rc
is neitherSend
norSync
let rcu_cell = RcuCell::new(Some(Rc::new(0_i32))); let arc_parent = Arc::new(rcu_cell);let mut child_threads = vec![]; for _ in 0..5 { let arc_child = Arc::clone(&arc_parent); child_threads.push(thread::spawn(move || { for _ in 0..1000 { let reader = arc_child.as_ref().read(); // data race on internal `strong_count` of `Rc` let _ = Rc::clone(&reader.unwrap()); } })); } for child in child_threads { child.join().expect("failed to join child thread"); } assert_eq!(Rc::strong_count(arc_parent.read().as_ref().unwrap()), 1);
}