| Commit message (Collapse) | Author | Age |
|---|
| |
|
|
| |
we can disable it to improve performance when it is not needed
|
| | |
|
| |
|
|
|
|
| |
The list-based priority queues did not perform well on the Niagara T2000.
This heap-based implementation should perform much faster when queues
are long.
|
| |
|
|
|
| |
- give TRACE() messages sequence numbers
- remove a some old, unused cruft
|
| | |
|
| |
|
|
|
|
|
|
| |
The SRP implementation did not correctly address various
suspension-related scenarios correctly. Now the need for
SRP blocking is tested on each scheduling event. This ensures
mutual exclusion under the SRP even in the face of unexpected
suspensions, for example due to IO.
|
| |
|
|
| |
This is the first step in cleaning up the SRP implementation.
|
|
|
This introduces the core changes ported from LITMUS 2007.
The kernel seems to work under QEMU, but many bugs probably remain.
|
