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
130
131
132
133
134
135
136
137
138
139
140
141
142
143
|
/*
* librc-strlist.h
* String list functions to make using queue(3) a little easier.
*/
/*
* Copyright (c) 2007-2015 The OpenRC Authors.
* See the Authors file at the top-level directory of this distribution and
* https://github.com/OpenRC/openrc/blob/HEAD/AUTHORS
*
* This file is part of OpenRC. It is subject to the license terms in
* the LICENSE file found in the top-level directory of this
* distribution and at https://github.com/OpenRC/openrc/blob/HEAD/LICENSE
* This file may not be copied, modified, propagated, or distributed
* except according to the terms contained in the LICENSE file.
*/
#include "queue.h"
#include "librc.h"
RC_STRINGLIST *
rc_stringlist_new(void)
{
RC_STRINGLIST *l = xmalloc(sizeof(*l));
TAILQ_INIT(l);
return l;
}
RC_STRING *
rc_stringlist_add(RC_STRINGLIST *list, const char *value)
{
RC_STRING *s = xmalloc(sizeof(*s));
s->value = xstrdup(value);
TAILQ_INSERT_TAIL(list, s, entries);
return s;
}
RC_STRING *
rc_stringlist_addu(RC_STRINGLIST *list, const char *value)
{
RC_STRING *s;
TAILQ_FOREACH(s, list, entries)
if (strcmp(s->value, value) == 0) {
errno = EEXIST;
return NULL;
}
return rc_stringlist_add(list, value);
}
bool
rc_stringlist_delete(RC_STRINGLIST *list, const char *value)
{
RC_STRING *s;
TAILQ_FOREACH(s, list, entries)
if (strcmp(s->value, value) == 0) {
TAILQ_REMOVE(list, s, entries);
free(s->value);
free(s);
return true;
}
errno = EEXIST;
return false;
}
RC_STRING *
rc_stringlist_find(RC_STRINGLIST *list, const char *value)
{
RC_STRING *s;
if (list) {
TAILQ_FOREACH(s, list, entries)
if (strcmp(s->value, value) == 0)
return s;
}
return NULL;
}
RC_STRINGLIST *
rc_stringlist_split(const char *value, const char *sep)
{
RC_STRINGLIST *list = rc_stringlist_new();
char *d = xstrdup(value);
char *p = d, *token;
while ((token = strsep(&p, sep)))
rc_stringlist_add(list, token);
free(d);
return list;
}
void
rc_stringlist_sort(RC_STRINGLIST **list)
{
RC_STRINGLIST *l = *list;
RC_STRINGLIST *new = rc_stringlist_new();
RC_STRING *s;
RC_STRING *sn;
RC_STRING *n;
RC_STRING *last;
TAILQ_FOREACH_SAFE(s, l, entries, sn) {
TAILQ_REMOVE(l, s, entries);
last = NULL;
TAILQ_FOREACH(n, new, entries) {
if (strcmp(s->value, n->value) < 0)
break;
last = n;
}
if (last)
TAILQ_INSERT_AFTER(new, last, s, entries);
else
TAILQ_INSERT_HEAD(new, s, entries);
}
/* Now we've sorted the list, copy across the new head */
free(l);
*list = new;
}
void
rc_stringlist_free(RC_STRINGLIST *list)
{
RC_STRING *s1;
RC_STRING *s2;
if (!list)
return;
s1 = TAILQ_FIRST(list);
while (s1) {
s2 = TAILQ_NEXT(s1, entries);
free(s1->value);
free(s1);
s1 = s2;
}
free(list);
}
|
