score/src/schedulerpriorityyield.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_Yield().
0010  */
0011
0012 /*
0013  *  Copyright (C) 2010 Gedare Bloom.
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/schedulerpriorityimpl.h>
0043 #include <rtems/score/threadimpl.h>
0044
0045 void _Scheduler_priority_Yield(
0046   const Scheduler_Control *scheduler,
0047   Thread_Control          *the_thread,
0048   Scheduler_Node          *node
0049 )
0050 {
0051   Scheduler_priority_Node *the_node;
0052   Chain_Control           *ready_chain;
0053
0054   the_node = _Scheduler_priority_Node_downcast( node );
0055   ready_chain = the_node->Ready_queue.ready_chain;
0056
0057   if ( !_Chain_Has_only_one_node( ready_chain ) ) {
0058     _Chain_Extract_unprotected( &the_thread->Object.Node );
0059     _Chain_Append_unprotected( ready_chain, &the_thread->Object.Node );
0060   }
0061
0062   _Scheduler_uniprocessor_Yield(
0063     scheduler,
0064     _Scheduler_priority_Get_highest_ready
0065   );
0066 }