2 * collectd - src/utils_llist.c
3 * Copyright (C) 2006 Florian Forster <octo at collectd.org>
5 * Permission is hereby granted, free of charge, to any person obtaining a
6 * copy of this software and associated documentation files (the "Software"),
7 * to deal in the Software without restriction, including without limitation
8 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
9 * and/or sell copies of the Software, and to permit persons to whom the
10 * Software is furnished to do so, subject to the following conditions:
12 * The above copyright notice and this permission notice shall be included in
13 * all copies or substantial portions of the Software.
15 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
18 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
20 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
21 * DEALINGS IN THE SOFTWARE.
24 * Florian Forster <octo at collectd.org>
30 #include "utils_llist.h"
44 llist_t *llist_create(void) {
47 ret = calloc(1, sizeof(*ret));
54 void llist_destroy(llist_t *l) {
61 for (e_this = l->head; e_this != NULL; e_this = e_next) {
62 e_next = e_this->next;
63 llentry_destroy(e_this);
69 llentry_t *llentry_create(char *key, void *value) {
72 e = malloc(sizeof(*e));
82 void llentry_destroy(llentry_t *e) { free(e); }
84 void llist_append(llist_t *l, llentry_t *e) {
97 void llist_prepend(llist_t *l, llentry_t *e) {
107 void llist_remove(llist_t *l, llentry_t *e) {
110 if ((l == NULL) || (e == NULL))
114 while ((prev != NULL) && (prev->next != e))
118 prev->next = e->next;
127 int llist_size(llist_t *l) { return l ? l->size : 0; }
129 static int llist_strcmp(llentry_t *e, void *ud) {
130 if ((e == NULL) || (ud == NULL))
132 return strcmp(e->key, (const char *)ud);
135 llentry_t *llist_search(llist_t *l, const char *key) {
136 return llist_search_custom(l, llist_strcmp, (void *)key);
139 llentry_t *llist_search_custom(llist_t *l, int (*compare)(llentry_t *, void *),
148 llentry_t *next = e->next;
150 if (compare(e, user_data) == 0)
159 llentry_t *llist_head(llist_t *l) {
165 llentry_t *llist_tail(llist_t *l) {