]>
Commit | Line | Data |
---|---|---|
2f461da2 HH |
1 | #pragma once |
2 | ||
3 | /*** | |
4 | This file is part of systemd. | |
5 | ||
6 | Copyright 2010 Lennart Poettering | |
7 | ||
8 | systemd is free software; you can redistribute it and/or modify it | |
9 | under the terms of the GNU Lesser General Public License as published by | |
10 | the Free Software Foundation; either version 2.1 of the License, or | |
11 | (at your option) any later version. | |
12 | ||
13 | systemd is distributed in the hope that it will be useful, but | |
14 | WITHOUT ANY WARRANTY; without even the implied warranty of | |
15 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
16 | Lesser General Public License for more details. | |
17 | ||
18 | You should have received a copy of the GNU Lesser General Public License | |
19 | along with systemd; If not, see <http://www.gnu.org/licenses/>. | |
20 | ***/ | |
21 | ||
22 | #include <stdarg.h> | |
23 | #include <stdbool.h> | |
24 | ||
25 | #include "util.h" | |
26 | ||
27 | char *strv_find(char **l, const char *name) _pure_; | |
28 | char *strv_find_prefix(char **l, const char *name) _pure_; | |
29 | ||
30 | void strv_free(char **l); | |
31 | DEFINE_TRIVIAL_CLEANUP_FUNC(char**, strv_free); | |
32 | #define _cleanup_strv_free_ _cleanup_(strv_freep) | |
33 | ||
34 | char **strv_copy(char * const *l); | |
e7ba1392 | 35 | unsigned int strv_length(char * const *l) _pure_; |
2f461da2 HH |
36 | |
37 | char **strv_merge(char **a, char **b); | |
38 | char **strv_merge_concat(char **a, char **b, const char *suffix); | |
39 | char **strv_append(char **l, const char *s); | |
40 | int strv_extend(char ***l, const char *value); | |
41 | int strv_push(char ***l, char *value); | |
42 | ||
43 | char **strv_remove(char **l, const char *s); | |
44 | char **strv_remove_prefix(char **l, const char *s); | |
45 | char **strv_uniq(char **l); | |
46 | ||
47 | #define strv_contains(l, s) (!!strv_find((l), (s))) | |
48 | ||
49 | char **strv_new(const char *x, ...) _sentinel_; | |
50 | char **strv_new_ap(const char *x, va_list ap); | |
51 | ||
52 | static inline const char* STRV_IFNOTNULL(const char *x) { | |
53 | return x ? x : (const char *) -1; | |
54 | } | |
55 | ||
56 | static inline bool strv_isempty(char * const *l) { | |
57 | return !l || !*l; | |
58 | } | |
59 | ||
60 | char **strv_split(const char *s, const char *separator); | |
61 | char **strv_split_quoted(const char *s); | |
62 | char **strv_split_newlines(const char *s); | |
63 | ||
64 | char *strv_join(char **l, const char *separator); | |
65 | ||
66 | char **strv_parse_nulstr(const char *s, size_t l); | |
67 | char **strv_split_nulstr(const char *s); | |
68 | ||
69 | bool strv_overlap(char **a, char **b) _pure_; | |
70 | ||
71 | #define STRV_FOREACH(s, l) \ | |
72 | for ((s) = (l); (s) && *(s); (s)++) | |
73 | ||
74 | #define STRV_FOREACH_BACKWARDS(s, l) \ | |
75 | STRV_FOREACH(s, l) \ | |
76 | ; \ | |
77 | for ((s)--; (l) && ((s) >= (l)); (s)--) | |
78 | ||
79 | #define STRV_FOREACH_PAIR(x, y, l) \ | |
80 | for ((x) = (l), (y) = (x+1); (x) && *(x) && *(y); (x) += 2, (y) = (x + 1)) | |
81 | ||
82 | char **strv_sort(char **l); | |
83 | void strv_print(char **l); | |
84 | ||
85 | #define STRV_MAKE(...) ((char**) ((const char*[]) { __VA_ARGS__, NULL })) | |
86 | ||
87 | #define STRV_MAKE_EMPTY ((char*[1]) { NULL }) | |
88 | ||
89 | #define strv_from_stdarg_alloca(first) \ | |
90 | ({ \ | |
91 | char **_l; \ | |
92 | \ | |
93 | if (!first) \ | |
94 | _l = (char**) &first; \ | |
95 | else { \ | |
96 | unsigned _n; \ | |
97 | va_list _ap; \ | |
98 | \ | |
99 | _n = 1; \ | |
100 | va_start(_ap, first); \ | |
101 | while (va_arg(_ap, char*)) \ | |
102 | _n++; \ | |
103 | va_end(_ap); \ | |
104 | \ | |
105 | _l = newa(char*, _n+1); \ | |
106 | _l[_n = 0] = (char*) first; \ | |
107 | va_start(_ap, first); \ | |
108 | for (;;) { \ | |
109 | _l[++_n] = va_arg(_ap, char*); \ | |
110 | if (!_l[_n]) \ | |
111 | break; \ | |
112 | } \ | |
113 | va_end(_ap); \ | |
114 | } \ | |
115 | _l; \ | |
116 | }) |