Data Structures | |
| struct | wsfQueue_t |
| Queue structure. More... | |
Macros | |
| #define | WSF_QUEUE_INIT(pQueue) {(pQueue)->pHead = NULL; (pQueue)->pTail = NULL;} |
| Initialize a queue. More... | |
Functions | |
| void | WsfQueueEnq (wsfQueue_t *pQueue, void *pElem) |
| Enqueue an element to the tail of a queue. More... | |
| void * | WsfQueueDeq (wsfQueue_t *pQueue) |
| Dequeue an element from the head of a queue. More... | |
| void | WsfQueuePush (wsfQueue_t *pQueue, void *pElem) |
| Push an element to the head of a queue. More... | |
| void | WsfQueueInsert (wsfQueue_t *pQueue, void *pElem, void *pPrev) |
| Insert an element into a queue. This function is typically used when iterating over a queue. More... | |
| void | WsfQueueRemove (wsfQueue_t *pQueue, void *pElem, void *pPrev) |
| Remove an element from a queue. This function is typically used when iterating over a queue. More... | |
| uint16_t | WsfQueueCount (wsfQueue_t *pQueue) |
| Count the number of elements in a queue. More... | |
| bool_t | WsfQueueEmpty (wsfQueue_t *pQueue) |
| Return TRUE if queue is empty. More... | |
| bool_t | WsfIsQueueDepthOne (wsfQueue_t *pQueue) |
| Check for a queue depth of 1 element. More... | |
| #define WSF_QUEUE_INIT | ( | pQueue | ) | {(pQueue)->pHead = NULL; (pQueue)->pTail = NULL;} |
Initialize a queue.
Definition at line 39 of file wsf_queue.h.
| bool_t WsfIsQueueDepthOne | ( | wsfQueue_t * | pQueue | ) |
Check for a queue depth of 1 element.
| pQueue | Queue. |
| uint16_t WsfQueueCount | ( | wsfQueue_t * | pQueue | ) |
Count the number of elements in a queue.
| pQueue | Pointer to queue. |
| void* WsfQueueDeq | ( | wsfQueue_t * | pQueue | ) |
Dequeue an element from the head of a queue.
| pQueue | Pointer to queue. |
| bool_t WsfQueueEmpty | ( | wsfQueue_t * | pQueue | ) |
Return TRUE if queue is empty.
| pQueue | Pointer to queue. |
| void WsfQueueEnq | ( | wsfQueue_t * | pQueue, |
| void * | pElem | ||
| ) |
Enqueue an element to the tail of a queue.
| pQueue | Pointer to queue. |
| pElem | Pointer to element. |
| void WsfQueueInsert | ( | wsfQueue_t * | pQueue, |
| void * | pElem, | ||
| void * | pPrev | ||
| ) |
Insert an element into a queue. This function is typically used when iterating over a queue.
| pQueue | Pointer to queue. |
| pElem | Pointer to element to be inserted. |
| pPrev | Pointer to previous element in the queue before element to be inserted. Note: set pPrev to NULL if pElem is first element in queue. |
| void WsfQueuePush | ( | wsfQueue_t * | pQueue, |
| void * | pElem | ||
| ) |
Push an element to the head of a queue.
| pQueue | Pointer to queue. |
| pElem | Pointer to element. |
| void WsfQueueRemove | ( | wsfQueue_t * | pQueue, |
| void * | pElem, | ||
| void * | pPrev | ||
| ) |
Remove an element from a queue. This function is typically used when iterating over a queue.
| pQueue | Pointer to queue. |
| pElem | Pointer to element to be removed. |
| pPrev | Pointer to previous element in the queue before element to be removed. |