]>
git.ipfire.org Git - thirdparty/systemd.git/blob - src/basic/string-util.h
1 /* SPDX-License-Identifier: LGPL-2.1+ */
11 /* What is interpreted as whitespace? */
12 #define WHITESPACE " \t\n\r"
13 #define NEWLINE "\n\r"
16 #define GLOB_CHARS "*?["
17 #define DIGITS "0123456789"
18 #define LOWERCASE_LETTERS "abcdefghijklmnopqrstuvwxyz"
19 #define UPPERCASE_LETTERS "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
20 #define LETTERS LOWERCASE_LETTERS UPPERCASE_LETTERS
21 #define ALPHANUMERICAL LETTERS DIGITS
22 #define HEXDIGITS DIGITS "abcdefABCDEF"
24 #define streq(a,b) (strcmp((a),(b)) == 0)
25 #define strneq(a, b, n) (strncmp((a), (b), (n)) == 0)
26 #define strcaseeq(a,b) (strcasecmp((a),(b)) == 0)
27 #define strncaseeq(a, b, n) (strncasecmp((a), (b), (n)) == 0)
29 int strcmp_ptr(const char *a
, const char *b
) _pure_
;
31 static inline bool streq_ptr(const char *a
, const char *b
) {
32 return strcmp_ptr(a
, b
) == 0;
35 static inline const char* strempty(const char *s
) {
39 static inline const char* strnull(const char *s
) {
43 static inline const char *strna(const char *s
) {
47 static inline bool isempty(const char *p
) {
51 static inline const char *empty_to_null(const char *p
) {
52 return isempty(p
) ? NULL
: p
;
55 static inline const char *empty_to_dash(const char *str
) {
56 return isempty(str
) ? "-" : str
;
59 static inline char *startswith(const char *s
, const char *prefix
) {
63 if (strncmp(s
, prefix
, l
) == 0)
69 static inline char *startswith_no_case(const char *s
, const char *prefix
) {
73 if (strncasecmp(s
, prefix
, l
) == 0)
79 char *endswith(const char *s
, const char *postfix
) _pure_
;
80 char *endswith_no_case(const char *s
, const char *postfix
) _pure_
;
82 char *first_word(const char *s
, const char *word
) _pure_
;
84 typedef enum SplitFlags
{
85 SPLIT_QUOTES
= 0x01 << 0,
86 SPLIT_RELAX
= 0x01 << 1,
89 const char* split(const char **state
, size_t *l
, const char *separator
, SplitFlags flags
);
91 #define FOREACH_WORD(word, length, s, state) \
92 _FOREACH_WORD(word, length, s, WHITESPACE, 0, state)
94 #define FOREACH_WORD_SEPARATOR(word, length, s, separator, state) \
95 _FOREACH_WORD(word, length, s, separator, 0, state)
97 #define _FOREACH_WORD(word, length, s, separator, flags, state) \
98 for ((state) = (s), (word) = split(&(state), &(length), (separator), (flags)); (word); (word) = split(&(state), &(length), (separator), (flags)))
100 char *strappend(const char *s
, const char *suffix
);
101 char *strnappend(const char *s
, const char *suffix
, size_t length
);
103 char *strjoin_real(const char *x
, ...) _sentinel_
;
104 #define strjoin(a, ...) strjoin_real((a), __VA_ARGS__, NULL)
106 #define strjoina(a, ...) \
108 const char *_appendees_[] = { a, __VA_ARGS__ }; \
112 for (_i_ = 0; _i_ < ELEMENTSOF(_appendees_) && _appendees_[_i_]; _i_++) \
113 _len_ += strlen(_appendees_[_i_]); \
114 _p_ = _d_ = alloca(_len_ + 1); \
115 for (_i_ = 0; _i_ < ELEMENTSOF(_appendees_) && _appendees_[_i_]; _i_++) \
116 _p_ = stpcpy(_p_, _appendees_[_i_]); \
121 char *strstrip(char *s
);
122 char *delete_chars(char *s
, const char *bad
);
123 char *delete_trailing_chars(char *s
, const char *bad
);
124 char *truncate_nl(char *s
);
126 static inline char *skip_leading_chars(const char *s
, const char *bad
) {
134 return (char*) s
+ strspn(s
, bad
);
137 char ascii_tolower(char x
);
138 char *ascii_strlower(char *s
);
139 char *ascii_strlower_n(char *s
, size_t n
);
141 char ascii_toupper(char x
);
142 char *ascii_strupper(char *s
);
144 int ascii_strcasecmp_n(const char *a
, const char *b
, size_t n
);
145 int ascii_strcasecmp_nn(const char *a
, size_t n
, const char *b
, size_t m
);
147 bool chars_intersect(const char *a
, const char *b
) _pure_
;
149 static inline bool _pure_
in_charset(const char *s
, const char* charset
) {
152 return s
[strspn(s
, charset
)] == '\0';
155 bool string_has_cc(const char *p
, const char *ok
) _pure_
;
157 char *ellipsize_mem(const char *s
, size_t old_length_bytes
, size_t new_length_columns
, unsigned percent
);
158 static inline char *ellipsize(const char *s
, size_t length
, unsigned percent
) {
159 return ellipsize_mem(s
, strlen(s
), length
, percent
);
162 char *cellescape(char *buf
, size_t len
, const char *s
);
164 /* This limit is arbitrary, enough to give some idea what the string contains */
165 #define CELLESCAPE_DEFAULT_LENGTH 64
167 bool nulstr_contains(const char *nulstr
, const char *needle
);
169 char* strshorten(char *s
, size_t l
);
171 char *strreplace(const char *text
, const char *old_string
, const char *new_string
);
173 char *strip_tab_ansi(char **ibuf
, size_t *_isz
, size_t highlight
[2]);
175 char *strextend_with_separator(char **x
, const char *separator
, ...) _sentinel_
;
177 #define strextend(x, ...) strextend_with_separator(x, NULL, __VA_ARGS__)
179 char *strrep(const char *s
, unsigned n
);
181 int split_pair(const char *s
, const char *sep
, char **l
, char **r
);
183 int free_and_strdup(char **p
, const char *s
);
184 int free_and_strndup(char **p
, const char *s
, size_t l
);
186 /* Normal memmem() requires haystack to be nonnull, which is annoying for zero-length buffers */
187 static inline void *memmem_safe(const void *haystack
, size_t haystacklen
, const void *needle
, size_t needlelen
) {
190 return (void*) haystack
;
192 if (haystacklen
< needlelen
)
198 return memmem(haystack
, haystacklen
, needle
, needlelen
);
201 #if HAVE_EXPLICIT_BZERO
202 static inline void* explicit_bzero_safe(void *p
, size_t l
) {
204 explicit_bzero(p
, l
);
209 void *explicit_bzero_safe(void *p
, size_t l
);
212 char *string_erase(char *x
);
214 char *string_free_erase(char *s
);
215 DEFINE_TRIVIAL_CLEANUP_FUNC(char *, string_free_erase
);
216 #define _cleanup_string_free_erase_ _cleanup_(string_free_erasep)
218 bool string_is_safe(const char *p
) _pure_
;
220 static inline size_t strlen_ptr(const char *s
) {
227 /* Like startswith(), but operates on arbitrary memory blocks */
228 static inline void *memory_startswith(const void *p
, size_t sz
, const char *token
) {
239 if (memcmp(p
, token
, n
) != 0)
242 return (uint8_t*) p
+ n
;
245 /* Like startswith_no_case(), but operates on arbitrary memory blocks.
246 * It works only for ASCII strings.
248 static inline void *memory_startswith_no_case(const void *p
, size_t sz
, const char *token
) {
259 for (i
= 0; i
< n
; i
++) {
260 if (ascii_tolower(((char *)p
)[i
]) != ascii_tolower(token
[i
]))
264 return (uint8_t*) p
+ n
;