GLAST / LAT > DAQ and FSW > FSW > Doxygen Index> DUMP / dev > dump / rhel5-64
Typedefs | |
typedef struct LL_node_ | LL_node |
Forward declaration of the LL_node structure. | |
Functions | |
int | LL_registerNode (LL_node *head, unsigned int uid, void *pay) |
Create a node with a unique ID. | |
void * | LL_unregisterNode (LL_node *head, unsigned int uid) |
Remove the spcified node. | |
void * | LL_getPayload (LL_node *head, unsigned int uid) |
Get the payload corresponding to a give id. | |
int | LL_isPresent (LL_node *head, unsigned int uid) |
Check if an ID exists. |
void* LL_getPayload | ( | LL_node * | head, | |
unsigned int | uid | |||
) |
Get the payload corresponding to a give id.
head | Pointer to the start of the linked list | |
uid | Unique ID |
References LL_findPrevNode(), LL_node_::next, LL_node_::pay, and LL_node_::uid.
Referenced by DUMP_process().
int LL_isPresent | ( | LL_node * | head, | |
unsigned int | uid | |||
) |
Check if an ID exists.
This routine searches for a node with the given ID.
head | Pointer to the start of the linked list | |
uid | Unique ID |
1 | If there is a node on the list with this ID |
References LL_findPrevNode(), LL_node_::next, and LL_node_::uid.
int LL_registerNode | ( | LL_node * | head, | |
unsigned int | uid, | |||
void * | pay | |||
) |
Create a node with a unique ID.
This routine creates a node with the specified UID and payload. It is an error if a node with the ID already exists.
head | Pointer to the start of the list of LL handlers | |
uid | Unique id for this node | |
pay | Pointer to the payload. |
0 | The new node was successfully created | |
1 | The ID already existed; use replace | |
-1 | Memory allocation failed |
References LL_findPrevNode(), LL_newNextNode(), LL_node_::next, and LL_node_::uid.
Referenced by DUMP_constructAstream().
void* LL_unregisterNode | ( | LL_node * | head, | |
unsigned int | uid | |||
) |
Remove the spcified node.
This routine removes the node with the specified ID from a list, and returns its payload pointer.
head | Pointer to the start of the list of LL handlers | |
uid | Unique id for the node to remove |
References LL_deleteNextNode(), LL_findPrevNode(), LL_node_::next, LL_node_::pay, and LL_node_::uid.