2 * Copyright (c) 2008 Isilon Systems, Inc.
3 * Copyright (c) 2008 Ilya Maykov <ivmaykov@gmail.com>
4 * Copyright (c) 1998 Berkeley Software Design, Inc.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. Berkeley Software Design Inc's name may not be used to endorse or
16 * promote products derived from this software without specific prior
19 * THIS SOFTWARE IS PROVIDED BY BERKELEY SOFTWARE DESIGN INC ``AS IS'' AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED. IN NO EVENT SHALL BERKELEY SOFTWARE DESIGN INC BE LIABLE
23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * from BSDI $Id: mutex_witness.c,v 1.1.2.20 2000/04/27 03:10:27 cp Exp $
32 * and BSDI $Id: synch_machdep.c,v 2.3.2.39 2000/04/27 03:10:25 cp Exp $
36 * Implementation of the `witness' lock verifier. Originally implemented for
37 * mutexes in BSD/OS. Extended to handle generic lock objects and lock
43 * Pronunciation: 'wit-n&s
45 * Etymology: Middle English witnesse, from Old English witnes knowledge,
46 * testimony, witness, from 2wit
47 * Date: before 12th century
48 * 1 : attestation of a fact or event : TESTIMONY
49 * 2 : one that gives evidence; specifically : one who testifies in
50 * a cause or before a judicial tribunal
51 * 3 : one asked to be present at a transaction so as to be able to
52 * testify to its having taken place
53 * 4 : one who has personal knowledge of something
54 * 5 a : something serving as evidence or proof : SIGN
55 * b : public affirmation by word or example of usually
56 * religious faith or conviction <the heroic witness to divine
58 * 6 capitalized : a member of the Jehovah's Witnesses
62 * Special rules concerning Giant and lock orders:
64 * 1) Giant must be acquired before any other mutexes. Stated another way,
65 * no other mutex may be held when Giant is acquired.
67 * 2) Giant must be released when blocking on a sleepable lock.
69 * This rule is less obvious, but is a result of Giant providing the same
70 * semantics as spl(). Basically, when a thread sleeps, it must release
71 * Giant. When a thread blocks on a sleepable lock, it sleeps. Hence rule
74 * 3) Giant may be acquired before or after sleepable locks.
76 * This rule is also not quite as obvious. Giant may be acquired after
77 * a sleepable lock because it is a non-sleepable lock and non-sleepable
78 * locks may always be acquired while holding a sleepable lock. The second
79 * case, Giant before a sleepable lock, follows from rule 2) above. Suppose
80 * you have two threads T1 and T2 and a sleepable lock X. Suppose that T1
81 * acquires X and blocks on Giant. Then suppose that T2 acquires Giant and
82 * blocks on X. When T2 blocks on X, T2 will release Giant allowing T1 to
83 * execute. Thus, acquiring Giant both before and after a sleepable lock
84 * will not result in a lock order reversal.
87 #include <sys/cdefs.h>
88 __FBSDID("$FreeBSD$");
91 #include "opt_hwpmc_hooks.h"
92 #include "opt_stack.h"
93 #include "opt_witness.h"
95 #include <sys/param.h>
98 #include <sys/kernel.h>
100 #include <sys/lock.h>
101 #include <sys/malloc.h>
102 #include <sys/mutex.h>
103 #include <sys/priv.h>
104 #include <sys/proc.h>
105 #include <sys/sbuf.h>
106 #include <sys/sched.h>
107 #include <sys/stack.h>
108 #include <sys/sysctl.h>
109 #include <sys/systm.h>
115 #include <machine/stdarg.h>
117 #if !defined(DDB) && !defined(STACK)
118 #error "DDB or STACK options are required for WITNESS"
121 /* Note that these traces do not work with KTR_ALQ. */
123 #define KTR_WITNESS KTR_SUBSYS
125 #define KTR_WITNESS 0
128 #define LI_RECURSEMASK 0x0000ffff /* Recursion depth of lock instance. */
129 #define LI_EXCLUSIVE 0x00010000 /* Exclusive lock instance. */
130 #define LI_NORELEASE 0x00020000 /* Lock not allowed to be released. */
132 /* Define this to check for blessed mutexes */
135 #define WITNESS_COUNT 1024
136 #define WITNESS_CHILDCOUNT (WITNESS_COUNT * 4)
137 #define WITNESS_HASH_SIZE 251 /* Prime, gives load factor < 2 */
138 #define WITNESS_PENDLIST 768
140 /* Allocate 256 KB of stack data space */
141 #define WITNESS_LO_DATA_COUNT 2048
143 /* Prime, gives load factor of ~2 at full load */
144 #define WITNESS_LO_HASH_SIZE 1021
147 * XXX: This is somewhat bogus, as we assume here that at most 2048 threads
148 * will hold LOCK_NCHILDREN locks. We handle failure ok, and we should
149 * probably be safe for the most part, but it's still a SWAG.
151 #define LOCK_NCHILDREN 5
152 #define LOCK_CHILDCOUNT 2048
154 #define MAX_W_NAME 64
156 #define BADSTACK_SBUF_SIZE (256 * WITNESS_COUNT)
157 #define FULLGRAPH_SBUF_SIZE 512
160 * These flags go in the witness relationship matrix and describe the
161 * relationship between any two struct witness objects.
163 #define WITNESS_UNRELATED 0x00 /* No lock order relation. */
164 #define WITNESS_PARENT 0x01 /* Parent, aka direct ancestor. */
165 #define WITNESS_ANCESTOR 0x02 /* Direct or indirect ancestor. */
166 #define WITNESS_CHILD 0x04 /* Child, aka direct descendant. */
167 #define WITNESS_DESCENDANT 0x08 /* Direct or indirect descendant. */
168 #define WITNESS_ANCESTOR_MASK (WITNESS_PARENT | WITNESS_ANCESTOR)
169 #define WITNESS_DESCENDANT_MASK (WITNESS_CHILD | WITNESS_DESCENDANT)
170 #define WITNESS_RELATED_MASK \
171 (WITNESS_ANCESTOR_MASK | WITNESS_DESCENDANT_MASK)
172 #define WITNESS_REVERSAL 0x10 /* A lock order reversal has been
174 #define WITNESS_RESERVED1 0x20 /* Unused flag, reserved. */
175 #define WITNESS_RESERVED2 0x40 /* Unused flag, reserved. */
176 #define WITNESS_LOCK_ORDER_KNOWN 0x80 /* This lock order is known. */
178 /* Descendant to ancestor flags */
179 #define WITNESS_DTOA(x) (((x) & WITNESS_RELATED_MASK) >> 2)
181 /* Ancestor to descendant flags */
182 #define WITNESS_ATOD(x) (((x) & WITNESS_RELATED_MASK) << 2)
184 #define WITNESS_INDEX_ASSERT(i) \
185 MPASS((i) > 0 && (i) <= w_max_used_index && (i) < WITNESS_COUNT)
187 MALLOC_DEFINE(M_WITNESS, "Witness", "Witness");
190 * Lock instances. A lock instance is the data associated with a lock while
191 * it is held by witness. For example, a lock instance will hold the
192 * recursion count of a lock. Lock instances are held in lists. Spin locks
193 * are held in a per-cpu list while sleep locks are held in per-thread list.
195 struct lock_instance {
196 struct lock_object *li_lock;
203 * A simple list type used to build the list of locks held by a thread
204 * or CPU. We can't simply embed the list in struct lock_object since a
205 * lock may be held by more than one thread if it is a shared lock. Locks
206 * are added to the head of the list, so we fill up each list entry from
207 * "the back" logically. To ease some of the arithmetic, we actually fill
208 * in each list entry the normal way (children[0] then children[1], etc.) but
209 * when we traverse the list we read children[count-1] as the first entry
210 * down to children[0] as the final entry.
212 struct lock_list_entry {
213 struct lock_list_entry *ll_next;
214 struct lock_instance ll_children[LOCK_NCHILDREN];
219 * The main witness structure. One of these per named lock type in the system
220 * (for example, "vnode interlock").
223 char w_name[MAX_W_NAME];
224 uint32_t w_index; /* Index in the relationship matrix */
225 struct lock_class *w_class;
226 STAILQ_ENTRY(witness) w_list; /* List of all witnesses. */
227 STAILQ_ENTRY(witness) w_typelist; /* Witnesses of a type. */
228 struct witness *w_hash_next; /* Linked list in hash buckets. */
229 const char *w_file; /* File where last acquired */
230 uint32_t w_line; /* Line where last acquired */
232 uint16_t w_num_ancestors; /* direct/indirect
234 uint16_t w_num_descendants; /* direct/indirect
235 * descendant count */
237 unsigned w_displayed:1;
238 unsigned w_reversed:1;
241 STAILQ_HEAD(witness_list, witness);
244 * The witness hash table. Keys are witness names (const char *), elements are
245 * witness objects (struct witness *).
247 struct witness_hash {
248 struct witness *wh_array[WITNESS_HASH_SIZE];
254 * Key type for the lock order data hash table.
256 struct witness_lock_order_key {
261 struct witness_lock_order_data {
262 struct stack wlod_stack;
263 struct witness_lock_order_key wlod_key;
264 struct witness_lock_order_data *wlod_next;
268 * The witness lock order data hash table. Keys are witness index tuples
269 * (struct witness_lock_order_key), elements are lock order data objects
270 * (struct witness_lock_order_data).
272 struct witness_lock_order_hash {
273 struct witness_lock_order_data *wloh_array[WITNESS_LO_HASH_SIZE];
279 struct witness_blessed {
285 struct witness_pendhelp {
287 struct lock_object *wh_lock;
290 struct witness_order_list_entry {
292 struct lock_class *w_class;
296 * Returns 0 if one of the locks is a spin lock and the other is not.
297 * Returns 1 otherwise.
300 witness_lock_type_equal(struct witness *w1, struct witness *w2)
303 return ((w1->w_class->lc_flags & (LC_SLEEPLOCK | LC_SPINLOCK)) ==
304 (w2->w_class->lc_flags & (LC_SLEEPLOCK | LC_SPINLOCK)));
308 witness_lock_order_key_empty(const struct witness_lock_order_key *key)
311 return (key->from == 0 && key->to == 0);
315 witness_lock_order_key_equal(const struct witness_lock_order_key *a,
316 const struct witness_lock_order_key *b)
319 return (a->from == b->from && a->to == b->to);
322 static int _isitmyx(struct witness *w1, struct witness *w2, int rmask,
325 static void _witness_debugger(int cond, const char *msg);
327 static void adopt(struct witness *parent, struct witness *child);
329 static int blessed(struct witness *, struct witness *);
331 static void depart(struct witness *w);
332 static struct witness *enroll(const char *description,
333 struct lock_class *lock_class);
334 static struct lock_instance *find_instance(struct lock_list_entry *list,
335 struct lock_object *lock);
336 static int isitmychild(struct witness *parent, struct witness *child);
337 static int isitmydescendant(struct witness *parent, struct witness *child);
338 static void itismychild(struct witness *parent, struct witness *child);
339 static int sysctl_debug_witness_badstacks(SYSCTL_HANDLER_ARGS);
340 static int sysctl_debug_witness_watch(SYSCTL_HANDLER_ARGS);
341 static int sysctl_debug_witness_fullgraph(SYSCTL_HANDLER_ARGS);
342 static void witness_add_fullgraph(struct sbuf *sb, struct witness *parent);
344 static void witness_ddb_compute_levels(void);
345 static void witness_ddb_display(int(*)(const char *fmt, ...));
346 static void witness_ddb_display_descendants(int(*)(const char *fmt, ...),
347 struct witness *, int indent);
348 static void witness_ddb_display_list(int(*prnt)(const char *fmt, ...),
349 struct witness_list *list);
350 static void witness_ddb_level_descendants(struct witness *parent, int l);
351 static void witness_ddb_list(struct thread *td);
353 static void witness_free(struct witness *m);
354 static struct witness *witness_get(void);
355 static uint32_t witness_hash_djb2(const uint8_t *key, uint32_t size);
356 static struct witness *witness_hash_get(const char *key);
357 static void witness_hash_put(struct witness *w);
358 static void witness_init_hash_tables(void);
359 static void witness_increment_graph_generation(void);
360 static void witness_lock_list_free(struct lock_list_entry *lle);
361 static struct lock_list_entry *witness_lock_list_get(void);
362 static int witness_lock_order_add(struct witness *parent,
363 struct witness *child);
364 static int witness_lock_order_check(struct witness *parent,
365 struct witness *child);
366 static struct witness_lock_order_data *witness_lock_order_get(
367 struct witness *parent,
368 struct witness *child);
369 static void witness_list_lock(struct lock_instance *instance,
370 int (*prnt)(const char *fmt, ...));
371 static void witness_setflag(struct lock_object *lock, int flag, int set);
374 #define witness_debugger(c) _witness_debugger(c, __func__)
376 #define witness_debugger(c)
379 SYSCTL_NODE(_debug, OID_AUTO, witness, CTLFLAG_RW, NULL, "Witness Locking");
382 * If set to 0, lock order checking is disabled. If set to -1,
383 * witness is completely disabled. Otherwise witness performs full
384 * lock order checking for all locks. At runtime, lock order checking
385 * may be toggled. However, witness cannot be reenabled once it is
386 * completely disabled.
388 static int witness_watch = 1;
389 TUNABLE_INT("debug.witness.watch", &witness_watch);
390 SYSCTL_PROC(_debug_witness, OID_AUTO, watch, CTLFLAG_RW | CTLTYPE_INT, NULL, 0,
391 sysctl_debug_witness_watch, "I", "witness is watching lock operations");
395 * When KDB is enabled and witness_kdb is 1, it will cause the system
396 * to drop into kdebug() when:
397 * - a lock hierarchy violation occurs
398 * - locks are held when going to sleep.
405 TUNABLE_INT("debug.witness.kdb", &witness_kdb);
406 SYSCTL_INT(_debug_witness, OID_AUTO, kdb, CTLFLAG_RW, &witness_kdb, 0, "");
409 * When KDB is enabled and witness_trace is 1, it will cause the system
410 * to print a stack trace:
411 * - a lock hierarchy violation occurs
412 * - locks are held when going to sleep.
414 int witness_trace = 1;
415 TUNABLE_INT("debug.witness.trace", &witness_trace);
416 SYSCTL_INT(_debug_witness, OID_AUTO, trace, CTLFLAG_RW, &witness_trace, 0, "");
419 #ifdef WITNESS_SKIPSPIN
420 int witness_skipspin = 1;
422 int witness_skipspin = 0;
424 TUNABLE_INT("debug.witness.skipspin", &witness_skipspin);
425 SYSCTL_INT(_debug_witness, OID_AUTO, skipspin, CTLFLAG_RDTUN, &witness_skipspin,
429 * Call this to print out the relations between locks.
431 SYSCTL_PROC(_debug_witness, OID_AUTO, fullgraph, CTLTYPE_STRING | CTLFLAG_RD,
432 NULL, 0, sysctl_debug_witness_fullgraph, "A", "Show locks relation graphs");
435 * Call this to print out the witness faulty stacks.
437 SYSCTL_PROC(_debug_witness, OID_AUTO, badstacks, CTLTYPE_STRING | CTLFLAG_RD,
438 NULL, 0, sysctl_debug_witness_badstacks, "A", "Show bad witness stacks");
440 static struct mtx w_mtx;
443 static struct witness_list w_free = STAILQ_HEAD_INITIALIZER(w_free);
444 static struct witness_list w_all = STAILQ_HEAD_INITIALIZER(w_all);
447 static struct witness_list w_spin = STAILQ_HEAD_INITIALIZER(w_spin);
448 static struct witness_list w_sleep = STAILQ_HEAD_INITIALIZER(w_sleep);
451 static struct lock_list_entry *w_lock_list_free = NULL;
452 static struct witness_pendhelp pending_locks[WITNESS_PENDLIST];
453 static u_int pending_cnt;
455 static int w_free_cnt, w_spin_cnt, w_sleep_cnt;
456 SYSCTL_INT(_debug_witness, OID_AUTO, free_cnt, CTLFLAG_RD, &w_free_cnt, 0, "");
457 SYSCTL_INT(_debug_witness, OID_AUTO, spin_cnt, CTLFLAG_RD, &w_spin_cnt, 0, "");
458 SYSCTL_INT(_debug_witness, OID_AUTO, sleep_cnt, CTLFLAG_RD, &w_sleep_cnt, 0,
461 static struct witness *w_data;
462 static uint8_t w_rmatrix[WITNESS_COUNT+1][WITNESS_COUNT+1];
463 static struct lock_list_entry w_locklistdata[LOCK_CHILDCOUNT];
464 static struct witness_hash w_hash; /* The witness hash table. */
466 /* The lock order data hash */
467 static struct witness_lock_order_data w_lodata[WITNESS_LO_DATA_COUNT];
468 static struct witness_lock_order_data *w_lofree = NULL;
469 static struct witness_lock_order_hash w_lohash;
470 static int w_max_used_index = 0;
471 static unsigned int w_generation = 0;
472 static const char w_notrunning[] = "Witness not running\n";
473 static const char w_stillcold[] = "Witness is still cold\n";
476 static struct witness_order_list_entry order_lists[] = {
480 { "proctree", &lock_class_sx },
481 { "allproc", &lock_class_sx },
482 { "allprison", &lock_class_sx },
487 { "Giant", &lock_class_mtx_sleep },
488 { "pipe mutex", &lock_class_mtx_sleep },
489 { "sigio lock", &lock_class_mtx_sleep },
490 { "process group", &lock_class_mtx_sleep },
491 { "process lock", &lock_class_mtx_sleep },
492 { "session", &lock_class_mtx_sleep },
493 { "uidinfo hash", &lock_class_rw },
495 { "pmc-sleep", &lock_class_mtx_sleep },
497 { "time lock", &lock_class_mtx_sleep },
502 { "accept", &lock_class_mtx_sleep },
503 { "so_snd", &lock_class_mtx_sleep },
504 { "so_rcv", &lock_class_mtx_sleep },
505 { "sellck", &lock_class_mtx_sleep },
510 { "so_rcv", &lock_class_mtx_sleep },
511 { "radix node head", &lock_class_rw },
512 { "rtentry", &lock_class_mtx_sleep },
513 { "ifaddr", &lock_class_mtx_sleep },
517 * protocol locks before interface locks, after UDP locks.
519 { "udpinp", &lock_class_rw },
520 { "in_multi_mtx", &lock_class_mtx_sleep },
521 { "igmp_mtx", &lock_class_mtx_sleep },
522 { "if_addr_mtx", &lock_class_mtx_sleep },
526 * protocol locks before interface locks, after UDP locks.
528 { "udpinp", &lock_class_rw },
529 { "in6_multi_mtx", &lock_class_mtx_sleep },
530 { "mld_mtx", &lock_class_mtx_sleep },
531 { "if_addr_mtx", &lock_class_mtx_sleep },
534 * UNIX Domain Sockets
536 { "unp_global_rwlock", &lock_class_rw },
537 { "unp_list_lock", &lock_class_mtx_sleep },
538 { "unp", &lock_class_mtx_sleep },
539 { "so_snd", &lock_class_mtx_sleep },
544 { "udp", &lock_class_rw },
545 { "udpinp", &lock_class_rw },
546 { "so_snd", &lock_class_mtx_sleep },
551 { "tcp", &lock_class_rw },
552 { "tcpinp", &lock_class_rw },
553 { "so_snd", &lock_class_mtx_sleep },
558 { "ddp_list_mtx", &lock_class_mtx_sleep },
559 { "ddp_mtx", &lock_class_mtx_sleep },
564 { "bpf global lock", &lock_class_mtx_sleep },
565 { "bpf interface lock", &lock_class_mtx_sleep },
566 { "bpf cdev lock", &lock_class_mtx_sleep },
571 { "nfsd_mtx", &lock_class_mtx_sleep },
572 { "so_snd", &lock_class_mtx_sleep },
578 { "802.11 com lock", &lock_class_mtx_sleep},
583 { "network driver", &lock_class_mtx_sleep},
589 { "ng_node", &lock_class_mtx_sleep },
590 { "ng_worklist", &lock_class_mtx_sleep },
595 { "system map", &lock_class_mtx_sleep },
596 { "vm page queue mutex", &lock_class_mtx_sleep },
597 { "vnode interlock", &lock_class_mtx_sleep },
598 { "cdev", &lock_class_mtx_sleep },
604 { "vm object", &lock_class_mtx_sleep },
605 { "page lock", &lock_class_mtx_sleep },
606 { "vm page queue mutex", &lock_class_mtx_sleep },
607 { "pmap", &lock_class_mtx_sleep },
610 * kqueue/VFS interaction
612 { "kqueue", &lock_class_mtx_sleep },
613 { "struct mount mtx", &lock_class_mtx_sleep },
614 { "vnode interlock", &lock_class_mtx_sleep },
619 { "dn->dn_mtx", &lock_class_sx },
620 { "dr->dt.di.dr_mtx", &lock_class_sx },
621 { "db->db_mtx", &lock_class_sx },
627 { "ap boot", &lock_class_mtx_spin },
629 { "rm.mutex_mtx", &lock_class_mtx_spin },
630 { "sio", &lock_class_mtx_spin },
631 { "scrlock", &lock_class_mtx_spin },
633 { "cy", &lock_class_mtx_spin },
636 { "pcib_mtx", &lock_class_mtx_spin },
637 { "rtc_mtx", &lock_class_mtx_spin },
639 { "scc_hwmtx", &lock_class_mtx_spin },
640 { "uart_hwmtx", &lock_class_mtx_spin },
641 { "fast_taskqueue", &lock_class_mtx_spin },
642 { "intr table", &lock_class_mtx_spin },
644 { "pmc-per-proc", &lock_class_mtx_spin },
646 { "process slock", &lock_class_mtx_spin },
647 { "sleepq chain", &lock_class_mtx_spin },
648 { "umtx lock", &lock_class_mtx_spin },
649 { "rm_spinlock", &lock_class_mtx_spin },
650 { "turnstile chain", &lock_class_mtx_spin },
651 { "turnstile lock", &lock_class_mtx_spin },
652 { "sched lock", &lock_class_mtx_spin },
653 { "td_contested", &lock_class_mtx_spin },
654 { "callout", &lock_class_mtx_spin },
655 { "entropy harvest mutex", &lock_class_mtx_spin },
656 { "syscons video lock", &lock_class_mtx_spin },
658 { "smp rendezvous", &lock_class_mtx_spin },
661 { "tlb0", &lock_class_mtx_spin },
666 { "intrcnt", &lock_class_mtx_spin },
667 { "icu", &lock_class_mtx_spin },
668 #if defined(SMP) && defined(__sparc64__)
669 { "ipi", &lock_class_mtx_spin },
672 { "allpmaps", &lock_class_mtx_spin },
673 { "descriptor tables", &lock_class_mtx_spin },
675 { "clk", &lock_class_mtx_spin },
676 { "cpuset", &lock_class_mtx_spin },
677 { "mprof lock", &lock_class_mtx_spin },
678 { "zombie lock", &lock_class_mtx_spin },
679 { "ALD Queue", &lock_class_mtx_spin },
681 { "MCA spin lock", &lock_class_mtx_spin },
683 #if defined(__i386__) || defined(__amd64__)
684 { "pcicfg", &lock_class_mtx_spin },
685 { "NDIS thread lock", &lock_class_mtx_spin },
687 { "tw_osl_io_lock", &lock_class_mtx_spin },
688 { "tw_osl_q_lock", &lock_class_mtx_spin },
689 { "tw_cl_io_lock", &lock_class_mtx_spin },
690 { "tw_cl_intr_lock", &lock_class_mtx_spin },
691 { "tw_cl_gen_lock", &lock_class_mtx_spin },
693 { "pmc-leaf", &lock_class_mtx_spin },
695 { "blocked lock", &lock_class_mtx_spin },
702 * Pairs of locks which have been blessed
703 * Don't complain about order problems with blessed locks
705 static struct witness_blessed blessed_list[] = {
707 static int blessed_count =
708 sizeof(blessed_list) / sizeof(struct witness_blessed);
712 * This global is set to 0 once it becomes safe to use the witness code.
714 static int witness_cold = 1;
717 * This global is set to 1 once the static lock orders have been enrolled
718 * so that a warning can be issued for any spin locks enrolled later.
720 static int witness_spin_warn = 0;
723 * The WITNESS-enabled diagnostic code. Note that the witness code does
724 * assume that the early boot is single-threaded at least until after this
725 * routine is completed.
728 witness_initialize(void *dummy __unused)
730 struct lock_object *lock;
731 struct witness_order_list_entry *order;
732 struct witness *w, *w1;
735 w_data = malloc(sizeof (struct witness) * WITNESS_COUNT, M_WITNESS,
739 * We have to release Giant before initializing its witness
740 * structure so that WITNESS doesn't get confused.
743 mtx_assert(&Giant, MA_NOTOWNED);
745 CTR1(KTR_WITNESS, "%s: initializing witness", __func__);
746 mtx_init(&w_mtx, "witness lock", NULL, MTX_SPIN | MTX_QUIET |
747 MTX_NOWITNESS | MTX_NOPROFILE);
748 for (i = WITNESS_COUNT - 1; i >= 0; i--) {
750 memset(w, 0, sizeof(*w));
751 w_data[i].w_index = i; /* Witness index never changes. */
754 KASSERT(STAILQ_FIRST(&w_free)->w_index == 0,
755 ("%s: Invalid list of free witness objects", __func__));
757 /* Witness with index 0 is not used to aid in debugging. */
758 STAILQ_REMOVE_HEAD(&w_free, w_list);
762 (sizeof(**w_rmatrix) * (WITNESS_COUNT+1) * (WITNESS_COUNT+1)));
764 for (i = 0; i < LOCK_CHILDCOUNT; i++)
765 witness_lock_list_free(&w_locklistdata[i]);
766 witness_init_hash_tables();
768 /* First add in all the specified order lists. */
769 for (order = order_lists; order->w_name != NULL; order++) {
770 w = enroll(order->w_name, order->w_class);
773 w->w_file = "order list";
774 for (order++; order->w_name != NULL; order++) {
775 w1 = enroll(order->w_name, order->w_class);
778 w1->w_file = "order list";
783 witness_spin_warn = 1;
785 /* Iterate through all locks and add them to witness. */
786 for (i = 0; pending_locks[i].wh_lock != NULL; i++) {
787 lock = pending_locks[i].wh_lock;
788 KASSERT(lock->lo_flags & LO_WITNESS,
789 ("%s: lock %s is on pending list but not LO_WITNESS",
790 __func__, lock->lo_name));
791 lock->lo_witness = enroll(pending_locks[i].wh_type,
795 /* Mark the witness code as being ready for use. */
800 SYSINIT(witness_init, SI_SUB_WITNESS, SI_ORDER_FIRST, witness_initialize,
804 witness_init(struct lock_object *lock, const char *type)
806 struct lock_class *class;
808 /* Various sanity checks. */
809 class = LOCK_CLASS(lock);
810 if ((lock->lo_flags & LO_RECURSABLE) != 0 &&
811 (class->lc_flags & LC_RECURSABLE) == 0)
812 panic("%s: lock (%s) %s can not be recursable", __func__,
813 class->lc_name, lock->lo_name);
814 if ((lock->lo_flags & LO_SLEEPABLE) != 0 &&
815 (class->lc_flags & LC_SLEEPABLE) == 0)
816 panic("%s: lock (%s) %s can not be sleepable", __func__,
817 class->lc_name, lock->lo_name);
818 if ((lock->lo_flags & LO_UPGRADABLE) != 0 &&
819 (class->lc_flags & LC_UPGRADABLE) == 0)
820 panic("%s: lock (%s) %s can not be upgradable", __func__,
821 class->lc_name, lock->lo_name);
824 * If we shouldn't watch this lock, then just clear lo_witness.
825 * Otherwise, if witness_cold is set, then it is too early to
826 * enroll this lock, so defer it to witness_initialize() by adding
827 * it to the pending_locks list. If it is not too early, then enroll
830 if (witness_watch < 1 || panicstr != NULL ||
831 (lock->lo_flags & LO_WITNESS) == 0)
832 lock->lo_witness = NULL;
833 else if (witness_cold) {
834 pending_locks[pending_cnt].wh_lock = lock;
835 pending_locks[pending_cnt++].wh_type = type;
836 if (pending_cnt > WITNESS_PENDLIST)
837 panic("%s: pending locks list is too small, bump it\n",
840 lock->lo_witness = enroll(type, class);
844 witness_destroy(struct lock_object *lock)
846 struct lock_class *class;
849 class = LOCK_CLASS(lock);
852 panic("lock (%s) %s destroyed while witness_cold",
853 class->lc_name, lock->lo_name);
855 /* XXX: need to verify that no one holds the lock */
856 if ((lock->lo_flags & LO_WITNESS) == 0 || lock->lo_witness == NULL)
858 w = lock->lo_witness;
860 mtx_lock_spin(&w_mtx);
861 MPASS(w->w_refcount > 0);
864 if (w->w_refcount == 0)
866 mtx_unlock_spin(&w_mtx);
871 witness_ddb_compute_levels(void)
876 * First clear all levels.
878 STAILQ_FOREACH(w, &w_all, w_list)
882 * Look for locks with no parents and level all their descendants.
884 STAILQ_FOREACH(w, &w_all, w_list) {
886 /* If the witness has ancestors (is not a root), skip it. */
887 if (w->w_num_ancestors > 0)
889 witness_ddb_level_descendants(w, 0);
894 witness_ddb_level_descendants(struct witness *w, int l)
898 if (w->w_ddb_level >= l)
904 for (i = 1; i <= w_max_used_index; i++) {
905 if (w_rmatrix[w->w_index][i] & WITNESS_PARENT)
906 witness_ddb_level_descendants(&w_data[i], l);
911 witness_ddb_display_descendants(int(*prnt)(const char *fmt, ...),
912 struct witness *w, int indent)
916 for (i = 0; i < indent; i++)
918 prnt("%s (type: %s, depth: %d, active refs: %d)",
919 w->w_name, w->w_class->lc_name,
920 w->w_ddb_level, w->w_refcount);
921 if (w->w_displayed) {
922 prnt(" -- (already displayed)\n");
926 if (w->w_file != NULL && w->w_line != 0)
927 prnt(" -- last acquired @ %s:%d\n", w->w_file,
930 prnt(" -- never acquired\n");
932 WITNESS_INDEX_ASSERT(w->w_index);
933 for (i = 1; i <= w_max_used_index; i++) {
934 if (w_rmatrix[w->w_index][i] & WITNESS_PARENT)
935 witness_ddb_display_descendants(prnt, &w_data[i],
941 witness_ddb_display_list(int(*prnt)(const char *fmt, ...),
942 struct witness_list *list)
946 STAILQ_FOREACH(w, list, w_typelist) {
947 if (w->w_file == NULL || w->w_ddb_level > 0)
950 /* This lock has no anscestors - display its descendants. */
951 witness_ddb_display_descendants(prnt, w, 0);
956 witness_ddb_display(int(*prnt)(const char *fmt, ...))
960 KASSERT(witness_cold == 0, ("%s: witness_cold", __func__));
961 witness_ddb_compute_levels();
963 /* Clear all the displayed flags. */
964 STAILQ_FOREACH(w, &w_all, w_list)
968 * First, handle sleep locks which have been acquired at least
971 prnt("Sleep locks:\n");
972 witness_ddb_display_list(prnt, &w_sleep);
975 * Now do spin locks which have been acquired at least once.
977 prnt("\nSpin locks:\n");
978 witness_ddb_display_list(prnt, &w_spin);
981 * Finally, any locks which have not been acquired yet.
983 prnt("\nLocks which were never acquired:\n");
984 STAILQ_FOREACH(w, &w_all, w_list) {
985 if (w->w_file != NULL || w->w_refcount == 0)
987 prnt("%s (type: %s, depth: %d)\n", w->w_name,
988 w->w_class->lc_name, w->w_ddb_level);
993 /* Trim useless garbage from filenames. */
995 fixup_filename(const char *file)
1000 while (strncmp(file, "../", 3) == 0)
1006 witness_defineorder(struct lock_object *lock1, struct lock_object *lock2)
1009 if (witness_watch == -1 || panicstr != NULL)
1012 /* Require locks that witness knows about. */
1013 if (lock1 == NULL || lock1->lo_witness == NULL || lock2 == NULL ||
1014 lock2->lo_witness == NULL)
1017 mtx_assert(&w_mtx, MA_NOTOWNED);
1018 mtx_lock_spin(&w_mtx);
1021 * If we already have either an explicit or implied lock order that
1022 * is the other way around, then return an error.
1024 if (witness_watch &&
1025 isitmydescendant(lock2->lo_witness, lock1->lo_witness)) {
1026 mtx_unlock_spin(&w_mtx);
1030 /* Try to add the new order. */
1031 CTR3(KTR_WITNESS, "%s: adding %s as a child of %s", __func__,
1032 lock2->lo_witness->w_name, lock1->lo_witness->w_name);
1033 itismychild(lock1->lo_witness, lock2->lo_witness);
1034 mtx_unlock_spin(&w_mtx);
1039 witness_checkorder(struct lock_object *lock, int flags, const char *file,
1040 int line, struct lock_object *interlock)
1042 struct lock_list_entry *lock_list, *lle;
1043 struct lock_instance *lock1, *lock2, *plock;
1044 struct lock_class *class;
1045 struct witness *w, *w1;
1049 if (witness_cold || witness_watch < 1 || lock->lo_witness == NULL ||
1053 w = lock->lo_witness;
1054 class = LOCK_CLASS(lock);
1056 file = fixup_filename(file);
1058 if (class->lc_flags & LC_SLEEPLOCK) {
1061 * Since spin locks include a critical section, this check
1062 * implicitly enforces a lock order of all sleep locks before
1065 if (td->td_critnest != 0 && !kdb_active)
1066 panic("blockable sleep lock (%s) %s @ %s:%d",
1067 class->lc_name, lock->lo_name, file, line);
1070 * If this is the first lock acquired then just return as
1071 * no order checking is needed.
1073 lock_list = td->td_sleeplocks;
1074 if (lock_list == NULL || lock_list->ll_count == 0)
1079 * If this is the first lock, just return as no order
1080 * checking is needed. Avoid problems with thread
1081 * migration pinning the thread while checking if
1082 * spinlocks are held. If at least one spinlock is held
1083 * the thread is in a safe path and it is allowed to
1087 lock_list = PCPU_GET(spinlocks);
1088 if (lock_list == NULL || lock_list->ll_count == 0) {
1096 * Check to see if we are recursing on a lock we already own. If
1097 * so, make sure that we don't mismatch exclusive and shared lock
1100 lock1 = find_instance(lock_list, lock);
1101 if (lock1 != NULL) {
1102 if ((lock1->li_flags & LI_EXCLUSIVE) != 0 &&
1103 (flags & LOP_EXCLUSIVE) == 0) {
1104 printf("shared lock of (%s) %s @ %s:%d\n",
1105 class->lc_name, lock->lo_name, file, line);
1106 printf("while exclusively locked from %s:%d\n",
1107 lock1->li_file, lock1->li_line);
1108 panic("share->excl");
1110 if ((lock1->li_flags & LI_EXCLUSIVE) == 0 &&
1111 (flags & LOP_EXCLUSIVE) != 0) {
1112 printf("exclusive lock of (%s) %s @ %s:%d\n",
1113 class->lc_name, lock->lo_name, file, line);
1114 printf("while share locked from %s:%d\n",
1115 lock1->li_file, lock1->li_line);
1116 panic("excl->share");
1122 * Find the previously acquired lock, but ignore interlocks.
1124 plock = &lock_list->ll_children[lock_list->ll_count - 1];
1125 if (interlock != NULL && plock->li_lock == interlock) {
1126 if (lock_list->ll_count > 1)
1128 &lock_list->ll_children[lock_list->ll_count - 2];
1130 lle = lock_list->ll_next;
1133 * The interlock is the only lock we hold, so
1138 plock = &lle->ll_children[lle->ll_count - 1];
1143 * Try to perform most checks without a lock. If this succeeds we
1144 * can skip acquiring the lock and return success.
1146 w1 = plock->li_lock->lo_witness;
1147 if (witness_lock_order_check(w1, w))
1151 * Check for duplicate locks of the same type. Note that we only
1152 * have to check for this on the last lock we just acquired. Any
1153 * other cases will be caught as lock order violations.
1155 mtx_lock_spin(&w_mtx);
1156 witness_lock_order_add(w1, w);
1159 if (!(lock->lo_flags & LO_DUPOK) && !(flags & LOP_DUPOK) &&
1160 !(w_rmatrix[i][i] & WITNESS_REVERSAL)) {
1161 w_rmatrix[i][i] |= WITNESS_REVERSAL;
1163 mtx_unlock_spin(&w_mtx);
1165 "acquiring duplicate lock of same type: \"%s\"\n",
1167 printf(" 1st %s @ %s:%d\n", plock->li_lock->lo_name,
1168 plock->li_file, plock->li_line);
1169 printf(" 2nd %s @ %s:%d\n", lock->lo_name, file, line);
1170 witness_debugger(1);
1172 mtx_unlock_spin(&w_mtx);
1175 mtx_assert(&w_mtx, MA_OWNED);
1178 * If we know that the lock we are acquiring comes after
1179 * the lock we most recently acquired in the lock order tree,
1180 * then there is no need for any further checks.
1182 if (isitmychild(w1, w))
1185 for (j = 0, lle = lock_list; lle != NULL; lle = lle->ll_next) {
1186 for (i = lle->ll_count - 1; i >= 0; i--, j++) {
1188 MPASS(j < WITNESS_COUNT);
1189 lock1 = &lle->ll_children[i];
1192 * Ignore the interlock the first time we see it.
1194 if (interlock != NULL && interlock == lock1->li_lock) {
1200 * If this lock doesn't undergo witness checking,
1203 w1 = lock1->li_lock->lo_witness;
1205 KASSERT((lock1->li_lock->lo_flags & LO_WITNESS) == 0,
1206 ("lock missing witness structure"));
1211 * If we are locking Giant and this is a sleepable
1212 * lock, then skip it.
1214 if ((lock1->li_lock->lo_flags & LO_SLEEPABLE) != 0 &&
1215 lock == &Giant.lock_object)
1219 * If we are locking a sleepable lock and this lock
1220 * is Giant, then skip it.
1222 if ((lock->lo_flags & LO_SLEEPABLE) != 0 &&
1223 lock1->li_lock == &Giant.lock_object)
1227 * If we are locking a sleepable lock and this lock
1228 * isn't sleepable, we want to treat it as a lock
1229 * order violation to enfore a general lock order of
1230 * sleepable locks before non-sleepable locks.
1232 if (((lock->lo_flags & LO_SLEEPABLE) != 0 &&
1233 (lock1->li_lock->lo_flags & LO_SLEEPABLE) == 0))
1237 * If we are locking Giant and this is a non-sleepable
1238 * lock, then treat it as a reversal.
1240 if ((lock1->li_lock->lo_flags & LO_SLEEPABLE) == 0 &&
1241 lock == &Giant.lock_object)
1245 * Check the lock order hierarchy for a reveresal.
1247 if (!isitmydescendant(w, w1))
1252 * We have a lock order violation, check to see if it
1253 * is allowed or has already been yelled about.
1258 * If the lock order is blessed, just bail. We don't
1259 * look for other lock order violations though, which
1266 /* Bail if this violation is known */
1267 if (w_rmatrix[w1->w_index][w->w_index] & WITNESS_REVERSAL)
1270 /* Record this as a violation */
1271 w_rmatrix[w1->w_index][w->w_index] |= WITNESS_REVERSAL;
1272 w_rmatrix[w->w_index][w1->w_index] |= WITNESS_REVERSAL;
1273 w->w_reversed = w1->w_reversed = 1;
1274 witness_increment_graph_generation();
1275 mtx_unlock_spin(&w_mtx);
1278 * Ok, yell about it.
1280 if (((lock->lo_flags & LO_SLEEPABLE) != 0 &&
1281 (lock1->li_lock->lo_flags & LO_SLEEPABLE) == 0))
1283 "lock order reversal: (sleepable after non-sleepable)\n");
1284 else if ((lock1->li_lock->lo_flags & LO_SLEEPABLE) == 0
1285 && lock == &Giant.lock_object)
1287 "lock order reversal: (Giant after non-sleepable)\n");
1289 printf("lock order reversal:\n");
1292 * Try to locate an earlier lock with
1293 * witness w in our list.
1296 lock2 = &lle->ll_children[i];
1297 MPASS(lock2->li_lock != NULL);
1298 if (lock2->li_lock->lo_witness == w)
1300 if (i == 0 && lle->ll_next != NULL) {
1302 i = lle->ll_count - 1;
1303 MPASS(i >= 0 && i < LOCK_NCHILDREN);
1308 printf(" 1st %p %s (%s) @ %s:%d\n",
1309 lock1->li_lock, lock1->li_lock->lo_name,
1310 w1->w_name, lock1->li_file, lock1->li_line);
1311 printf(" 2nd %p %s (%s) @ %s:%d\n", lock,
1312 lock->lo_name, w->w_name, file, line);
1314 printf(" 1st %p %s (%s) @ %s:%d\n",
1315 lock2->li_lock, lock2->li_lock->lo_name,
1316 lock2->li_lock->lo_witness->w_name,
1317 lock2->li_file, lock2->li_line);
1318 printf(" 2nd %p %s (%s) @ %s:%d\n",
1319 lock1->li_lock, lock1->li_lock->lo_name,
1320 w1->w_name, lock1->li_file, lock1->li_line);
1321 printf(" 3rd %p %s (%s) @ %s:%d\n", lock,
1322 lock->lo_name, w->w_name, file, line);
1324 witness_debugger(1);
1330 * If requested, build a new lock order. However, don't build a new
1331 * relationship between a sleepable lock and Giant if it is in the
1332 * wrong direction. The correct lock order is that sleepable locks
1333 * always come before Giant.
1335 if (flags & LOP_NEWORDER &&
1336 !(plock->li_lock == &Giant.lock_object &&
1337 (lock->lo_flags & LO_SLEEPABLE) != 0)) {
1338 CTR3(KTR_WITNESS, "%s: adding %s as a child of %s", __func__,
1339 w->w_name, plock->li_lock->lo_witness->w_name);
1340 itismychild(plock->li_lock->lo_witness, w);
1343 mtx_unlock_spin(&w_mtx);
1347 witness_lock(struct lock_object *lock, int flags, const char *file, int line)
1349 struct lock_list_entry **lock_list, *lle;
1350 struct lock_instance *instance;
1354 if (witness_cold || witness_watch == -1 || lock->lo_witness == NULL ||
1357 w = lock->lo_witness;
1359 file = fixup_filename(file);
1361 /* Determine lock list for this lock. */
1362 if (LOCK_CLASS(lock)->lc_flags & LC_SLEEPLOCK)
1363 lock_list = &td->td_sleeplocks;
1365 lock_list = PCPU_PTR(spinlocks);
1367 /* Check to see if we are recursing on a lock we already own. */
1368 instance = find_instance(*lock_list, lock);
1369 if (instance != NULL) {
1370 instance->li_flags++;
1371 CTR4(KTR_WITNESS, "%s: pid %d recursed on %s r=%d", __func__,
1372 td->td_proc->p_pid, lock->lo_name,
1373 instance->li_flags & LI_RECURSEMASK);
1374 instance->li_file = file;
1375 instance->li_line = line;
1379 /* Update per-witness last file and line acquire. */
1383 /* Find the next open lock instance in the list and fill it. */
1385 if (lle == NULL || lle->ll_count == LOCK_NCHILDREN) {
1386 lle = witness_lock_list_get();
1389 lle->ll_next = *lock_list;
1390 CTR3(KTR_WITNESS, "%s: pid %d added lle %p", __func__,
1391 td->td_proc->p_pid, lle);
1394 instance = &lle->ll_children[lle->ll_count++];
1395 instance->li_lock = lock;
1396 instance->li_line = line;
1397 instance->li_file = file;
1398 if ((flags & LOP_EXCLUSIVE) != 0)
1399 instance->li_flags = LI_EXCLUSIVE;
1401 instance->li_flags = 0;
1402 CTR4(KTR_WITNESS, "%s: pid %d added %s as lle[%d]", __func__,
1403 td->td_proc->p_pid, lock->lo_name, lle->ll_count - 1);
1407 witness_upgrade(struct lock_object *lock, int flags, const char *file, int line)
1409 struct lock_instance *instance;
1410 struct lock_class *class;
1412 KASSERT(witness_cold == 0, ("%s: witness_cold", __func__));
1413 if (lock->lo_witness == NULL || witness_watch == -1 || panicstr != NULL)
1415 class = LOCK_CLASS(lock);
1416 file = fixup_filename(file);
1417 if (witness_watch) {
1418 if ((lock->lo_flags & LO_UPGRADABLE) == 0)
1419 panic("upgrade of non-upgradable lock (%s) %s @ %s:%d",
1420 class->lc_name, lock->lo_name, file, line);
1421 if ((class->lc_flags & LC_SLEEPLOCK) == 0)
1422 panic("upgrade of non-sleep lock (%s) %s @ %s:%d",
1423 class->lc_name, lock->lo_name, file, line);
1425 instance = find_instance(curthread->td_sleeplocks, lock);
1426 if (instance == NULL)
1427 panic("upgrade of unlocked lock (%s) %s @ %s:%d",
1428 class->lc_name, lock->lo_name, file, line);
1429 if (witness_watch) {
1430 if ((instance->li_flags & LI_EXCLUSIVE) != 0)
1431 panic("upgrade of exclusive lock (%s) %s @ %s:%d",
1432 class->lc_name, lock->lo_name, file, line);
1433 if ((instance->li_flags & LI_RECURSEMASK) != 0)
1434 panic("upgrade of recursed lock (%s) %s r=%d @ %s:%d",
1435 class->lc_name, lock->lo_name,
1436 instance->li_flags & LI_RECURSEMASK, file, line);
1438 instance->li_flags |= LI_EXCLUSIVE;
1442 witness_downgrade(struct lock_object *lock, int flags, const char *file,
1445 struct lock_instance *instance;
1446 struct lock_class *class;
1448 KASSERT(witness_cold == 0, ("%s: witness_cold", __func__));
1449 if (lock->lo_witness == NULL || witness_watch == -1 || panicstr != NULL)
1451 class = LOCK_CLASS(lock);
1452 file = fixup_filename(file);
1453 if (witness_watch) {
1454 if ((lock->lo_flags & LO_UPGRADABLE) == 0)
1455 panic("downgrade of non-upgradable lock (%s) %s @ %s:%d",
1456 class->lc_name, lock->lo_name, file, line);
1457 if ((class->lc_flags & LC_SLEEPLOCK) == 0)
1458 panic("downgrade of non-sleep lock (%s) %s @ %s:%d",
1459 class->lc_name, lock->lo_name, file, line);
1461 instance = find_instance(curthread->td_sleeplocks, lock);
1462 if (instance == NULL)
1463 panic("downgrade of unlocked lock (%s) %s @ %s:%d",
1464 class->lc_name, lock->lo_name, file, line);
1465 if (witness_watch) {
1466 if ((instance->li_flags & LI_EXCLUSIVE) == 0)
1467 panic("downgrade of shared lock (%s) %s @ %s:%d",
1468 class->lc_name, lock->lo_name, file, line);
1469 if ((instance->li_flags & LI_RECURSEMASK) != 0)
1470 panic("downgrade of recursed lock (%s) %s r=%d @ %s:%d",
1471 class->lc_name, lock->lo_name,
1472 instance->li_flags & LI_RECURSEMASK, file, line);
1474 instance->li_flags &= ~LI_EXCLUSIVE;
1478 witness_unlock(struct lock_object *lock, int flags, const char *file, int line)
1480 struct lock_list_entry **lock_list, *lle;
1481 struct lock_instance *instance;
1482 struct lock_class *class;
1487 if (witness_cold || lock->lo_witness == NULL || panicstr != NULL)
1490 class = LOCK_CLASS(lock);
1491 file = fixup_filename(file);
1493 /* Find lock instance associated with this lock. */
1494 if (class->lc_flags & LC_SLEEPLOCK)
1495 lock_list = &td->td_sleeplocks;
1497 lock_list = PCPU_PTR(spinlocks);
1499 for (; *lock_list != NULL; lock_list = &(*lock_list)->ll_next)
1500 for (i = 0; i < (*lock_list)->ll_count; i++) {
1501 instance = &(*lock_list)->ll_children[i];
1502 if (instance->li_lock == lock)
1507 * When disabling WITNESS through witness_watch we could end up in
1508 * having registered locks in the td_sleeplocks queue.
1509 * We have to make sure we flush these queues, so just search for
1510 * eventual register locks and remove them.
1512 if (witness_watch > 0)
1513 panic("lock (%s) %s not locked @ %s:%d", class->lc_name,
1514 lock->lo_name, file, line);
1519 /* First, check for shared/exclusive mismatches. */
1520 if ((instance->li_flags & LI_EXCLUSIVE) != 0 && witness_watch > 0 &&
1521 (flags & LOP_EXCLUSIVE) == 0) {
1522 printf("shared unlock of (%s) %s @ %s:%d\n", class->lc_name,
1523 lock->lo_name, file, line);
1524 printf("while exclusively locked from %s:%d\n",
1525 instance->li_file, instance->li_line);
1526 panic("excl->ushare");
1528 if ((instance->li_flags & LI_EXCLUSIVE) == 0 && witness_watch > 0 &&
1529 (flags & LOP_EXCLUSIVE) != 0) {
1530 printf("exclusive unlock of (%s) %s @ %s:%d\n", class->lc_name,
1531 lock->lo_name, file, line);
1532 printf("while share locked from %s:%d\n", instance->li_file,
1534 panic("share->uexcl");
1536 /* If we are recursed, unrecurse. */
1537 if ((instance->li_flags & LI_RECURSEMASK) > 0) {
1538 CTR4(KTR_WITNESS, "%s: pid %d unrecursed on %s r=%d", __func__,
1539 td->td_proc->p_pid, instance->li_lock->lo_name,
1540 instance->li_flags);
1541 instance->li_flags--;
1544 /* The lock is now being dropped, check for NORELEASE flag */
1545 if ((instance->li_flags & LI_NORELEASE) != 0 && witness_watch > 0) {
1546 printf("forbidden unlock of (%s) %s @ %s:%d\n", class->lc_name,
1547 lock->lo_name, file, line);
1548 panic("lock marked norelease");
1551 /* Otherwise, remove this item from the list. */
1553 CTR4(KTR_WITNESS, "%s: pid %d removed %s from lle[%d]", __func__,
1554 td->td_proc->p_pid, instance->li_lock->lo_name,
1555 (*lock_list)->ll_count - 1);
1556 for (j = i; j < (*lock_list)->ll_count - 1; j++)
1557 (*lock_list)->ll_children[j] =
1558 (*lock_list)->ll_children[j + 1];
1559 (*lock_list)->ll_count--;
1563 * In order to reduce contention on w_mtx, we want to keep always an
1564 * head object into lists so that frequent allocation from the
1565 * free witness pool (and subsequent locking) is avoided.
1566 * In order to maintain the current code simple, when the head
1567 * object is totally unloaded it means also that we do not have
1568 * further objects in the list, so the list ownership needs to be
1569 * hand over to another object if the current head needs to be freed.
1571 if ((*lock_list)->ll_count == 0) {
1572 if (*lock_list == lle) {
1573 if (lle->ll_next == NULL)
1577 *lock_list = lle->ll_next;
1578 CTR3(KTR_WITNESS, "%s: pid %d removed lle %p", __func__,
1579 td->td_proc->p_pid, lle);
1580 witness_lock_list_free(lle);
1585 witness_thread_exit(struct thread *td)
1587 struct lock_list_entry *lle;
1590 lle = td->td_sleeplocks;
1591 if (lle == NULL || panicstr != NULL)
1593 if (lle->ll_count != 0) {
1594 for (n = 0; lle != NULL; lle = lle->ll_next)
1595 for (i = lle->ll_count - 1; i >= 0; i--) {
1597 printf("Thread %p exiting with the following locks held:\n",
1600 witness_list_lock(&lle->ll_children[i], printf);
1603 panic("Thread %p cannot exit while holding sleeplocks\n", td);
1605 witness_lock_list_free(lle);
1609 * Warn if any locks other than 'lock' are held. Flags can be passed in to
1610 * exempt Giant and sleepable locks from the checks as well. If any
1611 * non-exempt locks are held, then a supplied message is printed to the
1612 * console along with a list of the offending locks. If indicated in the
1613 * flags then a failure results in a panic as well.
1616 witness_warn(int flags, struct lock_object *lock, const char *fmt, ...)
1618 struct lock_list_entry *lock_list, *lle;
1619 struct lock_instance *lock1;
1624 if (witness_cold || witness_watch < 1 || panicstr != NULL)
1628 for (lle = td->td_sleeplocks; lle != NULL; lle = lle->ll_next)
1629 for (i = lle->ll_count - 1; i >= 0; i--) {
1630 lock1 = &lle->ll_children[i];
1631 if (lock1->li_lock == lock)
1633 if (flags & WARN_GIANTOK &&
1634 lock1->li_lock == &Giant.lock_object)
1636 if (flags & WARN_SLEEPOK &&
1637 (lock1->li_lock->lo_flags & LO_SLEEPABLE) != 0)
1643 printf(" with the following");
1644 if (flags & WARN_SLEEPOK)
1645 printf(" non-sleepable");
1646 printf(" locks held:\n");
1649 witness_list_lock(lock1, printf);
1653 * Pin the thread in order to avoid problems with thread migration.
1654 * Once that all verifies are passed about spinlocks ownership,
1655 * the thread is in a safe path and it can be unpinned.
1658 lock_list = PCPU_GET(spinlocks);
1659 if (lock_list != NULL && lock_list->ll_count != 0) {
1663 * We should only have one spinlock and as long as
1664 * the flags cannot match for this locks class,
1665 * check if the first spinlock is the one curthread
1668 lock1 = &lock_list->ll_children[lock_list->ll_count - 1];
1669 if (lock_list->ll_count == 1 && lock_list->ll_next == NULL &&
1670 lock1->li_lock == lock && n == 0)
1676 printf(" with the following");
1677 if (flags & WARN_SLEEPOK)
1678 printf(" non-sleepable");
1679 printf(" locks held:\n");
1680 n += witness_list_locks(&lock_list, printf);
1683 if (flags & WARN_PANIC && n)
1684 panic("%s", __func__);
1686 witness_debugger(n);
1691 witness_file(struct lock_object *lock)
1695 if (witness_cold || witness_watch < 1 || lock->lo_witness == NULL)
1697 w = lock->lo_witness;
1702 witness_line(struct lock_object *lock)
1706 if (witness_cold || witness_watch < 1 || lock->lo_witness == NULL)
1708 w = lock->lo_witness;
1712 static struct witness *
1713 enroll(const char *description, struct lock_class *lock_class)
1716 struct witness_list *typelist;
1718 MPASS(description != NULL);
1720 if (witness_watch == -1 || panicstr != NULL)
1722 if ((lock_class->lc_flags & LC_SPINLOCK)) {
1723 if (witness_skipspin)
1727 } else if ((lock_class->lc_flags & LC_SLEEPLOCK))
1728 typelist = &w_sleep;
1730 panic("lock class %s is not sleep or spin",
1731 lock_class->lc_name);
1733 mtx_lock_spin(&w_mtx);
1734 w = witness_hash_get(description);
1737 if ((w = witness_get()) == NULL)
1739 MPASS(strlen(description) < MAX_W_NAME);
1740 strcpy(w->w_name, description);
1741 w->w_class = lock_class;
1743 STAILQ_INSERT_HEAD(&w_all, w, w_list);
1744 if (lock_class->lc_flags & LC_SPINLOCK) {
1745 STAILQ_INSERT_HEAD(&w_spin, w, w_typelist);
1747 } else if (lock_class->lc_flags & LC_SLEEPLOCK) {
1748 STAILQ_INSERT_HEAD(&w_sleep, w, w_typelist);
1752 /* Insert new witness into the hash */
1753 witness_hash_put(w);
1754 witness_increment_graph_generation();
1755 mtx_unlock_spin(&w_mtx);
1759 mtx_unlock_spin(&w_mtx);
1760 if (lock_class != w->w_class)
1762 "lock (%s) %s does not match earlier (%s) lock",
1763 description, lock_class->lc_name,
1764 w->w_class->lc_name);
1769 depart(struct witness *w)
1771 struct witness_list *list;
1773 MPASS(w->w_refcount == 0);
1774 if (w->w_class->lc_flags & LC_SLEEPLOCK) {
1782 * Set file to NULL as it may point into a loadable module.
1786 witness_increment_graph_generation();
1791 adopt(struct witness *parent, struct witness *child)
1795 if (witness_cold == 0)
1796 mtx_assert(&w_mtx, MA_OWNED);
1798 /* If the relationship is already known, there's no work to be done. */
1799 if (isitmychild(parent, child))
1802 /* When the structure of the graph changes, bump up the generation. */
1803 witness_increment_graph_generation();
1806 * The hard part ... create the direct relationship, then propagate all
1807 * indirect relationships.
1809 pi = parent->w_index;
1810 ci = child->w_index;
1811 WITNESS_INDEX_ASSERT(pi);
1812 WITNESS_INDEX_ASSERT(ci);
1814 w_rmatrix[pi][ci] |= WITNESS_PARENT;
1815 w_rmatrix[ci][pi] |= WITNESS_CHILD;
1818 * If parent was not already an ancestor of child,
1819 * then we increment the descendant and ancestor counters.
1821 if ((w_rmatrix[pi][ci] & WITNESS_ANCESTOR) == 0) {
1822 parent->w_num_descendants++;
1823 child->w_num_ancestors++;
1827 * Find each ancestor of 'pi'. Note that 'pi' itself is counted as
1828 * an ancestor of 'pi' during this loop.
1830 for (i = 1; i <= w_max_used_index; i++) {
1831 if ((w_rmatrix[i][pi] & WITNESS_ANCESTOR_MASK) == 0 &&
1835 /* Find each descendant of 'i' and mark it as a descendant. */
1836 for (j = 1; j <= w_max_used_index; j++) {
1839 * Skip children that are already marked as
1840 * descendants of 'i'.
1842 if (w_rmatrix[i][j] & WITNESS_ANCESTOR_MASK)
1846 * We are only interested in descendants of 'ci'. Note
1847 * that 'ci' itself is counted as a descendant of 'ci'.
1849 if ((w_rmatrix[ci][j] & WITNESS_ANCESTOR_MASK) == 0 &&
1852 w_rmatrix[i][j] |= WITNESS_ANCESTOR;
1853 w_rmatrix[j][i] |= WITNESS_DESCENDANT;
1854 w_data[i].w_num_descendants++;
1855 w_data[j].w_num_ancestors++;
1858 * Make sure we aren't marking a node as both an
1859 * ancestor and descendant. We should have caught
1860 * this as a lock order reversal earlier.
1862 if ((w_rmatrix[i][j] & WITNESS_ANCESTOR_MASK) &&
1863 (w_rmatrix[i][j] & WITNESS_DESCENDANT_MASK)) {
1864 printf("witness rmatrix paradox! [%d][%d]=%d "
1865 "both ancestor and descendant\n",
1866 i, j, w_rmatrix[i][j]);
1868 printf("Witness disabled.\n");
1871 if ((w_rmatrix[j][i] & WITNESS_ANCESTOR_MASK) &&
1872 (w_rmatrix[j][i] & WITNESS_DESCENDANT_MASK)) {
1873 printf("witness rmatrix paradox! [%d][%d]=%d "
1874 "both ancestor and descendant\n",
1875 j, i, w_rmatrix[j][i]);
1877 printf("Witness disabled.\n");
1885 itismychild(struct witness *parent, struct witness *child)
1888 MPASS(child != NULL && parent != NULL);
1889 if (witness_cold == 0)
1890 mtx_assert(&w_mtx, MA_OWNED);
1892 if (!witness_lock_type_equal(parent, child)) {
1893 if (witness_cold == 0)
1894 mtx_unlock_spin(&w_mtx);
1895 panic("%s: parent \"%s\" (%s) and child \"%s\" (%s) are not "
1896 "the same lock type", __func__, parent->w_name,
1897 parent->w_class->lc_name, child->w_name,
1898 child->w_class->lc_name);
1900 adopt(parent, child);
1904 * Generic code for the isitmy*() functions. The rmask parameter is the
1905 * expected relationship of w1 to w2.
1908 _isitmyx(struct witness *w1, struct witness *w2, int rmask, const char *fname)
1910 unsigned char r1, r2;
1915 WITNESS_INDEX_ASSERT(i1);
1916 WITNESS_INDEX_ASSERT(i2);
1917 r1 = w_rmatrix[i1][i2] & WITNESS_RELATED_MASK;
1918 r2 = w_rmatrix[i2][i1] & WITNESS_RELATED_MASK;
1920 /* The flags on one better be the inverse of the flags on the other */
1921 if (!((WITNESS_ATOD(r1) == r2 && WITNESS_DTOA(r2) == r1) ||
1922 (WITNESS_DTOA(r1) == r2 && WITNESS_ATOD(r2) == r1))) {
1923 printf("%s: rmatrix mismatch between %s (index %d) and %s "
1924 "(index %d): w_rmatrix[%d][%d] == %hhx but "
1925 "w_rmatrix[%d][%d] == %hhx\n",
1926 fname, w1->w_name, i1, w2->w_name, i2, i1, i2, r1,
1929 printf("Witness disabled.\n");
1932 return (r1 & rmask);
1936 * Checks if @child is a direct child of @parent.
1939 isitmychild(struct witness *parent, struct witness *child)
1942 return (_isitmyx(parent, child, WITNESS_PARENT, __func__));
1946 * Checks if @descendant is a direct or inderect descendant of @ancestor.
1949 isitmydescendant(struct witness *ancestor, struct witness *descendant)
1952 return (_isitmyx(ancestor, descendant, WITNESS_ANCESTOR_MASK,
1958 blessed(struct witness *w1, struct witness *w2)
1961 struct witness_blessed *b;
1963 for (i = 0; i < blessed_count; i++) {
1964 b = &blessed_list[i];
1965 if (strcmp(w1->w_name, b->b_lock1) == 0) {
1966 if (strcmp(w2->w_name, b->b_lock2) == 0)
1970 if (strcmp(w1->w_name, b->b_lock2) == 0)
1971 if (strcmp(w2->w_name, b->b_lock1) == 0)
1978 static struct witness *
1984 if (witness_cold == 0)
1985 mtx_assert(&w_mtx, MA_OWNED);
1987 if (witness_watch == -1) {
1988 mtx_unlock_spin(&w_mtx);
1991 if (STAILQ_EMPTY(&w_free)) {
1993 mtx_unlock_spin(&w_mtx);
1994 printf("WITNESS: unable to allocate a new witness object\n");
1997 w = STAILQ_FIRST(&w_free);
1998 STAILQ_REMOVE_HEAD(&w_free, w_list);
2001 MPASS(index > 0 && index == w_max_used_index+1 &&
2002 index < WITNESS_COUNT);
2003 bzero(w, sizeof(*w));
2005 if (index > w_max_used_index)
2006 w_max_used_index = index;
2011 witness_free(struct witness *w)
2014 STAILQ_INSERT_HEAD(&w_free, w, w_list);
2018 static struct lock_list_entry *
2019 witness_lock_list_get(void)
2021 struct lock_list_entry *lle;
2023 if (witness_watch == -1)
2025 mtx_lock_spin(&w_mtx);
2026 lle = w_lock_list_free;
2029 mtx_unlock_spin(&w_mtx);
2030 printf("%s: witness exhausted\n", __func__);
2033 w_lock_list_free = lle->ll_next;
2034 mtx_unlock_spin(&w_mtx);
2035 bzero(lle, sizeof(*lle));
2040 witness_lock_list_free(struct lock_list_entry *lle)
2043 mtx_lock_spin(&w_mtx);
2044 lle->ll_next = w_lock_list_free;
2045 w_lock_list_free = lle;
2046 mtx_unlock_spin(&w_mtx);
2049 static struct lock_instance *
2050 find_instance(struct lock_list_entry *list, struct lock_object *lock)
2052 struct lock_list_entry *lle;
2053 struct lock_instance *instance;
2056 for (lle = list; lle != NULL; lle = lle->ll_next)
2057 for (i = lle->ll_count - 1; i >= 0; i--) {
2058 instance = &lle->ll_children[i];
2059 if (instance->li_lock == lock)
2066 witness_list_lock(struct lock_instance *instance,
2067 int (*prnt)(const char *fmt, ...))
2069 struct lock_object *lock;
2071 lock = instance->li_lock;
2072 prnt("%s %s %s", (instance->li_flags & LI_EXCLUSIVE) != 0 ?
2073 "exclusive" : "shared", LOCK_CLASS(lock)->lc_name, lock->lo_name);
2074 if (lock->lo_witness->w_name != lock->lo_name)
2075 prnt(" (%s)", lock->lo_witness->w_name);
2076 prnt(" r = %d (%p) locked @ %s:%d\n",
2077 instance->li_flags & LI_RECURSEMASK, lock, instance->li_file,
2083 witness_thread_has_locks(struct thread *td)
2086 if (td->td_sleeplocks == NULL)
2088 return (td->td_sleeplocks->ll_count != 0);
2092 witness_proc_has_locks(struct proc *p)
2096 FOREACH_THREAD_IN_PROC(p, td) {
2097 if (witness_thread_has_locks(td))
2105 witness_list_locks(struct lock_list_entry **lock_list,
2106 int (*prnt)(const char *fmt, ...))
2108 struct lock_list_entry *lle;
2112 for (lle = *lock_list; lle != NULL; lle = lle->ll_next)
2113 for (i = lle->ll_count - 1; i >= 0; i--) {
2114 witness_list_lock(&lle->ll_children[i], prnt);
2121 * This is a bit risky at best. We call this function when we have timed
2122 * out acquiring a spin lock, and we assume that the other CPU is stuck
2123 * with this lock held. So, we go groveling around in the other CPU's
2124 * per-cpu data to try to find the lock instance for this spin lock to
2125 * see when it was last acquired.
2128 witness_display_spinlock(struct lock_object *lock, struct thread *owner,
2129 int (*prnt)(const char *fmt, ...))
2131 struct lock_instance *instance;
2134 if (owner->td_critnest == 0 || owner->td_oncpu == NOCPU)
2136 pc = pcpu_find(owner->td_oncpu);
2137 instance = find_instance(pc->pc_spinlocks, lock);
2138 if (instance != NULL)
2139 witness_list_lock(instance, prnt);
2143 witness_save(struct lock_object *lock, const char **filep, int *linep)
2145 struct lock_list_entry *lock_list;
2146 struct lock_instance *instance;
2147 struct lock_class *class;
2149 KASSERT(witness_cold == 0, ("%s: witness_cold", __func__));
2150 if (lock->lo_witness == NULL || witness_watch == -1 || panicstr != NULL)
2152 class = LOCK_CLASS(lock);
2153 if (class->lc_flags & LC_SLEEPLOCK)
2154 lock_list = curthread->td_sleeplocks;
2156 if (witness_skipspin)
2158 lock_list = PCPU_GET(spinlocks);
2160 instance = find_instance(lock_list, lock);
2161 if (instance == NULL)
2162 panic("%s: lock (%s) %s not locked", __func__,
2163 class->lc_name, lock->lo_name);
2164 *filep = instance->li_file;
2165 *linep = instance->li_line;
2169 witness_restore(struct lock_object *lock, const char *file, int line)
2171 struct lock_list_entry *lock_list;
2172 struct lock_instance *instance;
2173 struct lock_class *class;
2175 KASSERT(witness_cold == 0, ("%s: witness_cold", __func__));
2176 if (lock->lo_witness == NULL || witness_watch == -1 || panicstr != NULL)
2178 class = LOCK_CLASS(lock);
2179 if (class->lc_flags & LC_SLEEPLOCK)
2180 lock_list = curthread->td_sleeplocks;
2182 if (witness_skipspin)
2184 lock_list = PCPU_GET(spinlocks);
2186 instance = find_instance(lock_list, lock);
2187 if (instance == NULL)
2188 panic("%s: lock (%s) %s not locked", __func__,
2189 class->lc_name, lock->lo_name);
2190 lock->lo_witness->w_file = file;
2191 lock->lo_witness->w_line = line;
2192 instance->li_file = file;
2193 instance->li_line = line;
2197 witness_assert(struct lock_object *lock, int flags, const char *file, int line)
2199 #ifdef INVARIANT_SUPPORT
2200 struct lock_instance *instance;
2201 struct lock_class *class;
2203 if (lock->lo_witness == NULL || witness_watch < 1 || panicstr != NULL)
2205 class = LOCK_CLASS(lock);
2206 if ((class->lc_flags & LC_SLEEPLOCK) != 0)
2207 instance = find_instance(curthread->td_sleeplocks, lock);
2208 else if ((class->lc_flags & LC_SPINLOCK) != 0)
2209 instance = find_instance(PCPU_GET(spinlocks), lock);
2211 panic("Lock (%s) %s is not sleep or spin!",
2212 class->lc_name, lock->lo_name);
2214 file = fixup_filename(file);
2217 if (instance != NULL)
2218 panic("Lock (%s) %s locked @ %s:%d.",
2219 class->lc_name, lock->lo_name, file, line);
2222 case LA_LOCKED | LA_RECURSED:
2223 case LA_LOCKED | LA_NOTRECURSED:
2225 case LA_SLOCKED | LA_RECURSED:
2226 case LA_SLOCKED | LA_NOTRECURSED:
2228 case LA_XLOCKED | LA_RECURSED:
2229 case LA_XLOCKED | LA_NOTRECURSED:
2230 if (instance == NULL) {
2231 panic("Lock (%s) %s not locked @ %s:%d.",
2232 class->lc_name, lock->lo_name, file, line);
2235 if ((flags & LA_XLOCKED) != 0 &&
2236 (instance->li_flags & LI_EXCLUSIVE) == 0)
2237 panic("Lock (%s) %s not exclusively locked @ %s:%d.",
2238 class->lc_name, lock->lo_name, file, line);
2239 if ((flags & LA_SLOCKED) != 0 &&
2240 (instance->li_flags & LI_EXCLUSIVE) != 0)
2241 panic("Lock (%s) %s exclusively locked @ %s:%d.",
2242 class->lc_name, lock->lo_name, file, line);
2243 if ((flags & LA_RECURSED) != 0 &&
2244 (instance->li_flags & LI_RECURSEMASK) == 0)
2245 panic("Lock (%s) %s not recursed @ %s:%d.",
2246 class->lc_name, lock->lo_name, file, line);
2247 if ((flags & LA_NOTRECURSED) != 0 &&
2248 (instance->li_flags & LI_RECURSEMASK) != 0)
2249 panic("Lock (%s) %s recursed @ %s:%d.",
2250 class->lc_name, lock->lo_name, file, line);
2253 panic("Invalid lock assertion at %s:%d.", file, line);
2256 #endif /* INVARIANT_SUPPORT */
2260 witness_setflag(struct lock_object *lock, int flag, int set)
2262 struct lock_list_entry *lock_list;
2263 struct lock_instance *instance;
2264 struct lock_class *class;
2266 if (lock->lo_witness == NULL || witness_watch == -1 || panicstr != NULL)
2268 class = LOCK_CLASS(lock);
2269 if (class->lc_flags & LC_SLEEPLOCK)
2270 lock_list = curthread->td_sleeplocks;
2272 if (witness_skipspin)
2274 lock_list = PCPU_GET(spinlocks);
2276 instance = find_instance(lock_list, lock);
2277 if (instance == NULL)
2278 panic("%s: lock (%s) %s not locked", __func__,
2279 class->lc_name, lock->lo_name);
2282 instance->li_flags |= flag;
2284 instance->li_flags &= ~flag;
2288 witness_norelease(struct lock_object *lock)
2291 witness_setflag(lock, LI_NORELEASE, 1);
2295 witness_releaseok(struct lock_object *lock)
2298 witness_setflag(lock, LI_NORELEASE, 0);
2303 witness_ddb_list(struct thread *td)
2306 KASSERT(witness_cold == 0, ("%s: witness_cold", __func__));
2307 KASSERT(kdb_active, ("%s: not in the debugger", __func__));
2309 if (witness_watch < 1)
2312 witness_list_locks(&td->td_sleeplocks, db_printf);
2315 * We only handle spinlocks if td == curthread. This is somewhat broken
2316 * if td is currently executing on some other CPU and holds spin locks
2317 * as we won't display those locks. If we had a MI way of getting
2318 * the per-cpu data for a given cpu then we could use
2319 * td->td_oncpu to get the list of spinlocks for this thread
2322 * That still wouldn't really fix this unless we locked the scheduler
2323 * lock or stopped the other CPU to make sure it wasn't changing the
2324 * list out from under us. It is probably best to just not try to
2325 * handle threads on other CPU's for now.
2327 if (td == curthread && PCPU_GET(spinlocks) != NULL)
2328 witness_list_locks(PCPU_PTR(spinlocks), db_printf);
2331 DB_SHOW_COMMAND(locks, db_witness_list)
2336 td = db_lookup_thread(addr, TRUE);
2339 witness_ddb_list(td);
2342 DB_SHOW_ALL_COMMAND(locks, db_witness_list_all)
2348 * It would be nice to list only threads and processes that actually
2349 * held sleep locks, but that information is currently not exported
2352 FOREACH_PROC_IN_SYSTEM(p) {
2353 if (!witness_proc_has_locks(p))
2355 FOREACH_THREAD_IN_PROC(p, td) {
2356 if (!witness_thread_has_locks(td))
2358 db_printf("Process %d (%s) thread %p (%d)\n", p->p_pid,
2359 p->p_comm, td, td->td_tid);
2360 witness_ddb_list(td);
2364 DB_SHOW_ALIAS(alllocks, db_witness_list_all)
2366 DB_SHOW_COMMAND(witness, db_witness_display)
2369 witness_ddb_display(db_printf);
2374 sysctl_debug_witness_badstacks(SYSCTL_HANDLER_ARGS)
2376 struct witness_lock_order_data *data1, *data2, *tmp_data1, *tmp_data2;
2377 struct witness *tmp_w1, *tmp_w2, *w1, *w2;
2379 u_int w_rmatrix1, w_rmatrix2;
2380 int error, generation, i, j;
2386 if (witness_watch < 1) {
2387 error = SYSCTL_OUT(req, w_notrunning, sizeof(w_notrunning));
2391 error = SYSCTL_OUT(req, w_stillcold, sizeof(w_stillcold));
2395 sb = sbuf_new(NULL, NULL, BADSTACK_SBUF_SIZE, SBUF_AUTOEXTEND);
2399 /* Allocate and init temporary storage space. */
2400 tmp_w1 = malloc(sizeof(struct witness), M_TEMP, M_WAITOK | M_ZERO);
2401 tmp_w2 = malloc(sizeof(struct witness), M_TEMP, M_WAITOK | M_ZERO);
2402 tmp_data1 = malloc(sizeof(struct witness_lock_order_data), M_TEMP,
2404 tmp_data2 = malloc(sizeof(struct witness_lock_order_data), M_TEMP,
2406 stack_zero(&tmp_data1->wlod_stack);
2407 stack_zero(&tmp_data2->wlod_stack);
2410 mtx_lock_spin(&w_mtx);
2411 generation = w_generation;
2412 mtx_unlock_spin(&w_mtx);
2413 sbuf_printf(sb, "Number of known direct relationships is %d\n",
2414 w_lohash.wloh_count);
2415 for (i = 1; i < w_max_used_index; i++) {
2416 mtx_lock_spin(&w_mtx);
2417 if (generation != w_generation) {
2418 mtx_unlock_spin(&w_mtx);
2420 /* The graph has changed, try again. */
2427 if (w1->w_reversed == 0) {
2428 mtx_unlock_spin(&w_mtx);
2432 /* Copy w1 locally so we can release the spin lock. */
2434 mtx_unlock_spin(&w_mtx);
2436 if (tmp_w1->w_reversed == 0)
2438 for (j = 1; j < w_max_used_index; j++) {
2439 if ((w_rmatrix[i][j] & WITNESS_REVERSAL) == 0 || i > j)
2442 mtx_lock_spin(&w_mtx);
2443 if (generation != w_generation) {
2444 mtx_unlock_spin(&w_mtx);
2446 /* The graph has changed, try again. */
2453 data1 = witness_lock_order_get(w1, w2);
2454 data2 = witness_lock_order_get(w2, w1);
2457 * Copy information locally so we can release the
2461 w_rmatrix1 = (unsigned int)w_rmatrix[i][j];
2462 w_rmatrix2 = (unsigned int)w_rmatrix[j][i];
2465 stack_zero(&tmp_data1->wlod_stack);
2466 stack_copy(&data1->wlod_stack,
2467 &tmp_data1->wlod_stack);
2469 if (data2 && data2 != data1) {
2470 stack_zero(&tmp_data2->wlod_stack);
2471 stack_copy(&data2->wlod_stack,
2472 &tmp_data2->wlod_stack);
2474 mtx_unlock_spin(&w_mtx);
2477 "\nLock order reversal between \"%s\"(%s) and \"%s\"(%s)!\n",
2478 tmp_w1->w_name, tmp_w1->w_class->lc_name,
2479 tmp_w2->w_name, tmp_w2->w_class->lc_name);
2482 "w_rmatrix[%s][%s] == %x, w_rmatrix[%s][%s] == %x\n",
2483 tmp_w1->name, tmp_w2->w_name, w_rmatrix1,
2484 tmp_w2->name, tmp_w1->w_name, w_rmatrix2);
2488 "Lock order \"%s\"(%s) -> \"%s\"(%s) first seen at:\n",
2489 tmp_w1->w_name, tmp_w1->w_class->lc_name,
2490 tmp_w2->w_name, tmp_w2->w_class->lc_name);
2491 stack_sbuf_print(sb, &tmp_data1->wlod_stack);
2492 sbuf_printf(sb, "\n");
2494 if (data2 && data2 != data1) {
2496 "Lock order \"%s\"(%s) -> \"%s\"(%s) first seen at:\n",
2497 tmp_w2->w_name, tmp_w2->w_class->lc_name,
2498 tmp_w1->w_name, tmp_w1->w_class->lc_name);
2499 stack_sbuf_print(sb, &tmp_data2->wlod_stack);
2500 sbuf_printf(sb, "\n");
2504 mtx_lock_spin(&w_mtx);
2505 if (generation != w_generation) {
2506 mtx_unlock_spin(&w_mtx);
2509 * The graph changed while we were printing stack data,
2516 mtx_unlock_spin(&w_mtx);
2518 /* Free temporary storage space. */
2519 free(tmp_data1, M_TEMP);
2520 free(tmp_data2, M_TEMP);
2521 free(tmp_w1, M_TEMP);
2522 free(tmp_w2, M_TEMP);
2525 error = SYSCTL_OUT(req, sbuf_data(sb), sbuf_len(sb) + 1);
2532 sysctl_debug_witness_fullgraph(SYSCTL_HANDLER_ARGS)
2538 if (witness_watch < 1) {
2539 error = SYSCTL_OUT(req, w_notrunning, sizeof(w_notrunning));
2543 error = SYSCTL_OUT(req, w_stillcold, sizeof(w_stillcold));
2548 error = sysctl_wire_old_buffer(req, 0);
2551 sb = sbuf_new_for_sysctl(NULL, NULL, FULLGRAPH_SBUF_SIZE, req);
2554 sbuf_printf(sb, "\n");
2556 mtx_lock_spin(&w_mtx);
2557 STAILQ_FOREACH(w, &w_all, w_list)
2559 STAILQ_FOREACH(w, &w_all, w_list)
2560 witness_add_fullgraph(sb, w);
2561 mtx_unlock_spin(&w_mtx);
2564 * Close the sbuf and return to userland.
2566 error = sbuf_finish(sb);
2573 sysctl_debug_witness_watch(SYSCTL_HANDLER_ARGS)
2577 value = witness_watch;
2578 error = sysctl_handle_int(oidp, &value, 0, req);
2579 if (error != 0 || req->newptr == NULL)
2581 if (value > 1 || value < -1 ||
2582 (witness_watch == -1 && value != witness_watch))
2584 witness_watch = value;
2589 witness_add_fullgraph(struct sbuf *sb, struct witness *w)
2593 if (w->w_displayed != 0 || (w->w_file == NULL && w->w_line == 0))
2597 WITNESS_INDEX_ASSERT(w->w_index);
2598 for (i = 1; i <= w_max_used_index; i++) {
2599 if (w_rmatrix[w->w_index][i] & WITNESS_PARENT) {
2600 sbuf_printf(sb, "\"%s\",\"%s\"\n", w->w_name,
2602 witness_add_fullgraph(sb, &w_data[i]);
2608 * A simple hash function. Takes a key pointer and a key size. If size == 0,
2609 * interprets the key as a string and reads until the null
2610 * terminator. Otherwise, reads the first size bytes. Returns an unsigned 32-bit
2611 * hash value computed from the key.
2614 witness_hash_djb2(const uint8_t *key, uint32_t size)
2616 unsigned int hash = 5381;
2619 /* hash = hash * 33 + key[i] */
2621 for (i = 0; i < size; i++)
2622 hash = ((hash << 5) + hash) + (unsigned int)key[i];
2624 for (i = 0; key[i] != 0; i++)
2625 hash = ((hash << 5) + hash) + (unsigned int)key[i];
2632 * Initializes the two witness hash tables. Called exactly once from
2633 * witness_initialize().
2636 witness_init_hash_tables(void)
2640 MPASS(witness_cold);
2642 /* Initialize the hash tables. */
2643 for (i = 0; i < WITNESS_HASH_SIZE; i++)
2644 w_hash.wh_array[i] = NULL;
2646 w_hash.wh_size = WITNESS_HASH_SIZE;
2647 w_hash.wh_count = 0;
2649 /* Initialize the lock order data hash. */
2651 for (i = 0; i < WITNESS_LO_DATA_COUNT; i++) {
2652 memset(&w_lodata[i], 0, sizeof(w_lodata[i]));
2653 w_lodata[i].wlod_next = w_lofree;
2654 w_lofree = &w_lodata[i];
2656 w_lohash.wloh_size = WITNESS_LO_HASH_SIZE;
2657 w_lohash.wloh_count = 0;
2658 for (i = 0; i < WITNESS_LO_HASH_SIZE; i++)
2659 w_lohash.wloh_array[i] = NULL;
2662 static struct witness *
2663 witness_hash_get(const char *key)
2669 if (witness_cold == 0)
2670 mtx_assert(&w_mtx, MA_OWNED);
2671 hash = witness_hash_djb2(key, 0) % w_hash.wh_size;
2672 w = w_hash.wh_array[hash];
2674 if (strcmp(w->w_name, key) == 0)
2684 witness_hash_put(struct witness *w)
2689 MPASS(w->w_name != NULL);
2690 if (witness_cold == 0)
2691 mtx_assert(&w_mtx, MA_OWNED);
2692 KASSERT(witness_hash_get(w->w_name) == NULL,
2693 ("%s: trying to add a hash entry that already exists!", __func__));
2694 KASSERT(w->w_hash_next == NULL,
2695 ("%s: w->w_hash_next != NULL", __func__));
2697 hash = witness_hash_djb2(w->w_name, 0) % w_hash.wh_size;
2698 w->w_hash_next = w_hash.wh_array[hash];
2699 w_hash.wh_array[hash] = w;
2704 static struct witness_lock_order_data *
2705 witness_lock_order_get(struct witness *parent, struct witness *child)
2707 struct witness_lock_order_data *data = NULL;
2708 struct witness_lock_order_key key;
2711 MPASS(parent != NULL && child != NULL);
2712 key.from = parent->w_index;
2713 key.to = child->w_index;
2714 WITNESS_INDEX_ASSERT(key.from);
2715 WITNESS_INDEX_ASSERT(key.to);
2716 if ((w_rmatrix[parent->w_index][child->w_index]
2717 & WITNESS_LOCK_ORDER_KNOWN) == 0)
2720 hash = witness_hash_djb2((const char*)&key,
2721 sizeof(key)) % w_lohash.wloh_size;
2722 data = w_lohash.wloh_array[hash];
2723 while (data != NULL) {
2724 if (witness_lock_order_key_equal(&data->wlod_key, &key))
2726 data = data->wlod_next;
2734 * Verify that parent and child have a known relationship, are not the same,
2735 * and child is actually a child of parent. This is done without w_mtx
2736 * to avoid contention in the common case.
2739 witness_lock_order_check(struct witness *parent, struct witness *child)
2742 if (parent != child &&
2743 w_rmatrix[parent->w_index][child->w_index]
2744 & WITNESS_LOCK_ORDER_KNOWN &&
2745 isitmychild(parent, child))
2752 witness_lock_order_add(struct witness *parent, struct witness *child)
2754 struct witness_lock_order_data *data = NULL;
2755 struct witness_lock_order_key key;
2758 MPASS(parent != NULL && child != NULL);
2759 key.from = parent->w_index;
2760 key.to = child->w_index;
2761 WITNESS_INDEX_ASSERT(key.from);
2762 WITNESS_INDEX_ASSERT(key.to);
2763 if (w_rmatrix[parent->w_index][child->w_index]
2764 & WITNESS_LOCK_ORDER_KNOWN)
2767 hash = witness_hash_djb2((const char*)&key,
2768 sizeof(key)) % w_lohash.wloh_size;
2769 w_rmatrix[parent->w_index][child->w_index] |= WITNESS_LOCK_ORDER_KNOWN;
2773 w_lofree = data->wlod_next;
2774 data->wlod_next = w_lohash.wloh_array[hash];
2775 data->wlod_key = key;
2776 w_lohash.wloh_array[hash] = data;
2777 w_lohash.wloh_count++;
2778 stack_zero(&data->wlod_stack);
2779 stack_save(&data->wlod_stack);
2783 /* Call this whenver the structure of the witness graph changes. */
2785 witness_increment_graph_generation(void)
2788 if (witness_cold == 0)
2789 mtx_assert(&w_mtx, MA_OWNED);
2795 _witness_debugger(int cond, const char *msg)
2798 if (witness_trace && cond)
2800 if (witness_kdb && cond)
2801 kdb_enter(KDB_WHY_WITNESS, msg);