![]() With mathematical certainty that a deadlock could not occur (assuming Validator - for all rules that are observed the lock validator proves it This is why we call it a "locking correctness" When determining validity of locking, all possible "deadlock scenarios"Īre considered: assuming arbitrary number of CPUs, arbitrary irq contextĪnd task context constellations, running arbitrary combinations of all ![]() If the new rule couldĬreate a deadlock scenario then this condition is printed out. Transparently and the kernel continues as normal. ![]() If this new rule isĬonsistent with the existing set of rules then the new rule is added New rule against the existing set of rules. Validator subsystem detects a new locking scenario, it validates this Use of spinlocks, rwlocks, mutexes and rwsems). Rules as they occur dynamically (as triggered by the kernel's natural What does the lock validator do? It "observes" and maps all locking Output can be used by kernel developers to figure out the precise Voluminous debug output that begins with "BUG. Typically if the lock validator finds some problem it will print out ![]() Reboot into the kernel and if everything goes well it should boot upįine and you should have /proc/lockdep and /proc/lockdep_stats files. The easiest way to try lockdep on a testbox is to apply the combo patchĭo 'make oldconfig' and accept all the defaults for new config options. We are pleased to announce the first release of the "lock dependencyĬorrectness validator" kernel debugging feature, which can be downloaded To: linux-kernel +Cc: Arjan van de Ven, Andrew Morton ` (73 more replies) 0 siblings, 74 replies 319+ messages in thread 21:22 ` lock validator: floppy.c irq-release fix Ingo Molnar ANNOUNCE: lock validator -V1 All of help / color / mirror / Atom feed * ANNOUNCE: lock validator -V1 21:21 Ingo Molnar ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |