lib/shaRes.c File Reference

#include "common.h"
#include "shaRes.h"

Include dependency graph for shaRes.c:

Go to the source code of this file.

Functions
static void	shaFreeNode (struct shaResNode *node)
void	shaUnlink (struct shaResNode *node)
void	shaLink (struct shaResNode *node)
shaResNode *	shaNewNode (struct shaResList *list, char *name, void *data)
void	shaCleanup (struct shaResList *list)
void	shaInit (struct shaResList *list, void(*freeData)(void *pData))
Variables
static char const	rcsid [] = "$Id: shaRes.c,v 1.4 2003/05/06 07:33:44 kate Exp $"

---

Function Documentation

void shaCleanup

(

struct shaResList *

list

)

Definition at line 63 of file shaRes.c.

References shaResList::head, shaResNode::list, shaResNode::next, and shaFreeNode().

{
struct shaResNode *node, *next;

for (node = list->head;node != NULL;node = next)
    {
    next = node->next;
    shaFreeNode(node);
    }
list->head = NULL;
}

Here is the call graph for this function:

static void shaFreeNode

(

struct shaResNode *

node

)

[static]

Definition at line 11 of file shaRes.c.

References shaResNode::data, shaResList::freeData, freeMem(), shaResList::head, shaResNode::list, shaResNode::name, shaResNode::next, and shaResNode::prev.

Referenced by shaCleanup(), and shaUnlink().

{
struct shaResNode *next = node->next;
struct shaResNode *prev = node->prev;
struct shaResList *list = node->list;

if (next != NULL)
    next->prev = prev;
if (prev != NULL)
    prev->next = next;
else
    list->head = next;
list->freeData(node->data);
freeMem(node->name);
freeMem(node);
}        

Here is the call graph for this function:

Here is the caller graph for this function:

void shaInit	(	struct shaResList *	list,
		void(*)(void *pData)	freeData
	)

Definition at line 76 of file shaRes.c.

References shaResList::freeData, shaResList::head, and shaResNode::list.

{
list->head = NULL;
list->freeData = freeData;
}

void shaLink

(

struct shaResNode *

node

)

Definition at line 36 of file shaRes.c.

References shaResNode::links.

{
++node->links;
}

struct shaResNode* shaNewNode	(	struct shaResList *	list,
		char *	name,
		void *	data
	)			[read]

Definition at line 42 of file shaRes.c.

References cloneString(), shaResList::head, shaResNode::list, needMem(), and shaResNode::prev.

{
struct shaResNode *nn = needMem(sizeof(*nn));
struct shaResNode *head = list->head;

/* Store the goods and what list we're on, and start with one link. */
nn->list = list;
nn->data = data;
nn->links = 1;
nn->name = cloneString(name);

/* Put us at the front of the list. */
nn->next = head;
nn->prev = NULL;
if (head != NULL)
    head->prev = nn;
list->head = nn;
return nn;
}

Here is the call graph for this function:

void shaUnlink

(

struct shaResNode *

node

)

Definition at line 29 of file shaRes.c.

References shaResNode::links, and shaFreeNode().

{
if (--node->links <= 0)
    shaFreeNode(node);
}

Here is the call graph for this function:

---

Variable Documentation

char const rcsid[] = "$Id: shaRes.c,v 1.4 2003/05/06 07:33:44 kate Exp $" [static]

Definition at line 9 of file shaRes.c.

---