score/src/scheduleredfreleasejob.c

0001 /* SPDX-License-Identifier: BSD-2-Clause */
0002
0003 /**
0004  * @file
0005  *
0006  * @ingroup RTEMSScoreSchedulerEDF
0007  *
0008  * @brief This source file contains the implementation of
0009  *   _Scheduler_EDF_Map_priority(), _Scheduler_EDF_Unmap_priority(),
0010  *   _Scheduler_EDF_Release_job(), and _Scheduler_EDF_Cancel_job().
0011  */
0012
0013 /*
0014  *  Copyright (C) 2011 Petr Benes.
0015  *  Copyright (C) 2011 On-Line Applications Research Corporation (OAR).
0016  *
0017  * Redistribution and use in source and binary forms, with or without
0018  * modification, are permitted provided that the following conditions
0019  * are met:
0020  * 1. Redistributions of source code must retain the above copyright
0021  *    notice, this list of conditions and the following disclaimer.
0022  * 2. Redistributions in binary form must reproduce the above copyright
0023  *    notice, this list of conditions and the following disclaimer in the
0024  *    documentation and/or other materials provided with the distribution.
0025  *
0026  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
0027  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
0028  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
0029  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
0030  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
0031  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
0032  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
0033  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
0034  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
0035  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
0036  * POSSIBILITY OF SUCH DAMAGE.
0037  */
0038
0039 #ifdef HAVE_CONFIG_H
0040 #include "config.h"
0041 #endif
0042
0043 #include <rtems/score/scheduleredfimpl.h>
0044
0045 Priority_Control _Scheduler_EDF_Map_priority(
0046   const Scheduler_Control *scheduler,
0047   Priority_Control         priority
0048 )
0049 {
0050   return SCHEDULER_EDF_PRIO_MSB | SCHEDULER_PRIORITY_MAP( priority );
0051 }
0052
0053 Priority_Control _Scheduler_EDF_Unmap_priority(
0054   const Scheduler_Control *scheduler,
0055   Priority_Control         priority
0056 )
0057 {
0058   return SCHEDULER_PRIORITY_UNMAP( priority & ~SCHEDULER_EDF_PRIO_MSB );
0059 }
0060
0061 void _Scheduler_EDF_Release_job(
0062   const Scheduler_Control *scheduler,
0063   Thread_Control          *the_thread,
0064   Priority_Node           *priority_node,
0065   uint64_t                 deadline,
0066   Thread_queue_Context    *queue_context
0067 )
0068 {
0069   (void) scheduler;
0070
0071   _Thread_Wait_acquire_critical( the_thread, queue_context );
0072
0073   /*
0074    * There is no integer overflow problem here due to the
0075    * SCHEDULER_PRIORITY_MAP().  The deadline is in clock ticks.  With the
0076    * minimum clock tick interval of 1us, the uptime is limited to about 146235
0077    * years.
0078    */
0079   _Priority_Node_set_priority(
0080     priority_node,
0081     SCHEDULER_PRIORITY_MAP( deadline )
0082   );
0083
0084   if ( _Priority_Node_is_active( priority_node ) ) {
0085     _Thread_Priority_changed(
0086       the_thread,
0087       priority_node,
0088       PRIORITY_GROUP_LAST,
0089       queue_context
0090     );
0091   } else {
0092     _Thread_Priority_add( the_thread, priority_node, queue_context );
0093   }
0094
0095   _Thread_Wait_release_critical( the_thread, queue_context );
0096 }
0097
0098 void _Scheduler_EDF_Cancel_job(
0099   const Scheduler_Control *scheduler,
0100   Thread_Control          *the_thread,
0101   Priority_Node           *priority_node,
0102   Thread_queue_Context    *queue_context
0103 )
0104 {
0105   (void) scheduler;
0106
0107   _Thread_Wait_acquire_critical( the_thread, queue_context );
0108
0109   if ( _Priority_Node_is_active( priority_node ) ) {
0110     _Thread_Priority_remove( the_thread, priority_node, queue_context );
0111     _Priority_Node_set_inactive( priority_node );
0112   }
0113
0114   _Thread_Wait_release_critical( the_thread, queue_context );
0115 }