-/*
- * Copyright (C) 2006-2009 Stig Venaas <venaas@uninett.no>
- *
- * Permission to use, copy, modify, and distribute this software for any
- * purpose with or without fee is hereby granted, provided that the above
- * copyright notice and this permission notice appear in all copies.
- */
+/* Copyright (c) 2006-2010, UNINETT AS
+ * Copyright (c) 2010-2012, NORDUnet A/S */
+/* See LICENSE for licensing information. */
#include <stdlib.h>
#include <string.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;
void *list_shift(struct list *list) {
struct list_node *node;
void *data;
-
+
if (!list || !list->first)
return NULL;
-
+
node = list->first;
list->first = node->next;
if (!list->first)
/* 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;
uint32_t list_count(struct list *list) {
return list->count;
}
+
+/* Local Variables: */
+/* c-file-style: "stroustrup" */
+/* End: */