QP native, platform-independent priority sets of 32 or 64 elements. More...
Go to the source code of this file.
Data Structures | |
struct | QPSet |
Typedefs | |
typedef uint8_t | QPSetBits |
Functions | |
uint_fast8_t | QF_LOG2 (QPSetBits x) |
static void | QPSet_setEmpty (QPSet *const me) |
static bool | QPSet_isEmpty (QPSet *const me) |
static bool | QPSet_notEmpty (QPSet *const me) |
static bool | QPSet_hasElement (QPSet *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 me) |
Definition in file qpset.h.
struct QPSet |
Priority Set of up to 32 elements 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 32 priority levels.
Data Fields | ||
---|---|---|
QPSetBits volatile | bits |
bitmask with a bit for each element |
uint_fast8_t QF_LOG2 | ( | QPSetBits | x | ) |
|
inlinestatic |
|
inlinestatic |
|
inlinestatic |
|
inlinestatic |
|
inlinestatic |
|
inlinestatic |