| Commit message (Collapse) | Author | Age |
|---|
| |
|
|
|
|
| |
This temporary patch remaps CPU IDs to match Ludwig's
cache topology. Thus, "virtual" CPUs 0 and 1, which share
an L2 cache, are remapped to CPUs 0 and 4.
|
| |
|
|
|
|
| |
This patch updates the PGM interface with the kernel.
Producers now boost their priority when generating tokens,
not consumers while waiting for tokens.
|
| |
|
|
|
| |
Adds routines for userspace tasks to use to communicate their
state to the Litmus kernel.
|
| |
|
|
|
| |
Adds macros for converting smaller time units into
bigger ones (ex. ns to s).
|
| |
|
|
|
|
|
| |
Renames the 'namespace' parameter to litmus_open_lock() forard
declaration in litmus.h to 'name_space'. This allows litmus.h
to be compiled by a C++ compiler. (Note: Using 'extern "C" {}'
does not work as an alternative solution.)
|
| |
|
|
|
|
| |
The kernel needs to be able to deal with tasks that do not make
themselves a real-time task, but get configured by some other task
instead.
|
| |
|
|
|
|
|
|
|
|
|
|
|
| |
The sproadic_*() macros have become unwieldy. This patch
replaces those convenience macros for global, clustered,
and partitioned scheduling. A part of this API change
is the explicit use of nanosecond time-values. Prior APIs
have used lt_t (litmus time), which had an implied time
scale of nanoseconds.
/bin apps and test suite also updated to use revised API.
Modifications to the test suite are mostly centered around
using nanoseconds instead of milliseconds.
|
| |
|
|
|
| |
Adds init_rt_task_param(). Facilitates setting up default
real-time task attributes that cannot be set by memset(0).
|
| |
|
|
|
|
|
|
|
| |
This patch adds cluster scheduling options to
rtspin and rt_launch. The convenience routines
in litmus.h were also updated to facilitate
clustered scheduling. For partitioned scheduling,
just set cluster_size = 1 (default size for rtspin
and rt_launch).
|
| |
|
|
|
|
|
|
|
|
|
| |
This patch replaces be_migrate_to() with several
be_migrate_*() APIs to automatically assign CPU affinity
masks from a task's partition (or cluster) assignment.
Routines are release-master-aware such that the release
master (if one exists) will NOT be included in the
task's affinity mask. (Note that release-master
avoidance may be overridden by calling
__be_migrate_thread_to_cluster().)
|
| |
|
|
|
|
| |
This is useful for testing locking protocol implementations (not
intended for benchmarking!), and also serves to document how to use
the LITMUS^RT locking API.
|
| |
|
|
| |
Useful for correlating test failures to events in traces.
|
| |
|
|
| |
This mirrors the option in rtspin.
|
| |
|
|
|
|
|
| |
The -f option required manually *also* setting
the -w option. This is no longer required.
While at it, simplify the code by using the /proc interface.
|
| |
|
|
|
| |
Make sure the kernel and userspace compilers have the same idea of the
layout of the control page.
|
| |
|
|
|
|
| |
Resuming higher-priority tasks should of course preempt lower-priority
tasks. This test case infers if higher-priority tasks are unreasonably
delayed.
|
| |
|
|
|
| |
Wrap nanosleep() to make sleeping for a given number of
nanoseconds easier, using the LITMUS^RT time type lt_t.
|
| |
|
|
|
| |
Add a wrapper for /proc/litmus/stats to make it easy to query the
number of tasks already waiting for a task set release.
|
| |
|
|
| |
For consistency reasons and to document the cpu parameter of the DPCP.
|
| |
|
|
|
|
| |
Use the kernel's notion of fixed priorities.
Also, add some clarifying comments to the
task setup wrappers.
|
| |
|
|
|
|
| |
PCP was only used for DPCP before
tests: add some basic tests for PCP under P-FP
|
| |
|
|
|
|
|
|
|
| |
dissertation (branch bbb-diss)
I took the unchanged code but removed references
to OMLP which was and is not implemented
tests: changed so that they work for P-FP
|
| |
|
|
| |
Everything is in one 32-bit word now.
|
| |
|
|
| |
we need uint64_t in litmus.h
|
| |
|
|
|
| |
The new generic lock layer in LITMUS^RT does away with per-protocol
system calls. Change accordingly.
|
| |
|
|
|
| |
The timing functions are quite handy when building benchmark tasks.
Avoid copy&paste reuse by making them available via the library.
|
| |
|
|
| |
Move the architecture-dependent code to the arch/ subtree.
|
| | |
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
The kernel warns against including header files directly. For good
reason: our previous approach (just -I$KERNEL/include) caused all
kinds of files to be included that should have come from /usr/include
instead.
This patch rewrites the Makfile so that the (few) needed headers are
copied into the liblitmus src tree before compiling the library. This
avoids having to specify the kernel include directories with -I, and
also makes it easier to link against liblitmus (external applications
do not need to know where the kernel is).
Finally, this allows us to enable -Werror.
|
| |
|
|
|
|
|
|
| |
how their execution budgets should be enforced: NO_ENFORCEMENT,
QUANTUM_ENFORCEMENT, and PRECISE_ENFORCEMENT (unsupported).
NOTE: Users of NO_ENFORCEMENT must call sleep_next_period() at the
end of every job to signal to the kernel that its job is complete.
|
| | |
|
| | |
|
| | |
|
| |
|
|
|
| |
This syscall hasn't been around since Fall 2007... The RTCSA'08 paper
details how we are doing it now.
|
| | |
|
| |\ |
|
| | |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| | |
This is the beginning of the LITMUS^RT testsuite.
The main design goals are flexibility and ease of test writing.
To create a new test, simply write a test case in any C file in the
tests/ subdirectory. The buildsystem will find the test and hook it
up with the testrunner.
Have a look at tests/fdso.c and include/tests.h to get an idea for what
tests look like.
Tests can be executed with the 'runtests' tool. Each testcase is executed
in a separate process in order to ensure that tests do not influence
each other.
|
| |/
|
|
| |
in C++ code.
|
| |
|
|
| |
Layered on top of the LITMUS control page.
|
| | |
|
| | |
|
| |
|
|
| |
Allows for higher-precision setup of real-time tasks.
|
| | |
|
| |
|
|
| |
For kernel entry/exit tracing.
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
