1 /* $NetBSD: stringlist.c,v 1.14 2015/05/21 01:29:13 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.14 2015/05/21 01:29:13 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(char *));
73 if (errno) {
74 free(sl);
75 sl = NULL;
76 }
77 return sl;
78 }
79
80
81 /*
82 * sl_add(): Add an item to the string list
83 */
84 int
sl_add(StringList * sl,char * name)85 sl_add(StringList *sl, char *name)
86 {
87
88 _DIAGASSERT(sl != NULL);
89
90 if (sl->sl_cur == sl->sl_max - 1) {
91 char **new = sl->sl_str;
92
93 errno = reallocarr(&new, (sl->sl_max + _SL_CHUNKSIZE),
94 sizeof(char *));
95 if (errno)
96 return -1;
97 sl->sl_max += _SL_CHUNKSIZE;
98 sl->sl_str = new;
99 }
100 sl->sl_str[sl->sl_cur++] = name;
101 return 0;
102 }
103
104
105 /*
106 * sl_free(): Free a stringlist
107 */
108 void
sl_free(StringList * sl,int all)109 sl_free(StringList *sl, int all)
110 {
111 size_t i;
112
113 if (sl == NULL)
114 return;
115 if (sl->sl_str) {
116 if (all)
117 for (i = 0; i < sl->sl_cur; i++)
118 free(sl->sl_str[i]);
119 free(sl->sl_str);
120 }
121 free(sl);
122 }
123
124
125 /*
126 * sl_find(): Find a name in the string list
127 */
128 char *
sl_find(StringList * sl,const char * name)129 sl_find(StringList *sl, const char *name)
130 {
131 size_t i;
132
133 _DIAGASSERT(sl != NULL);
134
135 for (i = 0; i < sl->sl_cur; i++)
136 if (strcmp(sl->sl_str[i], name) == 0)
137 return sl->sl_str[i];
138
139 return NULL;
140 }
141
142 int
sl_delete(StringList * sl,const char * name,int all)143 sl_delete(StringList *sl, const char *name, int all)
144 {
145 size_t i, j;
146
147 for (i = 0; i < sl->sl_cur; i++)
148 if (strcmp(sl->sl_str[i], name) == 0) {
149 if (all)
150 free(sl->sl_str[i]);
151 for (j = i + 1; j < sl->sl_cur; j++)
152 sl->sl_str[j - 1] = sl->sl_str[j];
153 sl->sl_str[--sl->sl_cur] = NULL;
154 return 0;
155 }
156 return -1;
157 }
158
159