rtems/src/schedulermapfromposix.c

0001 /* SPDX-License-Identifier: BSD-2-Clause */
0002
0003 /**
0004  * @file
0005  *
0006  * @ingroup RTEMSImplClassicScheduler
0007  *
0008  * @brief This source file contains the implementation of
0009  *   rtems_scheduler_map_priority_from_posix().
0010  */
0011
0012 /*
0013  * Copyright (C) 2020 embedded brains GmbH & Co. KG
0014  *
0015  * Redistribution and use in source and binary forms, with or without
0016  * modification, are permitted provided that the following conditions
0017  * are met:
0018  * 1. Redistributions of source code must retain the above copyright
0019  *    notice, this list of conditions and the following disclaimer.
0020  * 2. Redistributions in binary form must reproduce the above copyright
0021  *    notice, this list of conditions and the following disclaimer in the
0022  *    documentation and/or other materials provided with the distribution.
0023  *
0024  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
0025  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
0026  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
0027  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
0028  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
0029  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
0030  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
0031  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
0032  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
0033  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
0034  * POSSIBILITY OF SUCH DAMAGE.
0035  */
0036
0037 #ifdef HAVE_CONFIG_H
0038 #include "config.h"
0039 #endif
0040
0041 #include <rtems/rtems/scheduler.h>
0042 #include <rtems/score/schedulerimpl.h>
0043
0044 rtems_status_code rtems_scheduler_map_priority_from_posix(
0045   rtems_id             scheduler_id,
0046   int                  posix_priority,
0047   rtems_task_priority *priority
0048 )
0049 {
0050   const Scheduler_Control *scheduler;
0051
0052   if ( priority == NULL ) {
0053     return RTEMS_INVALID_ADDRESS;
0054   }
0055
0056   scheduler = _Scheduler_Get_by_id( scheduler_id );
0057   if ( scheduler == NULL ) {
0058     return RTEMS_INVALID_ID;
0059   }
0060
0061   if ( posix_priority < 1 ) {
0062     return RTEMS_INVALID_PRIORITY;
0063   }
0064
0065   if ( posix_priority >= scheduler->maximum_priority ) {
0066     return RTEMS_INVALID_PRIORITY;
0067   }
0068
0069   *priority = scheduler->maximum_priority - (Priority_Control) posix_priority;
0070   return RTEMS_SUCCESSFUL;
0071 }