2016-11-07 19:27:33 +01:00
|
|
|
Expected result
|
|
|
|
===============
|
|
|
|
|
|
|
|
When successful, you should see 5 different threads printing their
|
|
|
|
PID, priority and recursion depth. The thread with the lowest priority
|
|
|
|
should be able to lock (and unlock) the mutex first, followed by the
|
|
|
|
other threads in the order of their priority (highest next). If two
|
2023-02-22 09:22:30 +01:00
|
|
|
threads have the same priority the thread who comes first in the run queue
|
|
|
|
(in this test this is the one with the lower thread id) should acquire the
|
2023-03-15 12:58:09 +01:00
|
|
|
lock.
|
2016-11-07 19:27:33 +01:00
|
|
|
|
|
|
|
Background
|
|
|
|
==========
|
|
|
|
This test application stresses a mutex with a number of threads waiting on it.
|