|
Veritable Lasagna
An Allocator & Data Structure Library for C.
|
Include dependency graph for vl_async_queue.c:Functions | |
| void | vlAsyncQueueInit (vl_async_queue *queue, vl_uint16_t elementSize) |
| Initializes an async queue for elements of a specified size. | |
| void | vlAsyncQueueFree (vl_async_queue *queue) |
| Frees resources held by the queue but does not deallocate the queue structure. | |
| vl_async_queue * | vlAsyncQueueNew (vl_uint16_t elementSize) |
| Allocates and initializes a new async queue on the heap. | |
| void | vlAsyncQueueDelete (vl_async_queue *queue) |
| Deletes a heap-allocated queue created with vlAsyncQueueNew. | |
| void | vlAsyncQueueClear (vl_async_queue *queue) |
| Clears the queue content and resets it to its initial dummy-node state. | |
| void | vlAsyncQueueReset (vl_async_queue *queue) |
| Resets the queue, deallocating most dynamically allocated memory. | |
| void | vlAsyncQueuePushBack (vl_async_queue *queue, const void *value) |
| Pushes a new element to the end of the queue. | |
| vl_bool_t | vlAsyncQueuePopFront (vl_async_queue *queue, void *outValue) |
| Pops an element from the front of the queue. | |
| void vlAsyncQueueClear | ( | vl_async_queue * | queue | ) |
Clears the queue content and resets it to its initial dummy-node state.
| queue | Pointer to the queue. |
Here is the call graph for this function:| void vlAsyncQueueDelete | ( | vl_async_queue * | queue | ) |
Deletes a heap-allocated queue created with vlAsyncQueueNew.
queue pointer becomes invalid.NULL (due to free and vlAsyncQueueFree should be made safe or checked). Wait, vlAsyncQueueFree calls vlAsyncPoolFree which might not be safe.| queue | Pointer to the queue to be deleted. |
Here is the call graph for this function:
Here is the caller graph for this function:| void vlAsyncQueueFree | ( | vl_async_queue * | queue | ) |
Frees resources held by the queue but does not deallocate the queue structure.
queue structure remains but its contents are invalid.queue must not be NULL.| queue | Pointer to an initialized vl_async_queue. |
Here is the call graph for this function:
Here is the caller graph for this function:| void vlAsyncQueueInit | ( | vl_async_queue * | queue, |
| vl_uint16_t | elementSize | ||
| ) |
Initializes an async queue for elements of a specified size.
queue memory.vlAsyncQueueFree before its memory is reclaimed.queue instance.queue must not be NULL.queue is NULL.| queue | Pointer to an uninitialized vl_async_queue structure. |
| elementSize | Size in bytes of each element stored in the queue. |
Here is the call graph for this function:
Here is the caller graph for this function:| vl_async_queue * vlAsyncQueueNew | ( | vl_uint16_t | elementSize | ) |
Allocates and initializes a new async queue on the heap.
vl_async_queue pointer and is responsible for calling vlAsyncQueueDelete.vlAsyncQueueDelete.NULL if allocation fails.NULL if heap allocation for the queue structure or initial internal blocks fails.NULL on failure.| elementSize | Size in bytes of each element stored in the queue. |
Here is the call graph for this function:
Here is the caller graph for this function:| vl_bool_t vlAsyncQueuePopFront | ( | vl_async_queue * | queue, |
| void * | result | ||
| ) |
Pops an element from the front of the queue.
result.queue and result must not be NULL.VL_FALSE if the queue is empty.NULL.VL_TRUE if an element was popped, VL_FALSE if the queue was empty.| queue | Pointer to the queue. |
| result | Pointer to the buffer where the popped value will be written (must be elementSize bytes). |
Here is the call graph for this function:| void vlAsyncQueuePushBack | ( | vl_async_queue * | queue, |
| const void * | value | ||
| ) |
Pushes a new element to the end of the queue.
value.queue and value must not be NULL.NULL.| queue | Pointer to the queue. |
| value | Pointer to the data to enqueue (must be elementSize bytes). |
Here is the call graph for this function:
Here is the caller graph for this function:| void vlAsyncQueueReset | ( | vl_async_queue * | queue | ) |
Resets the queue, deallocating most dynamically allocated memory.
| queue | Pointer to the queue. |
Here is the call graph for this function: