score/src/schedulerpriority.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_Initialize() and
0010  *   _Scheduler_priority_Node_initialize().
0011  */
0012
0013 /*
0014  *  Copyright (C) 2010 Gedare Bloom.
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/schedulerpriorityimpl.h>
0044
0045 void _Scheduler_priority_Initialize( const Scheduler_Control *scheduler )
0046 {
0047   Scheduler_priority_Context *context =
0048     _Scheduler_priority_Get_context( scheduler );
0049
0050   _Priority_bit_map_Initialize( &context->Bit_map );
0051   _Scheduler_priority_Ready_queue_initialize(
0052     &context->Ready[ 0 ],
0053     scheduler->maximum_priority
0054   );
0055 }
0056
0057 void _Scheduler_priority_Node_initialize(
0058   const Scheduler_Control *scheduler,
0059   Scheduler_Node          *node,
0060   Thread_Control          *the_thread,
0061   Priority_Control         priority
0062 )
0063 {
0064   Scheduler_priority_Context *context;
0065   Scheduler_priority_Node    *the_node;
0066
0067   _Scheduler_Node_do_initialize( scheduler, node, the_thread, priority );
0068
0069   context = _Scheduler_priority_Get_context( scheduler );
0070   the_node = _Scheduler_priority_Node_downcast( node );
0071   _Scheduler_priority_Ready_queue_update(
0072     &the_node->Ready_queue,
0073     SCHEDULER_PRIORITY_UNMAP( priority ),
0074     &context->Bit_map,
0075     &context->Ready[ 0 ]
0076   );
0077 }