summaryrefslogtreecommitdiffstats
path: root/cpukit/score/include/rtems/score/schedulerpriorityimpl.h (follow)
Commit message (Collapse)AuthorAgeFilesLines
* score: Delete Thread_Scheduler_control::nodeSebastian Huber2016-11-021-1/+1
| | | | Update #2556.
* score: Pass scheduler node to block operationSebastian Huber2016-11-021-5/+8
| | | | | | Changed for consistency with other scheduler operations. Update #2556.
* score: Add debug support to chainsSebastian Huber2016-07-221-0/+1
| | | | | | | This helps to detect * double insert, append, prepend errors, and * get from empty chain errors.
* score: Change scheduler node init and destroySebastian Huber2016-07-011-0/+7
| | | | | | Provide the scheduler node to initialize or destroy to the corresponding operations. This makes it possible to have more than one scheduler node per thread.
* score: Change Priority_Control to 64-bitSebastian Huber2016-06-241-2/+2
| | | | | | | | A 32-bit Priority_Control limits the uptime to 49 days with a 1ms clock tick in case the EDF scheduler is used. Increase it to 64-bit to enable proper operation of the EDF scheduler, Close 2173.
* score: Add thread priority to scheduler nodesSebastian Huber2016-06-221-0/+1
| | | | | | | | | | | | | | | | | | The thread priority is manifest in two independent areas. One area is the user visible thread priority along with a potential thread queue. The other is the scheduler. Currently, a thread priority update via _Thread_Change_priority() first updates the user visble thread priority and the thread queue, then the scheduler is notified if necessary. The priority is passed to the scheduler via a local variable. A generation counter ensures that the scheduler discards out-of-date priorities. This use of a local variable ties the update in these two areas close together. For later enhancements and the OMIP locking protocol implementation we need more flexibility. Add a thread priority information block to Scheduler_Node and synchronize priority value updates via a sequence lock on SMP configurations. Update #2556.
* score: Delete unused _Scheduler_Priority_compare()Sebastian Huber2016-06-221-17/+0
| | | | | By convention, thread priorities must be integers in RTEMS. Smaller values represent more important threads.
* score: _Scheduler_priority_Ready_queue_initializeSebastian Huber2016-06-141-4/+5
| | | | | Use priority maximum of scheduler instance. This avoids a potential memory corruption on SMP configurations.
* score: Fix assertionsSebastian Huber2014-07-101-1/+4
|
* score: Rename *_Node_get() to *_Thread_get_node()Sebastian Huber2014-07-081-3/+3
| | | | | | 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.
* score: Use chain nodes for ready queue supportSebastian Huber2014-06-231-24/+25
| | | | | This reduces the API to the minimum data structures to maximize the re-usability.
* score: _Scheduler_priority_Get_scheduler_info()Sebastian Huber2014-06-131-6/+0
| | | | Delete _Scheduler_priority_Get_scheduler_info().
* score: Simplify _Thread_Change_priority()Sebastian Huber2014-05-151-7/+6
| | | | | | | | | | | | | | | | | | | | | | | | 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: Add and use _Scheduler_Get_context()Sebastian Huber2014-05-141-1/+1
|
* score: _Scheduler_priority_Ready_queue_requeue()Sebastian Huber2014-05-141-22/+0
| | | | Delete unused function _Scheduler_priority_Ready_queue_requeue().
* score: Introduce scheduler nodesSebastian Huber2014-05-141-49/+63
| | | | | | | | | | | | 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.
* score: Scheduler documentationSebastian Huber2014-05-141-1/+1
|
* score: Static scheduler configurationSebastian Huber2014-04-151-15/+15
| | | | | | Do not allocate the scheduler control structures from the workspace. This is a preparation step for configuration of clustered/partitioned schedulers on SMP.
* score: Add scheduler control to scheduler opsSebastian Huber2014-04-041-8/+12
| | | | | Scheduler operations must be free of a global scheduler context to enable partitioned/clustered scheduling.
* score: Move priority bit map to scheduler instanceSebastian Huber2014-04-031-22/+44
| | | | | | 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.
* Change all references of rtems.com to rtems.org.Chris Johns2014-03-211-1/+1
|
* smp: Add Deterministic Priority SMP SchedulerSebastian Huber2013-08-201-0/+17
|
* score: _Scheduler_priority_Ready_queue_initialize()Sebastian Huber2013-08-201-10/+4
| | | | Move workspace allocation to _Scheduler_priority_Initialize().
* score: _Scheduler_priority_Ready_queue_first()Sebastian Huber2013-08-201-4/+1
| | | | Remove superfluous check since a ready thread must exist.
* score: Add _Scheduler_priority_Get_ready_queues()Sebastian Huber2013-08-201-4/+9
| | | | Add and use _Scheduler_priority_Get_ready_queues()
* score: Add _Scheduler_priority_Get_scheduler_infoSebastian Huber2013-08-201-34/+27
| | | | Add and use _Scheduler_priority_Get_scheduler_info().
* score: PR2136: Fix _Thread_Change_priority()Sebastian Huber2013-08-201-2/+10
| | | | | | | | | | | | | | | Add call to _Scheduler_Schedule() in missing path after _Thread_Set_transient() in _Thread_Change_priority(). See also sptests/spintrcritical19. Add thread parameter to _Scheduler_Schedule(). This parameter is currently unused but may be used in future SMP schedulers. Do heir selection in _Scheduler_Schedule(). Use _Scheduler_Update_heir() for this in the particular scheduler implementation. Add and use _Scheduler_Generic_block().
* score: Create object implementation headerSebastian Huber2013-07-261-0/+1
| | | | | | Move implementation specific parts of object.h and object.inl into new header file objectimpl.h. The object.h contains now only the application visible API.
* score: Create prioritybitmap implementation headerSebastian Huber2013-07-261-0/+1
| | | | | | | | Move implementation specific parts of prioritybitmap.h and prioritybitmap.inl into new header file prioritybitmapimpl.h. The prioritybitmap.h contains now only the application visible API. Move content of bitfield.h into prioritybitmapimpl.h.
* score: Create schedulerpriority impl headerSebastian Huber2013-07-261-0/+214
Move implementation specific parts of schedulerpriority.h and schedulerpriority.inl into new header file schedulerpriorityimpl.h. The schedulerpriority.h contains now only the application visible API. Add missing includes. Remove superfluous includes. Move declaration of _Priority_Bit_map to prioritybitmap.inl since this variable is used only here. Remove second declaration of _Priority_Major_bit_map.
generated by cgit v1.2.3 (git 2.25.1) at 2024-05-17 16:43:46 +0000