Defines the data structure used to maintain information about the queue. More...
|Number of elements. |
|Number of elements currently in the queue. |
|Points to the free next place in the storage area. |
|Points to the next place of queued item. |
|const void **||pstart|
|Points to beginning of the queue storage area. |
|Points to the end of the queue storage area. |
|const struct RKH_SMA_T *||sma|
|Points to the associated SMA (a.k.a Active Object) that receives the enqueued events. More...|
|Minimum number of free elements ever in this queue. The nmin low-watermark provides valuable empirical data for proper sizing of the queue. |
|Performance information. This member is optional, thus it could be eliminated in compile-time with RKH_CFG_RQ_GET_INFO_EN. |
Defines the data structure used to maintain information about the queue.
The queue is a buffer-like object through which state machine applications (SMA) and ISRs send and receive messages to communicate and synchornize with data. It temporarily holds pointer to messages from a sender until the intended receiver is ready to read them.
The number of messages a queue can hold depends on its message size (pointer size) and the size of the memory area supplied during creation. To calculate the total message capacity of the queue, divide the number of bytes in each message into the total number of bytes in the supplied
The memory area for buffering messages is specified during queue creation. It can be located anywhere in the target's address space. This is an important feature because it gives the application considerable flexibility.
|const struct RKH_SMA_T* sma|