| /*** |
| This file is part of systemd. |
| |
| Copyright 2010 Lennart Poettering |
| Copyright 2013 Thomas H.P. Andersen |
| |
| systemd 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. |
| |
| systemd 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 systemd; If not, see <http://www.gnu.org/licenses/>. |
| ***/ |
| |
| #include <string.h> |
| |
| #include "alloc-util.h" |
| #include "specifier.h" |
| #include "string-util.h" |
| #include "strv.h" |
| #include "util.h" |
| |
| static void test_specifier_printf(void) { |
| static const Specifier table[] = { |
| { 'a', specifier_string, (char*) "AAAA" }, |
| { 'b', specifier_string, (char*) "BBBB" }, |
| { 'm', specifier_machine_id, NULL }, |
| { 'B', specifier_boot_id, NULL }, |
| { 'H', specifier_host_name, NULL }, |
| { 'v', specifier_kernel_release, NULL }, |
| {} |
| }; |
| |
| _cleanup_free_ char *w = NULL; |
| int r; |
| |
| r = specifier_printf("xxx a=%a b=%b yyy", table, NULL, &w); |
| assert_se(r >= 0); |
| assert_se(w); |
| |
| puts(w); |
| assert_se(streq(w, "xxx a=AAAA b=BBBB yyy")); |
| |
| free(w); |
| r = specifier_printf("machine=%m, boot=%B, host=%H, version=%v", table, NULL, &w); |
| assert_se(r >= 0); |
| assert_se(w); |
| puts(w); |
| } |
| |
| static const char* const input_table_multiple[] = { |
| "one", |
| "two", |
| "three", |
| NULL, |
| }; |
| |
| static const char* const input_table_one[] = { |
| "one", |
| NULL, |
| }; |
| |
| static const char* const input_table_none[] = { |
| NULL, |
| }; |
| |
| static const char* const input_table_two_empties[] = { |
| "", |
| "", |
| NULL, |
| }; |
| |
| static const char* const input_table_one_empty[] = { |
| "", |
| NULL, |
| }; |
| |
| |
| static const char* const input_table_quotes[] = { |
| "\"", |
| "'", |
| "\"\"", |
| "\\", |
| "\\\\", |
| NULL, |
| }; |
| #define QUOTES_STRING \ |
| "\"\\\"\" " \ |
| "\"\\\'\" " \ |
| "\"\\\"\\\"\" " \ |
| "\"\\\\\" " \ |
| "\"\\\\\\\\\"" |
| |
| static const char * const input_table_spaces[] = { |
| " ", |
| "' '", |
| "\" ", |
| " \"", |
| " \\\\ ", |
| NULL, |
| }; |
| #define SPACES_STRING \ |
| "\" \" " \ |
| "\"\\' \\'\" " \ |
| "\"\\\" \" " \ |
| "\" \\\"\" " \ |
| "\" \\\\\\\\ \"" |
| |
| static void test_strv_find(void) { |
| assert_se(strv_find((char **)input_table_multiple, "three")); |
| assert_se(!strv_find((char **)input_table_multiple, "four")); |
| } |
| |
| static void test_strv_find_prefix(void) { |
| assert_se(strv_find_prefix((char **)input_table_multiple, "o")); |
| assert_se(strv_find_prefix((char **)input_table_multiple, "one")); |
| assert_se(strv_find_prefix((char **)input_table_multiple, "")); |
| assert_se(!strv_find_prefix((char **)input_table_multiple, "xxx")); |
| assert_se(!strv_find_prefix((char **)input_table_multiple, "onee")); |
| } |
| |
| static void test_strv_find_startswith(void) { |
| char *r; |
| |
| r = strv_find_startswith((char **)input_table_multiple, "o"); |
| assert_se(r && streq(r, "ne")); |
| |
| r = strv_find_startswith((char **)input_table_multiple, "one"); |
| assert_se(r && streq(r, "")); |
| |
| r = strv_find_startswith((char **)input_table_multiple, ""); |
| assert_se(r && streq(r, "one")); |
| |
| assert_se(!strv_find_startswith((char **)input_table_multiple, "xxx")); |
| assert_se(!strv_find_startswith((char **)input_table_multiple, "onee")); |
| } |
| |
| static void test_strv_join(void) { |
| _cleanup_free_ char *p = NULL, *q = NULL, *r = NULL, *s = NULL, *t = NULL, *v = NULL, *w = NULL; |
| |
| p = strv_join((char **)input_table_multiple, ", "); |
| assert_se(p); |
| assert_se(streq(p, "one, two, three")); |
| |
| q = strv_join((char **)input_table_multiple, ";"); |
| assert_se(q); |
| assert_se(streq(q, "one;two;three")); |
| |
| r = strv_join((char **)input_table_multiple, NULL); |
| assert_se(r); |
| assert_se(streq(r, "one two three")); |
| |
| s = strv_join((char **)input_table_one, ", "); |
| assert_se(s); |
| assert_se(streq(s, "one")); |
| |
| t = strv_join((char **)input_table_none, ", "); |
| assert_se(t); |
| assert_se(streq(t, "")); |
| |
| v = strv_join((char **)input_table_two_empties, ", "); |
| assert_se(v); |
| assert_se(streq(v, ", ")); |
| |
| w = strv_join((char **)input_table_one_empty, ", "); |
| assert_se(w); |
| assert_se(streq(w, "")); |
| } |
| |
| static void test_strv_quote_unquote(const char* const *split, const char *quoted) { |
| _cleanup_free_ char *p; |
| _cleanup_strv_free_ char **s = NULL; |
| char **t; |
| int r; |
| |
| p = strv_join_quoted((char **)split); |
| assert_se(p); |
| printf("-%s- --- -%s-\n", p, quoted); /* fprintf deals with NULL, puts does not */ |
| assert_se(p); |
| assert_se(streq(p, quoted)); |
| |
| r = strv_split_extract(&s, quoted, WHITESPACE, EXTRACT_QUOTES); |
| assert_se(r == (int) strv_length(s)); |
| assert_se(s); |
| STRV_FOREACH(t, s) { |
| assert_se(*t); |
| assert_se(streq(*t, *split)); |
| split++; |
| } |
| } |
| |
| static void test_strv_unquote(const char *quoted, char **list) { |
| _cleanup_strv_free_ char **s; |
| _cleanup_free_ char *j; |
| unsigned i = 0; |
| char **t; |
| int r; |
| |
| r = strv_split_extract(&s, quoted, WHITESPACE, EXTRACT_QUOTES); |
| assert_se(r == (int) strv_length(list)); |
| assert_se(s); |
| j = strv_join(s, " | "); |
| assert_se(j); |
| puts(j); |
| |
| STRV_FOREACH(t, s) |
| assert_se(streq(list[i++], *t)); |
| |
| assert_se(list[i] == NULL); |
| } |
| |
| static void test_invalid_unquote(const char *quoted) { |
| char **s = NULL; |
| int r; |
| |
| r = strv_split_extract(&s, quoted, WHITESPACE, EXTRACT_QUOTES); |
| assert_se(s == NULL); |
| assert_se(r == -EINVAL); |
| } |
| |
| static void test_strv_split(void) { |
| char **s; |
| unsigned i = 0; |
| _cleanup_strv_free_ char **l = NULL; |
| const char str[] = "one,two,three"; |
| |
| l = strv_split(str, ","); |
| |
| assert_se(l); |
| |
| STRV_FOREACH(s, l) { |
| assert_se(streq(*s, input_table_multiple[i++])); |
| } |
| } |
| |
| static void test_strv_split_extract(void) { |
| _cleanup_strv_free_ char **l = NULL; |
| const char *str = ":foo\\:bar::waldo:"; |
| int r; |
| |
| r = strv_split_extract(&l, str, ":", EXTRACT_DONT_COALESCE_SEPARATORS); |
| assert_se(r == (int) strv_length(l)); |
| assert_se(streq_ptr(l[0], "")); |
| assert_se(streq_ptr(l[1], "foo:bar")); |
| assert_se(streq_ptr(l[2], "")); |
| assert_se(streq_ptr(l[3], "waldo")); |
| assert_se(streq_ptr(l[4], "")); |
| assert_se(streq_ptr(l[5], NULL)); |
| } |
| |
| static void test_strv_split_newlines(void) { |
| unsigned i = 0; |
| char **s; |
| _cleanup_strv_free_ char **l = NULL; |
| const char str[] = "one\ntwo\nthree"; |
| |
| l = strv_split_newlines(str); |
| |
| assert_se(l); |
| |
| STRV_FOREACH(s, l) { |
| assert_se(streq(*s, input_table_multiple[i++])); |
| } |
| } |
| |
| static void test_strv_split_nulstr(void) { |
| _cleanup_strv_free_ char **l = NULL; |
| const char nulstr[] = "str0\0str1\0str2\0str3\0"; |
| |
| l = strv_split_nulstr (nulstr); |
| assert_se(l); |
| |
| assert_se(streq(l[0], "str0")); |
| assert_se(streq(l[1], "str1")); |
| assert_se(streq(l[2], "str2")); |
| assert_se(streq(l[3], "str3")); |
| } |
| |
| static void test_strv_parse_nulstr(void) { |
| _cleanup_strv_free_ char **l = NULL; |
| const char nulstr[] = "fuck\0fuck2\0fuck3\0\0fuck5\0\0xxx"; |
| |
| l = strv_parse_nulstr(nulstr, sizeof(nulstr)-1); |
| assert_se(l); |
| puts("Parse nulstr:"); |
| strv_print(l); |
| |
| assert_se(streq(l[0], "fuck")); |
| assert_se(streq(l[1], "fuck2")); |
| assert_se(streq(l[2], "fuck3")); |
| assert_se(streq(l[3], "")); |
| assert_se(streq(l[4], "fuck5")); |
| assert_se(streq(l[5], "")); |
| assert_se(streq(l[6], "xxx")); |
| } |
| |
| static void test_strv_overlap(void) { |
| const char * const input_table[] = { |
| "one", |
| "two", |
| "three", |
| NULL |
| }; |
| const char * const input_table_overlap[] = { |
| "two", |
| NULL |
| }; |
| const char * const input_table_unique[] = { |
| "four", |
| "five", |
| "six", |
| NULL |
| }; |
| |
| assert_se(strv_overlap((char **)input_table, (char**)input_table_overlap)); |
| assert_se(!strv_overlap((char **)input_table, (char**)input_table_unique)); |
| } |
| |
| static void test_strv_sort(void) { |
| const char* input_table[] = { |
| "durian", |
| "apple", |
| "citrus", |
| "CAPITAL LETTERS FIRST", |
| "banana", |
| NULL |
| }; |
| |
| strv_sort((char **)input_table); |
| |
| assert_se(streq(input_table[0], "CAPITAL LETTERS FIRST")); |
| assert_se(streq(input_table[1], "apple")); |
| assert_se(streq(input_table[2], "banana")); |
| assert_se(streq(input_table[3], "citrus")); |
| assert_se(streq(input_table[4], "durian")); |
| } |
| |
| static void test_strv_extend_strv_concat(void) { |
| _cleanup_strv_free_ char **a = NULL, **b = NULL; |
| |
| a = strv_new("without", "suffix", NULL); |
| b = strv_new("with", "suffix", NULL); |
| assert_se(a); |
| assert_se(b); |
| |
| assert_se(strv_extend_strv_concat(&a, b, "_suffix") >= 0); |
| |
| assert_se(streq(a[0], "without")); |
| assert_se(streq(a[1], "suffix")); |
| assert_se(streq(a[2], "with_suffix")); |
| assert_se(streq(a[3], "suffix_suffix")); |
| } |
| |
| static void test_strv_extend_strv(void) { |
| _cleanup_strv_free_ char **a = NULL, **b = NULL, **n = NULL; |
| |
| a = strv_new("abc", "def", "ghi", NULL); |
| b = strv_new("jkl", "mno", "abc", "pqr", NULL); |
| assert_se(a); |
| assert_se(b); |
| |
| assert_se(strv_extend_strv(&a, b, true) == 3); |
| |
| assert_se(streq(a[0], "abc")); |
| assert_se(streq(a[1], "def")); |
| assert_se(streq(a[2], "ghi")); |
| assert_se(streq(a[3], "jkl")); |
| assert_se(streq(a[4], "mno")); |
| assert_se(streq(a[5], "pqr")); |
| assert_se(strv_length(a) == 6); |
| |
| assert_se(strv_extend_strv(&n, b, false) >= 0); |
| assert_se(streq(n[0], "jkl")); |
| assert_se(streq(n[1], "mno")); |
| assert_se(streq(n[2], "abc")); |
| assert_se(streq(n[3], "pqr")); |
| assert_se(strv_length(n) == 4); |
| } |
| |
| static void test_strv_extend(void) { |
| _cleanup_strv_free_ char **a = NULL, **b = NULL; |
| |
| a = strv_new("test", "test1", NULL); |
| assert_se(a); |
| assert_se(strv_extend(&a, "test2") >= 0); |
| assert_se(strv_extend(&b, "test3") >= 0); |
| |
| assert_se(streq(a[0], "test")); |
| assert_se(streq(a[1], "test1")); |
| assert_se(streq(a[2], "test2")); |
| assert_se(streq(b[0], "test3")); |
| } |
| |
| static void test_strv_extendf(void) { |
| _cleanup_strv_free_ char **a = NULL, **b = NULL; |
| |
| a = strv_new("test", "test1", NULL); |
| assert_se(a); |
| assert_se(strv_extendf(&a, "test2 %s %d %s", "foo", 128, "bar") >= 0); |
| assert_se(strv_extendf(&b, "test3 %s %s %d", "bar", "foo", 128) >= 0); |
| |
| assert_se(streq(a[0], "test")); |
| assert_se(streq(a[1], "test1")); |
| assert_se(streq(a[2], "test2 foo 128 bar")); |
| assert_se(streq(b[0], "test3 bar foo 128")); |
| } |
| |
| static void test_strv_foreach(void) { |
| _cleanup_strv_free_ char **a; |
| unsigned i = 0; |
| char **check; |
| |
| a = strv_new("one", "two", "three", NULL); |
| |
| assert_se(a); |
| |
| STRV_FOREACH(check, a) { |
| assert_se(streq(*check, input_table_multiple[i++])); |
| } |
| } |
| |
| static void test_strv_foreach_backwards(void) { |
| _cleanup_strv_free_ char **a; |
| unsigned i = 2; |
| char **check; |
| |
| a = strv_new("one", "two", "three", NULL); |
| |
| assert_se(a); |
| |
| STRV_FOREACH_BACKWARDS(check, a) { |
| assert_se(streq_ptr(*check, input_table_multiple[i--])); |
| } |
| } |
| |
| static void test_strv_foreach_pair(void) { |
| _cleanup_strv_free_ char **a = NULL; |
| char **x, **y; |
| |
| a = strv_new("pair_one", "pair_one", |
| "pair_two", "pair_two", |
| "pair_three", "pair_three", |
| NULL); |
| |
| STRV_FOREACH_PAIR(x, y, a) { |
| assert_se(streq(*x, *y)); |
| } |
| } |
| |
| static void test_strv_from_stdarg_alloca_one(char **l, const char *first, ...) { |
| char **j; |
| unsigned i; |
| |
| j = strv_from_stdarg_alloca(first); |
| |
| for (i = 0;; i++) { |
| assert_se(streq_ptr(l[i], j[i])); |
| |
| if (!l[i]) |
| break; |
| } |
| } |
| |
| static void test_strv_from_stdarg_alloca(void) { |
| test_strv_from_stdarg_alloca_one(STRV_MAKE("foo", "bar"), "foo", "bar", NULL); |
| test_strv_from_stdarg_alloca_one(STRV_MAKE("foo"), "foo", NULL); |
| test_strv_from_stdarg_alloca_one(STRV_MAKE_EMPTY, NULL); |
| } |
| |
| static void test_strv_push_prepend(void) { |
| _cleanup_strv_free_ char **a = NULL; |
| |
| a = strv_new("foo", "bar", "three", NULL); |
| |
| assert_se(strv_push_prepend(&a, strdup("first")) >= 0); |
| assert_se(streq(a[0], "first")); |
| assert_se(streq(a[1], "foo")); |
| assert_se(streq(a[2], "bar")); |
| assert_se(streq(a[3], "three")); |
| assert_se(!a[4]); |
| |
| assert_se(strv_consume_prepend(&a, strdup("first2")) >= 0); |
| assert_se(streq(a[0], "first2")); |
| assert_se(streq(a[1], "first")); |
| assert_se(streq(a[2], "foo")); |
| assert_se(streq(a[3], "bar")); |
| assert_se(streq(a[4], "three")); |
| assert_se(!a[5]); |
| } |
| |
| static void test_strv_push(void) { |
| _cleanup_strv_free_ char **a = NULL; |
| char *i, *j; |
| |
| assert_se(i = strdup("foo")); |
| assert_se(strv_push(&a, i) >= 0); |
| |
| assert_se(i = strdup("a")); |
| assert_se(j = strdup("b")); |
| assert_se(strv_push_pair(&a, i, j) >= 0); |
| |
| assert_se(streq_ptr(a[0], "foo")); |
| assert_se(streq_ptr(a[1], "a")); |
| assert_se(streq_ptr(a[2], "b")); |
| assert_se(streq_ptr(a[3], NULL)); |
| } |
| |
| static void test_strv_equal(void) { |
| _cleanup_strv_free_ char **a = NULL; |
| _cleanup_strv_free_ char **b = NULL; |
| _cleanup_strv_free_ char **c = NULL; |
| |
| a = strv_new("one", "two", "three", NULL); |
| assert_se(a); |
| b = strv_new("one", "two", "three", NULL); |
| assert_se(a); |
| c = strv_new("one", "two", "three", "four", NULL); |
| assert_se(a); |
| |
| assert_se(strv_equal(a, a)); |
| assert_se(strv_equal(a, b)); |
| assert_se(strv_equal(NULL, NULL)); |
| |
| assert_se(!strv_equal(a, c)); |
| assert_se(!strv_equal(b, c)); |
| assert_se(!strv_equal(b, NULL)); |
| } |
| |
| static void test_strv_is_uniq(void) { |
| _cleanup_strv_free_ char **a = NULL, **b = NULL, **c = NULL, **d = NULL; |
| |
| a = strv_new(NULL, NULL); |
| assert_se(a); |
| assert_se(strv_is_uniq(a)); |
| |
| b = strv_new("foo", NULL); |
| assert_se(b); |
| assert_se(strv_is_uniq(b)); |
| |
| c = strv_new("foo", "bar", NULL); |
| assert_se(c); |
| assert_se(strv_is_uniq(c)); |
| |
| d = strv_new("foo", "bar", "waldo", "bar", "piep", NULL); |
| assert_se(d); |
| assert_se(!strv_is_uniq(d)); |
| } |
| |
| static void test_strv_reverse(void) { |
| _cleanup_strv_free_ char **a = NULL, **b = NULL, **c = NULL, **d = NULL; |
| |
| a = strv_new(NULL, NULL); |
| assert_se(a); |
| |
| strv_reverse(a); |
| assert_se(strv_isempty(a)); |
| |
| b = strv_new("foo", NULL); |
| assert_se(b); |
| strv_reverse(b); |
| assert_se(streq_ptr(b[0], "foo")); |
| assert_se(streq_ptr(b[1], NULL)); |
| |
| c = strv_new("foo", "bar", NULL); |
| assert_se(c); |
| strv_reverse(c); |
| assert_se(streq_ptr(c[0], "bar")); |
| assert_se(streq_ptr(c[1], "foo")); |
| assert_se(streq_ptr(c[2], NULL)); |
| |
| d = strv_new("foo", "bar", "waldo", NULL); |
| assert_se(d); |
| strv_reverse(d); |
| assert_se(streq_ptr(d[0], "waldo")); |
| assert_se(streq_ptr(d[1], "bar")); |
| assert_se(streq_ptr(d[2], "foo")); |
| assert_se(streq_ptr(d[3], NULL)); |
| } |
| |
| static void test_strv_shell_escape(void) { |
| _cleanup_strv_free_ char **v = NULL; |
| |
| v = strv_new("foo:bar", "bar,baz", "wal\\do", NULL); |
| assert_se(v); |
| assert_se(strv_shell_escape(v, ",:")); |
| assert_se(streq_ptr(v[0], "foo\\:bar")); |
| assert_se(streq_ptr(v[1], "bar\\,baz")); |
| assert_se(streq_ptr(v[2], "wal\\\\do")); |
| assert_se(streq_ptr(v[3], NULL)); |
| } |
| |
| static void test_strv_skip_one(char **a, size_t n, char **b) { |
| a = strv_skip(a, n); |
| assert_se(strv_equal(a, b)); |
| } |
| |
| static void test_strv_skip(void) { |
| test_strv_skip_one(STRV_MAKE("foo", "bar", "baz"), 0, STRV_MAKE("foo", "bar", "baz")); |
| test_strv_skip_one(STRV_MAKE("foo", "bar", "baz"), 1, STRV_MAKE("bar", "baz")); |
| test_strv_skip_one(STRV_MAKE("foo", "bar", "baz"), 2, STRV_MAKE("baz")); |
| test_strv_skip_one(STRV_MAKE("foo", "bar", "baz"), 3, STRV_MAKE(NULL)); |
| test_strv_skip_one(STRV_MAKE("foo", "bar", "baz"), 4, STRV_MAKE(NULL)); |
| test_strv_skip_one(STRV_MAKE("foo", "bar", "baz"), 55, STRV_MAKE(NULL)); |
| |
| test_strv_skip_one(STRV_MAKE("quux"), 0, STRV_MAKE("quux")); |
| test_strv_skip_one(STRV_MAKE("quux"), 1, STRV_MAKE(NULL)); |
| test_strv_skip_one(STRV_MAKE("quux"), 55, STRV_MAKE(NULL)); |
| |
| test_strv_skip_one(STRV_MAKE(NULL), 0, STRV_MAKE(NULL)); |
| test_strv_skip_one(STRV_MAKE(NULL), 1, STRV_MAKE(NULL)); |
| test_strv_skip_one(STRV_MAKE(NULL), 55, STRV_MAKE(NULL)); |
| } |
| |
| static void test_strv_extend_n(void) { |
| _cleanup_strv_free_ char **v = NULL; |
| |
| v = strv_new("foo", "bar", NULL); |
| assert_se(v); |
| |
| assert_se(strv_extend_n(&v, "waldo", 3) >= 0); |
| assert_se(strv_extend_n(&v, "piep", 2) >= 0); |
| |
| assert_se(streq(v[0], "foo")); |
| assert_se(streq(v[1], "bar")); |
| assert_se(streq(v[2], "waldo")); |
| assert_se(streq(v[3], "waldo")); |
| assert_se(streq(v[4], "waldo")); |
| assert_se(streq(v[5], "piep")); |
| assert_se(streq(v[6], "piep")); |
| assert_se(v[7] == NULL); |
| |
| v = strv_free(v); |
| |
| assert_se(strv_extend_n(&v, "foo", 1) >= 0); |
| assert_se(strv_extend_n(&v, "bar", 0) >= 0); |
| |
| assert_se(streq(v[0], "foo")); |
| assert_se(v[1] == NULL); |
| } |
| |
| static void test_strv_make_nulstr_one(char **l) { |
| _cleanup_free_ char *b = NULL, *c = NULL; |
| _cleanup_strv_free_ char **q = NULL; |
| const char *s = NULL; |
| size_t n, m; |
| unsigned i = 0; |
| |
| assert_se(strv_make_nulstr(l, &b, &n) >= 0); |
| assert_se(q = strv_parse_nulstr(b, n)); |
| assert_se(strv_equal(l, q)); |
| |
| assert_se(strv_make_nulstr(q, &c, &m) >= 0); |
| assert_se(m == n); |
| assert_se(memcmp(b, c, m) == 0); |
| |
| NULSTR_FOREACH(s, b) |
| assert_se(streq(s, l[i++])); |
| assert_se(i == strv_length(l)); |
| } |
| |
| static void test_strv_make_nulstr(void) { |
| test_strv_make_nulstr_one(NULL); |
| test_strv_make_nulstr_one(STRV_MAKE(NULL)); |
| test_strv_make_nulstr_one(STRV_MAKE("foo")); |
| test_strv_make_nulstr_one(STRV_MAKE("foo", "bar")); |
| test_strv_make_nulstr_one(STRV_MAKE("foo", "bar", "quuux")); |
| } |
| |
| static void test_foreach_string(void) { |
| const char * const t[] = { |
| "foo", |
| "bar", |
| "waldo", |
| NULL |
| }; |
| const char *x; |
| unsigned i = 0; |
| |
| FOREACH_STRING(x, "foo", "bar", "waldo") |
| assert_se(streq_ptr(t[i++], x)); |
| |
| assert_se(i == 3); |
| |
| FOREACH_STRING(x, "zzz") |
| assert_se(streq(x, "zzz")); |
| } |
| |
| static void test_strv_fnmatch(void) { |
| _cleanup_strv_free_ char **v = NULL; |
| |
| assert_se(!strv_fnmatch(STRV_MAKE_EMPTY, "a", 0)); |
| |
| v = strv_new("*\\*", NULL); |
| assert_se(!strv_fnmatch(v, "\\", 0)); |
| assert_se(strv_fnmatch(v, "\\", FNM_NOESCAPE)); |
| } |
| |
| int main(int argc, char *argv[]) { |
| test_specifier_printf(); |
| test_strv_foreach(); |
| test_strv_foreach_backwards(); |
| test_strv_foreach_pair(); |
| test_strv_find(); |
| test_strv_find_prefix(); |
| test_strv_find_startswith(); |
| test_strv_join(); |
| |
| test_strv_quote_unquote(input_table_multiple, "\"one\" \"two\" \"three\""); |
| test_strv_quote_unquote(input_table_one, "\"one\""); |
| test_strv_quote_unquote(input_table_none, ""); |
| test_strv_quote_unquote(input_table_one_empty, "\"\""); |
| test_strv_quote_unquote(input_table_two_empties, "\"\" \"\""); |
| test_strv_quote_unquote(input_table_quotes, QUOTES_STRING); |
| test_strv_quote_unquote(input_table_spaces, SPACES_STRING); |
| |
| test_strv_unquote(" foo=bar \"waldo\" zzz ", STRV_MAKE("foo=bar", "waldo", "zzz")); |
| test_strv_unquote("", STRV_MAKE_EMPTY); |
| test_strv_unquote(" ", STRV_MAKE_EMPTY); |
| test_strv_unquote(" ", STRV_MAKE_EMPTY); |
| test_strv_unquote(" x", STRV_MAKE("x")); |
| test_strv_unquote("x ", STRV_MAKE("x")); |
| test_strv_unquote(" x ", STRV_MAKE("x")); |
| test_strv_unquote(" \"x\" ", STRV_MAKE("x")); |
| test_strv_unquote(" 'x' ", STRV_MAKE("x")); |
| test_strv_unquote(" 'x\"' ", STRV_MAKE("x\"")); |
| test_strv_unquote(" \"x'\" ", STRV_MAKE("x'")); |
| test_strv_unquote("a '--b=c \"d e\"'", STRV_MAKE("a", "--b=c \"d e\"")); |
| |
| /* trailing backslashes */ |
| test_strv_unquote(" x\\\\", STRV_MAKE("x\\")); |
| test_invalid_unquote(" x\\"); |
| |
| test_invalid_unquote("a --b='c \"d e\"''"); |
| test_invalid_unquote("a --b='c \"d e\" '\""); |
| test_invalid_unquote("a --b='c \"d e\"garbage"); |
| test_invalid_unquote("'"); |
| test_invalid_unquote("\""); |
| test_invalid_unquote("'x'y'g"); |
| |
| test_strv_split(); |
| test_strv_split_extract(); |
| test_strv_split_newlines(); |
| test_strv_split_nulstr(); |
| test_strv_parse_nulstr(); |
| test_strv_overlap(); |
| test_strv_sort(); |
| test_strv_extend_strv(); |
| test_strv_extend_strv_concat(); |
| test_strv_extend(); |
| test_strv_extendf(); |
| test_strv_from_stdarg_alloca(); |
| test_strv_push_prepend(); |
| test_strv_push(); |
| test_strv_equal(); |
| test_strv_is_uniq(); |
| test_strv_reverse(); |
| test_strv_shell_escape(); |
| test_strv_skip(); |
| test_strv_extend_n(); |
| test_strv_make_nulstr(); |
| |
| test_foreach_string(); |
| test_strv_fnmatch(); |
| |
| return 0; |
| } |