|
RKH
|
Macros for tracing the event queue execution. More...
Macros | |
| #define | RKH_TR_QUE_INIT(queue_, actObj_, nElem_) |
| Initializes the previously allocated queue data structure RKH_QUEUE_T. More... | |
| #define | RKH_TR_QUE_GET(queue_, nElem_) |
| Get and remove an element from a queue. More... | |
| #define | RKH_TR_QUE_FIFO(queue_, nElem_, nMin_) |
| Puts an element on a queue in a FIFO manner. The element is queued by reference, not by copy. More... | |
| #define | RKH_TR_QUE_LIFO(queue_, nElem_, nMin_) |
| Puts an element on a queue in a LIFO manner. The element is queued by reference, not by copy. More... | |
| #define | RKH_TR_QUE_FULL(queue_) |
| Queue is full. More... | |
| #define | RKH_TR_QUE_DPT(queue_) |
| Depletes a queue. Empties the contents of the queue and eliminates all stored elements. More... | |
| #define | RKH_TR_QUE_GET_LAST(queue_) |
| Get the last element from the queue. More... | |
Macros for tracing the event queue execution.
| #define RKH_TR_QUE_INIT | ( | queue_, | |
| actObj_, | |||
| nElem_ | |||
| ) |
Initializes the previously allocated queue data structure RKH_QUEUE_T.
| [in] | queue_ | Event queue |
| [in] | actObj_ | Associated active object that receives the equeued events. |
| [in] | nElem_ | Storage size [in the units of void pointers] |
Definition at line 163 of file rkhtrc_record.h.
| #define RKH_TR_QUE_GET | ( | queue_, | |
| nElem_ | |||
| ) |
Get and remove an element from a queue.
| [in] | queue_ | Event queue |
| [in] | nElem_ | Number of elements currently in the queue |
Definition at line 181 of file rkhtrc_record.h.
| #define RKH_TR_QUE_FIFO | ( | queue_, | |
| nElem_, | |||
| nMin_ | |||
| ) |
Puts an element on a queue in a FIFO manner. The element is queued by reference, not by copy.
| [in] | queue_ | Event queue |
| [in] | nElem_ | Number of elements currently in the queue |
| [in] | nMin_ | Minimum number of free elements ever in this queue |
Definition at line 200 of file rkhtrc_record.h.
| #define RKH_TR_QUE_LIFO | ( | queue_, | |
| nElem_, | |||
| nMin_ | |||
| ) |
Puts an element on a queue in a LIFO manner. The element is queued by reference, not by copy.
| [in] | queue_ | Event queue |
| [in] | nElem_ | Number of elements currently in the queue |
| [in] | nMin_ | Minimum number of free elements ever in this queue |
Definition at line 220 of file rkhtrc_record.h.
| #define RKH_TR_QUE_FULL | ( | queue_ | ) |
Queue is full.
| [in] | queue_ | Event queue |
Definition at line 237 of file rkhtrc_record.h.
| #define RKH_TR_QUE_DPT | ( | queue_ | ) |
Depletes a queue. Empties the contents of the queue and eliminates all stored elements.
| [in] | queue_ | Event queue |
Definition at line 252 of file rkhtrc_record.h.
| #define RKH_TR_QUE_GET_LAST | ( | queue_ | ) |
Get the last element from the queue.
| [in] | queue_ | Event queue |
Definition at line 267 of file rkhtrc_record.h.