linux/lib/locking-selftest.c

298  * AA deadlock:
422  * detecting a read-lock/lock-write deadlock: if the chain cache doesn't differ
431  *	{ Not a deadlock, B -> A is added in the chain cache }
437  *	{ B->A found in chain cache, not reported as a deadlock }
524  * ABBA deadlock:
556  * AB BC CA deadlock:
589  * AB CA BC deadlock:
622  * AB BC CD DA deadlock:
656  * AB CD BD DA deadlock:
689  * AB CD BC DA deadlock:
1011  * Deadlock scenario:
1020  * The deadlock occurs because CPU#1 will spin on B, and CPU#2
1073  * write-read / write-read / write-read deadlock even if read is recursive
1105  * write-write / read-read / write-read deadlock even if read is recursive
1137  * write-write / read-read / read-write is not deadlock when read is recursive
1169  * write-read / read-read / write-write is not deadlock when read is recursive
1304  * 			write_lock(A); // if this one is read_lock(), no deadlock
2100 /* This is not a deadlock, because we have X1 to serialize Y1 and Y2 */
2372  * is a deadlock.
2399  * is not a deadlock.
2426  * is a deadlock. Because the two read_lock()s are both non-recursive readers.
2779 	 * deadlock.  in hardirq_deadlock_softirq_not_deadlock()
2782 	 * hardirq-unsafe, deadlock.  in hardirq_deadlock_softirq_not_deadlock()
2821 	DO_TESTCASE_6R("A-A deadlock", AA);  in locking_selftest()
2822 	DO_TESTCASE_6R("A-B-B-A deadlock", ABBA);  in locking_selftest()
2823 	DO_TESTCASE_6R("A-B-B-C-C-A deadlock", ABBCCA);  in locking_selftest()
2824 	DO_TESTCASE_6R("A-B-C-A-B-C deadlock", ABCABC);  in locking_selftest()
2825 	DO_TESTCASE_6R("A-B-B-C-C-D-D-A deadlock", ABBCCDDA);  in locking_selftest()
2826 	DO_TESTCASE_6R("A-B-C-D-B-D-D-A deadlock", ABCDBDDA);  in locking_selftest()
2827 	DO_TESTCASE_6R("A-B-C-D-B-C-D-A deadlock", ABCDBCDA);  in locking_selftest()