bert/tracing-mutex
1
0
Fork 0
mirror of https://github.com/bertptrs/tracing-mutex.git synced 2025-12-27 21:40:32 +01:00
Code Issues Projects Releases Wiki Activity

Fix unfortunate typo

Browse Source
This commit is contained in:
Bert Peters
2021-05-13 17:44:45 +02:00
parent 75df988d8a
commit 440693ab1e
1 changed files with 5 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
src/lib.rs
View File

@@ -125,7 +125,7 @@ impl MutexId {
pub fn get_borrowed(&self) -> BorrowedMutex { pub fn get_borrowed(&self) -> BorrowedMutex {
let creates_cycle = HELD_LOCKS.with(|locks| { let creates_cycle = HELD_LOCKS.with(|locks| {
if let Some(&previous) = locks.borrow().last() { if let Some(&previous) = locks.borrow().last() {
let mut graph = get_depedency_graph(); let mut graph = get_dependency_graph();
graph.add_edge(previous, self.value()) && graph.has_cycles() graph.add_edge(previous, self.value()) && graph.has_cycles()
} else { } else {
@@ -157,7 +157,7 @@ impl fmt::Debug for MutexId {
impl Drop for MutexId { impl Drop for MutexId {
fn drop(&mut self) { fn drop(&mut self) {
get_depedency_graph().remove_node(self.value()); get_dependency_graph().remove_node(self.value());
} }
} }
@@ -263,7 +263,7 @@ impl<'a> Drop for BorrowedMutex<'a> {
} }
/// Get a reference to the current dependency graph /// Get a reference to the current dependency graph
fn get_depedency_graph() -> impl DerefMut<Target = DiGraph<usize>> { fn get_dependency_graph() -> impl DerefMut<Target = DiGraph<usize>> {
DEPENDENCY_GRAPH DEPENDENCY_GRAPH
.lock() .lock()
.unwrap_or_else(PoisonError::into_inner) .unwrap_or_else(PoisonError::into_inner)
@@ -295,7 +295,7 @@ mod tests {
let b = LazyMutexId::new(); let b = LazyMutexId::new();
let c = LazyMutexId::new(); let c = LazyMutexId::new();
let mut graph = get_depedency_graph(); let mut graph = get_dependency_graph();
graph.add_edge(a.value(), b.value()); graph.add_edge(a.value(), b.value());
graph.add_edge(b.value(), c.value()); graph.add_edge(b.value(), c.value());
@@ -309,6 +309,6 @@ mod tests {
drop(c); drop(c);
// If c's destructor correctly ran the graph shouldn't contain cycles anymore // If c's destructor correctly ran the graph shouldn't contain cycles anymore
assert!(!get_depedency_graph().has_cycles()); assert!(!get_dependency_graph().has_cycles());
} }
} }