mirror of
https://github.com/torvalds/linux.git
synced 2026-08-17 12:59:51 +02:00
224ec489d3
This patch add the documentation piece for the reasoning of deadlock detection related to recursive read lock. The following sections are added: * Explain what is a recursive read lock, and what deadlock cases they could introduce. * Introduce the notations for different types of dependencies, and the definition of strong paths. * Proof for a closed strong path is both sufficient and necessary for deadlock detections with recursive read locks involved. The proof could also explain why we call the path "strong" Signed-off-by: Boqun Feng <boqun.feng@gmail.com> Signed-off-by: Peter Zijlstra (Intel) <peterz@infradead.org> Link: https://lkml.kernel.org/r/20200807074238.1632519-3-boqun.feng@gmail.com |
||
|---|---|---|
| .. | ||
| futex-requeue-pi.rst | ||
| hwspinlock.rst | ||
| index.rst | ||
| lockdep-design.rst | ||
| lockstat.rst | ||
| locktorture.rst | ||
| locktypes.rst | ||
| mutex-design.rst | ||
| percpu-rw-semaphore.rst | ||
| pi-futex.rst | ||
| preempt-locking.rst | ||
| robust-futex-ABI.rst | ||
| robust-futexes.rst | ||
| rt-mutex-design.rst | ||
| rt-mutex.rst | ||
| seqlock.rst | ||
| spinlocks.rst | ||
| ww-mutex-design.rst | ||