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

Do not allow recursive locks.

Browse Source
This commit is contained in:
Benjamin Lerman
2022-05-01 16:58:58 +02:00
committed by Bert Peters
parent aef99d4f65
commit b5a5ca16c3
2 changed files with 8 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
src/graph.rs
View File

@@ -98,8 +98,8 @@ where
/// would introduce a cycle, the edge is rejected and `false` is returned. /// would introduce a cycle, the edge is rejected and `false` is returned.
pub(crate) fn add_edge(&mut self, x: V, y: V) -> bool { pub(crate) fn add_edge(&mut self, x: V, y: V) -> bool {
if x == y { if x == y {
// self-edges are not considered cycles // self-edges are always considered cycles
return true; return false;
} }
let (_, out_edges, ub) = self.add_node(x); let (_, out_edges, ub) = self.add_node(x);
@@ -258,7 +258,9 @@ mod tests {
for i in 0..NUM_NODES { for i in 0..NUM_NODES {
for j in i..NUM_NODES { for j in i..NUM_NODES {
edges.push((i, j)); if i != j {
edges.push((i, j));
}
} }
} }

4
src/lib.rs
View File

@@ -357,7 +357,9 @@ mod tests {
let mut edges = Vec::with_capacity(NUM_NODES * NUM_NODES); let mut edges = Vec::with_capacity(NUM_NODES * NUM_NODES);
for i in 0..NUM_NODES { for i in 0..NUM_NODES {
for j in i..NUM_NODES { for j in i..NUM_NODES {
edges.push((i, j)); if i != j {
edges.push((i, j));
}
} }
} }