Zengtudor/pybind11
1
0
Fork 0
mirror of https://github.com/pybind/pybind11.git synced 2024-11-22 05:05:11 +00:00
Code Issues Packages Projects Releases Wiki Activity

[docs/advanced] Fix tables in deadlock.md

Browse Source
This commit is contained in:
Thomas Köppe 2024-10-03 16:29:10 +01:00
parent 365cbe96cd
commit 5d0e95ca28
1 changed files with 18 additions and 18 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

36
docs/advanced/deadlock.md
View File

@ -17,13 +17,13 @@ A deadlock can occur when more than one thread attempts to lock more than one
mutex, and two of the threads lock two of the mutexes in different orders. For mutex, and two of the threads lock two of the mutexes in different orders. For
example, consider mutexes `mu1` and `mu2`, and threads T1 and T2, executing: example, consider mutexes `mu1` and `mu2`, and threads T1 and T2, executing:
| T1 | T2 | | T1 | T2 |
--- | ------------------- | ------------------- |--- | ------------------- | -------------------|
1 | `mu1.lock()`{.good} | `mu2.lock()`{.good} |1 | `mu1.lock()`{.good} | `mu2.lock()`{.good}|
2 | `mu2.lock()`{.bad} | `mu1.lock()`{.bad} |2 | `mu2.lock()`{.bad} | `mu1.lock()`{.bad} |
3 | `/* work */` | `/* work */` |3 | `/* work */` | `/* work */` |
4 | `mu2.unlock()` | `mu1.unlock()` |4 | `mu2.unlock()` | `mu1.unlock()` |
5 | `mu1.unlock()` | `mu2.unlock()` |5 | `mu1.unlock()` | `mu2.unlock()` |
Now if T1 manages to lock `mu1` and T2 manages to lock `mu2` (as indicated in Now if T1 manages to lock `mu1` and T2 manages to lock `mu2` (as indicated in
green), then both threads will block while trying to lock the respective other green), then both threads will block while trying to lock the respective other
@ -37,17 +37,17 @@ point; what matters is only the order of any attempt to *lock* the mutexes. For
example, the following, more complex series of operations is just as prone to example, the following, more complex series of operations is just as prone to
deadlock: deadlock:
| T1 | T2 | | T1 | T2 |
--- | ------------------- | ------------------- |--- | ------------------- | -------------------|
1 | `mu1.lock()`{.good} | `mu1.lock()`{.good} |1 | `mu1.lock()`{.good} | `mu1.lock()`{.good}|
2 | waiting for T2 | `mu2.lock()`{.good} |2 | waiting for T2 | `mu2.lock()`{.good}|
3 | waiting for T2 | `/* work */` |3 | waiting for T2 | `/* work */` |
3 | waiting for T2 | `mu1.unlock()` |3 | waiting for T2 | `mu1.unlock()` |
3 | `mu2.lock()`{.bad} | `/* work */` |3 | `mu2.lock()`{.bad} | `/* work */` |
3 | `/* work */` | `mu1.lock()`{.bad} |3 | `/* work */` | `mu1.lock()`{.bad} |
3 | `/* work */` | `/* work */` |3 | `/* work */` | `/* work */` |
4 | `mu2.unlock()` | `mu1.unlock()` |4 | `mu2.unlock()` | `mu1.unlock()` |
5 | `mu1.unlock()` | `mu2.unlock()` |5 | `mu1.unlock()` | `mu2.unlock()` |
When the mutexes involved in a locking sequence are known at compile-time, then When the mutexes involved in a locking sequence are known at compile-time, then
avoiding deadlocks is “merely” a matter of arranging the lock avoiding deadlocks is “merely” a matter of arranging the lock