1*0a6a1f1dSLionel Sambuc /* $NetBSD: stringlist.c,v 1.14 2015/05/21 01:29:13 christos Exp $ */
22fe8fb19SBen Gras
32fe8fb19SBen Gras /*-
42fe8fb19SBen Gras * Copyright (c) 1994, 1999 The NetBSD Foundation, Inc.
52fe8fb19SBen Gras * All rights reserved.
62fe8fb19SBen Gras *
72fe8fb19SBen Gras * This code is derived from software contributed to The NetBSD Foundation
82fe8fb19SBen Gras * by Christos Zoulas.
92fe8fb19SBen Gras *
102fe8fb19SBen Gras * Redistribution and use in source and binary forms, with or without
112fe8fb19SBen Gras * modification, are permitted provided that the following conditions
122fe8fb19SBen Gras * are met:
132fe8fb19SBen Gras * 1. Redistributions of source code must retain the above copyright
142fe8fb19SBen Gras * notice, this list of conditions and the following disclaimer.
152fe8fb19SBen Gras * 2. Redistributions in binary form must reproduce the above copyright
162fe8fb19SBen Gras * notice, this list of conditions and the following disclaimer in the
172fe8fb19SBen Gras * documentation and/or other materials provided with the distribution.
182fe8fb19SBen Gras *
192fe8fb19SBen Gras * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
202fe8fb19SBen Gras * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
212fe8fb19SBen Gras * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
222fe8fb19SBen Gras * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
232fe8fb19SBen Gras * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
242fe8fb19SBen Gras * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
252fe8fb19SBen Gras * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
262fe8fb19SBen Gras * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
272fe8fb19SBen Gras * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
282fe8fb19SBen Gras * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
292fe8fb19SBen Gras * POSSIBILITY OF SUCH DAMAGE.
302fe8fb19SBen Gras */
312fe8fb19SBen Gras
322fe8fb19SBen Gras #include <sys/cdefs.h>
332fe8fb19SBen Gras #if defined(LIBC_SCCS) && !defined(lint)
34*0a6a1f1dSLionel Sambuc __RCSID("$NetBSD: stringlist.c,v 1.14 2015/05/21 01:29:13 christos Exp $");
352fe8fb19SBen Gras #endif /* LIBC_SCCS and not lint */
362fe8fb19SBen Gras
372fe8fb19SBen Gras #include "namespace.h"
382fe8fb19SBen Gras
392fe8fb19SBen Gras #include <assert.h>
402fe8fb19SBen Gras #include <err.h>
41*0a6a1f1dSLionel Sambuc #include <errno.h>
422fe8fb19SBen Gras #include <stdio.h>
432fe8fb19SBen Gras #include <stdlib.h>
442fe8fb19SBen Gras #include <string.h>
452fe8fb19SBen Gras #include <stringlist.h>
462fe8fb19SBen Gras
472fe8fb19SBen Gras #ifdef __weak_alias
__weak_alias(sl_add,_sl_add)482fe8fb19SBen Gras __weak_alias(sl_add,_sl_add)
492fe8fb19SBen Gras __weak_alias(sl_find,_sl_find)
502fe8fb19SBen Gras __weak_alias(sl_free,_sl_free)
512fe8fb19SBen Gras __weak_alias(sl_init,_sl_init)
522fe8fb19SBen Gras __weak_alias(sl_delete,_sl_delete)
532fe8fb19SBen Gras #endif
542fe8fb19SBen Gras
552fe8fb19SBen Gras #define _SL_CHUNKSIZE 20
562fe8fb19SBen Gras
572fe8fb19SBen Gras /*
582fe8fb19SBen Gras * sl_init(): Initialize a string list
592fe8fb19SBen Gras */
602fe8fb19SBen Gras StringList *
612fe8fb19SBen Gras sl_init(void)
622fe8fb19SBen Gras {
632fe8fb19SBen Gras StringList *sl;
642fe8fb19SBen Gras
652fe8fb19SBen Gras sl = malloc(sizeof(StringList));
662fe8fb19SBen Gras if (sl == NULL)
672fe8fb19SBen Gras return NULL;
682fe8fb19SBen Gras
692fe8fb19SBen Gras sl->sl_cur = 0;
702fe8fb19SBen Gras sl->sl_max = _SL_CHUNKSIZE;
71*0a6a1f1dSLionel Sambuc sl->sl_str = NULL;
72*0a6a1f1dSLionel Sambuc errno = reallocarr(&sl->sl_str, sl->sl_max, sizeof(char *));
73*0a6a1f1dSLionel Sambuc if (errno) {
742fe8fb19SBen Gras free(sl);
752fe8fb19SBen Gras sl = NULL;
762fe8fb19SBen Gras }
772fe8fb19SBen Gras return sl;
782fe8fb19SBen Gras }
792fe8fb19SBen Gras
802fe8fb19SBen Gras
812fe8fb19SBen Gras /*
822fe8fb19SBen Gras * sl_add(): Add an item to the string list
832fe8fb19SBen Gras */
842fe8fb19SBen Gras int
sl_add(StringList * sl,char * name)852fe8fb19SBen Gras sl_add(StringList *sl, char *name)
862fe8fb19SBen Gras {
872fe8fb19SBen Gras
882fe8fb19SBen Gras _DIAGASSERT(sl != NULL);
892fe8fb19SBen Gras
902fe8fb19SBen Gras if (sl->sl_cur == sl->sl_max - 1) {
91*0a6a1f1dSLionel Sambuc char **new = sl->sl_str;
922fe8fb19SBen Gras
93*0a6a1f1dSLionel Sambuc errno = reallocarr(&new, (sl->sl_max + _SL_CHUNKSIZE),
94*0a6a1f1dSLionel Sambuc sizeof(char *));
95*0a6a1f1dSLionel Sambuc if (errno)
962fe8fb19SBen Gras return -1;
972fe8fb19SBen Gras sl->sl_max += _SL_CHUNKSIZE;
982fe8fb19SBen Gras sl->sl_str = new;
992fe8fb19SBen Gras }
1002fe8fb19SBen Gras sl->sl_str[sl->sl_cur++] = name;
1012fe8fb19SBen Gras return 0;
1022fe8fb19SBen Gras }
1032fe8fb19SBen Gras
1042fe8fb19SBen Gras
1052fe8fb19SBen Gras /*
1062fe8fb19SBen Gras * sl_free(): Free a stringlist
1072fe8fb19SBen Gras */
1082fe8fb19SBen Gras void
sl_free(StringList * sl,int all)1092fe8fb19SBen Gras sl_free(StringList *sl, int all)
1102fe8fb19SBen Gras {
1112fe8fb19SBen Gras size_t i;
1122fe8fb19SBen Gras
1132fe8fb19SBen Gras if (sl == NULL)
1142fe8fb19SBen Gras return;
1152fe8fb19SBen Gras if (sl->sl_str) {
1162fe8fb19SBen Gras if (all)
1172fe8fb19SBen Gras for (i = 0; i < sl->sl_cur; i++)
1182fe8fb19SBen Gras free(sl->sl_str[i]);
1192fe8fb19SBen Gras free(sl->sl_str);
1202fe8fb19SBen Gras }
1212fe8fb19SBen Gras free(sl);
1222fe8fb19SBen Gras }
1232fe8fb19SBen Gras
1242fe8fb19SBen Gras
1252fe8fb19SBen Gras /*
1262fe8fb19SBen Gras * sl_find(): Find a name in the string list
1272fe8fb19SBen Gras */
1282fe8fb19SBen Gras char *
sl_find(StringList * sl,const char * name)1292fe8fb19SBen Gras sl_find(StringList *sl, const char *name)
1302fe8fb19SBen Gras {
1312fe8fb19SBen Gras size_t i;
1322fe8fb19SBen Gras
1332fe8fb19SBen Gras _DIAGASSERT(sl != NULL);
1342fe8fb19SBen Gras
1352fe8fb19SBen Gras for (i = 0; i < sl->sl_cur; i++)
1362fe8fb19SBen Gras if (strcmp(sl->sl_str[i], name) == 0)
1372fe8fb19SBen Gras return sl->sl_str[i];
1382fe8fb19SBen Gras
1392fe8fb19SBen Gras return NULL;
1402fe8fb19SBen Gras }
1412fe8fb19SBen Gras
1422fe8fb19SBen Gras int
sl_delete(StringList * sl,const char * name,int all)1432fe8fb19SBen Gras sl_delete(StringList *sl, const char *name, int all)
1442fe8fb19SBen Gras {
1452fe8fb19SBen Gras size_t i, j;
1462fe8fb19SBen Gras
1472fe8fb19SBen Gras for (i = 0; i < sl->sl_cur; i++)
1482fe8fb19SBen Gras if (strcmp(sl->sl_str[i], name) == 0) {
1492fe8fb19SBen Gras if (all)
1502fe8fb19SBen Gras free(sl->sl_str[i]);
1512fe8fb19SBen Gras for (j = i + 1; j < sl->sl_cur; j++)
1522fe8fb19SBen Gras sl->sl_str[j - 1] = sl->sl_str[j];
1532fe8fb19SBen Gras sl->sl_str[--sl->sl_cur] = NULL;
1542fe8fb19SBen Gras return 0;
1552fe8fb19SBen Gras }
1562fe8fb19SBen Gras return -1;
1572fe8fb19SBen Gras }
1582fe8fb19SBen Gras
159