Priority Set of up to QF_MAX_ACTIVE elements. More...
#include "qf.h"
Static Public Member Functions | |
static void | QPSet_setEmpty (QPSet *const me) |
static bool | QPSet_isEmpty (QPSet const *const me) |
static bool | QPSet_notEmpty (QPSet const *const me) |
static bool | QPSet_hasElement (QPSet const *const me, uint_fast8_t const n) |
static void | QPSet_insert (QPSet *const me, uint_fast8_t const n) |
static void | QPSet_remove (QPSet *const me, uint_fast8_t const n) |
static uint_fast8_t | QPSet_findMax (QPSet const *const me) |
Public Attributes | |
QPSetBits volatile | bits [(QF_MAX_ACTIVE+31U)/32U] |
Static Private Member Functions | |
static void | QPSet_update (QPSet const *const me, QPSet *const rmc) |
static bool | QPSet_verify (QPSet const *const me, QPSet const *const rmc) |
The priority set represents the set of active objects that are ready to run and need to be considered by the scheduling algorithm. The set is capable of storing up to QF_MAX_ACTIVE priority levels, which can be configured in the rage 1..64, inclusive.
|
inlinestatic |
|
inlinestatic |
|
inlinestatic |
|
inlinestatic |
|
inlinestatic |
insert element n
into the set (n = 1..QF_MAX_ACTIVE)
|
inlinestatic |
Remove element n
from the set (n = 1U..QF_MAX_ACTIVE)
|
inlinestatic |
QPSetBits volatile QPSet::bits[(QF_MAX_ACTIVE+31U)/32U] |