xref: /netbsd-src/lib/libc/gen/stringlist.c (revision b5677b36047b601b9addaaa494a58ceae82c2a6c)
1 /*	$NetBSD: stringlist.c,v 1.13 2008/04/28 20:22:59 martin 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.13 2008/04/28 20:22:59 martin Exp $");
35 #endif /* LIBC_SCCS and not lint */
36 
37 #include "namespace.h"
38 
39 #include <assert.h>
40 #include <err.h>
41 #include <stdio.h>
42 #include <stdlib.h>
43 #include <string.h>
44 #include <stringlist.h>
45 
46 #ifdef __weak_alias
47 __weak_alias(sl_add,_sl_add)
48 __weak_alias(sl_find,_sl_find)
49 __weak_alias(sl_free,_sl_free)
50 __weak_alias(sl_init,_sl_init)
51 __weak_alias(sl_delete,_sl_delete)
52 #endif
53 
54 #define _SL_CHUNKSIZE	20
55 
56 /*
57  * sl_init(): Initialize a string list
58  */
59 StringList *
60 sl_init(void)
61 {
62 	StringList *sl;
63 
64 	sl = malloc(sizeof(StringList));
65 	if (sl == NULL)
66 		return NULL;
67 
68 	sl->sl_cur = 0;
69 	sl->sl_max = _SL_CHUNKSIZE;
70 	sl->sl_str = malloc(sl->sl_max * sizeof(char *));
71 	if (sl->sl_str == NULL) {
72 		free(sl);
73 		sl = NULL;
74 	}
75 	return sl;
76 }
77 
78 
79 /*
80  * sl_add(): Add an item to the string list
81  */
82 int
83 sl_add(StringList *sl, char *name)
84 {
85 
86 	_DIAGASSERT(sl != NULL);
87 
88 	if (sl->sl_cur == sl->sl_max - 1) {
89 		char	**new;
90 
91 		new = realloc(sl->sl_str,
92 		    (sl->sl_max + _SL_CHUNKSIZE) * sizeof(char *));
93 		if (new == NULL)
94 			return -1;
95 		sl->sl_max += _SL_CHUNKSIZE;
96 		sl->sl_str = new;
97 	}
98 	sl->sl_str[sl->sl_cur++] = name;
99 	return 0;
100 }
101 
102 
103 /*
104  * sl_free(): Free a stringlist
105  */
106 void
107 sl_free(StringList *sl, int all)
108 {
109 	size_t i;
110 
111 	if (sl == NULL)
112 		return;
113 	if (sl->sl_str) {
114 		if (all)
115 			for (i = 0; i < sl->sl_cur; i++)
116 				free(sl->sl_str[i]);
117 		free(sl->sl_str);
118 	}
119 	free(sl);
120 }
121 
122 
123 /*
124  * sl_find(): Find a name in the string list
125  */
126 char *
127 sl_find(StringList *sl, const char *name)
128 {
129 	size_t i;
130 
131 	_DIAGASSERT(sl != NULL);
132 
133 	for (i = 0; i < sl->sl_cur; i++)
134 		if (strcmp(sl->sl_str[i], name) == 0)
135 			return sl->sl_str[i];
136 
137 	return NULL;
138 }
139 
140 int
141 sl_delete(StringList *sl, const char *name, int all)
142 {
143 	size_t i, j;
144 
145 	for (i = 0; i < sl->sl_cur; i++)
146 		if (strcmp(sl->sl_str[i], name) == 0) {
147 			if (all)
148 				free(sl->sl_str[i]);
149 			for (j = i + 1; j < sl->sl_cur; j++)
150 				sl->sl_str[j - 1] = sl->sl_str[j];
151 			sl->sl_str[--sl->sl_cur] = NULL;
152 			return 0;
153 		}
154 	return -1;
155 }
156 
157