summaryrefslogtreecommitdiffstats
path: root/cpukit/include/rtems/score (follow)
Commit message (Collapse)AuthorAgeFilesLines
* score: Rework idle handling in SMP schedulersSebastian Huber2021-11-235-466/+427
| | | | | | | | | | | | | | | | | | This patch fixes an issue with the idle thread handling in the SMP scheduler framework used for the MrsP locking protocol. The approach to use a simple chain of unused idle threads is broken for schedulers which support thread to processor affinity. The reason is that the thread to processor affinity introduces another ordering indicator which may under certain conditions lead to a reordering of idle threads in the scheduled chain. This reordering is not propagated to the chain of unused idle threads. This could lead to use an idle thread for a sticky scheduler node which is already in use. This locks up the system in infinite loops in the thread context switch procedure. To fix this, the SMP scheduler implementations must now provide callbacks to get and release an unused idle thread. Update #4531.
* score: Add SMP scheduler make/clean stickySebastian Huber2021-11-2310-77/+378
| | | | | | | | | | | | | | | | | | | | This patch fixes the following broken behaviour: While a thread is scheduled on a helping scheduler, while it does not own a MrsP semaphore, if it obtains a MrsP semaphore, then no scheduler node using an idle thread and the ceiling priority of the semaphore is unblocked for the home scheduler. This could lead to priority inversion issues and is not in line with the MrsP protocol. Introduce two new scheduler operations which are only enabled if RTEMS_SMP is defined. The operations are used to make the scheduler node of the home scheduler sticky and to clean the sticky property. This helps to keep the sticky handing out of the frequently used priority update operation. Close #4532.
* score: Add SMP scheduler idle exchange callbackSebastian Huber2021-11-231-0/+19
| | | | Update #4531.
* score: Rework affine ready queue handlingSebastian Huber2021-11-231-2/+11
| | | | | | | | Rework the handling of the affine ready queue for the EDF SMP scheduler. Do the queue handling in the node insert, move, and extract operations. Remove the queue handling from _Scheduler_EDF_SMP_Allocate_processor(). Update #4531.
* score: Use extract from scheduled callbacksSebastian Huber2021-11-231-5/+20
| | | | | | | Use the extract from scheduled callback provided by the scheduler implementation in the SMP scheduler framework. Update #4531.
* score: Remove return value from enqueue scheduledSebastian Huber2021-11-231-26/+30
| | | | | | The return value was unused. Remove it. Update #4531.
* score: Scheduler insert after moveSebastian Huber2021-11-231-5/+5
| | | | | | | | Insert nodes after moving the second node to reduce the items in the data structure for the insert operation. This also avoids having two nodes for the same processor inserted into the scheduled chain. Update #4531.
* score: Add missing idle thread exchangesSebastian Huber2021-11-231-0/+18
| | | | Update #4531.
* score: Add missing idle thread releasesSebastian Huber2021-11-231-0/+12
| | | | Update #4531.
* score: Simplify _Scheduler_Exchange_idle_thread()Sebastian Huber2021-11-232-17/+11
| | | | | | Remove superfluous idle parameter. Update #4531.
* score: Change _Scheduler_Try_to_schedule_node()Sebastian Huber2021-11-232-6/+6
| | | | | | Add the victim node as parameter instead of the idle thread. Update #4531.
* score: Not set CPU in _Scheduler_Use_idle_thread()Sebastian Huber2021-11-231-14/+8
| | | | | | | | Do not set the CPU of the idle thread in _Scheduler_Use_idle_thread(). This helps to use _Scheduler_Try_to_schedule_node() under more general conditions in the future, for example in case the owner and user of a node are not the same. Update #4531.
* score: Rename _Scheduler_Set_idle_thread()Sebastian Huber2021-11-232-22/+23
| | | | | | | Rename _Scheduler_Set_idle_thread() in _Scheduler_Node_set_idle_user() and move it to <rtems/score/schedulernodeimpl.h>. Update #4531.
* score: Add red-black tree append/prependSebastian Huber2021-11-231-0/+26
| | | | | | | These functions are a faster alternative to _RBTree_Insert_inline() if it is known that the new node is the maximum/minimum node. Update #4531.
* score: Simplify _Scheduler_Generic_block()Sebastian Huber2021-11-231-1/+1
| | | | | | If we block the executing thread and it is not the heir thread, then there is no need to run the schedule operation. The scheduler already selected a new heir.
* cpukit: Enable debug for SMP AArch64Kinsey Moore2021-11-221-9/+22
| | | | | | | Ensure when both RTEMS_DEBUG is specified and pointers are large that enough space is allocated to accomodate the Per_CPU_Control structure. This changes the calculation to be more compositional instead of trying to list out every permutation of options possible.
* score: Fix _CORE_ceiling_mutex_Set_priority()Sebastian Huber2021-11-151-6/+8
| | | | | | | We have to use a second thread queue context to acquire and release the thread wait lock. Close #4356.
* score: Always check if a prio ceiling is definedSebastian Huber2021-11-151-10/+10
| | | | | | | | | | Priority ceiling semaphores (in contrast to MrsP semaphores) have only one priority ceiling which is defined for the home scheduler of the task which created the semaphore. Always check during a semaphore seize that the home scheduler of the calling task is equal to this scheduler. This avoids a scheduler mismatch if the semphore is acquired after the calling thread blocked on the semaphore.
* score: Fix thread pinning assertionsSebastian Huber2021-11-151-2/+2
|
* score: Add _Timecounter_Set_NTP_update_second()Sebastian Huber2021-11-151-1/+23
| | | | | | | Allow the installation of an NTP update second handler which may be used by an NTP service. Update #2348.
* score: Introduce CPU budget operationsSebastian Huber2021-11-1514-129/+155
| | | | | | | | | | | | | | This patch set replaces the CPU budget algorithm enumeration with a set of CPU budget operations which implement a particular CPU budget algorithm. This helps to hide the CPU budget algorithm implementation details from the general thread handling. The CPU budget callouts are turned into CPU budget operations. This slightly reduces the size of the thread control block. All schedulers used the default scheduler tick implementation. The tick scheduler operation is removed and the CPU budget operations are directly used in _Watchdog_Tick() if the executing thread uses a CPU budget algorithm. This is performance improvement for all threads which do not use a CPU budget algorithm (default behaviour).
* cpukit: Add signal mapping supportKinsey Moore2021-10-291-0/+71
| | | | | | This adds a confdef option allowing an application to request mapping machine exceptions to POSIX signals. This is required for some languages such as Ada.
* score: Fix typoSebastian Huber2021-10-251-2/+2
|
* rtems: Fix rate monotonic statisticsSebastian Huber2021-10-253-12/+47
| | | | | | | | | | | | | | | The rate monotonic period statistics were affected by rtems_cpu_usage_reset(). The logic to detect and work around a CPU usage reset was broken. The Thread_Contol::cpu_time_used is changed to contain the processor time used throughout the entire lifetime of the thread. The new member Thread_Contol::cpu_time_used_at_last_reset is added to contain the processor time used at the time of the last reset through rtems_cpu_usage_reset(). This decouples the resets of the CPU usage and the rate monotonic period statistics. Update #4528.
* score: Simplify _Watchdog_Next_first()Sebastian Huber2021-10-251-19/+36
|
* Add support for IDLE Thread stack allocatorJoel Sherrill2021-10-111-0/+24
| | | | | | | | Add a stack allocator hook specifically for allocation of IDLE thread stacks. This allows the user to decide if IDLE thread stacks are statically allocated or handled by the same custom allocator mechanism as other thread stacks. Closes #4524.
* score: Always check queue in _Thread_Wait_cancel()Sebastian Huber2021-10-061-2/+2
| | | | | | Commit 18c8a270c296addff87f96b8c248f27eba31c24f removed _Thread_queue_Do_nothing_extract() so we have to check for a non-NULL queue in all configurations.
* score: Optimize EDF SMP scheduler opsSebastian Huber2021-10-061-1/+1
| | | | | | | The schedule operation is only called by rtems_task_mode(). It is called if preempt mode of the executing thread changes from disabled to enabled. Since the EDF SMP scheduler does not support the disabled preemption mode, the schedule operation is never called.
* scoe: Move workspace group definitionSebastian Huber2021-10-062-10/+10
| | | | | | Define the group in the header file which is used by <rtems/confdefs.h>. Update #3706.
* score: Add Hash Handler to groupSebastian Huber2021-10-061-0/+2
| | | | Update #3706.
* score: Add Thread_queue_Deadlock_statusSebastian Huber2021-10-011-11/+39
| | | | | | Replace the boolen return value with the new enum Thread_queue_Deadlock_status. This improves the code readability. Improve documentation. Shorten function names.
* score: Regenerate <rtems/score/basedefs.h>Sebastian Huber2021-09-301-1/+1
| | | | Reflect renamed specification item.
* score: Remove unused default scheduler opsSebastian Huber2021-09-211-46/+13
| | | | | | | | | | If SMP support is enabled and the system has exactly one processor, then it may use an uniprocessor scheduler. The ask for help, reconsider help request, and withdraw node operations can be NULL in this case, since they are only used if a thread has at least one helping scheduler node. At least two schedulers are required to get a helping node and each scheduler involved must own at least one processor. This is not possible on a system with exactly one processor.
* score: Ensure only one CPU if requiredSebastian Huber2021-09-211-1/+2
| | | | | | | Issue the new fatal SMP error SMP_FATAL_SCHEDULER_REQUIRES_EXACTLY_ONE_PROCESSOR if the system starts with not exactly one processor and an uniprocessor scheduler is configured.
* score: Provide two thread pin/unpin defaultsSebastian Huber2021-09-215-11/+32
| | | | | | | | | | | | | | The uniprocessor schedulers do not support systems with more than more processors. So they rivially support thread pinning and thus the SMP_FATAL_SCHEDULER_PIN_OR_UNPIN_NOT_SUPPORTED cannot happen. Add a second default implementation for SMP schedulers which do not support thread pinning. Change license to BSD-2-Clause according to file history and re-licensing agreement. Update #3053.
* score: SCHEDULER_OPERATION_DEFAULT_GET_SET_AFFINITYSebastian Huber2021-09-217-8/+20
| | | | | Rename SCHEDULER_OPERATION_DEFAULT_GET_SET_AFFINITY in SCHEDULER_DEFAULT_SET_AFFINITY_OPERATION. Add Doxygen comment.
* score: SCHEDULER_OPERATION_DEFAULT_ASK_FOR_HELPSebastian Huber2021-09-215-6/+17
| | | | | Rename SCHEDULER_OPERATION_DEFAULT_ASK_FOR_HELP in SCHEDULER_DEFAULT_SMP_OPERATIONS. Add a Doxygen comment.
* score: Change TOD_LATEST_YEAR to 2099Sebastian Huber2021-09-061-2/+29
| | | | | | | | This simplifies the implementation a bit. Declare _TOD_Days_to_date[] in <rtems/score/todimpl.h>. Make _TOD_Days_per_month[] and _TOD_Days_since_last_leap_year[] static. Update #4338.
* score: Limit the CLOCK_REALTIME settingSebastian Huber2021-09-061-0/+9
| | | | | Limit the CLOCK_REALTIME setting to ensure that the CLOCK_REALTIME is defined for a system uptime of at least 114 years.
* score: Add _TOD_Is_valid_new_time_of_day()Sebastian Huber2021-09-061-1/+13
| | | | | | Move the TOD validation to the callers of _TOD_Set(). This avoids dead code in case only rtems_clock_set() is used in an application because rtems_clock_set() always calls _TOD_Set() with a valid time of day.
* score: Remove TOD_TICKS_PER_SECOND_method()Sebastian Huber2021-09-061-18/+2
| | | | Use _Watchdog_Ticks_per_second instead.
* score: Return status in _TOD_Adjust()Sebastian Huber2021-09-061-1/+4
|
* score: Document thread queue operationsSebastian Huber2021-09-032-9/+61
|
* score: Update priority only if necessarySebastian Huber2021-09-011-2/+2
| | | | | | In _Thread_queue_Flush_critical(), update the priority of the thread queue owner only if necessary. The scheduler update priority operation could be expensive.
* score: Remove _Thread_queue_Unblock_critical()Sebastian Huber2021-09-011-28/+6
| | | | | This function was only used in one place. Replace it with a call to _Thread_queue_Resume().
* score: Remove _Thread_queue_First_locked()Sebastian Huber2021-09-011-28/+0
| | | | | The _Thread_queue_First_locked() was only used in one place. Move the code of this inline function to this place.
* score: Fix blocking message queue receiveSebastian Huber2021-09-012-54/+25
| | | | | | | | | | | | | In order to ensure FIFO fairness across schedulers, the thread queue surrender operation must be used to dequeue a thread from the thread queue. The thread queue extract operation is intended for timeouts. Add _Thread_queue_Resume() which may be used to make extracted or surrendered threads ready again. Remove the now unused _Thread_queue_Extract_critical() function. Close #4509.
* score: Fix priority discipline handlingSebastian Huber2021-09-013-58/+56
| | | | | | | | | | | The priority queues in clustered scheduling configurations use a per scheduler priority queue rotation to ensure FIFO fairness across schedulers. This mechanism is implemented in the thread queue surrender operation. Unfortunately some semaphore and message queue directives used wrongly the thread queue extract operation. Fix this through the use of _Thread_queue_Surrender(). Update #4358.
* score: Delete unused rtems_ada_selfSebastian Huber2021-08-181-5/+0
|
* score: Make zombie registry observableSebastian Huber2021-08-181-0/+27
| | | | | | This helps to write tests for _Thread_Wait_for_execution_stop(). Rename Thread_Zombie_control in Thread_Zombie_registry.
generated by cgit v1.2.3 (git 2.25.1) at 2024-05-21 12:26:52 +0000