summaryrefslogtreecommitdiff
path: root/Build/source/texk/kpathsea/str-list.c
diff options
context:
space:
mode:
Diffstat (limited to 'Build/source/texk/kpathsea/str-list.c')
-rw-r--r--Build/source/texk/kpathsea/str-list.c151
1 files changed, 151 insertions, 0 deletions
diff --git a/Build/source/texk/kpathsea/str-list.c b/Build/source/texk/kpathsea/str-list.c
new file mode 100644
index 00000000000..676aaa0ad26
--- /dev/null
+++ b/Build/source/texk/kpathsea/str-list.c
@@ -0,0 +1,151 @@
+/* str-list.c: define routines for string lists.
+
+ Copyright 1993, 2008, 2012, 2018 Karl Berry.
+ Copyright 2001, 2005 Olaf Weber.
+
+ This library is free software; you can redistribute it and/or
+ modify it under the terms of the GNU Lesser General Public
+ License as published by the Free Software Foundation; either
+ version 2.1 of the License, or (at your option) any later version.
+
+ This library is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+ Lesser General Public License for more details.
+
+ You should have received a copy of the GNU Lesser General Public License
+ along with this library; if not, see <http://www.gnu.org/licenses/>. */
+
+#include <kpathsea/config.h>
+
+#include <kpathsea/str-list.h>
+
+
+/* See the .h file for comments. */
+
+
+void
+str_list_add (str_list_type *l, string s)
+{
+ STR_LIST_LENGTH (*l)++;
+ XRETALLOC (STR_LIST (*l), STR_LIST_LENGTH (*l), string);
+ STR_LIST_LAST_ELT (*l) = s;
+}
+
+void
+cstr_list_add (cstr_list_type *l, const_string s)
+{
+ STR_LIST_LENGTH (*l)++;
+ XRETALLOC (STR_LIST (*l), STR_LIST_LENGTH (*l), const_string);
+ STR_LIST_LAST_ELT (*l) = s;
+}
+
+
+/* May as well save some reallocations and do everything in a chunk
+ instead of calling str_list_add on each element. */
+
+void
+str_list_concat (str_list_type *target, str_list_type more)
+{
+ unsigned e;
+ unsigned prev_len = STR_LIST_LENGTH (*target);
+
+ STR_LIST_LENGTH (*target) += STR_LIST_LENGTH (more);
+ XRETALLOC (STR_LIST (*target), STR_LIST_LENGTH (*target), string);
+
+ for (e = 0; e < STR_LIST_LENGTH (more); e++) {
+ STR_LIST_ELT (*target, prev_len + e) = STR_LIST_ELT (more, e);
+ }
+}
+
+
+/* Concatenate the elements of MORE to each element of TARGET. This
+ _must_ be done with the first index varying fastest.
+ We free the old elements of TARGET. */
+
+void
+str_list_concat_elements (str_list_type *target, str_list_type more)
+{
+ if (STR_LIST_EMPTY (more)) {
+ return;
+
+ } else if (STR_LIST_EMPTY (*target)) {
+ unsigned i;
+ STR_LIST_LENGTH (*target) = STR_LIST_LENGTH (more);
+ STR_LIST (*target) = (string *) xmalloc (STR_LIST_LENGTH (more)
+ * sizeof (char *));
+ for (i = 0; i != STR_LIST_LENGTH (more); ++i) {
+ STR_LIST_ELT (*target, i) = xstrdup (STR_LIST_ELT (more, i));
+ }
+ return;
+
+ } else {
+ unsigned new_len;
+ char **new_list;
+ unsigned i, j;
+ new_list = (string *) xmalloc (STR_LIST_LENGTH (*target)
+ * STR_LIST_LENGTH (more)
+ * sizeof (char *));
+ new_len = 0;
+ for (j = 0; j != STR_LIST_LENGTH (more); ++j) {
+ for (i = 0; i != STR_LIST_LENGTH (*target); ++i) {
+ new_list[new_len] = concat (STR_LIST_ELT (*target, i),
+ STR_LIST_ELT (more, j));
+ ++new_len;
+ }
+ }
+ for (i = 0; i != STR_LIST_LENGTH(*target); ++i) {
+ free (STR_LIST_ELT (*target, i));
+ }
+ free (STR_LIST (*target));
+ STR_LIST_LENGTH (*target) = new_len;
+ STR_LIST (*target) = new_list;
+ }
+}
+
+
+/* Free the list (but not the elements within it). */
+
+void
+str_list_free (str_list_type *l)
+{
+ if (STR_LIST (*l)) {
+ free (STR_LIST (*l));
+ STR_LIST (*l) = NULL;
+ }
+}
+
+
+
+/* Remove duplicate elements from L, freeing their space. Since our
+ lists are so short, we do a maximally inefficient bubble search. */
+
+void
+str_list_uniqify (str_list_type *l)
+{
+ unsigned e;
+ str_list_type ret = str_list_init ();
+
+ for (e = 0; e < STR_LIST_LENGTH (*l); e++) {
+ string elt1 = STR_LIST_ELT (*l, e);
+ unsigned f;
+ for (f = e + 1; f < STR_LIST_LENGTH (*l); f++) {
+ string elt2 = STR_LIST_ELT (*l, f);
+ /* I don't think our list should ever contain NULL's, but if
+ it does, let it stay and don't bother collapsing multiple
+ NULL's into one. */
+ if (FILESTRCASEEQ (elt1, elt2)) {
+ break;
+ }
+ }
+
+ if (f == STR_LIST_LENGTH (*l)) {
+ str_list_add (&ret, elt1); /* not found */
+ } else {
+ free (elt1); /* duplicate, forget this one */
+ }
+ }
+
+ /* Replace the passed list with what we constructed. */
+ *l = ret;
+}