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