Important changes to repositories hosted on mbed.com
Mbed hosted mercurial repositories are deprecated and are due to be permanently deleted in July 2026.
To keep a copy of this software download the repository Zip archive or clone locally using Mercurial.
It is also possible to export all your personal repositories from the account settings page.
Dependents: qp_hangman qp_dpp qp_blinky
QPSet64 Class Reference
Priority Set of up to 64 elements for building various schedulers, but also useful as a general set of up to 64 elements of any kind. More...
#include <qp.h>
Public Member Functions | |
| bool | isEmpty (void) const |
| the function evaluates to TRUE if the set is empty, which means that no active objects are ready to run. | |
| bool | notEmpty (void) const |
| the function evaluates to TRUE if the set has elements, which means that some active objects are ready to run. | |
| bool | hasElement (uint8_t const n) const |
| the function evaluates to TRUE if the priority set has the element n. | |
| void | insert (uint8_t const n) |
| insert element n into the set, n = 1..64 | |
| void | remove (uint8_t const n) |
| remove element n from the set, n = 1..64 | |
| uint8_t | findMax (void) const |
| find the maximum element in the set, | |
Detailed Description
Priority Set of up to 64 elements for building various schedulers, but also useful as a general set of up to 64 elements of any kind.
The priority set represents the set of active objects that are ready to run and need to be considered by scheduling processing. The set is capable of storing up to 64 priority levels.
The priority set allows to build cooperative multitasking schedulers to manage up to 64 tasks. It is also used in the Quantum Kernel (QK) preemptive scheduler.
The inherited 8-bit set is used as the 8-elemtn set of of 8-bit subsets Each bit in the super.bits set represents a subset (8-elements) as follows:
bit 0 in this->m_bits is 1 when subset[0] is not empty
bit 1 in this->m_bits is 1 when subset[1] is not empty
bit 2 in this->m_bits is 1 when subset[2] is not empty
bit 3 in this->m_bits is 1 when subset[3] is not empty
bit 4 in this->m_bits is 1 when subset[4] is not empty
bit 5 in this->m_bits is 1 when subset[5] is not empty
bit 6 in this->m_bits is 1 when subset[6] is not empty
bit 7 in this->m_bits is 1 when subset[7] is not empty
Definition at line 1026 of file qp.h.
Member Function Documentation
| uint8_t findMax | ( | void | ) | const |
| bool hasElement | ( | uint8_t const | n ) | const |
| void insert | ( | uint8_t const | n ) |
| bool isEmpty | ( | void | ) | const |
| bool notEmpty | ( | void | ) | const |
Generated on Wed Jul 13 2022 11:50:18 by
1.7.2