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