list.c

仅作参考。 测试环境：WinXP + VC6.0+sp6 Redhat Linux AS 3 + Gcc3.x.x Solaris 10 + Gcc3

#include "../include/list.h"

void push(stack_st* stack,char* value)
{
	list_t* plist = (list_t*)malloc(sizeof(list_t) + strlen(value) + 1);
	if(plist == NULL)
	{
		printf("malloc error\n");
		return ;
	}
	plist->item = (char*)plist + sizeof(list_t);
	strcpy(plist->item,value);
	plist->next = NULL;
	if(stack->top != NULL)
	{
	    stack->top->next = plist;
	}
    plist->prev = stack->top;
	stack->top = plist;
}
list_t* pop(stack_st* stack)
{
	list_t* retvalue = stack->top;
	if(stack->top != NULL)
	{
		list_t* prevlist = (stack->top)->prev;
		if(prevlist != NULL)
		{
			prevlist->next = NULL;
		}
		if(stack->top != NULL)
		{
			stack->top->prev = NULL;
			stack->top->next = NULL;
		}
		stack->top = prevlist;
	}
	return retvalue;
}
void enqueue(queue_t* queue,char* value)
{
	list_t* plist = (list_t*)malloc(sizeof(list_t) + strlen(value) + 1);
	if(plist == NULL)
	{
		printf("malloc error\n");
		return ;
	}
	plist->item = (char*)plist + sizeof(list_t);
	strcpy(plist->item,value);
	plist->next = NULL;
	if(queue->rear != NULL)
	{
		queue->rear->next = plist;
	}
    plist->prev = queue->rear;	
	queue->rear = plist;
	if(queue->front == NULL)
	{
		queue->front = queue->rear;
	}
}
list_t* dequeue(queue_t* queue)
{
	list_t* retvalue = queue->front;
	if(queue->front != NULL)
	{
		list_t* nextlist = queue->front->next;
		if(nextlist != NULL)
		{
			nextlist->prev = NULL;
		}
		if(queue->front != NULL)
		{
			queue->front->prev = NULL;
			queue->front->next = NULL;
		}
		queue->front = nextlist;
	}
	return retvalue;
}