]>
Commit | Line | Data |
---|---|---|
db9ecf05 | 1 | /* SPDX-License-Identifier: LGPL-2.1-or-later */ |
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 | |
14337c37 ZJS |
16 | char* strv_find(char * const *l, const char *name) _pure_; |
17 | char* strv_find_case(char * const *l, const char *name) _pure_; | |
18 | char* strv_find_prefix(char * const *l, const char *name) _pure_; | |
19 | char* strv_find_startswith(char * const *l, const char *name) _pure_; | |
a4bfb399 | 20 | |
ddd6a22a LP |
21 | #define strv_contains(l, s) (!!strv_find((l), (s))) |
22 | #define strv_contains_case(l, s) (!!strv_find_case((l), (s))) | |
23 | ||
14337c37 | 24 | char** strv_free(char **l); |
14bf2c9d | 25 | DEFINE_TRIVIAL_CLEANUP_FUNC(char**, strv_free); |
dfb33a97 LP |
26 | #define _cleanup_strv_free_ _cleanup_(strv_freep) |
27 | ||
14337c37 | 28 | char** strv_free_erase(char **l); |
ab84f5b9 ZJS |
29 | DEFINE_TRIVIAL_CLEANUP_FUNC(char**, strv_free_erase); |
30 | #define _cleanup_strv_free_erase_ _cleanup_(strv_free_erasep) | |
31 | ||
14337c37 | 32 | char** strv_copy(char * const *l); |
da6053d0 | 33 | size_t strv_length(char * const *l) _pure_; |
60918275 | 34 | |
479ddcdf YW |
35 | int strv_extend_strv(char ***a, char * const *b, bool filter_duplicates); |
36 | int strv_extend_strv_concat(char ***a, char * const *b, const char *suffix); | |
82443be5 | 37 | int strv_prepend(char ***l, const char *value); |
5926ccca | 38 | int strv_extend(char ***l, const char *value); |
20e265d4 | 39 | int strv_extendf(char ***l, const char *format, ...) _printf_(2,0); |
4f4afc88 | 40 | int strv_extend_front(char ***l, const char *value); |
4468addc | 41 | int strv_push(char ***l, char *value); |
98940a3c | 42 | int strv_push_pair(char ***l, char *a, char *b); |
da6053d0 | 43 | int strv_insert(char ***l, size_t position, char *value); |
6e888894 ZJS |
44 | |
45 | static inline int strv_push_prepend(char ***l, char *value) { | |
46 | return strv_insert(l, 0, value); | |
47 | } | |
48 | ||
6e18964d | 49 | int strv_consume(char ***l, char *value); |
98940a3c | 50 | int strv_consume_pair(char ***l, char *a, char *b); |
9a00f57a | 51 | int strv_consume_prepend(char ***l, char *value); |
034c6ed7 | 52 | |
14337c37 ZJS |
53 | char** strv_remove(char **l, const char *s); |
54 | char** strv_uniq(char **l); | |
479ddcdf | 55 | bool strv_is_uniq(char * const *l); |
5f9a22c3 | 56 | |
8b75798d YW |
57 | int strv_compare(char * const *a, char * const *b); |
58 | static inline bool strv_equal(char * const *a, char * const *b) { | |
59 | return strv_compare(a, b) == 0; | |
60 | } | |
0f84a72e | 61 | |
14337c37 ZJS |
62 | char** strv_new_internal(const char *x, ...) _sentinel_; |
63 | char** strv_new_ap(const char *x, va_list ap); | |
bea1a013 | 64 | #define strv_new(...) strv_new_internal(__VA_ARGS__, NULL) |
60918275 | 65 | |
66032ef4 | 66 | #define STRV_IGNORE ((const char *) POINTER_MAX) |
f9d14060 | 67 | |
07719a21 | 68 | static inline const char* STRV_IFNOTNULL(const char *x) { |
f9d14060 | 69 | return x ? x : STRV_IGNORE; |
07719a21 LP |
70 | } |
71 | ||
2fd9ae2e | 72 | static inline bool strv_isempty(char * const *l) { |
5f9a22c3 LP |
73 | return !l || !*l; |
74 | } | |
75 | ||
90e30d76 | 76 | int strv_split_full(char ***t, const char *s, const char *separators, ExtractFlags flags); |
14337c37 | 77 | static inline char** strv_split(const char *s, const char *separators) { |
0645b83a | 78 | char **ret; |
0645b83a | 79 | |
f385c447 YW |
80 | if (strv_split_full(&ret, s, separators, 0) < 0) |
81 | return NULL; | |
82 | ||
83 | return ret; | |
84 | } | |
85 | ||
3c318caa FS |
86 | int strv_split_and_extend_full(char ***t, const char *s, const char *separators, bool filter_duplicates, ExtractFlags flags); |
87 | #define strv_split_and_extend(t, s, sep, dup) strv_split_and_extend_full(t, s, sep, dup, 0) | |
88 | ||
f385c447 | 89 | int strv_split_newlines_full(char ***ret, const char *s, ExtractFlags flags); |
14337c37 | 90 | static inline char** strv_split_newlines(const char *s) { |
f385c447 YW |
91 | char **ret; |
92 | ||
93 | if (strv_split_newlines_full(&ret, s, 0) < 0) | |
0645b83a ZJS |
94 | return NULL; |
95 | ||
96 | return ret; | |
97 | } | |
f88e6be5 | 98 | |
a082edd5 LB |
99 | /* Given a string containing white-space separated tuples of words themselves separated by ':', |
100 | * returns a vector of strings. If the second element in a tuple is missing, the corresponding | |
101 | * string in the vector is an empty string. */ | |
102 | int strv_split_colon_pairs(char ***t, const char *s); | |
103 | ||
14337c37 | 104 | char* strv_join_full(char * const *l, const char *separator, const char *prefix, bool escape_separtor); |
479ddcdf | 105 | static inline char *strv_join(char * const *l, const char *separator) { |
d4d9f034 | 106 | return strv_join_full(l, separator, NULL, false); |
2b9a7d2e | 107 | } |
5f9a22c3 | 108 | |
14337c37 ZJS |
109 | char** strv_parse_nulstr(const char *s, size_t l); |
110 | char** strv_split_nulstr(const char *s); | |
479ddcdf | 111 | int strv_make_nulstr(char * const *l, char **p, size_t *n); |
21bc923a | 112 | |
a7addf32 ZJS |
113 | static inline int strv_from_nulstr(char ***a, const char *nulstr) { |
114 | char **t; | |
115 | ||
116 | t = strv_split_nulstr(nulstr); | |
117 | if (!t) | |
118 | return -ENOMEM; | |
119 | *a = t; | |
120 | return 0; | |
121 | } | |
122 | ||
479ddcdf | 123 | bool strv_overlap(char * const *a, char * const *b) _pure_; |
0c85a4f3 | 124 | |
de010b0b YW |
125 | #define _STRV_FOREACH(s, l, i) \ |
126 | for (typeof(*(l)) *s, *i = (l); (s = i) && *i; i++) | |
127 | ||
60918275 | 128 | #define STRV_FOREACH(s, l) \ |
de010b0b YW |
129 | _STRV_FOREACH(s, l, UNIQ_T(i, UNIQ)) |
130 | ||
131 | #define _STRV_FOREACH_BACKWARDS(s, l, h, i) \ | |
132 | for (typeof(*(l)) *s, *h = (l), *i = ({ \ | |
133 | size_t _len = strv_length(h); \ | |
134 | _len > 0 ? h + _len - 1 : NULL; \ | |
135 | }); \ | |
136 | i && (s = i) >= h; \ | |
137 | i--) | |
138 | ||
139 | #define STRV_FOREACH_BACKWARDS(s, l) \ | |
140 | _STRV_FOREACH_BACKWARDS(s, l, UNIQ_T(h, UNIQ), UNIQ_T(i, UNIQ)) | |
60918275 | 141 | |
de010b0b YW |
142 | #define _STRV_FOREACH_PAIR(x, y, l, i) \ |
143 | for (typeof(*l) *x, *y, *i = (l); \ | |
144 | i && *(x = i) && *(y = i + 1); \ | |
145 | i += 2) | |
857a493d | 146 | |
de010b0b YW |
147 | #define STRV_FOREACH_PAIR(x, y, l) \ |
148 | _STRV_FOREACH_PAIR(x, y, l, UNIQ_T(i, UNIQ)) | |
246aa6dd | 149 | |
14337c37 | 150 | char** strv_sort(char **l); |
479ddcdf | 151 | void strv_print(char * const *l); |
250a918d LP |
152 | |
153 | #define strv_from_stdarg_alloca(first) \ | |
154 | ({ \ | |
155 | char **_l; \ | |
156 | \ | |
157 | if (!first) \ | |
897e7561 | 158 | _l = (char**) &first; \ |
250a918d | 159 | else { \ |
da6053d0 | 160 | size_t _n; \ |
250a918d LP |
161 | va_list _ap; \ |
162 | \ | |
163 | _n = 1; \ | |
164 | va_start(_ap, first); \ | |
165 | while (va_arg(_ap, char*)) \ | |
166 | _n++; \ | |
167 | va_end(_ap); \ | |
168 | \ | |
169 | _l = newa(char*, _n+1); \ | |
170 | _l[_n = 0] = (char*) first; \ | |
171 | va_start(_ap, first); \ | |
172 | for (;;) { \ | |
173 | _l[++_n] = va_arg(_ap, char*); \ | |
174 | if (!_l[_n]) \ | |
175 | break; \ | |
176 | } \ | |
177 | va_end(_ap); \ | |
178 | } \ | |
179 | _l; \ | |
180 | }) | |
53ede806 LP |
181 | |
182 | #define STR_IN_SET(x, ...) strv_contains(STRV_MAKE(__VA_ARGS__), x) | |
c7bf9d51 ZJS |
183 | #define STRPTR_IN_SET(x, ...) \ |
184 | ({ \ | |
185 | const char* _x = (x); \ | |
186 | _x && strv_contains(STRV_MAKE(__VA_ARGS__), _x); \ | |
187 | }) | |
c4a7b2c5 | 188 | |
ddd6a22a LP |
189 | #define STRCASE_IN_SET(x, ...) strv_contains_case(STRV_MAKE(__VA_ARGS__), x) |
190 | #define STRCASEPTR_IN_SET(x, ...) \ | |
191 | ({ \ | |
192 | const char* _x = (x); \ | |
193 | _x && strv_contains_case(STRV_MAKE(__VA_ARGS__), _x); \ | |
194 | }) | |
195 | ||
52f15520 LP |
196 | #define STARTSWITH_SET(p, ...) \ |
197 | ({ \ | |
198 | const char *_p = (p); \ | |
de010b0b | 199 | char *_found = NULL; \ |
52f15520 LP |
200 | STRV_FOREACH(_i, STRV_MAKE(__VA_ARGS__)) { \ |
201 | _found = startswith(_p, *_i); \ | |
202 | if (_found) \ | |
203 | break; \ | |
204 | } \ | |
205 | _found; \ | |
206 | }) | |
207 | ||
890befcf ZJS |
208 | #define ENDSWITH_SET(p, ...) \ |
209 | ({ \ | |
210 | const char *_p = (p); \ | |
de010b0b | 211 | char *_found = NULL; \ |
890befcf ZJS |
212 | STRV_FOREACH(_i, STRV_MAKE(__VA_ARGS__)) { \ |
213 | _found = endswith(_p, *_i); \ | |
214 | if (_found) \ | |
215 | break; \ | |
216 | } \ | |
217 | _found; \ | |
218 | }) | |
219 | ||
f85b12d6 LP |
220 | #define _FOREACH_STRING(uniq, x, y, ...) \ |
221 | for (char **UNIQ_T(l, uniq) = STRV_MAKE(({ x = y; }), ##__VA_ARGS__); \ | |
66a64081 | 222 | x; \ |
f85b12d6 LP |
223 | x = *(++UNIQ_T(l, uniq))) |
224 | ||
225 | #define FOREACH_STRING(x, y, ...) \ | |
226 | _FOREACH_STRING(UNIQ, x, y, ##__VA_ARGS__) | |
e1dd6790 | 227 | |
14337c37 ZJS |
228 | char** strv_reverse(char **l); |
229 | char** strv_shell_escape(char **l, const char *bad); | |
bceccd5e | 230 | |
0ef84b80 | 231 | bool strv_fnmatch_full(char* const* patterns, const char *s, int flags, size_t *matched_pos); |
191a3f16 ZJS |
232 | static inline bool strv_fnmatch(char* const* patterns, const char *s) { |
233 | return strv_fnmatch_full(patterns, s, 0, NULL); | |
0ef84b80 | 234 | } |
bceccd5e | 235 | |
2404701e | 236 | static inline bool strv_fnmatch_or_empty(char* const* patterns, const char *s, int flags) { |
bceccd5e ZJS |
237 | assert(s); |
238 | return strv_isempty(patterns) || | |
191a3f16 | 239 | strv_fnmatch_full(patterns, s, flags, NULL); |
bceccd5e | 240 | } |
fe382237 | 241 | |
14337c37 | 242 | char** strv_skip(char **l, size_t n); |
8dd4c05b LP |
243 | |
244 | int strv_extend_n(char ***l, const char *value, size_t n); | |
3df9bec5 | 245 | |
479ddcdf | 246 | int fputstrv(FILE *f, char * const *l, const char *separator, bool *space); |
b302a50d LP |
247 | |
248 | #define strv_free_and_replace(a, b) \ | |
249 | ({ \ | |
7ecc424f LP |
250 | char ***_a = &(a); \ |
251 | char ***_b = &(b); \ | |
252 | strv_free(*_a); \ | |
253 | (*_a) = (*_b); \ | |
254 | (*_b) = NULL; \ | |
b302a50d LP |
255 | 0; \ |
256 | }) | |
cde79109 ZJS |
257 | |
258 | extern const struct hash_ops string_strv_hash_ops; | |
856e5195 ZJS |
259 | int _string_strv_hashmap_put(Hashmap **h, const char *key, const char *value HASHMAP_DEBUG_PARAMS); |
260 | int _string_strv_ordered_hashmap_put(OrderedHashmap **h, const char *key, const char *value HASHMAP_DEBUG_PARAMS); | |
261 | #define string_strv_hashmap_put(h, k, v) _string_strv_hashmap_put(h, k, v HASHMAP_DEBUG_SRC_ARGS) | |
262 | #define string_strv_ordered_hashmap_put(h, k, v) _string_strv_ordered_hashmap_put(h, k, v HASHMAP_DEBUG_SRC_ARGS) |