FIFO Queue Implementation.
More...
FIFO Queue Implementation.
◆ globus_fifo_t
Data type used in all function calls to manipulate a Globus FIFO
◆ globus_fifo_convert_to_list()
Convert the fifo into a list.
◆ globus_fifo_copy()
Make a copy of the fifo. globus_fifo_destroy() must be called the returned pointer to free memory associated with it.
◆ globus_fifo_dequeue()
dequeue the element at the front of the queue.
◆ globus_fifo_destroy()
Destroy the fifo data structure.
This function destroys the memory associate with the fifo data structure. For every call to globus_fifo_init() there must be a corresponding call to globus_fifo_destroy()
◆ globus_fifo_destroy_all()
void globus_fifo_destroy_all |
( |
globus_fifo_t * |
fifo, |
|
|
void(*)(void *) |
datum_free |
|
) |
| |
Destroy the fifo data structure.
This function destroys the memory associate with the fifo data structure. It calls datum_free() on behalf of all remaining nodes in the queue. For every call to globus_fifo_init() there must be a corresponding call to globus_fifo_destroy()
◆ globus_fifo_empty()
This function returns a boolean indicating whether or not the fifo is empty.
◆ globus_fifo_enqueue()
Add data to the back of the queue.
◆ globus_fifo_init()
Initialize the fifo structure.
This function initializes the fifo data structure. The structure must be initialized before it can be used with any other function.
◆ globus_fifo_move()
Move the queue from fifo_src pointer to fifo_dest pointer.
◆ globus_fifo_peek()
get a pointer to the element at the front of the queue.
◆ globus_fifo_remove()
void * globus_fifo_remove |
( |
globus_fifo_t * |
headp, |
|
|
void * |
datum |
|
) |
| |
|
extern |
remove datum from anywhere in the queue.
◆ globus_fifo_size()
This function returns a integer representing the number of elements in the queue.
◆ globus_fifo_tail_peek()
Get a pointer to the element at the back of the queue.