nodelist.c

upnpdom main part of upnp

///////////////////////////////////////////////////////////////////////////
//
// Copyright (c) 2000 Intel Corporation
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// * Redistributions of source code must retain the above copyright notice,
// this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above copyright notice,
// this list of conditions and the following disclaimer in the documentation
// and/or other materials provided with the distribution.
// * Neither name of Intel Corporation nor the names of its contributors
// may be used to endorse or promote products derived from this software
// without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL INTEL OR
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
// OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
//
///////////////////////////////////////////////////////////////////////////

//	$Revision: 1.1.2.8 $
//	$Date: 2004/08/16 03:17:47 $
#include "../../inc/tools/config.h"
#if EXCLUDE_DOM == 0
#include "../../inc/upnpdom/NodeList.h"

struct strNode *NodeList_item(NodeList *pNodeList, unsigned long index)
{
	unsigned int i;
	InternalList *n;
	struct strNode *ReturnNode;
//	Node ReturnNode;
	if(index > NodeList_getLength(pNodeList)-1)
	{
		ReturnNode = (struct strNode *) malloc (sizeof(struct strNode) + 1);
		Node_Node_0(ReturnNode);
		if(!ReturnNode)
		   	{DBGONLY(UpnpPrintf(UPNP_CRITICAL,DOM,__FILE__,__LINE__,"Insuffecient memory\n");)}
		ReturnNode->nact=NULL;
		ReturnNode->ownerNode=ReturnNode;
		return ReturnNode;
	}
	n=pNodeList->head;
	for(i=0; i<index && n!=NULL; ++i)
		n = n->next;
	ReturnNode = (struct strNode *) malloc (sizeof(struct strNode) + 1);
        Node_Node_0(ReturnNode);
	//ReturnNode = new Node;
	if(!ReturnNode)
	   	{DBGONLY(UpnpPrintf(UPNP_CRITICAL,DOM,__FILE__,__LINE__,"Insuffecient memory\n");)}
	ReturnNode->ownerNode=ReturnNode;
	ReturnNode->nact = n->ofWho;
	ReturnNode->nact->RefCount++;
	return ReturnNode;
}



void NodeList_addToInternalList(NodeList *pNodeList, struct strNodeAct *add)
{
	InternalList *traverse, *p;
	InternalList *na = (InternalList *) malloc (sizeof(InternalList) + 1); 
	if(!na)
	   	{DBGONLY(UpnpPrintf(UPNP_CRITICAL,DOM,__FILE__,__LINE__,"Insuffecient memory\n");)}
	
	na->next=NULL;
	na->ofWho=add;

	if(pNodeList->head==NULL)
	{
		pNodeList->head=na;
		return;
	}
	traverse=pNodeList->head;
	p=traverse;
	while(traverse !=NULL)
	{
		p=traverse;
		traverse=traverse->next;
	}
	p->next=na;
}


unsigned long NodeList_getLength(NodeList *pNodeList)
{
	InternalList *n;
	unsigned long length=0;

	n=pNodeList->head;
	for(length=0; n!=NULL; ++length, n=n->next);
	return length;
}

void NodeList_deleteNodeList(NodeList *pNodeList)
{
	free(pNodeList->ownerNodeList);
	pNodeList->head=NULL;
}
void NodeList_NodeList_0(NodeList *pNodeList)
{
        pNodeList->head=NULL;
}

void NodeList_NodeList_free(NodeList *pNodeList)
{
	InternalList *del, *prev;
	del=pNodeList->head;
	prev=del;
	while(del!=NULL)
	{
		del=del->next;
		free(prev);
		prev=del;
	}
}

#endif