/** * @file * * @brief Thread Manipulation with the Priority-Based Scheduler * * This include file contains all the constants and structures associated * with the manipulation of threads for the priority-based scheduler. */ /* * Copryight (c) 2010 Gedare Bloom. * Copyright (C) 2011 On-Line Applications Research Corporation (OAR). * * The license and distribution terms for this file may be * found in the file LICENSE in this distribution or at * http://www.rtems.org/license/LICENSE. */ #ifndef _RTEMS_SCORE_SCHEDULERPRIORITY_H #define _RTEMS_SCORE_SCHEDULERPRIORITY_H #include #include #include #ifdef __cplusplus extern "C" { #endif /** * @defgroup RTEMSScoreSchedulerDPS Deterministic Priority Scheduler * * @ingroup RTEMSScoreScheduler */ /**@{*/ /** * Entry points for the Deterministic Priority Based Scheduler. */ #define SCHEDULER_PRIORITY_ENTRY_POINTS \ { \ _Scheduler_priority_Initialize, /* initialize entry point */ \ _Scheduler_priority_Schedule, /* schedule entry point */ \ _Scheduler_priority_Yield, /* yield entry point */ \ _Scheduler_priority_Block, /* block entry point */ \ _Scheduler_priority_Unblock, /* unblock entry point */ \ _Scheduler_priority_Update_priority, /* update priority entry point */ \ _Scheduler_default_Map_priority, /* map priority entry point */ \ _Scheduler_default_Unmap_priority, /* unmap priority entry point */ \ SCHEDULER_OPERATION_DEFAULT_ASK_FOR_HELP \ _Scheduler_priority_Node_initialize, /* node initialize entry point */ \ _Scheduler_default_Node_destroy, /* node destroy entry point */ \ _Scheduler_default_Release_job, /* new period of task */ \ _Scheduler_default_Cancel_job, /* cancel period of task */ \ _Scheduler_default_Tick, /* tick entry point */ \ _Scheduler_default_Start_idle /* start idle entry point */ \ SCHEDULER_OPERATION_DEFAULT_GET_SET_AFFINITY \ } typedef struct { /** * @brief Basic scheduler context. */ Scheduler_Context Base; /** * @brief Bit map to indicate non-empty ready queues. */ Priority_bit_map_Control Bit_map; /** * @brief One ready queue per priority level. */ Chain_Control Ready[ 0 ]; } Scheduler_priority_Context; /** * @brief Data for ready queue operations. */ typedef struct { /** * @brief The thread priority currently used by the scheduler. */ unsigned int current_priority; /** This field points to the Ready FIFO for this thread's priority. */ Chain_Control *ready_chain; /** This field contains precalculated priority map indices. */ Priority_bit_map_Information Priority_map; } Scheduler_priority_Ready_queue; /** * @brief Scheduler node specialization for Deterministic Priority schedulers. */ typedef struct { /** * @brief Basic scheduler node. */ Scheduler_Node Base; /** * @brief The associated ready queue of this node. */ Scheduler_priority_Ready_queue Ready_queue; } Scheduler_priority_Node; /** * @brief Initializes the priority scheduler. * This routine initializes the priority scheduler. */ void _Scheduler_priority_Initialize( const Scheduler_Control *scheduler ); void _Scheduler_priority_Block( const Scheduler_Control *scheduler, Thread_Control *the_thread, Scheduler_Node *node ); /** * @brief Sets the heir thread to be the next ready thread. * * This kernel routine sets the heir thread to be the next ready thread * by invoking the_scheduler->ready_queue->operations->first(). */ void _Scheduler_priority_Schedule( const Scheduler_Control *scheduler, Thread_Control *the_thread ); void _Scheduler_priority_Unblock( const Scheduler_Control *scheduler, Thread_Control *the_thread, Scheduler_Node *node ); void _Scheduler_priority_Update_priority( const Scheduler_Control *scheduler, Thread_Control *the_thread, Scheduler_Node *base_node ); void _Scheduler_priority_Node_initialize( const Scheduler_Control *scheduler, Scheduler_Node *node, Thread_Control *the_thread, Priority_Control priority ); void _Scheduler_priority_Yield( const Scheduler_Control *scheduler, Thread_Control *the_thread, Scheduler_Node *node ); /**@}*/ #ifdef __cplusplus } #endif #endif /* end of include file */