source: rtems/cpukit/score/macros/rtems/score/priority.inl @ 3a4ae6c

4.104.114.84.95
Last change on this file since 3a4ae6c was 3a4ae6c, checked in by Joel Sherrill <joel.sherrill@…>, on Sep 11, 1995 at 7:35:39 PM

The word "RTEMS" almost completely removed from the core.

Configuration Table Template file added and all tests
modified to use this. All gvar.h and conftbl.h files
removed from test directories.

Configuration parameter maximum_devices added.

Core semaphore and mutex handlers added and RTEMS API Semaphore
Manager updated to reflect this.

Initialization sequence changed to invoke API specific initialization
routines. Initialization tasks table now owned by RTEMS Tasks Manager.

Added user extension for post-switch.

Utilized user extensions to implement API specific functionality
like signal dispatching.

Added extensions to the System Initialization Thread so that an
API can register a function to be invoked while the system
is being initialized. These are largely equivalent to the
pre-driver and post-driver hooks.

Added the Modules file oar-go32_p5, modified oar-go32, and modified
the file make/custom/go32.cfg to look at an environment varable which
determines what CPU model is being used.

All BSPs updated to reflect named devices and clock driver's IOCTL
used by the Shared Memory Driver. Also merged clock isr into
main file and removed ckisr.c where possible.

Updated spsize to reflect new and moved variables.

Makefiles for the executive source and include files updated to show
break down of files into Core, RTEMS API, and Neither.

Header and inline files installed into subdirectory based on whether
logically in the Core or a part of the RTEMS API.

  • Property mode set to 100644
File size: 3.2 KB
Line 
1/*  priority.inl
2 *
3 *  This file contains the macro implementation of all inlined routines
4 *  in the Priority Handler.
5 *
6 *  COPYRIGHT (c) 1989, 1990, 1991, 1992, 1993, 1994.
7 *  On-Line Applications Research Corporation (OAR).
8 *  All rights assigned to U.S. Government, 1994.
9 *
10 *  This material may be reproduced by or for the U.S. Government pursuant
11 *  to the copyright license under the clause at DFARS 252.227-7013.  This
12 *  notice must appear in all copies of this file and its derivatives.
13 *
14 *  $Id$
15 */
16
17#ifndef __PRIORITY_inl
18#define __PRIORITY_inl
19
20#include <rtems/core/bitfield.h>
21
22/*PAGE
23 *
24 *  _Priority_Handler_initialization
25 *
26 */
27
28#define _Priority_Handler_initialization() \
29  { \
30    unsigned32 index; \
31    \
32    _Priority_Major_bit_map = 0; \
33    for ( index=0 ; index <16 ; index++ ) \
34       _Priority_Bit_map[ index ] = 0; \
35  }
36
37/*PAGE
38 *
39 *  _Priority_Is_valid
40 *
41 */
42
43  /*
44   *  Since PRIORITY_MINIMUM is 0 and priorities are stored unsigned,
45   *  then checking for less than 0 is unnecessary.
46   */
47
48#define _Priority_Is_valid( _the_priority ) \
49  (  (_the_priority) <= PRIORITY_MAXIMUM )
50
51/*PAGE
52 *
53 *  _Priority_Major
54 *
55 */
56
57#define _Priority_Major( _the_priority ) ( (_the_priority) / 16 )
58
59/*PAGE
60 *
61 *  _Priority_Minor
62 *
63 */
64
65#define _Priority_Minor( _the_priority ) ( (_the_priority) % 16 )
66
67/*PAGE
68 *
69 *  _Priority_Add_to_bit_map
70 *
71 */
72
73#define _Priority_Add_to_bit_map( _the_priority_map ) \
74   { \
75     *(_the_priority_map)->minor |= (_the_priority_map)->ready_minor; \
76     _Priority_Major_bit_map     |= (_the_priority_map)->ready_major; \
77   }
78
79/*PAGE
80 *
81 *  _Priority_Remove_from_bit_map
82 *
83 */
84
85#define _Priority_Remove_from_bit_map( _the_priority_map ) \
86   { \
87     *(_the_priority_map)->minor &= (_the_priority_map)->block_minor; \
88     if ( *(_the_priority_map)->minor == 0 ) \
89       _Priority_Major_bit_map &= (_the_priority_map)->block_major; \
90   }
91
92/*PAGE
93 *
94 *  _Priority_Get_highest
95 *
96 */
97
98#define _Priority_Get_highest( _high_priority ) \
99  { \
100    Priority_Bit_map_control minor; \
101    Priority_Bit_map_control major; \
102    \
103    _Bitfield_Find_first_bit( _Priority_Major_bit_map, major ); \
104    _Bitfield_Find_first_bit( _Priority_Bit_map[major], minor ); \
105    \
106    (_high_priority) = (_CPU_Priority_Bits_index( major ) * 16) +  \
107                       _CPU_Priority_Bits_index( minor ); \
108  }
109
110/*PAGE
111 *
112 *  _Priority_Initialize_information
113 *
114 */
115
116#define _Priority_Initialize_information( \
117     _the_priority_map, _new_priority ) \
118  { \
119    Priority_Bit_map_control _major; \
120    Priority_Bit_map_control _minor; \
121    Priority_Bit_map_control _mask;  \
122    \
123    _major = _Priority_Major( (_new_priority) ); \
124    _minor = _Priority_Minor( (_new_priority) ); \
125    \
126    (_the_priority_map)->minor =  \
127      &_Priority_Bit_map[ _CPU_Priority_Bits_index(_major) ]; \
128    \
129    _mask = _CPU_Priority_Mask( _major ); \
130    (_the_priority_map)->ready_major = _mask; \
131    (_the_priority_map)->block_major = ~_mask; \
132    \
133    _mask = _CPU_Priority_Mask( _minor ); \
134    (_the_priority_map)->ready_minor = _mask; \
135    (_the_priority_map)->block_minor = ~_mask; \
136  }
137
138/*PAGE
139 *
140 *  _Priority_Is_group_empty
141 *
142 */
143
144#define _Priority_Is_group_empty ( _the_priority ) \
145  ( (_the_priority) == 0 )
146
147#endif
148/* end of include file */
Note: See TracBrowser for help on using the repository browser.