posix/src/psxpriorityisvalid.c

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