GLAST/LAT > DAQ and FSW > FSW > Doxygen Index > PBS / V2-10-13
Constituent: pbs     Tag: linux-gcc
#include "PBS/LI_comdefs.h"
#include "PBS/TOC_comdefs.h"
Include dependency graph for LI_protos.h:
This graph shows which files directly or indirectly include this file:
Functions | |
void | LI_append (LI_head *dst, LI_head *src) |
Appends the src list members to the dst list. | |
int | LI_disable (LI_head *list) |
Disables the dequeing of nodes from this list. | |
int | LI_enable (LI_head *list) |
Enable the dequeing of nodes from this list. | |
int | LI_enabled (const LI_head *list) |
Returns the state of the enabled flag for this list. | |
int | LI_init (LI_head *list, LI_type type) |
Initializes the list head of a singly linked list to an empty list. | |
int | LI_destroy (LI_head *list) |
Destroys the data structures associate with a list. | |
LI_node * | LI_insert (LI_head *list, LI_node *node) |
Adds a node to the tail of a previously initialized list. | |
LI_node * | LI_jam (LI_head *list, LI_node *node) |
Adds a node to the head of a previously initialized list. | |
void | LI_prepend (LI_head *dst, LI_head *src) |
Prepends the src list members to the dst list. | |
LI_node * | LI_remove (LI_head *list) |
Removes the node from the tail of a previously initialized list. An empty list returns NULL as its node. | |
LI_node * | LI_removeW (LI_head *list) |
Removes the node from the tail of a previously initialized linked list. If the list is empty, the thread of code is blocked until a node becomes available. | |
LI_node * | LI_removeW_toc (LI_head *list, const TOC *toc) |
Removes the node from the tail of a previously initialized linked list. If the list is empty, the thread of code is blocked until a node becomes available or the timeout expires. |
CVS $Id: LI_protos.h,v 1.3 2004/10/20 14:36:51 russell Exp $
Provides ability to manipulate a singly linked list in an interlocked fashion, i.e. thread safe. The actual interlock mechanism is platform dependent.
See also the inline versions of these routines which may offer increased performance at the expense of code space and modularity. The L routines provide the same functionality without the overhead/features associated with being interlocked.
|
Appends the src list members to the dst list.
|
|
Destroys the data structures associate with a list.
|
|
Disables the dequeing of nodes from this list.
|
|
Enable the dequeing of nodes from this list.
|
|
Returns the state of the enabled flag for this list.
|
|
Initializes the list head of a singly linked list to an empty list.
|
|
Adds a node to the tail of a previously initialized list.
|
|
Adds a node to the head of a previously initialized list.
|
|
Prepends the src list members to the dst list.
|
|
Removes the node from the tail of a previously initialized list. An empty list returns NULL as its node.
|
|
Removes the node from the tail of a previously initialized linked list. If the list is empty, the thread of code is blocked until a node becomes available.
|
|
Removes the node from the tail of a previously initialized linked list. If the list is empty, the thread of code is blocked until a node becomes available or the timeout expires.
|