summaryrefslogtreecommitdiffstats
path: root/testsuites (follow)
Commit message (Collapse)AuthorAgeFilesLines
* sptests/spcontext01: Avoid NULL pointer accessSebastian Huber2014-07-011-1/+15
|
* 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
|
* samples/pppd: Fix extra drivers initializerSebastian Huber2014-06-111-1/+1
|
* smptest/smpfatal03: Update due to API changesSebastian Huber2014-06-101-1/+1
|
* sptests/spsem03: New testSebastian Huber2014-06-036-0/+194
|
* rhealstone: Produce proper begin/end messagesSebastian Huber2014-06-036-12/+25
|
* 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: Add Resource HandlerSebastian Huber2014-06-036-0/+445
| | | | | | | | | | A resource is something that has at most one owner at a time and may have multiple rivals in case an owner is present. The owner and rivals are impersonated via resource nodes. A resource is represented via the resource control structure. The resource controls and nodes are organized as trees. It is possible to detect deadlocks via such a resource tree. The _Resource_Iterate() function can be used to iterate through such a resource tree starting at a top node.
* score: _Scheduler_Set_affinity()Sebastian Huber2014-06-021-3/+3
| | | | | Do not change the scheduler with this function. Documentation. Coding style.
* rtems-test-check: Ignore tests which require real ISR based clock tickChris Johns2014-05-282-1/+73
| | | | | | | | | BSPs for simulators which do not include a clock tick interrupt source are incapable of running some tests successfully. This is a common characteristic of some BSPs and a fixed set of tests. There is no point in duplicating this list of tests in those BSPs test configuration. Read testsuites/testdata/require-tick-isr.tcfg for details.
* score: Multiprocessor Resource Sharing ProtocolSebastian Huber2014-05-2812-0/+1251
| | | | | | | | | | | | | | | | | | | | | | 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: PR2179: Fix initially locked PCP mutexesSebastian Huber2014-05-232-0/+37
| | | | | Elevate the priority of the creating task to the ceiling priority in case a semaphore is created as initially locked.
* testsuite: Add a user keypress to start pppd.Chris Johns2014-05-221-0/+22
| | | | Allow the test to run and pass when automatic testing.
* rtems: Fix sp2038 test.Chris Johns2014-05-221-0/+37
| | | | | | | | Avoid using newlib's gmtime_r call which fails with a max signed int. Add an RTEMS specific version for 1/1/1988 to 31/12/2100. Update sp2038 to test every day from 1/1/1988 to 31/12/2100. Only days need be tested as the code splits the seconds based on days.
* score: _Thread_Set_life_protection()Sebastian Huber2014-05-212-17/+80
| | | | | | | 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().
* score: Simplify _Thread_Change_priority()Sebastian Huber2014-05-156-175/+0
| | | | | | | | | | | | | | | | | | | | | | | | The function to change a thread priority was too complex. Simplify it with a new scheduler operation. This increases the average case performance due to the simplified logic. The interrupt disabled critical section is a bit prolonged since now the extract, update and enqueue steps are executed atomically. This should however not impact the worst-case interrupt latency since at least for the Deterministic Priority Scheduler this sequence can be carried out with a wee bit of instructions and no loops. Add _Scheduler_Change_priority() to replace the sequence of - _Thread_Set_transient(), - _Scheduler_Extract(), - _Scheduler_Enqueue(), and - _Scheduler_Enqueue_first(). Delete STATES_TRANSIENT, _States_Is_transient() and _Thread_Set_transient() since this state is now superfluous. With this change it is possible to get rid of the SCHEDULER_SMP_NODE_IN_THE_AIR state. This considerably simplifies the implementation of the new SMP locking protocols.
* score: Introduce scheduler nodesSebastian Huber2014-05-141-1/+1
| | | | | | | | | | | | Rename scheduler per-thread information into scheduler nodes using Scheduler_Node as the base type. Use inheritance for specialized schedulers. Move the scheduler specific states from the thread control block into the scheduler node structure. Validate the SMP scheduler node state transitions in case RTEMS_DEBUG is defined.
* bsps: Use bsp_start_on_secondary_processor()Sebastian Huber2014-05-121-12/+3
| | | | Use a standard function for startup on secondary processors.
* score: Fix CPU context usage on SMPSebastian Huber2014-05-081-0/+27
| | | | | | | | | | We must not alter the is executing indicator in _CPU_Context_Initialize() since this would cause an invalid state during a self restart. The is executing indicator must be valid at creation time since otherwise _Thread_Kill_zombies() uses an undefined value for not started threads. This could result in a system life lock.
* smptests/smp07: Fix test outputSebastian Huber2014-05-071-3/+2
|
* smptests/smp05: Fix test name and outputSebastian Huber2014-05-071-4/+3
|
* tests: Add locked_printf_plugin()Sebastian Huber2014-05-072-18/+49
| | | | Add locked_vprintf(). Return an int just like printf(), etc.
* score: Implement forced thread migrationSebastian Huber2014-05-0710-15/+306
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | 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.
* testsuites: Remove BSP_SMALL_MEMORYJoel Sherrill2014-05-0616-153/+18
|
* 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().
* testsuite: Add a per BSP test check for tests not to build.Chris Johns2014-05-058-110/+145
| | | | | | | | Provide a file per BSP to list tests that do not build for a BSP. This change removes the BSP_SMALL_MEMORY hack from the code. That hack was a mistake. Provide configuration files for each BSP with tests that cannot build.
* score: Statically initialize _ISR_Vector_tableSebastian Huber2014-04-292-5/+1
|
* utf8proc01: Honor BSP_SMALL_MEMORYJoel Sherrill2014-04-221-1/+7
|
* flashdisk01: Honor BSP_SMALL_MEMORYJoel Sherrill2014-04-221-2/+2
|
* fsdosfsname01: Honor BSP_SMALL_MEMORYJoel Sherrill2014-04-221-9/+23
|
* fsdosfsformat01: Honor BSP_SMALL_MEMORYJoel Sherrill2014-04-221-4/+10
|
* smptests/smpload01: Reduce timeout valueSebastian Huber2014-04-161-7/+3
| | | | Use events instead of suspend/resume.
* score: Add clustered/partitioned schedulingSebastian Huber2014-04-1527-9/+902
| | | | | | | | | | | | | | | 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-156-1/+167
| | | | | Make rtems_task_get_affinity() and rtems_task_set_affinity() available on non-SMP configurations. Allow larger CPU sets.
* score: Static scheduler configurationSebastian Huber2014-04-155-34/+39
| | | | | | Do not allocate the scheduler control structures from the workspace. This is a preparation step for configuration of clustered/partitioned schedulers on SMP.
* sp74.doc: Correct minor typosJoel Sherrill2014-04-141-3/+5
|
generated by cgit v1.2.3 (git 2.25.1) at 2024-05-11 18:12:27 +0000