QP/C  7.3.3
Real-Time Embedded Framework
Loading...
Searching...
No Matches
QEQueue Class Reference

Native QF Event Queue. More...

#include "qequeue.h"

Public Member Functions

void QEQueue_init (QEQueue *const me, struct QEvt const **const qSto, uint_fast16_t const qLen)
 
bool QEQueue_post (QEQueue *const me, struct QEvt const *const e, uint_fast16_t const margin, uint_fast8_t const qsId)
 
void QEQueue_postLIFO (QEQueue *const me, struct QEvt const *const e, uint_fast8_t const qsId)
 
struct QEvt const * QEQueue_get (QEQueue *const me, uint_fast8_t const qsId)
 

Static Public Member Functions

static QEQueueCtr QEQueue_getNFree (QEQueue const *const me)
 
static QEQueueCtr QEQueue_getNMin (QEQueue const *const me)
 
static bool QEQueue_isEmpty (QEQueue const *const me)
 

Private Attributes

struct QEvt const *volatile frontEvt
 
struct QEvt const ** ring
 
QEQueueCtr end
 
QEQueueCtr volatile head
 
QEQueueCtr volatile tail
 
QEQueueCtr volatile nFree
 
QEQueueCtr nMin
 

Detailed Description

Native QF Event Queue.

This class describes the native QF event queue, which can be used as the event queue for active objects, or as a simple "raw" event queue for thread-safe event passing among non-framework entities, such as ISRs, device drivers, or other third-party components.

The native QF event queue is configured by defining the macro QACTIVE_EQUEUE_TYPE as QEQueue in the specific QF port header file.

The QEQueue structure contains only data members for managing an event queue, but does not contain the storage for the queue buffer, which must be provided externally during the queue initialization.

The event queue can store only event pointers, not the whole events. The internal implementation uses the standard ring-buffer plus one external location that optimizes the queue operation for the most frequent case of empty queue.

The QEQueue structure is used with two sets of functions. One set is for the active object event queue, which might need to block the active object task when the event queue is empty and might need to unblock it when events are posted to the queue. The interface for the native active object event queue consists of the following functions: QActive_post(), QActive_postLIFO(), and QActive_get_(). Additionally the function QEQueue_init() is used to initialize the queue.

The other set of functions, uses QEQueue as a simple "raw" event queue to pass events between entities other than active objects, such as ISRs. The "raw" event queue is not capable of blocking on the get() operation, but is still thread-safe because it uses QF critical section to protect its integrity. The interface for the "raw" thread-safe queue consists of the following functions: QEQueue_post(), QEQueue_postLIFO(), and QEQueue_get(). Additionally the function QEQueue_init() is used to initialize the queue.

Most event queue operations (both the active object queues and the "raw" queues) internally use the QF critical section. You should be careful not to invoke those operations from other critical sections when nesting of critical sections is not supported.

See also
QEQueue for the description of the data members

Definition at line 66 of file qequeue.h.

Member Function Documentation

◆ QEQueue_init()

QEQueue::QEQueue_init ( QEQueue *const  me,
struct QEvt const **const  qSto,
uint_fast16_t const  qLen 
)

Initialize the native QF event queue.

Initialize the event queue by giving it the storage for the ring buffer.

Parameters
[in,out]mecurrent instance pointer (see oop)
[in]qStoan array of pointers to QEvt to serve as the ring buffer for the event queue
[in]qLenthe length of the qSto buffer (in QEvt pointers)
Note
The actual capacity of the queue is qLen + 1, because of the extra location forntEvt.
This function is also used to initialize the event queues of active objects in the built-int QV and QK kernels, as well as other QP ports to OSes/RTOSes that do provide a suitable message queue.

◆ QEQueue_post()

QEQueue::QEQueue_post ( QEQueue *const  me,
struct QEvt const *const  e,
uint_fast16_t const  margin,
uint_fast8_t const  qsId 
)

Post an event to the "raw" thread-safe event queue (FIFO).

Post an event to the "raw" thread-safe event queue using the First-In-First-Out (FIFO) order.

Parameters
[in,out]mecurrent instance pointer (see oop)
[in]epointer to the event to be posted to the queue
[in]marginnumber of required free slots in the queue after posting the event. The special value QF_NO_MARGIN means that this function will assert if posting
[in]qsIdQS-id of this state machine (for QS local filter)
Returns
'true' (success) when the posting succeeded with the provided margin and 'false' (failure) when the posting fails.
Precondition qf_qeq:200
  • event must be valid
Note
The QF_NO_MARGIN value of the margin parameter is special and denotes situation when the post() operation is assumed to succeed (event delivery guarantee). An assertion fires, when the event cannot be delivered in this case.
This function can be called from any task context or ISR context.
See also
QEQueue_postLIFO(), QEQueue_get()

Definition at line 87 of file qf_qeq.c.

◆ QEQueue_postLIFO()

QEQueue::QEQueue_postLIFO ( QEQueue *const  me,
struct QEvt const *const  e,
uint_fast8_t const  qsId 
)

Post an event to the "raw" thread-safe event queue (LIFO).

Post an event to the "raw" thread-safe event queue using the Last-In-First-Out (LIFO) order.

Parameters
[in,out]mecurrent instance pointer (see oop)
[in]epointer to the event to be posted to the queue
[in]qsIdQS-id of this state machine (for QS local filter)
Precondition qf_qeq:300
  • the queue must be able to accept the event (cannot overflow)
Attention
The LIFO policy should be used only with great caution, because it alters the order of events in the queue.
Note
This function can be called from any task context or ISR context.
this function is used for the "raw" thread-safe queues and not for the queues of active objects.
See also
QEQueue_post(), QEQueue_get(), QActive_defer()

Definition at line 167 of file qf_qeq.c.

◆ QEQueue_get()

QEQueue::QEQueue_get ( QEQueue *const  me,
uint_fast8_t const  qsId 
)

Obtain an event from the "raw" thread-safe queue.

Retrieves an event from the front of the "raw" thread-safe queue and returns a pointer to this event to the caller.

Parameters
[in,out]mecurrent instance pointer (see oop)
[in]qsIdQS-id of this state machine (for QS local filter)
Returns
pointer to event at the front of the queue, if the queue is not empty and NULL if the queue is empty.
Note
This function is used for the "raw" thread-safe queues and not for the queues of active objects.
See also
QEQueue_post(), QEQueue_postLIFO(), QActive_recall()

Definition at line 219 of file qf_qeq.c.

◆ QEQueue_getNFree()

QEQueue::QEQueue_getNFree ( QEQueue const *const  me)
inlinestatic

Obtain the number of free entries still available in the queue.

This operation needs to be used with caution because the number of free entries can change unexpectedly. The main intent for using this operation is in conjunction with event deferral. In this case the queue is accessed only from a single thread (by a single AO), so the number of free entries cannot change unexpectedly.

Parameters
[in]mecurrent instance pointer (see oop)
Returns
the current number of free slots in the queue.

Definition at line 117 of file qequeue.h.

◆ QEQueue_getNMin()

QEQueue::QEQueue_getNMin ( QEQueue const *const  me)
inlinestatic

Obtain the minimum number of free entries ever in the queue (a.k.a. "low-watermark").

This operation needs to be used with caution because the "low-watermark" can change unexpectedly. The main intent for using this operation is to get an idea of queue usage to size the queue adequately.

Parameters
[in]mecurrent instance pointer (see oop)
Returns
the minimum number of free entries ever in the queue since init.

Definition at line 122 of file qequeue.h.

◆ QEQueue_isEmpty()

QEQueue::QEQueue_isEmpty ( QEQueue const *const  me)
inlinestatic

Find out if the queue is empty.

This operation needs to be used with caution because the queue status can change unexpectedly. The main intent for using this operation is in conjunction with event deferral. In this case the queue is accessed only from a single thread (by a single AO), so no other entity can post events to the queue.

Parameters
[in,out]mecurrent instance pointer (see oop)
Returns
'true' if the queue is current empty and 'false' otherwise.

Definition at line 127 of file qequeue.h.

Member Data Documentation

◆ frontEvt

QEQueue::frontEvt
private

Pointer to event at the front of the queue.

All incoming and outgoing events pass through the frontEvt location. When the queue is empty (which is most of the time), the extra frontEvt location allows to bypass the ring buffer altogether, greatly optimizing the performance of the queue. Only bursts of events engage the ring buffer.

The additional role of this attribute is to indicate the empty status of the queue. The queue is empty when frontEvt is NULL.

Definition at line 70 of file qequeue.h.

◆ ring

QEQueue::ring
private

Pointer to the start of the ring buffer

Definition at line 73 of file qequeue.h.

◆ end

QEQueue::end
private

Offset of the end of the ring buffer from the start of the buffer

Definition at line 76 of file qequeue.h.

◆ head

QEQueue::head
private

Offset to where next event will be inserted into the buffer

Definition at line 79 of file qequeue.h.

◆ tail

QEQueue::tail
private

Offset of where next event will be extracted from the buffer

Definition at line 82 of file qequeue.h.

◆ nFree

QEQueue::nFree
private

Number of free events in the ring buffer

Definition at line 85 of file qequeue.h.

◆ nMin

QEQueue::nMin
private

Minimum number of free events ever in the ring buffer.

This attribute remembers the low-watermark of the ring buffer, which provides a valuable information for sizing event queues.

See also
QF_getQueueMargin().

Definition at line 88 of file qequeue.h.


The documentation for this class was generated from the following files: