summaryrefslogtreecommitdiffstats
path: root/testsuites (follow)
Commit message (Collapse)AuthorAgeFilesLines
* 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
|
* 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-1123-34/+34
| | | | | | 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.
* score: Statically initialize IO managerSebastian Huber2014-04-103-6/+1
| | | | | | | | | | | | This simplifies the RTEMS initialization and helps to avoid a memory overhead. The workspace demands of the IO manager were not included in the <rtems/confdefs.h> workspace size estimate. This is also fixed as a side-effect. Update documentation and move "Specifying Application Defined Device Driver Table" to the section end. This sub-section is not that important for the user. Mentioning this at the beginning may lead to confusion.
* sptests/sp37: Account for internal struct alignSebastian Huber2014-04-091-2/+10
|
* smptests/smpschedule01: Rename in smpscheduler01Sebastian Huber2014-04-097-23/+23
|
* sptests/sp68: Fix configurationSebastian Huber2014-04-071-0/+2
|
* psxtests/psxkey02: Test for proper error caseSebastian Huber2014-04-072-37/+14
|
* tmtests/tm21: Fix configurationSebastian Huber2014-04-072-2/+4
|
* sptests/spwatchdog: Fix for short enumsSebastian Huber2014-04-071-4/+11
|
* score: Delete _Thread_Ticks_per_timesliceSebastian Huber2014-04-071-1/+0
| | | | Use the Configuration instead.
* score: Delete _Thread_Maximum_extensionsSebastian Huber2014-04-071-1/+0
| | | | Use the Configuration instead.
* Disable per task variables when SMP is enabledJoel Sherrill2014-04-044-12/+22
| | | | | | 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.
* rhealstone/rhmlatency: Fix configurationSebastian Huber2014-04-041-0/+2
|
* score: Add scheduler control to scheduler opsSebastian Huber2014-04-042-6/+12
| | | | | Scheduler operations must be free of a global scheduler context to enable partitioned/clustered scheduling.
* 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
|
* samples/fileio: Fix configurationSebastian Huber2014-04-031-1/+1
|
* score: Move priority bit map to scheduler instanceSebastian Huber2014-04-033-28/+21
| | | | | | Delete global variables _Priority_Major_bit_map and _Priority_Bit_map. This makes it possible to use multiple priority scheduler instances for example with clustered/partitioned scheduling on SMP.
* score: PR788: Add INTERNAL_ERROR_RESOURCE_IN_USESebastian Huber2014-04-0311-16/+89
| | | | | | | | | | | | | | | Issue a fatal error in case a thread is deleted which still owns resources (e.g. a binary semaphore with priority inheritance or ceiling protocol). The resource count must be checked quite late since RTEMS task variable destructors, POSIX key destructors, POSIX cleanup handler, the Newlib thread termination extension or other thread termination extensions may release resources. In this context it would be quite difficult to return an error status to the caller. An alternative would be to place threads with a non-zero resource count not on the zombie chain. Thus we have a resource leak instead of a fatal error. The terminator thread can see this error if we return an RTEMS_RESOURCE_IN_USE status for the rtems_task_delete() for example.
* libtests/newlib01: New testSebastian Huber2014-04-016-0/+347
|
* smptests/smpthreadlife01: Avoid bad profiling statSebastian Huber2014-04-011-1/+5
|
* score: PR2172: _Thread_queue_Extract()Sebastian Huber2014-04-011-3/+1
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | Add _Thread_queue_Extract_with_return_code(). On SMP this sequence in _Thread_queue_Process_timeout() was broken: [...] /* * After we enable interrupts here, a lot may happen in the * meantime, e.g. nested interrupts may release the resource that * times out here. So we enter _Thread_queue_Extract() * speculatively. Inside this function we check the actual status * under ISR disable protection. This ensures that exactly one * executing context performs the extract operation (other parties * may call _Thread_queue_Dequeue()). If this context won, then * we have a timeout. * * We can use the_thread_queue pointer here even if * the_thread->Wait.queue is already set to NULL since the extract * operation will only use the thread queue discipline to select * the right extract operation. The timeout status is set during * thread queue initialization. */ we_did_it = _Thread_queue_Extract( the_thread_queue, the_thread ); if ( we_did_it ) { the_thread->Wait.return_code = the_thread_queue->timeout_status; } [...] In case _Thread_queue_Extract() successfully extracted a thread, then this thread may start execution on a remote processor immediately and read the the_thread->Wait.return_code before we update it here with the timeout status. Thus it observes a successful operation even if it timed out.
* smptests/smpthreadlife01: TypoSebastian Huber2014-03-311-5/+0
|
* smptests/smpthreadlife01: Add test casesSebastian Huber2014-03-312-11/+159
|
* sptests/sptask_err04: Fix broken testSebastian Huber2014-03-313-3/+5
|
* score: Delete CORE_mutex_Control::lockSebastian Huber2014-03-311-2/+2
| | | | | | | | The holder field is enough to determine if a mutex is locked or not. This leads also to better error status codes in case a rtems_semaphore_release() is done for a mutex without having the ownership.
* score: Do not reset resource count during restartSebastian Huber2014-03-316-0/+389
| | | | | | | This fixes an integer underflow problem in case resources are released after a thread restart. Add new test sptests/spthreadlife01.
* score: PR2152: Use allocator mutex for objectsSebastian Huber2014-03-311-0/+2
| | | | | Use allocator mutex for objects allocate/free. This prevents that the thread dispatch latency depends on the workspace/heap fragmentation.