score/src/schedulerprioritychangepriority.c

0001 /* SPDX-License-Identifier: BSD-2-Clause */
0002
0003 /**
0004  * @file
0005  *
0006  * @ingroup RTEMSScoreSchedulerPriority
0007  *
0008  * @brief This source file contains the implementation of
0009  *   _Scheduler_priority_Update_priority().
0010  */
0011
0012 /*
0013  *  COPYRIGHT (c) 2011.
0014  *  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/schedulerpriorityimpl.h>
0043
0044 void _Scheduler_priority_Update_priority(
0045   const Scheduler_Control *scheduler,
0046   Thread_Control          *the_thread,
0047   Scheduler_Node          *node
0048 )
0049 {
0050   Scheduler_priority_Context *context;
0051   Scheduler_priority_Node    *the_node;
0052   unsigned int                new_priority;
0053   unsigned int                unmapped_priority;
0054
0055   if ( !_Thread_Is_ready( the_thread ) ) {
0056     /* Nothing to do */
0057     return;
0058   }
0059
0060   the_node = _Scheduler_priority_Node_downcast( node );
0061   new_priority = (unsigned int)
0062     _Scheduler_Node_get_priority( &the_node->Base );
0063   unmapped_priority = SCHEDULER_PRIORITY_UNMAP( new_priority );
0064
0065   if ( unmapped_priority == the_node->Ready_queue.current_priority ) {
0066     /* Nothing to do */
0067     return;
0068   }
0069
0070   context = _Scheduler_priority_Get_context( scheduler );
0071
0072   _Scheduler_priority_Ready_queue_extract(
0073     &the_thread->Object.Node,
0074     &the_node->Ready_queue,
0075     &context->Bit_map
0076   );
0077
0078   _Scheduler_priority_Ready_queue_update(
0079     &the_node->Ready_queue,
0080     unmapped_priority,
0081     &context->Bit_map,
0082     &context->Ready[ 0 ]
0083   );
0084
0085   if ( SCHEDULER_PRIORITY_IS_APPEND( new_priority ) ) {
0086     _Scheduler_priority_Ready_queue_enqueue(
0087       &the_thread->Object.Node,
0088       &the_node->Ready_queue,
0089       &context->Bit_map
0090     );
0091   } else {
0092     _Scheduler_priority_Ready_queue_enqueue_first(
0093       &the_thread->Object.Node,
0094       &the_node->Ready_queue,
0095       &context->Bit_map
0096     );
0097   }
0098
0099   _Scheduler_uniprocessor_Schedule(
0100     scheduler,
0101     _Scheduler_priority_Get_highest_ready
0102   );
0103 }