summaryrefslogtreecommitdiffstats
path: root/testsuites/smptests (follow)
Commit message (Collapse)AuthorAgeFilesLines
* smptests/smpfatal03: Wait for end of test msgSebastian Huber2014-10-241-0/+2
|
* tests/smptests: Normal use of test extensionSebastian Huber2014-10-242-4/+4
|
* tests/smptests: Use barriers in smpfatal0{12}Sebastian Huber2014-10-232-4/+18
| | | | | Call the test extension explicitly and wait for report output using a barrier. This avoids problems with an early shutdown of the system.
* smptests/smpload01: Report profiling only onceSebastian Huber2014-09-172-184/+0
| | | | Rely on test extension to report profiling.
* smptests/smpcache01: Remove invalidation of data cache lines from testDaniel Cederman2014-09-163-33/+33
| | | | | Invalidation of entire data cache might cause data written to the stack to get lost.
* smptests/smplock01: Update screen fileSebastian Huber2014-09-011-1/+1
|
* tests: Add documentationSebastian Huber2014-09-019-13/+75
|
* smptests/smpfatal08: Fix link errorSebastian Huber2014-09-011-0/+7
|
* smptests/smpcache01: Test the SMP cache managerDaniel Cederman2014-08-226-0/+342
| | | | Invokes SMP cache management routines under different scenarios.
* smpschedsem01: new test.Jennifer Averett2014-07-116-0/+134
| | | | | This test verifies priority is inherited from a high priority semaphore by a lower priority task.
* smpschedaffinity05: Add test for worst case migration for affintiy scheduler.Jennifer Averett2014-07-116-0/+295
| | | | | | This test uses a combination of priority and affinity to cause the tasks running on all 4 cores to change due to one task priority change.
* smpschedaffinity04: New test.Jennifer Averett2014-07-116-0/+229
| | | | | This test walks a secondary high prority task across all the cores.
* smpschedaffinity03: New test.Jennifer Averett2014-07-116-0/+142
| | | | This task walks the affinity of self across all the cores.
* smpschedaffinity02: New test.Jennifer Averett2014-07-116-0/+283
| | | | | This test checks setting the affinity of a secondary task on a two core system.
* smpschedaffinity01: New test.Jennifer Averett2014-07-116-0/+220
| | | | This test verifies that affinity is honored when set prior to task start.
* score: Fix scheduler helping implementationSebastian Huber2014-07-102-241/+255
| | | | | Do not extract the idle threads from the ready set so that there is always a thread available for comparison.
* smptests/smpmrsp01: Add and update test casesSebastian Huber2014-07-092-185/+720
|
* score: Need for help indicator for scheduler opsSebastian Huber2014-07-081-16/+387
| | | | | | | | | | | | | Return a thread in need for help for the following scheduler operations - unblock, - change priority, and - yield. A thread in need for help is a thread that encounters a scheduler state change from scheduled to ready or a thread that cannot be scheduled in an unblock operation. Such a thread can ask threads which depend on resources owned by this thread for help.
* score: Rename *_Node_get() to *_Thread_get_node()Sebastian Huber2014-07-081-1/+1
| | | | | | This emphasizes that the scheduler node of a thread is returned and this is not a function working with scheduler nodes like the other *_Node_*() functions.
* smptests/smpfatal08: Support RTEMS_PARAVIRTSebastian Huber2014-06-301-1/+2
|
* smptests/smpmigration02: PR2183: Add test caseSebastian Huber2014-06-241-11/+138
|
* score: Fix thread deletion on SMPSebastian Huber2014-06-232-13/+193
| | | | | | Close the thread object in _Thread_Make_zombie() so that all blocking operations that use _Thread_Get() in the corresponding release directive can find a terminating thread and can complete the operation.
* score: Collect scheduler related fields in TCBSebastian Huber2014-06-231-2/+3
| | | | | Add Thread_Scheduler_control to collect scheduler related fields of the TCB.
* smptests/smpwakeafter01: New testSebastian Huber2014-06-186-0/+230
|
* smptests: Avoid use of uninitialized dataSebastian Huber2014-06-132-0/+4
|
* smptests/smpscheduler03: Test all SMP schedulersSebastian Huber2014-06-122-4/+135
|
* smptest/smpfatal03: Update due to API changesSebastian Huber2014-06-101-1/+1
|
* smptests/smpthreadlife01: Fix for debug enabledChristian Mauderer2014-06-031-4/+4
|
* smptests/smpmrsp01: Fix scheduler idsChristian Mauderer2014-06-031-1/+9
|
* score: Use Resource Handler for MrsP semaphoresSebastian Huber2014-06-031-0/+288
| | | | | This enables proper resource dependency tracking and as a side-effect deadlock detection.
* score: _Scheduler_Set_affinity()Sebastian Huber2014-06-021-3/+3
| | | | | Do not change the scheduler with this function. Documentation. Coding style.
* score: Multiprocessor Resource Sharing ProtocolSebastian Huber2014-05-286-0/+881
| | | | | | | | | | | | | | | | | | | | | | Add basic support for the Multiprocessor Resource Sharing Protocol (MrsP). The Multiprocessor Resource Sharing Protocol (MrsP) is defined in A. Burns and A.J. Wellings, A Schedulability Compatible Multiprocessor Resource Sharing Protocol - MrsP, Proceedings of the 25th Euromicro Conference on Real-Time Systems (ECRTS 2013), July 2013. It is a generalization of the Priority Ceiling Protocol to SMP systems. Each MrsP semaphore uses a ceiling priority per scheduler instance. These ceiling priorities can be specified with rtems_semaphore_set_priority(). A task obtaining or owning a MrsP semaphore will execute with the ceiling priority for its scheduler instance as specified by the MrsP semaphore object. Tasks waiting to get ownership of a MrsP semaphore will not relinquish the processor voluntarily. In case the owner of a MrsP semaphore gets preempted it can ask all tasks waiting for this semaphore to help out and temporarily borrow the right to execute on one of their assigned processors. The help out feature is not implemented with this patch.
* score: Fix race condition in SMP startupSebastian Huber2014-05-266-110/+0
| | | | | | | | | | | | | | Do not use the Per_CPU_Control::started in _SMP_Start_multitasking_on_secondary_processor() since this field may be not up to date when a secondary processor reads it. Use the read-only scheduler assignment instead. Add a new fatal error SMP_FATAL_MULTITASKING_START_ON_INVALID_PROCESSOR. This prevents out-of-bounds access. It is currently not possible to test these fatal errors. One option would be to fake values of the _CPU_SMP_Get_current_processor(), but unfortunately this function is inline on some architectures.
* score: _Thread_Set_life_protection()Sebastian Huber2014-05-211-5/+18
| | | | | | | Enable usage of _Thread_Set_life_protection() in thread dispatch critical sections. This can be used to enable the thread life-protection with thread dispatching disabled and then enable thread dispatching.
* score: Split SMP scheduler enqueue functionSebastian Huber2014-05-156-0/+178
| | | | | | | | Extract code from _Scheduler_SMP_Enqueue_ordered() and move it to the new function _Scheduler_SMP_Enqueue_scheduled_ordered() to avoid untestable execution paths. Add and use function _Scheduler_SMP_Unblock().
* bsps: Use bsp_start_on_secondary_processor()Sebastian Huber2014-05-121-12/+3
| | | | Use a standard function for startup on secondary processors.
* smptests/smp07: Fix test outputSebastian Huber2014-05-071-3/+2
|
* smptests/smp05: Fix test name and outputSebastian Huber2014-05-071-4/+3
|
* score: Implement forced thread migrationSebastian Huber2014-05-078-9/+302
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | 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 SMP test message handlerSebastian Huber2014-05-056-0/+245
| | | | | This handler can be used to test the inter-processor interrupt implementation.
* score: SMP_FATAL_SCHEDULER_WITHOUT_PROCESSORSSebastian Huber2014-05-057-122/+51
| | | | | Avoid the SMP_FATAL_SCHEDULER_WITHOUT_PROCESSORS fatal error and make it a run-time error in rtems_scheduler_ident() and _Scheduler_Get_by_id().
* smptests/smpload01: Reduce timeout valueSebastian Huber2014-04-161-7/+3
| | | | Use events instead of suspend/resume.
* score: Add clustered/partitioned schedulingSebastian Huber2014-04-1526-3/+879
| | | | | | | | | | | | | | | 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: Rename rtems_smp_get_current_processor()Sebastian Huber2014-04-1117-29/+29
| | | | | | | Rename rtems_smp_get_current_processor() in rtems_get_current_processor(). Make rtems_get_current_processor() a function in uni-processor configurations to enable ABI compatibility with SMP configurations.
* rtems: Rename rtems_smp_get_processor_count()Sebastian Huber2014-04-1122-33/+33
| | | | | | Rename rtems_smp_get_processor_count() in rtems_get_processor_count(). Make rtems_get_processor_count() a function in uni-processor configurations to enable ABI compatibility with SMP configurations.
* smptests/smpschedule01: Rename in smpscheduler01Sebastian Huber2014-04-097-23/+23
|
* Disable per task variables when SMP is enabledJoel Sherrill2014-04-041-9/+1
| | | | | | Per task variables are inherently unsafe in SMP systems. This patch disables them from the build and adds warnings in the appropriate documentation and configuration sections.
* smpaffinity01: Use Priority Affinity SMP scheduler.Jennifer Averett2014-04-031-1/+2
|
* smppsxaffinity01: Use Priority Affinity SMP scheduler.Jennifer Averett2014-04-031-0/+1
|
* smppsxaffinity02: Use Priority Affinity SMP scheduler.Jennifer Averett2014-04-031-0/+1
|
generated by cgit v1.2.3 (git 2.25.1) at 2024-05-23 11:36:05 +0000