1 .\" Copyright (c) 2001 John H. Baldwin <jhb@FreeBSD.org>
2 .\" All rights reserved.
4 .\" Redistribution and use in source and binary forms, with or without
5 .\" modification, are permitted provided that the following conditions
7 .\" 1. Redistributions of source code must retain the above copyright
8 .\" notice, this list of conditions and the following disclaimer.
9 .\" 2. Redistributions in binary form must reproduce the above copyright
10 .\" notice, this list of conditions and the following disclaimer in the
11 .\" documentation and/or other materials provided with the distribution.
13 .\" THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
14 .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
15 .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
16 .\" ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
17 .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
18 .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
19 .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
20 .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
21 .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
22 .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 .Nd lock validation facility
35 .Cd options WITNESS_KDB
36 .Cd options WITNESS_SKIPSPIN
40 module keeps track of the locks acquired and released by each thread.
41 It also keeps track of the order in which locks are acquired with respect
43 Each time a lock is acquired,
45 uses these two lists to verify that a lock is not being acquired in the
47 If a lock order violation is detected, then a message is output to the
48 kernel console detailing the locks involved and the locations in question.
49 Witness can also be configured to drop into the kernel debugger when an order
54 code also checks various other conditions such as verifying that one
55 does not recurse on a non-recursive lock.
58 verifies that a new process would not be switched to when a lock is released
59 or a lock is blocked on during an acquire while any spin locks are held.
60 If any of these checks fail, then the kernel will panic.
62 The flag that controls whether or not the kernel debugger is entered when a
63 lock order violation is detected can be set in a variety of ways.
64 By default, the flag is off, but if the
67 specified, then the flag will default to on.
68 It can also be set from the
72 environment variable or after the kernel has booted via the
75 If the flag is set to zero, then the debugger will not be entered.
76 If the flag is non-zero, then the debugger will be entered.
80 code can also be configured to skip all checks on spin mutexes.
81 By default, this flag defaults to off, but it can be turned on by
85 The flag can also be set via the
88 .Va debug.witness.skipspin .
89 If the variable is set to a non-zero value, then spin mutexes are skipped.
90 Once the kernel has booted, the status of this flag can be examined but not
91 set via the read-only sysctl
92 .Va debug.witness.skipspin .
95 .Va debug.witness.watch
96 specifies the level of witness involvement in the system.
97 A value of 1 specifies that witness is enabled.
98 A value of 0 specifies that witness is disabled, but that can be enabled
99 again. This will maintain a small amount of overhead in the system.
100 A value of -1 specifies that witness is disabled permanently and that
101 cannot be enabled again.
103 .Va debug.witness.watch
109 code also provides two extra
115 are compiled into the kernel:
118 Outputs the list of locks held by the current thread to the kernel console
119 along with the filename and line number at which each lock was last acquired
122 Dump the current order list to the kernel console.
123 The code first displays the lock order tree for all of the sleep locks.
124 Then it displays the lock order tree for all of the spin locks.
125 Finally, it displays a list of locks that have not yet been acquired.
135 code first appeared in
137 and was imported from there into
142 code currently does not handle recursion of shared