| Commit message (Collapse) | Author | Age |
| |
|
| |
|
| |
|
| |
|
| |
|
|
|
|
|
|
| |
under EXT-RES scheduling with the global OMLP.
Note that this assumes the caller already holds the lock.
|
| |
|
|
|
|
|
|
|
|
|
| |
Userspace now gets to decide when exactly a synchronous release should
take place.
Additionally, introduce -q option to ensure that the synchronous
release occurs at an integer multiple of a given quantum size (or
hyperperiod length).
|
|
|
|
| |
Convenient wrapper for CLOCK_MONOTONIC -> lt_t.
|
| |
|
|
|
|
|
|
|
|
| |
- Decompose read_mapping into two functions: *read_mapping* which reads
CPU mapping data as string from file, and *set_mapping* that actually sets
the cpu_set_t according to the mapping
- Add unit test for setting cpu_set_t to various CPU indexes
|
|
|
|
|
|
|
|
|
|
|
|
| |
-Appearantly, a newline character is appended to the end of CPU mapping
string. It seems like this was not the case with old versions of liblitmus and
in order not to break the intended behaviour of code, newline appended
to CPU mapping string is simply ignored
-Pointer arithmetic for parsing CPU mapping is done within loop body to prevent
"array subscript is below array bounds" warning prompted by gcc-6.1.1
-Fix indentation and whitespaces
|
| |
|
|
|
|
|
| |
This fixes a problem on a 48-core platform where tasks couldn't be
migrated to certain cores.
|
|
|
|
| |
This change should be transparent to clients of the library.
|
|
|
|
| |
These are provided elsewhere, we don't need to reimplement them.
|
| |
|
| |
|
| |
|
| |
|
| |
|
|
|
|
| |
Signed-off-by: Bjoern Brandenburg <bbb@mpi-sws.org>
|
| |
|
|
|
|
|
|
|
| |
This patch fixes a bug in read_mapping(), which is used for
reading CPU and cluster (domain) mappings. read_mapping()
did not account for the case when NR_CPUS is not evenly
divisible by 32 (quite common when NR_CPUS < 32).
|
|
|
|
|
| |
Patch cleans up an error message to match the
migrate-to-domain API.
|
|
|
|
|
|
|
| |
This patch removes unneeded code from be_migrate_thread_to_domain().
This function no longer needs to check the number of online
CPUs since the CPU mask for a given domain is now returned directly
from read_mapping().
|
|
|
|
|
|
|
| |
Switch rt_launch to use a more modern way to launch real-time tasks.
This makes rt_launch more flexible, makes it more similar to rtspin,
and also allows to let us get rid of a chunk of old, inflexible code
in liblitmus that wasn't really serving any useful purpose anymore.
|
|
|
|
|
|
|
|
|
|
|
|
| |
This patch improves the cpu bit map parsing used to determine
CPU/cluster mapping. Namely, it supports clusters with more
than 32 CPUs. Prior to this patch, mapping would fail due to
unexpected commas in bitfield data read from /proc (groups
of 32 CPUs are separated by commas).
NOTE: Bug could still be encountered if NR_CPUS > 32.
New CPU limit: 4096.
|
|
|
|
| |
Just add the ID and symbol.
|
|
|
|
|
|
| |
Make sure new default parameters such as the deadline are taken care
of in the old task creation routines. This fixes a problem with
rt_launch.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
This patch replaces the algorithm used to compute CPU affinity masks.
The old algorithm was fragile and would break on systems with multiple
levels of shared caches. (As found on some older Intel chips, and as
one would probably find on a system with hyper-threading enabled.) The
bug stems from fact that Linux enumerates consecutive CPUs in a way
that distributes them across the physical system, thereby reducing
contention resources (e.g., cache).
Cluster size no longer needs to be provided now that cluster/CPU
mappings are explicit in /proc/litmus/domains/.
This keeps the following migration functions, but marks them as
deprecated:
- be_migrate_to_cluster()
- cluster_to_first_cpu()
- partition_to_cpu()
Although the deprecated interfaces are supported, the implementations
for these functions call the new be_migrate_to_domain() and
domain_to_first_cpu() functions.
[bbb: resolved several merge conflicts]
|
|
|
|
| |
This matches the corresponding change in the kernel.
|
|
|
|
| |
The string 'NO_CPU' needs to fit into the buffer.
|
|
|
|
|
|
| |
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.
|
|
|
|
|
| |
A recent patch changed the name of the constant in the kernel. Update
liblitmus accordingly.
|
|
|
|
|
|
|
|
| |
My version of gcc would complain about "dereferencing pointer does
break strict-aliasing rules" because of a (harmless) pointer cast.
This patch adds a helper void pointer to make the assignment explicit,
which avoids the cast and hence silences the warning.
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
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.
|
|
|
|
| |
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.
|
|
|
|
|
| |
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.
|
|
|
|
|
|
|
|
| |
Updated APIs to support arbitrary deadlines. Added macros for implicit
deadlines.
Note: Had to tweak Makefile to support gcc version >= 4.6 (moved -lrt to the
end of the link command).
|
|
|
|
|
|
| |
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.
|