1 /* $NetBSD: stringlist.c,v 1.15 2022/03/12 17:31:39 christos Exp $ */
2
3 /*-
4 * Copyright (c) 1994, 1999 The NetBSD Foundation, Inc.
5 * All rights reserved.
6 *
7 * This code is derived from software contributed to The NetBSD Foundation
8 * by Christos Zoulas.
9 *
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
12 * are met:
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 *
19 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
20 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
21 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
23 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
24 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
25 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
26 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
27 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
28 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29 * POSSIBILITY OF SUCH DAMAGE.
30 */
31
32 #include <sys/cdefs.h>
33 #if defined(LIBC_SCCS) && !defined(lint)
34 __RCSID("$NetBSD: stringlist.c,v 1.15 2022/03/12 17:31:39 christos Exp $");
35 #endif /* LIBC_SCCS and not lint */
36
37 #include "namespace.h"
38
39 #include <assert.h>
40 #include <err.h>
41 #include <errno.h>
42 #include <stdio.h>
43 #include <stdlib.h>
44 #include <string.h>
45 #include <stringlist.h>
46
47 #ifdef __weak_alias
__weak_alias(sl_add,_sl_add)48 __weak_alias(sl_add,_sl_add)
49 __weak_alias(sl_find,_sl_find)
50 __weak_alias(sl_free,_sl_free)
51 __weak_alias(sl_init,_sl_init)
52 __weak_alias(sl_delete,_sl_delete)
53 #endif
54
55 #define _SL_CHUNKSIZE 20
56
57 /*
58 * sl_init(): Initialize a string list
59 */
60 StringList *
61 sl_init(void)
62 {
63 StringList *sl;
64
65 sl = malloc(sizeof(StringList));
66 if (sl == NULL)
67 return NULL;
68
69 sl->sl_cur = 0;
70 sl->sl_max = _SL_CHUNKSIZE;
71 sl->sl_str = NULL;
72 errno = reallocarr(&sl->sl_str, sl->sl_max, sizeof(*sl->sl_str));
73 if (errno) {
74 int serrno = errno;
75 free(sl);
76 errno = serrno;
77 sl = NULL;
78 }
79 return sl;
80 }
81
82
83 /*
84 * sl_add(): Add an item to the string list
85 */
86 int
sl_add(StringList * sl,char * name)87 sl_add(StringList *sl, char *name)
88 {
89
90 _DIAGASSERT(sl != NULL);
91
92 if (sl->sl_cur == sl->sl_max - 1) {
93 char **new = sl->sl_str;
94
95 errno = reallocarr(&new, (sl->sl_max + _SL_CHUNKSIZE),
96 sizeof(*new));
97 if (errno)
98 return -1;
99 sl->sl_max += _SL_CHUNKSIZE;
100 sl->sl_str = new;
101 }
102 sl->sl_str[sl->sl_cur++] = name;
103 return 0;
104 }
105
106
107 /*
108 * sl_free(): Free a stringlist
109 */
110 void
sl_free(StringList * sl,int all)111 sl_free(StringList *sl, int all)
112 {
113 size_t i;
114
115 if (sl == NULL)
116 return;
117 if (sl->sl_str) {
118 if (all)
119 for (i = 0; i < sl->sl_cur; i++)
120 free(sl->sl_str[i]);
121 free(sl->sl_str);
122 }
123 free(sl);
124 }
125
126
127 /*
128 * sl_find(): Find a name in the string list
129 */
130 char *
sl_find(StringList * sl,const char * name)131 sl_find(StringList *sl, const char *name)
132 {
133 size_t i;
134
135 _DIAGASSERT(sl != NULL);
136
137 for (i = 0; i < sl->sl_cur; i++)
138 if (strcmp(sl->sl_str[i], name) == 0)
139 return sl->sl_str[i];
140
141 return NULL;
142 }
143
144 int
sl_delete(StringList * sl,const char * name,int all)145 sl_delete(StringList *sl, const char *name, int all)
146 {
147 size_t i, j;
148
149 for (i = 0; i < sl->sl_cur; i++)
150 if (strcmp(sl->sl_str[i], name) == 0) {
151 if (all)
152 free(sl->sl_str[i]);
153 for (j = i + 1; j < sl->sl_cur; j++)
154 sl->sl_str[j - 1] = sl->sl_str[j];
155 sl->sl_str[--sl->sl_cur] = NULL;
156 return 0;
157 }
158 return -1;
159 }
160
161