12898275511

Committed 21 Jan 2025 10:06PM UTC coverage: 0.117%. Remained the same

Build # 12898275511

Build Type

push

github

Committed by

poettering

Commit Message

update TODO

Coverage Stats

478 of 408181 relevant lines covered (0.12%)

1.45 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

0.0

/src/basic/strv.h

/* SPDX-License-Identifier: LGPL-2.1-or-later */
#pragma once

#include <fnmatch.h>
#include <stdarg.h>
#include <stdbool.h>
#include <stddef.h>
#include <stdio.h>

#include "alloc-util.h"
#include "extract-word.h"
#include "hashmap.h"
#include "macro.h"
#include "string-util.h"

char* strv_find(char * const *l, const char *name) _pure_;
char* strv_find_case(char * const *l, const char *name) _pure_;
char* strv_find_prefix(char * const *l, const char *name) _pure_;
char* strv_find_startswith(char * const *l, const char *name) _pure_;
char* strv_find_closest(char * const *l, const char *name) _pure_;
/* Given two vectors, the first a list of keys and the second a list of key-value pairs, returns the value
 * of the first key from the first vector that is found in the second vector. */
char* strv_find_first_field(char * const *needles, char * const *haystack) _pure_;

#define strv_contains(l, s) (!!strv_find((l), (s)))
#define strv_contains_case(l, s) (!!strv_find_case((l), (s)))

char** strv_free(char **l);
DEFINE_TRIVIAL_CLEANUP_FUNC(char**, strv_free);
#define _cleanup_strv_free_ _cleanup_(strv_freep)

char** strv_free_erase(char **l);
DEFINE_TRIVIAL_CLEANUP_FUNC(char**, strv_free_erase);
#define _cleanup_strv_free_erase_ _cleanup_(strv_free_erasep)

void strv_free_many(char ***strvs, size_t n);

char** strv_copy_n(char * const *l, size_t n);
static inline char** strv_copy(char * const *l) {
        return strv_copy_n(l, SIZE_MAX);
}
int strv_copy_unless_empty(char * const *l, char ***ret);

size_t strv_length(char * const *l) _pure_;

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

int strv_extend_strv_biconcat(char ***a, const char *prefix, const char* const *b, const char *suffix);
static inline int strv_extend_strv_concat(char ***a, const char* const *b, const char *suffix) {
        return strv_extend_strv_biconcat(a, NULL, b, suffix);
}

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

/* _with_size() are lower-level functions where the size can be provided externally,
 * which allows us to skip iterating over the strv to find the end, which saves
 * a bit of time and reduces the complexity of appending from O(n²) to O(n). */

int strv_extend_with_size(char ***l, size_t *n, const char *value);
static inline int strv_extend(char ***l, const char *value) {
        return strv_extend_with_size(l, NULL, value);
}

int strv_extend_many_internal(char ***l, const char *value, ...);
#define strv_extend_many(l, ...) strv_extend_many_internal(l, __VA_ARGS__, POINTER_MAX)

int strv_extendf(char ***l, const char *format, ...) _printf_(2,3);

int strv_push_with_size(char ***l, size_t *n, char *value);
static inline int strv_push(char ***l, char *value) {
        return strv_push_with_size(l, NULL, value);
}
int strv_push_pair(char ***l, char *a, char *b);

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

static inline int strv_push_prepend(char ***l, char *value) {
        return strv_insert(l, 0, value);
}

int strv_consume_with_size(char ***l, size_t *n, char *value);
static inline int strv_consume(char ***l, char *value) {
        return strv_consume_with_size(l, NULL, value);
}

int strv_consume_pair(char ***l, char *a, char *b);
int strv_consume_prepend(char ***l, char *value);

char** strv_remove(char **l, const char *s);
char** strv_uniq(char **l);
bool strv_is_uniq(char * const *l);

int strv_compare(char * const *a, char * const *b);
static inline bool strv_equal(char * const *a, char * const *b) {
        return strv_compare(a, b) == 0;
}

bool strv_equal_ignore_order(char **a, char **b);

char** strv_new_internal(const char *x, ...) _sentinel_;
char** strv_new_ap(const char *x, va_list ap);
#define strv_new(...) strv_new_internal(__VA_ARGS__, NULL)

#define STRV_IGNORE ((const char *) POINTER_MAX)

static inline const char* STRV_IFNOTNULL(const char *x) {
        return x ?: STRV_IGNORE;
}

static inline bool strv_isempty(char * const *l) {
        return !l || !*l;
}

int strv_split_full(char ***t, const char *s, const char *separators, ExtractFlags flags);
static inline char** strv_split(const char *s, const char *separators) {
        char **ret;

        if (strv_split_full(&ret, s, separators, EXTRACT_RETAIN_ESCAPE) < 0)
                return NULL;

        return ret;
}

int strv_split_and_extend_full(char ***t, const char *s, const char *separators, bool filter_duplicates, ExtractFlags flags);
#define strv_split_and_extend(t, s, sep, dup) strv_split_and_extend_full(t, s, sep, dup, 0)

int strv_split_newlines_full(char ***ret, const char *s, ExtractFlags flags);
static inline char** strv_split_newlines(const char *s) {
        char **ret;

        if (strv_split_newlines_full(&ret, s, 0) < 0)
                return NULL;

        return ret;
}

/* Given a string containing white-space separated tuples of words themselves separated by ':',
 * returns a vector of strings. If the second element in a tuple is missing, the corresponding
 * string in the vector is an empty string. */
int strv_split_colon_pairs(char ***t, const char *s);

char* strv_join_full(char * const *l, const char *separator, const char *prefix, bool escape_separator);
static inline char *strv_join(char * const *l, const char *separator) {
        return strv_join_full(l, separator, NULL, false);
}

bool strv_overlap(char * const *a, char * const *b) _pure_;

#define _STRV_FOREACH_BACKWARDS(s, l, h, i)                             \
        for (typeof(*(l)) *s, *h = (l), *i = ({                         \
                                size_t _len = strv_length(h);           \
                                _len > 0 ? h + _len - 1 : NULL;         \
                        });                                             \
             (s = i);                                                   \
             i = PTR_SUB1(i, h))

#define STRV_FOREACH_BACKWARDS(s, l)                                    \
        _STRV_FOREACH_BACKWARDS(s, l, UNIQ_T(h, UNIQ), UNIQ_T(i, UNIQ))

#define _STRV_FOREACH_PAIR(x, y, l, i)                          \
        for (typeof(*(l)) *x, *y, *i = (l);                     \
             i && *(x = i) && *(y = i + 1);                     \
             i += 2)

#define STRV_FOREACH_PAIR(x, y, l)                      \
        _STRV_FOREACH_PAIR(x, y, l, UNIQ_T(i, UNIQ))

char** strv_sort(char **l);
char** strv_sort_uniq(char **l);
void strv_print_full(char * const *l, const char *prefix);
static inline void strv_print(char * const *l) {
        strv_print_full(l, NULL);
}

char* startswith_strv(const char *s, char * const *l);

#define STARTSWITH_SET(p, ...)                                  \
        startswith_strv(p, STRV_MAKE(__VA_ARGS__))

char* endswith_strv(const char *s, char * const *l);

#define ENDSWITH_SET(p, ...)                                    \
        endswith_strv(p, STRV_MAKE(__VA_ARGS__))

#define strv_from_stdarg_alloca(first)                          \
        ({                                                      \
                char **_l;                                      \
                                                                \
                if (!first)                                     \
                        _l = (char**) &first;                   \
                else {                                          \
                        size_t _n;                              \
                        va_list _ap;                            \
                                                                \
                        _n = 1;                                 \
                        va_start(_ap, first);                   \
                        while (va_arg(_ap, char*))              \
                                _n++;                           \
                        va_end(_ap);                            \
                                                                \
                        _l = newa(char*, _n+1);                 \
                        _l[_n = 0] = (char*) first;             \
                        va_start(_ap, first);                   \
                        for (;;) {                              \
                                _l[++_n] = va_arg(_ap, char*);  \
                                if (!_l[_n])                    \
                                        break;                  \
                        }                                       \
                        va_end(_ap);                            \
                }                                               \
                _l;                                             \
        })

#define STR_IN_SET(x, ...) strv_contains(STRV_MAKE(__VA_ARGS__), x)
#define STRPTR_IN_SET(x, ...)                                    \
        ({                                                       \
                const char* _x = (x);                            \
                _x && strv_contains(STRV_MAKE(__VA_ARGS__), _x); \
        })

#define STRCASE_IN_SET(x, ...) strv_contains_case(STRV_MAKE(__VA_ARGS__), x)
#define STRCASEPTR_IN_SET(x, ...)                                    \
        ({                                                       \
                const char* _x = (x);                            \
                _x && strv_contains_case(STRV_MAKE(__VA_ARGS__), _x); \
        })

#define _FOREACH_STRING(uniq, x, y, ...)                                \
        for (const char *x, * const*UNIQ_T(l, uniq) = STRV_MAKE_CONST(({ x = y; }), ##__VA_ARGS__); \
             x;                                                         \
             x = *(++UNIQ_T(l, uniq)))

#define FOREACH_STRING(x, y, ...)                       \
        _FOREACH_STRING(UNIQ, x, y, ##__VA_ARGS__)

char** strv_reverse(char **l);
char** strv_shell_escape(char **l, const char *bad);

bool strv_fnmatch_full(char* const* patterns, const char *s, int flags, size_t *ret_matched_pos);
static inline bool strv_fnmatch(char* const* patterns, const char *s) {
        return strv_fnmatch_full(patterns, s, 0, NULL);
}
static inline bool strv_fnmatch_or_empty(char* const* patterns, const char *s, int flags) {
        assert(s);
        return strv_isempty(patterns) ||
               strv_fnmatch_full(patterns, s, flags, NULL);
}

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

int strv_extend_n(char ***l, const char *value, size_t n);

int strv_extend_assignment(char ***l, const char *lhs, const char *rhs);

int fputstrv(FILE *f, char * const *l, const char *separator, bool *space);

#define strv_free_and_replace(a, b)             \
        free_and_replace_full(a, b, strv_free)

int _string_strv_hashmap_put(Hashmap **h, const char *key, const char *value  HASHMAP_DEBUG_PARAMS);
int _string_strv_ordered_hashmap_put(OrderedHashmap **h, const char *key, const char *value  HASHMAP_DEBUG_PARAMS);
#define string_strv_hashmap_put(h, k, v) _string_strv_hashmap_put(h, k, v  HASHMAP_DEBUG_SRC_ARGS)
#define string_strv_ordered_hashmap_put(h, k, v) _string_strv_ordered_hashmap_put(h, k, v  HASHMAP_DEBUG_SRC_ARGS)

int strv_rebreak_lines(char **l, size_t width, char ***ret);

1	/* SPDX-License-Identifier: LGPL-2.1-or-later */
2	#pragma once
3
4	#include <fnmatch.h>
5	#include <stdarg.h>
6	#include <stdbool.h>
7	#include <stddef.h>
8	#include <stdio.h>
9
10	#include "alloc-util.h"
11	#include "extract-word.h"
12	#include "hashmap.h"
13	#include "macro.h"
14	#include "string-util.h"
15
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_;
20	char* strv_find_closest(char * const l, const char name) _pure_;
21	/* Given two vectors, the first a list of keys and the second a list of key-value pairs, returns the value
22	* of the first key from the first vector that is found in the second vector. */
23	char* strv_find_first_field(char * const needles, char const *haystack) _pure_;
24
25	#define strv_contains(l, s) (!!strv_find((l), (s)))
26	#define strv_contains_case(l, s) (!!strv_find_case((l), (s)))
27
28	char strv_free(char l);
29	DEFINE_TRIVIAL_CLEANUP_FUNC(char**, strv_free);	×
30	#define _cleanup_strv_free_ _cleanup_(strv_freep)
31
32	char strv_free_erase(char l);
33	DEFINE_TRIVIAL_CLEANUP_FUNC(char**, strv_free_erase);	×
34	#define _cleanup_strv_free_erase_ _cleanup_(strv_free_erasep)
35
36	void strv_free_many(char ***strvs, size_t n);
37
38	char** strv_copy_n(char * const *l, size_t n);
39	static inline char** strv_copy(char * const *l) {	×
40	return strv_copy_n(l, SIZE_MAX);	×
41	}
42	int strv_copy_unless_empty(char * const l, char **ret);
43
44	size_t strv_length(char * const *l) _pure_;
45
46	int strv_extend_strv(char **a, char const *b, bool filter_duplicates);
47	int strv_extend_strv_consume(char *a, char b, bool filter_duplicates);
48
49	int strv_extend_strv_biconcat(char **a, const char prefix, const char* const b, const char suffix);
50	static inline int strv_extend_strv_concat(char **a, const char const b, const char suffix) {	×
51	return strv_extend_strv_biconcat(a, NULL, b, suffix);	×
52	}
53
54	int strv_prepend(char **l, const char value);
55
56	/* _with_size() are lower-level functions where the size can be provided externally,
57	* which allows us to skip iterating over the strv to find the end, which saves
58	* a bit of time and reduces the complexity of appending from O(n²) to O(n). */
59
60	int strv_extend_with_size(char **l, size_t n, const char *value);
61	static inline int strv_extend(char **l, const char value) {	×
62	return strv_extend_with_size(l, NULL, value);	×
63	}
64
65	int strv_extend_many_internal(char **l, const char value, ...);
66	#define strv_extend_many(l, ...) strv_extend_many_internal(l, __VA_ARGS__, POINTER_MAX)
67
68	int strv_extendf(char **l, const char format, ...) _printf_(2,3);
69
70	int strv_push_with_size(char **l, size_t n, char *value);
71	static inline int strv_push(char **l, char value) {	×
72	return strv_push_with_size(l, NULL, value);	×
73	}
74	int strv_push_pair(char **l, char a, char *b);
75
76	int strv_insert(char **l, size_t position, char value);
77
78	static inline int strv_push_prepend(char **l, char value) {	×
79	return strv_insert(l, 0, value);	×
80	}
81
82	int strv_consume_with_size(char **l, size_t n, char *value);
83	static inline int strv_consume(char **l, char value) {	×
84	return strv_consume_with_size(l, NULL, value);	×
85	}
86
87	int strv_consume_pair(char **l, char a, char *b);
88	int strv_consume_prepend(char **l, char value);
89
90	char strv_remove(char l, const char *s);
91	char strv_uniq(char l);
92	bool strv_is_uniq(char * const *l);
93
94	int strv_compare(char * const a, char const *b);
95	static inline bool strv_equal(char * const a, char const *b) {	×
96	return strv_compare(a, b) == 0;	×
97	}
98
99	bool strv_equal_ignore_order(char a, char b);
100
101	char** strv_new_internal(const char *x, ...) _sentinel_;
102	char** strv_new_ap(const char *x, va_list ap);
103	#define strv_new(...) strv_new_internal(__VA_ARGS__, NULL)
104
105	#define STRV_IGNORE ((const char *) POINTER_MAX)
106
107	static inline const char* STRV_IFNOTNULL(const char *x) {	×
108	return x ?: STRV_IGNORE;	×
109	}
110
111	static inline bool strv_isempty(char * const *l) {	×
112	return !l \|\| !*l;	×
113	}
114
115	int strv_split_full(char **t, const char s, const char *separators, ExtractFlags flags);
116	static inline char** strv_split(const char s, const char separators) {	×
117	char **ret;	×
118
119	if (strv_split_full(&ret, s, separators, EXTRACT_RETAIN_ESCAPE) < 0)	×
120	return NULL;	×
121
122	return ret;	×
123	}
124
125	int strv_split_and_extend_full(char **t, const char s, const char *separators, bool filter_duplicates, ExtractFlags flags);
126	#define strv_split_and_extend(t, s, sep, dup) strv_split_and_extend_full(t, s, sep, dup, 0)
127
128	int strv_split_newlines_full(char **ret, const char s, ExtractFlags flags);
129	static inline char** strv_split_newlines(const char *s) {	×
130	char **ret;	×
131
132	if (strv_split_newlines_full(&ret, s, 0) < 0)	×
133	return NULL;	×
134
135	return ret;	×
136	}
137
138	/* Given a string containing white-space separated tuples of words themselves separated by ':',
139	* returns a vector of strings. If the second element in a tuple is missing, the corresponding
140	* string in the vector is an empty string. */
141	int strv_split_colon_pairs(char **t, const char s);
142
143	char* strv_join_full(char * const l, const char separator, const char *prefix, bool escape_separator);
144	static inline char strv_join(char const l, const char separator) {	×
145	return strv_join_full(l, separator, NULL, false);	×
146	}
147
148	bool strv_overlap(char * const a, char const *b) _pure_;
149
150	#define _STRV_FOREACH_BACKWARDS(s, l, h, i) \
151	for (typeof((l)) s, h = (l), i = ({ \
152	size_t _len = strv_length(h); \
153	_len > 0 ? h + _len - 1 : NULL; \
154	}); \
155	(s = i); \
156	i = PTR_SUB1(i, h))
157
158	#define STRV_FOREACH_BACKWARDS(s, l) \
159	_STRV_FOREACH_BACKWARDS(s, l, UNIQ_T(h, UNIQ), UNIQ_T(i, UNIQ))
160
161	#define _STRV_FOREACH_PAIR(x, y, l, i) \
162	for (typeof((l)) x, y, i = (l); \
163	i && (x = i) && (y = i + 1); \
164	i += 2)
165
166	#define STRV_FOREACH_PAIR(x, y, l) \
167	_STRV_FOREACH_PAIR(x, y, l, UNIQ_T(i, UNIQ))
168
169	char strv_sort(char l);
170	char strv_sort_uniq(char l);
171	void strv_print_full(char * const l, const char prefix);
172	static inline void strv_print(char * const *l) {	×
173	strv_print_full(l, NULL);	×
174	}	×
175
176	char* startswith_strv(const char s, char const *l);
177
178	#define STARTSWITH_SET(p, ...) \
179	startswith_strv(p, STRV_MAKE(__VA_ARGS__))
180
181	char* endswith_strv(const char s, char const *l);
182
183	#define ENDSWITH_SET(p, ...) \
184	endswith_strv(p, STRV_MAKE(__VA_ARGS__))
185
186	#define strv_from_stdarg_alloca(first) \
187	({ \
188	char **_l; \
189	\
190	if (!first) \
191	_l = (char**) &first; \
192	else { \
193	size_t _n; \
194	va_list _ap; \
195	\
196	_n = 1; \
197	va_start(_ap, first); \
198	while (va_arg(_ap, char*)) \
199	_n++; \
200	va_end(_ap); \
201	\
202	_l = newa(char*, _n+1); \
203	_l[_n = 0] = (char*) first; \
204	va_start(_ap, first); \
205	for (;;) { \
206	_l[++_n] = va_arg(_ap, char*); \
207	if (!_l[_n]) \
208	break; \
209	} \
210	va_end(_ap); \
211	} \
212	_l; \
213	})
214
215	#define STR_IN_SET(x, ...) strv_contains(STRV_MAKE(__VA_ARGS__), x)
216	#define STRPTR_IN_SET(x, ...) \
217	({ \
218	const char* _x = (x); \
219	_x && strv_contains(STRV_MAKE(__VA_ARGS__), _x); \
220	})
221
222	#define STRCASE_IN_SET(x, ...) strv_contains_case(STRV_MAKE(__VA_ARGS__), x)
223	#define STRCASEPTR_IN_SET(x, ...) \
224	({ \
225	const char* _x = (x); \
226	_x && strv_contains_case(STRV_MAKE(__VA_ARGS__), _x); \
227	})
228
229	#define _FOREACH_STRING(uniq, x, y, ...) \
230	for (const char x, const*UNIQ_T(l, uniq) = STRV_MAKE_CONST(({ x = y; }), ##__VA_ARGS__); \
231	x; \
232	x = *(++UNIQ_T(l, uniq)))
233
234	#define FOREACH_STRING(x, y, ...) \
235	_FOREACH_STRING(UNIQ, x, y, ##__VA_ARGS__)
236
237	char strv_reverse(char l);
238	char strv_shell_escape(char l, const char *bad);
239
240	bool strv_fnmatch_full(char* const* patterns, const char s, int flags, size_t ret_matched_pos);
241	static inline bool strv_fnmatch(char* const* patterns, const char *s) {	×
242	return strv_fnmatch_full(patterns, s, 0, NULL);	×
243	}
244	static inline bool strv_fnmatch_or_empty(char* const* patterns, const char *s, int flags) {	×
245	assert(s);	×
246	return strv_isempty(patterns) \|\|	×
247	strv_fnmatch_full(patterns, s, flags, NULL);	×
248	}
249
250	char strv_skip(char l, size_t n);
251
252	int strv_extend_n(char **l, const char value, size_t n);
253
254	int strv_extend_assignment(char **l, const char lhs, const char *rhs);
255
256	int fputstrv(FILE f, char const l, const char separator, bool *space);
257
258	#define strv_free_and_replace(a, b) \
259	free_and_replace_full(a, b, strv_free)
260
261	int _string_strv_hashmap_put(Hashmap *h, const char key, const char *value HASHMAP_DEBUG_PARAMS);
262	int _string_strv_ordered_hashmap_put(OrderedHashmap *h, const char key, const char *value HASHMAP_DEBUG_PARAMS);
263	#define string_strv_hashmap_put(h, k, v) _string_strv_hashmap_put(h, k, v HASHMAP_DEBUG_SRC_ARGS)
264	#define string_strv_ordered_hashmap_put(h, k, v) _string_strv_ordered_hashmap_put(h, k, v HASHMAP_DEBUG_SRC_ARGS)
265
266	int strv_rebreak_lines(char l, size_t width, char *ret);

systemd / systemd / 12898275511

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous