1 /* str-list.c: define routines for string lists.
3 Copyright 1993, 2008, 2012 Karl Berry.
4 Copyright 2001, 2005 Olaf Weber.
6 This library is free software; you can redistribute it and/or
7 modify it under the terms of the GNU Lesser General Public
8 License as published by the Free Software Foundation; either
9 version 2.1 of the License, or (at your option) any later version.
11 This library is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 Lesser General Public License for more details.
16 You should have received a copy of the GNU Lesser General Public License
17 along with this library; if not, see <http://www.gnu.org/licenses/>. */
19 #include <kpathsea/config.h>
21 #include <kpathsea/str-list.h>
24 /* See the .h file for comments. */
28 str_list_add (str_list_type *l, string s)
30 STR_LIST_LENGTH (*l)++;
31 XRETALLOC (STR_LIST (*l), STR_LIST_LENGTH (*l), string);
32 STR_LIST_LAST_ELT (*l) = s;
36 cstr_list_add (cstr_list_type *l, const_string s)
38 STR_LIST_LENGTH (*l)++;
39 XRETALLOC (STR_LIST (*l), STR_LIST_LENGTH (*l), const_string);
40 STR_LIST_LAST_ELT (*l) = s;
44 /* May as well save some reallocations and do everything in a chunk
45 instead of calling str_list_add on each element. */
48 str_list_concat (str_list_type *target, str_list_type more)
51 unsigned prev_len = STR_LIST_LENGTH (*target);
53 STR_LIST_LENGTH (*target) += STR_LIST_LENGTH (more);
54 XRETALLOC (STR_LIST (*target), STR_LIST_LENGTH (*target), string);
56 for (e = 0; e < STR_LIST_LENGTH (more); e++)
57 STR_LIST_ELT (*target, prev_len + e) = STR_LIST_ELT (more, e);
61 /* Concatenate the elements of more to each element of target. This
62 _must_ be done with the first index varying fastest. */
63 /* Note that we free the old elements of target as well. */
66 str_list_concat_elements (str_list_type *target, str_list_type more)
68 if (STR_LIST_LENGTH(more) == 0) {
70 } else if (STR_LIST_LENGTH(*target) == 0) {
72 STR_LIST_LENGTH(*target) = STR_LIST_LENGTH(more);
74 (string*)xmalloc(STR_LIST_LENGTH(more)*sizeof(char*));
75 for (i=0;i!=STR_LIST_LENGTH(more);++i) {
76 STR_LIST_ELT(*target,i)=xstrdup(STR_LIST_ELT(more,i));
83 new_list = (string*)xmalloc(STR_LIST_LENGTH (*target)
84 * STR_LIST_LENGTH (more) * sizeof(char*));
87 for (j = 0; j != STR_LIST_LENGTH(more); ++j) {
88 for (i = 0; i != STR_LIST_LENGTH(*target); ++i) {
89 new_list[new_len] = concat(STR_LIST_ELT(*target,i),
90 STR_LIST_ELT(more,j));
94 for (i = 0; i != STR_LIST_LENGTH(*target); ++i)
95 free(STR_LIST_ELT(*target, i));
96 free(STR_LIST(*target));
97 STR_LIST_LENGTH(*target) = new_len;
98 STR_LIST(*target) = new_list;
103 /* Free the list (but not the elements within it). */
106 str_list_free (str_list_type *l)
110 free (STR_LIST (*l));
111 STR_LIST (*l) = NULL;
117 /* Remove duplicate elements from L, freeing their space. Since our
118 lists are so short, we do a maximally inefficient bubble search. */
121 str_list_uniqify (str_list_type *l)
124 str_list_type ret = str_list_init ();
126 for (e = 0; e < STR_LIST_LENGTH (*l); e++) {
127 string elt1 = STR_LIST_ELT (*l, e);
129 for (f = e + 1; f < STR_LIST_LENGTH (*l); f++) {
130 string elt2 = STR_LIST_ELT (*l, f);
131 /* I don't think our list should ever contain NULL's, but if
132 it does, let it stay and don't bother collapsing multiple
134 if (FILESTRCASEEQ (elt1, elt2)) {
139 if (f == STR_LIST_LENGTH (*l)) {
140 str_list_add (&ret, elt1); /* not found */
142 free (elt1); /* duplicate, forget this one */
146 /* Replace the passed list with what we constructed. */