]>
Commit | Line | Data |
---|---|---|
53e1b683 | 1 | /* SPDX-License-Identifier: LGPL-2.1+ */ |
c2f1db8f | 2 | #pragma once |
60918275 | 3 | |
84ac7bea | 4 | #include <fnmatch.h> |
15ae422b LP |
5 | #include <stdarg.h> |
6 | #include <stdbool.h> | |
11c3a366 | 7 | #include <stddef.h> |
ca78ad1d | 8 | #include <stdio.h> |
15ae422b | 9 | |
11c3a366 | 10 | #include "alloc-util.h" |
93cc7779 | 11 | #include "extract-word.h" |
cde79109 | 12 | #include "hashmap.h" |
11c3a366 | 13 | #include "macro.h" |
8059aa9c | 14 | #include "string-util.h" |
60918275 | 15 | |
479ddcdf YW |
16 | char *strv_find(char * const *l, const char *name) _pure_; |
17 | char *strv_find_prefix(char * const *l, const char *name) _pure_; | |
18 | char *strv_find_startswith(char * const *l, const char *name) _pure_; | |
a4bfb399 | 19 | |
33c2ce7b | 20 | char **strv_free(char **l); |
14bf2c9d | 21 | DEFINE_TRIVIAL_CLEANUP_FUNC(char**, strv_free); |
dfb33a97 LP |
22 | #define _cleanup_strv_free_ _cleanup_(strv_freep) |
23 | ||
ab84f5b9 ZJS |
24 | char **strv_free_erase(char **l); |
25 | DEFINE_TRIVIAL_CLEANUP_FUNC(char**, strv_free_erase); | |
26 | #define _cleanup_strv_free_erase_ _cleanup_(strv_free_erasep) | |
27 | ||
b231b547 | 28 | char **strv_copy(char * const *l); |
da6053d0 | 29 | size_t strv_length(char * const *l) _pure_; |
60918275 | 30 | |
479ddcdf YW |
31 | int strv_extend_strv(char ***a, char * const *b, bool filter_duplicates); |
32 | int strv_extend_strv_concat(char ***a, char * const *b, const char *suffix); | |
5926ccca | 33 | int strv_extend(char ***l, const char *value); |
20e265d4 | 34 | int strv_extendf(char ***l, const char *format, ...) _printf_(2,0); |
4f4afc88 | 35 | int strv_extend_front(char ***l, const char *value); |
4468addc | 36 | int strv_push(char ***l, char *value); |
98940a3c | 37 | int strv_push_pair(char ***l, char *a, char *b); |
da6053d0 | 38 | int strv_insert(char ***l, size_t position, char *value); |
6e888894 ZJS |
39 | |
40 | static inline int strv_push_prepend(char ***l, char *value) { | |
41 | return strv_insert(l, 0, value); | |
42 | } | |
43 | ||
6e18964d | 44 | int strv_consume(char ***l, char *value); |
98940a3c | 45 | int strv_consume_pair(char ***l, char *a, char *b); |
9a00f57a | 46 | int strv_consume_prepend(char ***l, char *value); |
034c6ed7 | 47 | |
5f9a22c3 LP |
48 | char **strv_remove(char **l, const char *s); |
49 | char **strv_uniq(char **l); | |
479ddcdf | 50 | bool strv_is_uniq(char * const *l); |
5f9a22c3 | 51 | |
8b75798d YW |
52 | int strv_compare(char * const *a, char * const *b); |
53 | static inline bool strv_equal(char * const *a, char * const *b) { | |
54 | return strv_compare(a, b) == 0; | |
55 | } | |
0f84a72e | 56 | |
5f9a22c3 | 57 | #define strv_contains(l, s) (!!strv_find((l), (s))) |
cba8922f | 58 | |
bea1a013 | 59 | char **strv_new_internal(const char *x, ...) _sentinel_; |
b231b547 | 60 | char **strv_new_ap(const char *x, va_list ap); |
bea1a013 | 61 | #define strv_new(...) strv_new_internal(__VA_ARGS__, NULL) |
60918275 | 62 | |
f9d14060 AK |
63 | #define STRV_IGNORE ((const char *) -1) |
64 | ||
07719a21 | 65 | static inline const char* STRV_IFNOTNULL(const char *x) { |
f9d14060 | 66 | return x ? x : STRV_IGNORE; |
07719a21 LP |
67 | } |
68 | ||
2fd9ae2e | 69 | static inline bool strv_isempty(char * const *l) { |
5f9a22c3 LP |
70 | return !l || !*l; |
71 | } | |
72 | ||
8059aa9c | 73 | char **strv_split_full(const char *s, const char *separator, SplitFlags flags); |
af0b60b3 | 74 | static inline char **strv_split(const char *s, const char *separator) { |
8059aa9c | 75 | return strv_split_full(s, separator, 0); |
af0b60b3 | 76 | } |
b231b547 | 77 | char **strv_split_newlines(const char *s); |
5f9a22c3 | 78 | |
8adaf7bd | 79 | int strv_split_extract(char ***t, const char *s, const char *separators, ExtractFlags flags); |
f88e6be5 | 80 | |
479ddcdf YW |
81 | char *strv_join_prefix(char * const *l, const char *separator, const char *prefix); |
82 | static inline char *strv_join(char * const *l, const char *separator) { | |
2b9a7d2e YW |
83 | return strv_join_prefix(l, separator, NULL); |
84 | } | |
5f9a22c3 | 85 | |
21bc923a | 86 | char **strv_parse_nulstr(const char *s, size_t l); |
fabe5c0e | 87 | char **strv_split_nulstr(const char *s); |
479ddcdf | 88 | int strv_make_nulstr(char * const *l, char **p, size_t *n); |
21bc923a | 89 | |
479ddcdf | 90 | bool strv_overlap(char * const *a, char * const *b) _pure_; |
0c85a4f3 | 91 | |
60918275 | 92 | #define STRV_FOREACH(s, l) \ |
cba8922f | 93 | for ((s) = (l); (s) && *(s); (s)++) |
60918275 | 94 | |
4a39c774 LP |
95 | #define STRV_FOREACH_BACKWARDS(s, l) \ |
96 | for (s = ({ \ | |
97 | char **_l = l; \ | |
98 | _l ? _l + strv_length(_l) - 1U : NULL; \ | |
99 | }); \ | |
100 | (l) && ((s) >= (l)); \ | |
101 | (s)--) | |
857a493d | 102 | |
246aa6dd | 103 | #define STRV_FOREACH_PAIR(x, y, l) \ |
961e4526 | 104 | for ((x) = (l), (y) = (x+1); (x) && *(x) && *(y); (x) += 2, (y) = (x + 1)) |
246aa6dd | 105 | |
857a493d | 106 | char **strv_sort(char **l); |
479ddcdf | 107 | void strv_print(char * const *l); |
250a918d | 108 | |
897e7561 LP |
109 | #define STRV_MAKE(...) ((char**) ((const char*[]) { __VA_ARGS__, NULL })) |
110 | ||
111 | #define STRV_MAKE_EMPTY ((char*[1]) { NULL }) | |
112 | ||
250a918d LP |
113 | #define strv_from_stdarg_alloca(first) \ |
114 | ({ \ | |
115 | char **_l; \ | |
116 | \ | |
117 | if (!first) \ | |
897e7561 | 118 | _l = (char**) &first; \ |
250a918d | 119 | else { \ |
da6053d0 | 120 | size_t _n; \ |
250a918d LP |
121 | va_list _ap; \ |
122 | \ | |
123 | _n = 1; \ | |
124 | va_start(_ap, first); \ | |
125 | while (va_arg(_ap, char*)) \ | |
126 | _n++; \ | |
127 | va_end(_ap); \ | |
128 | \ | |
129 | _l = newa(char*, _n+1); \ | |
130 | _l[_n = 0] = (char*) first; \ | |
131 | va_start(_ap, first); \ | |
132 | for (;;) { \ | |
133 | _l[++_n] = va_arg(_ap, char*); \ | |
134 | if (!_l[_n]) \ | |
135 | break; \ | |
136 | } \ | |
137 | va_end(_ap); \ | |
138 | } \ | |
139 | _l; \ | |
140 | }) | |
53ede806 LP |
141 | |
142 | #define STR_IN_SET(x, ...) strv_contains(STRV_MAKE(__VA_ARGS__), x) | |
c7bf9d51 ZJS |
143 | #define STRPTR_IN_SET(x, ...) \ |
144 | ({ \ | |
145 | const char* _x = (x); \ | |
146 | _x && strv_contains(STRV_MAKE(__VA_ARGS__), _x); \ | |
147 | }) | |
c4a7b2c5 | 148 | |
52f15520 LP |
149 | #define STARTSWITH_SET(p, ...) \ |
150 | ({ \ | |
151 | const char *_p = (p); \ | |
152 | char *_found = NULL, **_i; \ | |
153 | STRV_FOREACH(_i, STRV_MAKE(__VA_ARGS__)) { \ | |
154 | _found = startswith(_p, *_i); \ | |
155 | if (_found) \ | |
156 | break; \ | |
157 | } \ | |
158 | _found; \ | |
159 | }) | |
160 | ||
890befcf ZJS |
161 | #define ENDSWITH_SET(p, ...) \ |
162 | ({ \ | |
163 | const char *_p = (p); \ | |
164 | char *_found = NULL, **_i; \ | |
165 | STRV_FOREACH(_i, STRV_MAKE(__VA_ARGS__)) { \ | |
166 | _found = endswith(_p, *_i); \ | |
167 | if (_found) \ | |
168 | break; \ | |
169 | } \ | |
170 | _found; \ | |
171 | }) | |
172 | ||
66a64081 LP |
173 | #define FOREACH_STRING(x, y, ...) \ |
174 | for (char **_l = STRV_MAKE(({ x = y; }), ##__VA_ARGS__); \ | |
175 | x; \ | |
176 | x = *(++_l)) | |
e1dd6790 LP |
177 | |
178 | char **strv_reverse(char **l); | |
04c14b25 | 179 | char **strv_shell_escape(char **l, const char *bad); |
bceccd5e | 180 | |
0ef84b80 | 181 | bool strv_fnmatch_full(char* const* patterns, const char *s, int flags, size_t *matched_pos); |
191a3f16 ZJS |
182 | static inline bool strv_fnmatch(char* const* patterns, const char *s) { |
183 | return strv_fnmatch_full(patterns, s, 0, NULL); | |
0ef84b80 | 184 | } |
bceccd5e | 185 | |
2404701e | 186 | static inline bool strv_fnmatch_or_empty(char* const* patterns, const char *s, int flags) { |
bceccd5e ZJS |
187 | assert(s); |
188 | return strv_isempty(patterns) || | |
191a3f16 | 189 | strv_fnmatch_full(patterns, s, flags, NULL); |
bceccd5e | 190 | } |
fe382237 LP |
191 | |
192 | char ***strv_free_free(char ***l); | |
9ecdba8c | 193 | DEFINE_TRIVIAL_CLEANUP_FUNC(char***, strv_free_free); |
e3ead6bb LP |
194 | |
195 | char **strv_skip(char **l, size_t n); | |
8dd4c05b LP |
196 | |
197 | int strv_extend_n(char ***l, const char *value, size_t n); | |
3df9bec5 | 198 | |
479ddcdf | 199 | int fputstrv(FILE *f, char * const *l, const char *separator, bool *space); |
b302a50d LP |
200 | |
201 | #define strv_free_and_replace(a, b) \ | |
202 | ({ \ | |
203 | strv_free(a); \ | |
204 | (a) = (b); \ | |
205 | (b) = NULL; \ | |
206 | 0; \ | |
207 | }) | |
cde79109 ZJS |
208 | |
209 | extern const struct hash_ops string_strv_hash_ops; | |
210 | int string_strv_hashmap_put(Hashmap **h, const char *key, const char *value); | |
211 | int string_strv_ordered_hashmap_put(OrderedHashmap **h, const char *key, const char *value); |