clist.c

/* clist.c */
#include <stdlib.h>
#include <string.h>

#include "clist.h"

/* clist_init */
void clist_init(CList *list, void (*destroy)(void *data)){
	/* Initialize the list. */
	list->size = 0;
	list->destroy = destroy;
	list->head = NULL;

	return;
}

/* clist_destroy */
void clist_destroy(CList *list){
	void *data;

	/* Remove each element. */
	while (clist_size(list) > 0) {
		if (clist_rem_next(list, list->head, (void **)data) == 0
		    && list->destroy != NULL) {
			list->destroy(data);
		}
	}
	
	/* No operations are allowed now, but clear the structure as a precaution. */
	memset(list, 0, sizeof(CList));

	return;
}

/* clist_ins_next */
int clist_ins_next(CList *list, CListElmt *element, const void *data){
	CListElmt *new_element;

	/* Allocate storage for the element. */
	if ((new_element = (CListElmt *)malloc(sizeof(CListElmt))) == NULL) {
		return -1;
	}

	/* Insert the element into the list. */
	new_element->data = (void *)data;
	if (clist_size(list) == 0) {
		/* Handle insertion when the list is empty. */
		new_element->next = new_element;
		list->head = new_element;
	} else {
		/* Handle insertion when the list is not empty. */
		new_element->next = element->next;
		element->next = new_element;
	}

	/* Adjust the size of list to account for the inserted element. */
	list->size++;

	return 0;
}

/* clist_rem_next */
int clist_rem_next(CList *list, CListElmt *element, void **data){
	CListElmt *old_element;

	/* Don't allow removal from an empty list. */
	if (clist_size(list) == 0) {
		return -1;
	}

	/* Remove the element from the list. */
	*data = element->next->data;
	if (element->next == element) {
		/* Handle removing the last element. */
		old_element = element->next;
		list->head = NULL;
	} else {
		/* Handle removing other than the last element. */
		old_element = element->next;
		element->next = element->next->next;
		if (old_element == clist_head(list)) {
			list->head = old_element->next;
		}
	}

	/* Free the storage allocated by thr abstract datatype. */
	free(old_element);

	/* Adjust the size of the list to account for the removed element. */
	list->size--;

	return 0;
}