/* SPDX-License-Identifier: LGPL-2.1-or-later */

#include "nm-sd-adapt-shared.h"

#include <errno.h>

#include <fnmatch.h>

#include <stdarg.h>

#include <stdio.h>

#include <stdlib.h>

#include "alloc-util.h"

#include "escape.h"

#include "extract-word.h"

#include "fileio.h"

#include "memory-util.h"

#include "nulstr-util.h"

#include "sort-util.h"

#include "string-util.h"

#include "strv.h"

char *strv_find(char * const *l, const char *name) {

        char * const *i;

        assert(name);

        STRV_FOREACH(i, l)

                if (streq(*i, name))

                        return *i;

        return NULL;

}

char *strv_find_case(char * const *l, const char *name) {

        char * const *i;

        assert(name);

        STRV_FOREACH(i, l)

                if (strcaseeq(*i, name))

                        return *i;

        return NULL;

}

char *strv_find_prefix(char * const *l, const char *name) {

        char * const *i;

        assert(name);

        STRV_FOREACH(i, l)

                if (startswith(*i, name))

                        return *i;

        return NULL;

}

char *strv_find_startswith(char * const *l, const char *name) {

        char * const *i, *e;

        assert(name);

        /* Like strv_find_prefix, but actually returns only the

         * suffix, not the whole item */

        STRV_FOREACH(i, l) {

                e = startswith(*i, name);

                if (e)

                        return e;

        }

        return NULL;

}

char **strv_free(char **l) {

        char **k;

        if (!l)

                return NULL;

        for (k = l; *k; k++)

                free(*k);

        return mfree(l);

}

char **strv_free_erase(char **l) {

        char **i;

        STRV_FOREACH(i, l)

                erase_and_freep(i);

        return mfree(l);

}

char **strv_copy(char * const *l) {

        char **r, **k;

        k = r = new(char*, strv_length(l) + 1);

        if (!r)

                return NULL;

        if (l)

                for (; *l; k++, l++) {

                        *k = strdup(*l);

                        if (!*k) {

                                strv_free(r);

                                return NULL;

                        }

                }

        *k = NULL;

        return r;

}

size_t strv_length(char * const *l) {

        size_t n = 0;

        if (!l)

                return 0;

        for (; *l; l++)

                n++;

        return n;

}

char **strv_new_ap(const char *x, va_list ap) {

        _cleanup_strv_free_ char **a = NULL;

        size_t n = 0, i = 0;

        va_list aq;

        /* As a special trick we ignore all listed strings that equal

         * STRV_IGNORE. This is supposed to be used with the

         * STRV_IFNOTNULL() macro to include possibly NULL strings in

         * the string list. */

        va_copy(aq, ap);

        for (const char *s = x; s; s = va_arg(aq, const char*)) {

                if (s == STRV_IGNORE)

                        continue;

                n++;

        }

        va_end(aq);

        a = new(char*, n+1);

        if (!a)

                return NULL;

        for (const char *s = x; s; s = va_arg(ap, const char*)) {

                if (s == STRV_IGNORE)

                        continue;

                a[i] = strdup(s);

                if (!a[i])

                        return NULL;

                i++;

        }

        a[i] = NULL;

        return TAKE_PTR(a);

}

char **strv_new_internal(const char *x, ...) {

        char **r;

        va_list ap;

        va_start(ap, x);

        r = strv_new_ap(x, ap);

        va_end(ap);

        return r;

}

int strv_extend_strv(char ***a, char * const *b, bool filter_duplicates) {

        char * const *s, **t;

        size_t p, q, i = 0, j;

        assert(a);

        if (strv_isempty(b))

                return 0;

        p = strv_length(*a);

        q = strv_length(b);

        if (p >= SIZE_MAX - q)

                return -ENOMEM;

        t = reallocarray(*a, GREEDY_ALLOC_ROUND_UP(p + q + 1), sizeof(char *));

        if (!t)

                return -ENOMEM;

        t[p] = NULL;

        *a = t;

        STRV_FOREACH(s, b) {

                if (filter_duplicates && strv_contains(t, *s))

                        continue;

                t[p+i] = strdup(*s);

                if (!t[p+i])

                        goto rollback;

                i++;

                t[p+i] = NULL;

        }

        assert(i <= q);

        return (int) i;

rollback:

        for (j = 0; j < i; j++)

                free(t[p + j]);

        t[p] = NULL;

        return -ENOMEM;

}

#if 0 /* NM_IGNORED */

int strv_extend_strv_concat(char ***a, char * const *b, const char *suffix) {

        char * const *s;

        int r;

        STRV_FOREACH(s, b) {

                char *v;

                v = strjoin(*s, suffix);

                if (!v)

                        return -ENOMEM;

                r = strv_push(a, v);

                if (r < 0) {

                        free(v);

                        return r;

                }

        }

        return 0;

}

#endif /* NM_IGNORED */

int strv_split_newlines_full(char ***ret, const char *s, ExtractFlags flags) {

        _cleanup_strv_free_ char **l = NULL;

        size_t n;

        int r;

        assert(s);

        /* Special version of strv_split_full() that splits on newlines and

         * suppresses an empty string at the end. */

        r = strv_split_full(&l, s, NEWLINE, flags);

        if (r < 0)

                return r;

        n = strv_length(l);

        if (n > 0 && isempty(l[n - 1])) {

                l[n - 1] = mfree(l[n - 1]);

                n--;

        }

        *ret = TAKE_PTR(l);

        return n;

}

int strv_split_full(char ***t, const char *s, const char *separators, ExtractFlags flags) {

        _cleanup_strv_free_ char **l = NULL;

        size_t n = 0, allocated = 0;

        int r;

        assert(t);

        assert(s);

        for (;;) {

                _cleanup_free_ char *word = NULL;

                r = extract_first_word(&s, &word, separators, flags);

                if (r < 0)

                        return r;

                if (r == 0)

                        break;

                if (!GREEDY_REALLOC(l, allocated, n + 2))

                        return -ENOMEM;

                l[n++] = TAKE_PTR(word);

                l[n] = NULL;

        }

        if (!l) {

                l = new0(char*, 1);

                if (!l)

                        return -ENOMEM;

        }

        *t = TAKE_PTR(l);

        return (int) n;

}

#if 0 /* NM_IGNORED */

int strv_split_colon_pairs(char ***t, const char *s) {

        _cleanup_strv_free_ char **l = NULL;

        size_t n = 0, allocated = 0;

        int r;

        assert(t);

        assert(s);

        for (;;) {

                _cleanup_free_ char *first = NULL, *second = NULL, *tuple = NULL, *second_or_empty = NULL;

                r = extract_first_word(&s, &tuple, NULL, EXTRACT_UNQUOTE|EXTRACT_RETAIN_ESCAPE);

                if (r < 0)

                        return r;

                if (r == 0)

                        break;

                const char *p = tuple;

                r = extract_many_words(&p, ":", EXTRACT_CUNESCAPE|EXTRACT_UNESCAPE_SEPARATORS,

                                       &first, &second, NULL);

                if (r < 0)

                        return r;

                if (r == 0)

                        continue;

                /* Enforce that at most 2 colon-separated words are contained in each group */

                if (!isempty(p))

                        return -EINVAL;

                second_or_empty = strdup(strempty(second));

                if (!second_or_empty)

                        return -ENOMEM;

                if (!GREEDY_REALLOC(l, allocated, n + 3))

                        return -ENOMEM;

                l[n++] = TAKE_PTR(first);

                l[n++] = TAKE_PTR(second_or_empty);

                l[n] = NULL;

        }

        if (!l) {

                l = new0(char*, 1);

                if (!l)

                        return -ENOMEM;

        }

        *t = TAKE_PTR(l);

        return (int) n;

}

#endif /* NM_IGNORED */

char *strv_join_full(char * const *l, const char *separator, const char *prefix, bool unescape_separators) {

        char * const *s;

        char *r, *e;

        size_t n, k, m;

        if (!separator)

                separator = " ";

        k = strlen(separator);

        m = strlen_ptr(prefix);

        if (unescape_separators) /* If there separator is multi-char, we won't know how to escape it. */

                assert(k == 1);

        n = 0;

        STRV_FOREACH(s, l) {

                if (s != l)

                        n += k;

                bool needs_escaping = unescape_separators && strchr(*s, separator[0]);

                n += m + strlen(*s) * (1 + needs_escaping);

        }

        r = new(char, n+1);

        if (!r)

                return NULL;

        e = r;

        STRV_FOREACH(s, l) {

                if (s != l)

                        e = stpcpy(e, separator);

                if (prefix)

                        e = stpcpy(e, prefix);

                bool needs_escaping = unescape_separators && strchr(*s, separator[0]);

                if (needs_escaping)

                        for (size_t i = 0; (*s)[i]; i++) {

                                if ((*s)[i] == separator[0])

                                        *(e++) = '\\';

                                *(e++) = (*s)[i];

                        }

                else

                        e = stpcpy(e, *s);

        }

        *e = 0;

        return r;

}

int strv_push(char ***l, char *value) {

        char **c;

        size_t n;

        if (!value)

                return 0;

        n = strv_length(*l);

        /* Check for overflow */

        if (n > SIZE_MAX-2)

                return -ENOMEM;

        c = reallocarray(*l, GREEDY_ALLOC_ROUND_UP(n + 2), sizeof(char*));

        if (!c)

                return -ENOMEM;

        c[n] = value;

        c[n+1] = NULL;

        *l = c;

        return 0;

}

int strv_push_pair(char ***l, char *a, char *b) {

        char **c;

        size_t n;

        if (!a && !b)

                return 0;

        n = strv_length(*l);

        /* Check for overflow */

        if (n > SIZE_MAX-3)

                return -ENOMEM;

        /* increase and check for overflow */

        c = reallocarray(*l, GREEDY_ALLOC_ROUND_UP(n + !!a + !!b + 1), sizeof(char*));

        if (!c)

                return -ENOMEM;

        if (a)

                c[n++] = a;

        if (b)

                c[n++] = b;

        c[n] = NULL;

        *l = c;

        return 0;

}

int strv_insert(char ***l, size_t position, char *value) {

        char **c;

        size_t n, m, i;

        if (!value)

                return 0;

        n = strv_length(*l);

        position = MIN(position, n);

        /* increase and check for overflow */

        m = n + 2;

        if (m < n)

                return -ENOMEM;

        c = new(char*, m);

        if (!c)

                return -ENOMEM;

        for (i = 0; i < position; i++)

                c[i] = (*l)[i];

        c[position] = value;

        for (i = position; i < n; i++)

                c[i+1] = (*l)[i];

        c[n+1] = NULL;

        free(*l);

        *l = c;

        return 0;

}

int strv_consume(char ***l, char *value) {

        int r;

        r = strv_push(l, value);

        if (r < 0)

                free(value);

        return r;

}

int strv_consume_pair(char ***l, char *a, char *b) {

        int r;

        r = strv_push_pair(l, a, b);

        if (r < 0) {

                free(a);

                free(b);

        }

        return r;

}

int strv_consume_prepend(char ***l, char *value) {

        int r;

        r = strv_push_prepend(l, value);

        if (r < 0)

                free(value);

        return r;

}

int strv_prepend(char ***l, const char *value) {

        char *v;

        if (!value)

                return 0;

        v = strdup(value);

        if (!v)

                return -ENOMEM;

        return strv_consume_prepend(l, v);

}

int strv_extend(char ***l, const char *value) {

        char *v;

        if (!value)

                return 0;

        v = strdup(value);

        if (!v)

                return -ENOMEM;

        return strv_consume(l, v);

}

int strv_extend_front(char ***l, const char *value) {

        size_t n, m;

        char *v, **c;

        assert(l);

        /* Like strv_extend(), but prepends rather than appends the new entry */

        if (!value)

                return 0;

        n = strv_length(*l);

        /* Increase and overflow check. */

        m = n + 2;

        if (m < n)

                return -ENOMEM;

        v = strdup(value);

        if (!v)

                return -ENOMEM;

        c = reallocarray(*l, m, sizeof(char*));

        if (!c) {

                free(v);

                return -ENOMEM;

        }

        memmove(c+1, c, n * sizeof(char*));

        c[0] = v;

        c[n+1] = NULL;

        *l = c;

        return 0;

}

char **strv_uniq(char **l) {

        char **i;

        /* Drops duplicate entries. The first identical string will be

         * kept, the others dropped */

        STRV_FOREACH(i, l)

                strv_remove(i+1, *i);

        return l;

}

bool strv_is_uniq(char * const *l) {

        char * const *i;

        STRV_FOREACH(i, l)

                if (strv_find(i+1, *i))

                        return false;

        return true;

}

char **strv_remove(char **l, const char *s) {

        char **f, **t;

        if (!l)

                return NULL;

        assert(s);

        /* Drops every occurrence of s in the string list, edits

         * in-place. */

        for (f = t = l; *f; f++)

                if (streq(*f, s))

                        free(*f);

                else

                        *(t++) = *f;

        *t = NULL;

        return l;

}

char **strv_parse_nulstr(const char *s, size_t l) {

        /* l is the length of the input data, which will be split at NULs into

         * elements of the resulting strv. Hence, the number of items in the resulting strv

         * will be equal to one plus the number of NUL bytes in the l bytes starting at s,

         * unless s[l-1] is NUL, in which case the final empty string is not stored in

         * the resulting strv, and length is equal to the number of NUL bytes.

         *

         * Note that contrary to a normal nulstr which cannot contain empty strings, because

         * the input data is terminated by any two consequent NUL bytes, this parser accepts

         * empty strings in s.

         */

        const char *p;

        size_t c = 0, i = 0;

        char **v;

        assert(s || l <= 0);

        if (l <= 0)

                return new0(char*, 1);

        for (p = s; p < s + l; p++)

                if (*p == 0)

                        c++;

        if (s[l-1] != 0)

                c++;

        v = new0(char*, c+1);

        if (!v)

                return NULL;

        p = s;

        while (p < s + l) {

                const char *e;

                e = memchr(p, 0, s + l - p);

                v[i] = strndup(p, e ? e - p : s + l - p);

                if (!v[i]) {

                        strv_free(v);

                        return NULL;

                }

                i++;

                if (!e)

                        break;

                p = e + 1;

        }

        assert(i == c);

        return v;

}

#if 0 /* NM_IGNORED */

char **strv_split_nulstr(const char *s) {

        const char *i;

        char **r = NULL;

        NULSTR_FOREACH(i, s)

                if (strv_extend(&r, i) < 0) {

                        strv_free(r);

                        return NULL;

                }

        if (!r)

                return strv_new(NULL);

        return r;

}

#endif /* NM_IGNORED */

int strv_make_nulstr(char * const *l, char **ret, size_t *ret_size) {

        /* A valid nulstr with two NULs at the end will be created, but

         * q will be the length without the two trailing NULs. Thus the output

         * string is a valid nulstr and can be iterated over using NULSTR_FOREACH,

         * and can also be parsed by strv_parse_nulstr as long as the length

         * is provided separately.

         */

        size_t n_allocated = 0, n = 0;

        _cleanup_free_ char *m = NULL;

        char * const *i;

        assert(ret);

        assert(ret_size);

        STRV_FOREACH(i, l) {

                size_t z;

                z = strlen(*i);

                if (!GREEDY_REALLOC(m, n_allocated, n + z + 2))

                        return -ENOMEM;

                memcpy(m + n, *i, z + 1);

                n += z + 1;

        }

        if (!m) {

                m = new0(char, 1);

                if (!m)

                        return -ENOMEM;

                n = 1;

        } else

                /* make sure there is a second extra NUL at the end of resulting nulstr */

                m[n] = '\0';

        assert(n > 0);

        *ret = m;

        *ret_size = n - 1;

        m = NULL;

        return 0;

}

bool strv_overlap(char * const *a, char * const *b) {

        char * const *i;

        STRV_FOREACH(i, a)

                if (strv_contains(b, *i))

                        return true;

        return false;

}

#if 0 /* NM_IGNORED */

static int str_compare(char * const *a, char * const *b) {

        return strcmp(*a, *b);

}

char **strv_sort(char **l) {

        typesafe_qsort(l, strv_length(l), str_compare);

        return l;

}

#endif /* NM_IGNORED */

int strv_compare(char * const *a, char * const *b) {

        int r;

        if (strv_isempty(a)) {

                if (strv_isempty(b))

                        return 0;

                else

                        return -1;

        }

        if (strv_isempty(b))

                return 1;

        for ( ; *a || *b; ++a, ++b) {

                r = strcmp_ptr(*a, *b);

                if (r != 0)

                        return r;

        }

        return 0;

}

void strv_print(char * const *l) {

        char * const *s;

        STRV_FOREACH(s, l)

                puts(*s);

}

int strv_extendf(char ***l, const char *format, ...) {

        va_list ap;

        char *x;

        int r;

        va_start(ap, format);

        r = vasprintf(&x, format, ap);

        va_end(ap);

        if (r < 0)

                return -ENOMEM;

        return strv_consume(l, x);

}

char **strv_reverse(char **l) {

        size_t n, i;

        n = strv_length(l);

        if (n <= 1)

                return l;

        for (i = 0; i < n / 2; i++)

                SWAP_TWO(l[i], l[n-1-i]);

        return l;

}

char **strv_shell_escape(char **l, const char *bad) {

        char **s;

        /* Escapes every character in every string in l that is in bad,

         * edits in-place, does not roll-back on error. */

        STRV_FOREACH(s, l) {

                char *v;

                v = shell_escape(*s, bad);

                if (!v)

                        return NULL;

                free(*s);

                *s = v;

        }

        return l;

}

bool strv_fnmatch_full(char* const* patterns, const char *s, int flags, size_t *matched_pos) {

        for (size_t i = 0; patterns && patterns[i]; i++)

                if (fnmatch(patterns[i], s, flags) == 0) {

                        if (matched_pos)

                                *matched_pos = i;

                        return true;

                }

        return false;

}

char ***strv_free_free(char ***l) {

        char ***i;

        if (!l)

                return NULL;

        for (i = l; *i; i++)

                strv_free(*i);

        return mfree(l);

}

char **strv_skip(char **l, size_t n) {

        while (n > 0) {