+/* Copyright (c) 2007-2009, UNINETT AS */
+/* See LICENSE for licensing information. */
+
#include <stdlib.h>
#include <string.h>
#include "list.h"
if (!list)
return;
-
+
for (node = list->first; node; node = next) {
free(node->data);
next = node->next;
node = malloc(sizeof(struct list_node));
if (!node)
return 0;
-
+
node->next = NULL;
node->data = data;
else
list->first = node;
list->last = node;
-
+
+ list->count++;
return 1;
}
void *list_shift(struct list *list) {
struct list_node *node;
void *data;
-
- if (!list->first)
+
+ if (!list || !list->first)
return NULL;
-
+
node = list->first;
list->first = node->next;
if (!list->first)
list->last = NULL;
data = node->data;
free(node);
-
+ list->count--;
return data;
}
/* removes all entries with matching data pointer */
void list_removedata(struct list *list, void *data) {
struct list_node *node, *t;
-
+
if (!list || !list->first)
return;
while (node->data == data) {
list->first = node->next;
free(node);
+ list->count--;
node = list->first;
if (!node) {
list->last = NULL;
t = node->next;
node->next = t->next;
free(t);
+ list->count--;
if (!node->next) { /* we removed the last one */
list->last = node;
return;
struct list_node *list_next(struct list_node *node) {
return node->next;
}
+
+/* returns number of nodes */
+uint32_t list_count(struct list *list) {
+ return list->count;
+}
+
+/* Local Variables: */
+/* c-file-style: "stroustrup" */
+/* End: */