globus_fifo - Man Page

typedef struct globus_fifo_s * globus_fifo_t

int globus_fifo_init (globus_fifo_t *fifo)
Initialize the fifo structure.
void globus_fifo_destroy (globus_fifo_t *fifo)
void globus_fifo_destroy_all (globus_fifo_t *fifo, void(*datum_free)(void *))
int globus_fifo_empty (const globus_fifo_t *fifo)
int globus_fifo_size (const globus_fifo_t *fifo)
int globus_fifo_enqueue (globus_fifo_t *fifo, void *datum)
globus_fifo_t * globus_fifo_copy (const globus_fifo_t *fifo)
void * globus_fifo_peek (globus_fifo_t *fifo)
void * globus_fifo_tail_peek (globus_fifo_t *fifo)
void * globus_fifo_remove (globus_fifo_t *headp, void *datum)
void * globus_fifo_dequeue (globus_fifo_t *fifo)
int globus_fifo_move (globus_fifo_t *fifo_dest, globus_fifo_t *fifo_src)
globus_list_t * globus_fifo_convert_to_list (globus_fifo_t *fifo)

Data type used in all function calls to manipulate a Globus FIFO

Convert the fifo into a list.

Make a copy of the fifo. globus_fifo_destroy() must be called the returned pointer to free memory associated with it.

dequeue the element at the front of the queue.

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()

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()

This function returns a boolean indicating whether or not the fifo is empty.

Add data to the back of the queue.

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.

Move the queue from fifo_src pointer to fifo_dest pointer.

get a pointer to the element at the front of the queue.

remove datum from anywhere in the queue.

This function returns a integer representing the number of elements in the queue.

Get a pointer to the element at the back of the queue.