summaryrefslogtreecommitdiffstats
path: root/testsuites/sptests/spscheduler01/init.c (follow)
Commit message (Collapse)AuthorAgeFilesLines
* Update company nameSebastian Huber2023-05-201-1/+1
| | | | | The embedded brains GmbH & Co. KG is the legal successor of embedded brains GmbH.
* testsuites/sptests/sp[s-z]*: Change license to BSD-2Joel Sherrill2022-04-051-3/+22
| | | | Updates #3053.
* rtems: rtems_scheduler_get_processor_set() statusSebastian Huber2021-05-061-1/+1
| | | | | | | | | In case the processor set is not large enough to contain the processor set owned by the scheduler return RTEMS_INVALID_SIZE instead of RTEMS_INVALID_NUMBER. This is more in line with other directives since the issue is related to the size of an object. Close #4401.
* rtems: Change rtems_task_get_affinity() statusSebastian Huber2021-04-271-1/+2
| | | | | | | | | In case the processor set is not large enough to contain the processor affinity set of the task return RTEMS_INVALID_SIZE instead of RTEMS_INVALID_NUMBER. This is more in line with other directives since the issue is related to the size of an object. Close #4393.
* rtems: Add rtems_scheduler_map_priority_from_posix()Sebastian Huber2020-03-031-0/+44
| | | | Update #3881.
* rtems: Add rtems_scheduler_map_priority_to_posix()Sebastian Huber2020-03-031-7/+45
| | | | Update #3881.
* Move feature macro before "config.h" includeSebastian Huber2019-12-021-3/+3
| | | | | | | This allows to use header includes in "config.h" to reduce the build configuration checks. Update #3818.
* rtems: Add rtems_scheduler_get_maximum_priority()Sebastian Huber2018-12-071-1/+25
| | | | Update #3636.
* tests: Use simple console driverSebastian Huber2017-11-061-1/+1
| | | | | Update #3170. Update #3199.
* tests: Remove TEST_INITSebastian Huber2017-10-281-1/+0
| | | | | | | | The TEST_EXTERN is a used only by the system.h style tests and they use CONFIGURE_INIT appropriately. Update #3170. Update #3199.
* sptests/spscheduler01: Test POSIX set/get affinitySebastian Huber2017-10-281-23/+96
|
* score: Fix _Scheduler_Set_affinity()Sebastian Huber2017-10-281-1/+12
|
* testsuite: Use printk for all test output where possible.Chris Johns2017-10-231-0/+2
| | | | | | | | | | - Remove the printf support leaving the direct printk support configured with TESTS_USE_PRINTK and all other output goes via a buffered vsniprintf call to printk. - Control the test's single init for functions and global data with TEST_INIT and not CONFIGURE_INIT. They are now separate. Updates #3170.
* rtems: Add rtems_scheduler_ident_by_processor_setSebastian Huber2017-07-111-0/+19
| | | | Update #3070.
* rtems: Add rtems_scheduler_ident_by_processor()Sebastian Huber2017-07-111-0/+12
| | | | Update #3069.
* Remove obsolete __RTEMS_HAVE_SYS_CPUSET_H__Joel Sherrill2017-01-111-4/+0
|
* rtems: Add scheduler processor add/removeSebastian Huber2016-11-101-0/+28
| | | | Update #2797.
* score: Relax _Scheduler_Set() restrictionsSebastian Huber2016-11-031-1/+1
| | | | | | No longer unconditionally prevent scheduler changes if the thread owns resources. Prevent a scheduler change only in case other threads wait for the resource.
* rtems: Add rtems_task_get_priority()Sebastian Huber2016-09-211-0/+39
| | | | | Update #2556. Update #2784.
* rtems: Fix rtems_task_set_scheduler() APISebastian Huber2016-07-011-8/+155
| | | | | | | | | | | Task priorities are only valid within a scheduler instance. The rtems_task_set_scheduler() directive moves a task from one scheduler instance to another using the current priority of the thread. However, the current task priority of the source scheduler instance is undefined in the target scheduler instance. Add a third parameter to specify the priority. Close #2749.
* Delete CONFIGURE_USE_IMFS_AS_BASE_FILESYSTEMSebastian Huber2014-12-161-2/+0
| | | | This define was superfluous, undocumented and used inconsistently.
* score: Implement forced thread migrationSebastian Huber2014-05-071-4/+4
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | The current implementation of task migration in RTEMS has some implications with respect to the interrupt latency. It is crucial to preserve the system invariant that a task can execute on at most one processor in the system at a time. This is accomplished with a boolean indicator in the task context. The processor architecture specific low-level task context switch code will mark that a task context is no longer executing and waits that the heir context stopped execution before it restores the heir context and resumes execution of the heir task. So there is one point in time in which a processor is without a task. This is essential to avoid cyclic dependencies in case multiple tasks migrate at once. Otherwise some supervising entity is necessary to prevent life-locks. Such a global supervisor would lead to scalability problems so this approach is not used. Currently the thread dispatch is performed with interrupts disabled. So in case the heir task is currently executing on another processor then this prolongs the time of disabled interrupts since one processor has to wait for another processor to make progress. It is difficult to avoid this issue with the interrupt latency since interrupts normally store the context of the interrupted task on its stack. In case a task is marked as not executing we must not use its task stack to store such an interrupt context. We cannot use the heir stack before it stopped execution on another processor. So if we enable interrupts during this transition we have to provide an alternative task independent stack for this time frame. This issue needs further investigation.
* score: Add clustered/partitioned schedulingSebastian Huber2014-04-151-6/+23
| | | | | | | | | | | | | | | Clustered/partitioned scheduling helps to control the worst-case latencies in the system. The goal is to reduce the amount of shared state in the system and thus prevention of lock contention. Modern multi-processor systems tend to have several layers of data and instruction caches. With clustered/partitioned scheduling it is possible to honour the cache topology of a system and thus avoid expensive cache synchronization traffic. We have clustered scheduling in case the set of processors of a system is partitioned into non-empty pairwise-disjoint subsets. These subsets are called clusters. Clusters with a cardinality of one are partitions. Each cluster is owned by exactly one scheduler instance.
* rtems: Add task get/set schedulerSebastian Huber2014-04-151-1/+77
|
* rtems: Add scheduler get processorsSebastian Huber2014-04-151-0/+53
|
* rtems: Add scheduler identificationSebastian Huber2014-04-151-1/+29
|
* score: Task get/set affinitySebastian Huber2014-04-151-0/+130
Make rtems_task_get_affinity() and rtems_task_set_affinity() available on non-SMP configurations. Allow larger CPU sets.