score/src/sched.c

0001 /* SPDX-License-Identifier: BSD-2-Clause */
0002
0003 /**
0004  * @file
0005  *
0006  * @ingroup RTEMSScoreScheduler
0007  *
0008  * @brief This source file contains the implementation of
0009  *   _Sched_Count(), _Sched_Index(), _Sched_Name_to_index(), and
0010  *   _Sched_Processor_count().
0011  */
0012
0013 /*
0014  * Copyright (c) 2015 embedded brains GmbH & Co. KG
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 <sys/lock.h>
0043
0044 #include <rtems/score/schedulerimpl.h>
0045
0046 int _Sched_Count( void )
0047 {
0048   return (int) _Scheduler_Count;
0049 }
0050
0051 int _Sched_Index( void )
0052 {
0053   Thread_Control *executing = _Thread_Get_executing();
0054
0055   return (int) _Scheduler_Get_index( _Thread_Scheduler_get_home( executing ) );
0056 }
0057
0058 int _Sched_Name_to_index( const char *name, size_t len )
0059 {
0060   uint32_t name_32 = 0;
0061   size_t i = 0;
0062
0063   while ( i < 4 && i < len ) {
0064     name_32 |= ( (uint32_t) ( (uint8_t) *name ) ) << ( ( 3 - i ) * 8 );
0065     ++name;
0066     ++i;
0067   }
0068
0069   for ( i = 0 ; i < _Scheduler_Count ; ++i ) {
0070     const Scheduler_Control *scheduler = &_Scheduler_Table[ i ];
0071
0072     if ( scheduler->name == name_32 ) {
0073       return (int) i;
0074     }
0075   }
0076
0077   return -1;
0078 }
0079
0080 int _Sched_Processor_count( int index )
0081 {
0082   size_t i = (size_t) index;
0083
0084   if ( i < _Scheduler_Count ) {
0085     return _Scheduler_Get_processor_count( &_Scheduler_Table[ i ] );
0086   } else {
0087     return 0;
0088   }
0089 }