summaryrefslogtreecommitdiffstats
path: root/cpukit/rtems (follow)
Commit message (Collapse)AuthorAgeFilesLines
* libnetworking: Fix close of active socketsSebastian Huber2015-01-201-0/+5
| | | | | | | Send a special event to notify tasks waiting for a socket state change in case this socket gets closed. This prevents a use after free. Close #785.
* rtems: Add rtems_cache_coherent_allocate()Sebastian Huber2014-11-271-0/+61
| | | | Add rtems_cache_coherent_free() and rtems_cache_coherent_add_area().
* score: Rework global constructionSebastian Huber2014-10-131-1/+12
| | | | | | Ensure that the global construction is performed in the context of the first initialization thread. On SMP this was not guaranteed in the previous implementation.
* rtems: SMP fix for timer serverSebastian Huber2014-08-271-1/+3
|
* rtems: Add more clock tick functionsSebastian Huber2014-08-261-0/+71
| | | | | Add rtems_clock_tick_later(), rtems_clock_tick_later_usec() and rtems_clock_tick_before().
* rtems: Inline rtems_clock_get_ticks_since_boot()Sebastian Huber2014-08-253-39/+7
| | | | Update documentation.
* score: Add SMP support to the cache managerDaniel Cederman2014-08-221-0/+82
| | | | | | | | | Adds functions that allows the user to specify which cores that should perform the cache operation. SMP messages are sent to all the specified cores and the caller waits until all cores have acknowledged that they have flushed their cache. If CPU_CACHE_NO_INSTRUCTION_CACHE_SNOOPING is defined the instruction cache invalidation function will perform the operation on all cores using the previous method.
* Delete unused *_Is_null() functionsSebastian Huber2014-07-267-86/+0
|
* semdelete.c: Correct spacingJoel Sherrill2014-07-141-1/+1
|
* rtems: Delete unused <rtems/rtems/atomic.h>Sebastian Huber2014-06-303-43/+0
|
* score: Remove scheduler parameter from most opsSebastian Huber2014-06-233-20/+4
| | | | | | | | | | | | | Remove the scheduler parameter from most high level scheduler operations like - _Scheduler_Block(), - _Scheduler_Unblock(), - _Scheduler_Change_priority(), - _Scheduler_Update_priority(), - _Scheduler_Release_job(), and - _Scheduler_Yield(). This simplifies the scheduler operations usage.
* score: Fix _Thread_Delay_ended() on SMPSebastian Huber2014-06-203-11/+13
| | | | | | | | | | | | | | | | Suppose we have two tasks A and B and two processors. Task A is about to delete task B. Now task B calls rtems_task_wake_after(1) on the other processor. Task B will block on the Giant lock. Task A progresses with the task B deletion until it has to wait for termination. Now task B obtains the Giant lock, sets its state to STATES_DELAYING, initializes its watchdog timer and waits. Eventually _Thread_Delay_ended() is called, but now _Thread_Get() returned NULL since the thread is already marked as deleted. Thus task B remained forever in the STATES_DELAYING state. Instead of passing the thread identifier use the thread control block directly via the watchdog user argument. This makes _Thread_Delay_ended() also a bit more efficient.
* score: PR2181: Add _Thread_Yield()Sebastian Huber2014-06-121-2/+1
| | | | | | | | | | | | | | | | | | | The _Scheduler_Yield() was called by the executing thread with thread dispatching disabled and interrupts enabled. The rtems_task_suspend() is explicitly allowed in ISRs: http://rtems.org/onlinedocs/doc-current/share/rtems/html/c_user/Interrupt-Manager-Directives-Allowed-from-an-ISR.html#Interrupt-Manager-Directives-Allowed-from-an-ISR Unlike the other scheduler operations the locking was performed inside the operation. This lead to the following race condition. Suppose a ISR suspends the executing thread right before the yield scheduler operation. Now the executing thread is not longer in the set of ready threads. The typical scheduler operations did not check the thread state and will now extract the thread again and enqueue it. This corrupted data structures. Add _Thread_Yield() and do the scheduler yield operation with interrupts disabled. This has a negligible effect on the interrupt latency.
* score: Add and use _Thread_Owns_resources()Sebastian Huber2014-06-031-1/+1
|
* score: _Scheduler_Set_affinity()Sebastian Huber2014-06-021-0/+11
| | | | | Do not change the scheduler with this function. Documentation. Coding style.
* score: _Scheduler_Get_affinity()Sebastian Huber2014-06-021-1/+0
| | | | Drop scheduler parameter. Coding style.
* rtems: Coding styleSebastian Huber2014-06-021-19/+15
|
* score: Multiprocessor Resource Sharing ProtocolSebastian Huber2014-05-2811-10/+309
| | | | | | | | | | | | | | | | | | | | | | 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.
* rtems: Fix sp2038 test.Chris Johns2014-05-221-14/+93
| | | | | | | | 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.
* rtems: Simplify rtems_semaphore_obtain()Sebastian Huber2014-05-221-2/+4
|
* rtems: Clarify task set/get scheduler parametersSebastian Huber2014-05-203-10/+10
|
* rtems: Move extern "C" in <rtems.h>Sebastian Huber2014-05-121-4/+4
| | | | Do not cover the includes with an extern "C".
* rtems: Fix ASR SMP supportSebastian Huber2014-05-072-3/+24
| | | | Initialize the ISR lock only once and destroy it properly.
* score: Implement forced thread migrationSebastian Huber2014-05-072-5/+2
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | 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: DocumentationSebastian Huber2014-05-071-2/+6
|
* score: SMP_FATAL_SCHEDULER_WITHOUT_PROCESSORSSebastian Huber2014-05-052-3/+11
| | | | | 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().
* doc: rtems_task_set_scheduler()Sebastian Huber2014-04-171-0/+3
|
* doc: rtems_get_processor_count()Sebastian Huber2014-04-171-8/+5
|
* rtems: Add const qualifierSebastian Huber2014-04-162-6/+6
|
* score: Add clustered/partitioned schedulingSebastian Huber2014-04-153-2/+3
| | | | | | | | | | | | | | | 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-154-0/+155
|
* rtems: Add scheduler get processorsSebastian Huber2014-04-153-0/+79
|
* rtems: Add scheduler identificationSebastian Huber2014-04-153-0/+64
|
* score: Task get/set affinitySebastian Huber2014-04-152-31/+28
| | | | | Make rtems_task_get_affinity() and rtems_task_set_affinity() available on non-SMP configurations. Allow larger CPU sets.
* score: Simplify thread control initializationSebastian Huber2014-04-152-37/+5
| | | | | | | | | | | The thread control block contains fields that point to application configuration dependent memory areas, like the scheduler information, the API control blocks, the user extension context table, the RTEMS notepads and the Newlib re-entrancy support. Account for these areas in the configuration and avoid extra workspace allocations for these areas. This helps also to avoid heap fragementation and reduces the per thread memory due to a reduced heap allocation overhead.
* rtems: Rename rtems_smp_get_current_processor()Sebastian Huber2014-04-113-6/+30
| | | | | | | 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-113-4/+29
| | | | | | 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: Use proper protectionSebastian Huber2014-04-071-6/+7
|
* score: Delete _Thread_Ticks_per_timesliceSebastian Huber2014-04-071-1/+2
| | | | Use the Configuration instead.
* Disable per task variables when SMP is enabledJoel Sherrill2014-04-049-24/+60
| | | | | | 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.
* score: Add scheduler control to scheduler opsSebastian Huber2014-04-047-16/+37
| | | | | Scheduler operations must be free of a global scheduler context to enable partitioned/clustered scheduling.
* rtems: Move affinity from thread to scheduler.Jennifer Averett2014-04-032-9/+9
|
* score: Delete CORE_mutex_Control::lockSebastian Huber2014-03-311-1/+1
| | | | | | | | 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: PR2152: Use allocator mutex for objectsSebastian Huber2014-03-3124-125/+91
| | | | | Use allocator mutex for objects allocate/free. This prevents that the thread dispatch latency depends on the workspace/heap fragmentation.
* score: Thread life cycle re-implementationSebastian Huber2014-03-314-41/+30
| | | | | | | | | | | | | | | | | | | The thread deletion is now supported on SMP. This change fixes the following PRs: PR1814: SMP race condition between stack free and dispatch PR2035: psxcancel reveals NULL pointer access in _Thread_queue_Extract() The POSIX cleanup handler are now called in the right context (should be called in the context of the terminating thread). http://pubs.opengroup.org/onlinepubs/009695399/functions/xsh_chap02_09.html Add a user extension the reflects a thread termination event. This is used to reclaim the Newlib reentrancy structure (may use file operations), the POSIX cleanup handlers and the POSIX key destructors.
* score: Add parameter to _Thread_Restart()Sebastian Huber2014-03-311-1/+1
| | | | | The executing thread will be later used for a common implementation with _Thread_Close().
* score: Use thread action for thread restartSebastian Huber2014-03-311-9/+1
| | | | | The thread restart is now supported on SMP. New test smptests/smpthreadlife01.
* rtems: Use thread action for signalsSebastian Huber2014-03-316-10/+36
|
* Change all references of rtems.com to rtems.org.Chris Johns2014-03-21219-219/+219
|
* rtems: Include missing header fileSebastian Huber2014-03-181-1/+2
|
generated by cgit v1.2.3 (git 2.25.1) at 2024-05-23 15:30:54 +0000