---

GLAST/LAT > DAQ and FSW > FSW > Doxygen Index > DUMP / V0-0-2

Constituent: dump     Tag: sun-gcc

---

         

---

list_p.h File Reference

Private definitions for the linked list routines. More...

#include "list.h"

Include dependency graph for list_p.h:

This graph shows which files directly or indirectly include this file:

Data Structures
struct	LL_node_
	Definition of a list node structure. More...
Functions
LL_node *	LL_newNode (LL_node *next, unsigned int id, void *pay)
	Create a new linked-list node.
void	LL_deleteNode (LL_node *node)
	Delete a node.
void	LL_deleteNextNode (LL_node *node)
	Delete the next node.
int	LL_newNextNode (LL_node *node, unsigned int id, void *pay)
	Create a new node.
LL_node *	LL_findPrevNode (LL_node *head, unsigned int id)
	Find the previous node.

---

Detailed Description

Private definitions for the linked list routines.

Author:

James Swain & Owen Saxton

Id

list_p.h,v 1.2 2007/10/26 21:49:22 saxton Exp

---

Function Documentation

void LL_deleteNextNode (  LL_node *  handler  )

Delete the next node. This routine deletes from the linked list the node after the one pointed to. Parameters: handler  Pointer to the node on the linked list preceding the one to be deleted

void LL_deleteNode (  LL_node *  handler  )

Delete a node. This routine frees the memory allocated to t node Parameters: handler  Pointer to linked-list node to free

LL_node* LL_findPrevNode (  LL_node *  head, unsigned int  uid )

Find the previous node. This routine scans the linked list until either the last node is reached, or the one immediately preceding the specified node. Parameters: head  Pointer to the start of the list of LL handlers uid  Unique id of the node being sought Returns: Pointer to the node immediately before the one being sought or the last node of the list

int LL_newNextNode (  LL_node *  handler, unsigned int  uid, void *  pay )

Create a new node. This routine creates a new node on the linked list immediately following the one indicated Parameters: handler  Pointer to the node after which the new node is to be added uid  Unique ID pay  Pointer to the payload Return values: 0  The insertion of a new node was successful -1  The insertion of a new node failed because of a memory allocation error

LL_node* LL_newNode (  LL_node *  next, unsigned int  uid, void *  pay )

Create a new linked-list node. Parameters: next  Pointer to use as the next node for the new node uid  Unique id for this node pay  Pointer to the payload structure associated with this node Returns: Pointer to the new linked-list node, or NULL if there is memory allocation failure

---