score/src/scheduleredfchangepriority.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_Update_priority().
0010  */
0011
0012 /*
0013  *  Copyright (C) 2011 Petr Benes.
0014  *  Copyright (C) 2011 On-Line Applications Research Corporation (OAR).
0015  *
0016  * Redistribution and use in source and binary forms, with or without
0017  * modification, are permitted provided that the following conditions
0018  * are met:
0019  * 1. Redistributions of source code must retain the above copyright
0020  *    notice, this list of conditions and the following disclaimer.
0021  * 2. Redistributions in binary form must reproduce the above copyright
0022  *    notice, this list of conditions and the following disclaimer in the
0023  *    documentation and/or other materials provided with the distribution.
0024  *
0025  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
0026  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
0027  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
0028  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
0029  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
0030  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
0031  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
0032  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
0033  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
0034  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
0035  * POSSIBILITY OF SUCH DAMAGE.
0036  */
0037
0038 #ifdef HAVE_CONFIG_H
0039 #include "config.h"
0040 #endif
0041
0042 #include <rtems/score/scheduleredfimpl.h>
0043
0044 void _Scheduler_EDF_Update_priority(
0045   const Scheduler_Control *scheduler,
0046   Thread_Control          *the_thread,
0047   Scheduler_Node          *node
0048 )
0049 {
0050   Scheduler_EDF_Context *context;
0051   Scheduler_EDF_Node    *the_node;
0052   Priority_Control       priority;
0053   Priority_Control       insert_priority;
0054
0055   if ( !_Thread_Is_ready( the_thread ) ) {
0056     /* Nothing to do */
0057     return;
0058   }
0059
0060   the_node = _Scheduler_EDF_Node_downcast( node );
0061   insert_priority = _Scheduler_Node_get_priority( &the_node->Base );
0062   priority = SCHEDULER_PRIORITY_PURIFY( insert_priority );
0063
0064   if ( priority == the_node->priority ) {
0065     /* Nothing to do */
0066     return;
0067   }
0068
0069   the_node->priority = priority;
0070   context = _Scheduler_EDF_Get_context( scheduler );
0071
0072   _Scheduler_EDF_Extract( context, the_node );
0073   _Scheduler_EDF_Enqueue( context, the_node, insert_priority );
0074   _Scheduler_uniprocessor_Schedule(
0075     scheduler,
0076     _Scheduler_EDF_Get_highest_ready
0077   );
0078 }