aboutsummaryrefslogtreecommitdiffstats
path: root/litmus/litmus.c
Commit message (Collapse)AuthorAge
* cleanup trailing whitespaceBjoern B. Brandenburg2009-09-10
|
* rt domain: avoid use-after-free and re-init-while-in-use bugsBjoern B. Brandenburg2009-05-03
| | | | | | Don't just blindly overwrite the timers if they could be still in use. The the use-after-free bug was observed under Qemu.
* litmus core: report ready tasks to user spaceBjoern B. Brandenburg2009-05-02
|
* litmus core: fix sysrq registrationBjoern B. Brandenburg2009-05-02
| | | | The letter 'q' is already taken in 2.6.24.
* litmus proc: add release_master interfaceBjoern B. Brandenburg2009-04-23
| | | | | Let user space set which CPU should handle releases. It is up to plugins to make use of this information.
* Merge commit 'origin/master' into rtss09Bjoern B. Brandenburg2009-04-18
|\
| * Merge branch 'master' of ssh://cvs/cvs/proj/litmus/repo/litmus2008Bjoern B. Brandenburg2009-04-18
| |\
| * | litmus core: remove no longer used sorted lists codeBjoern B. Brandenburg2009-04-18
| | | | | | | | | | | | No plugin uses it anymore.
* | | rt_domain: use per-event timersBjoern B. Brandenburg2009-04-09
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | Don't multiplex one timer among all release heaps. The hrtimer subsystem can handle many timers and is heavily optimize; make use of this fact. This also greatly simplifies the actual callback, which should help to bring down release overheads. This also saves memory as we do not need to maintain a separate heap of (release) heaps.
* | | rt_domain: do not allocate/free memory in release queue handlingBjoern B. Brandenburg2009-04-09
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | This fixes a bunch of bugs: - a memory leak (some heap nodes were never reclaimed) - a locking rules violation (memory allocation can wake up kswapd, which causes a circular locking dependency between the release queue lock and the run queue locks Also, allocating memory in a hot path was never particularly clever. This patch pre-allocates memory at task-creation time, but does not change how the release queue works overall.
* | | add release_heap slabBjoern B. Brandenburg2009-04-09
| | | | | | | | | | | | Prepare for centralized allocation of release heaps.
* | | litmus core: use heap node allocation APIBjoern B. Brandenburg2009-04-09
| |/ |/| | | | | Avoid duplication.
* | Merge branch 'syscall_ohead'Bjoern B. Brandenburg2009-03-02
|\ \
| * | add sys_null_call() to enable system call overhead tracingBjoern B. Brandenburg2009-03-02
| | | | | | | | | | | | | | | A simple noop system call to record kernel entry and exit times.
* | | fixed sizeof usage to conform to linux kernel coding style. so,Mitchell Jareo2009-03-01
|/ / | | | | | | | | | | | | | | struct x* p = kmalloc(sizeof(struct x), ....) becomes struct x* p = kmalloc(sizeof(*p), ...) for example.
* / LITMUS: remove trailing whitespace for release2008.2Bjoern B. Brandenburg2008-12-01
|/
* LITMUS: provide per-plugin setup/tear down callbacksBjoern B. Brandenburg2008-11-06
| | | | Give plugins a chance to set up state and clean up.
* sched_trace: add task system release tracingBjoern B. Brandenburg2008-11-03
|
* litmus: error out in ENOMEM caseBjoern B. Brandenburg2008-10-06
| | | | If we can't allocate heap nodes then we can't admit RT tasks.
* binomial heaps: reuse heap_node slab for allocationsBjoern B. Brandenburg2008-09-11
| | | | | | | We already have a heap_node slab in litmus.c. We can reuse it for the other allocations. This patch also fixes a misnaming of heap_node_alloc/free.
* make inclusion of SRP support optional2008.1Bjoern B. Brandenburg2008-07-01
| | | | we can disable it to improve performance when it is not needed
* don't include NP-Flag syscalls if config option is not selectedBjoern B. Brandenburg2008-07-01
|
* Use binomial heaps as priority queues.Bjoern B. Brandenburg2008-05-19
| | | | | | 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.
* LITMUS: improve coreBjoern B. Brandenburg2008-05-10
| | | | | - give TRACE() messages sequence numbers - remove a some old, unused cruft
* LITMUS: remove outdated commentBjoern B. Brandenburg2008-05-05
|
* SRP: improve robustnessBjoern B. Brandenburg2008-05-01
| | | | | | | | 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.
* update SRP implBjoern B. Brandenburg2008-05-01
| | | | This is the first step in cleaning up the SRP implementation.
* LITMUS 2008: Initial PortBjoern B. Brandenburg2008-02-13
This introduces the core changes ported from LITMUS 2007. The kernel seems to work under QEMU, but many bugs probably remain.
generated by cgit v1.2.2 (git 2.25.0) at 2025-04-05 14:54:56 -0400