1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
|
/*
*
* BlueZ - Bluetooth protocol stack for Linux
*
* Copyright (C) 2004-2006 Marcel Holtmann <marcel@holtmann.org>
* Copyright (C) 2005-2006 Johan Hedberg <johan.hedberg@nokia.com>
*
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*
*/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include <stdio.h>
#include <errno.h>
#include <malloc.h>
#include "list.h"
struct slist *slist_append(struct slist *list, void *data)
{
struct slist *entry, *tail;
entry = malloc(sizeof(struct slist));
/* FIXME: this currently just silently fails */
if (!entry)
return list;
entry->data = data;
entry->next = NULL;
if (!list)
return entry;
/* Find the end of the list */
for (tail = list; tail->next; tail = tail->next);
tail->next = entry;
return list;
}
struct slist *slist_remove(struct slist *list, void *data)
{
struct slist *l, *next, *prev = NULL, *match = NULL;
if (!list)
return NULL;
for (l = list; l != NULL; l = l->next) {
if (l->data == data) {
match = l;
break;
}
prev = l;
}
if (!match)
return list;
next = match->next;
free(match);
/* If the head was removed, return the next element */
if (!prev)
return next;
prev->next = next;
return list;
}
struct slist *slist_find(struct slist *list, const void *data,
cmp_func_t cmp_func)
{
struct slist *l;
for (l = list; l != NULL; l = l->next) {
if (!cmp_func(l->data, data))
return l;
}
return NULL;
}
int slist_length(struct slist *list)
{
int len;
for (len = 0; list != NULL; list = list->next)
len++;
return len;
}
void slist_foreach(struct slist *list, slist_func_t func, void *user_data)
{
while (list) {
struct slist *next = list->next;
func(list->data, user_data);
list = next;
}
}
void slist_free(struct slist *list)
{
struct slist *l, *next;
for (l = list; l != NULL; l = next) {
next = l->next;
free(l);
}
}
|
