1 /*-*- Mode: C; c-basic-offset: 8; indent-tabs-mode: nil -*-*/
4 This file is part of systemd.
6 Copyright 2010 Lennart Poettering
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.
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.
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/>.
31 char *strv_find(char **l, const char *name) {
43 char *strv_find_prefix(char **l, const char *name) {
49 if (startswith(*i, name))
55 char *strv_find_startswith(char **l, const char *name) {
60 /* Like strv_find_prefix, but actually returns only the
61 * suffix, not the whole item */
64 e = startswith(*i, name);
72 void strv_free(char **l) {
84 char **strv_copy(char * const *l) {
87 k = r = new(char*, strv_length(l) + 1);
92 for (; *l; k++, l++) {
104 unsigned strv_length(char * const *l) {
116 char **strv_new_ap(const char *x, va_list ap) {
119 unsigned n = 0, i = 0;
122 /* As a special trick we ignore all listed strings that equal
123 * (const char*) -1. This is supposed to be used with the
124 * STRV_IFNOTNULL() macro to include possibly NULL strings in
125 * the string list. */
128 n = x == (const char*) -1 ? 0 : 1;
131 while ((s = va_arg(aq, const char*))) {
132 if (s == (const char*) -1)
146 if (x != (const char*) -1) {
153 while ((s = va_arg(ap, const char*))) {
155 if (s == (const char*) -1)
175 char **strv_new(const char *x, ...) {
180 r = strv_new_ap(x, ap);
186 int strv_extend_strv(char ***a, char **b) {
191 r = strv_extend(a, *s);
199 int strv_extend_strv_concat(char ***a, char **b, const char *suffix) {
206 v = strappend(*s, suffix);
220 char **strv_split(const char *s, const char *separator) {
221 const char *word, *state;
229 FOREACH_WORD_SEPARATOR(word, l, s, separator, state)
237 FOREACH_WORD_SEPARATOR(word, l, s, separator, state) {
238 r[i] = strndup(word, l);
251 int strv_split_quoted(char ***t, const char *s) {
252 const char *word, *state;
260 FOREACH_WORD_QUOTED(word, l, s, state)
271 FOREACH_WORD_QUOTED(word, l, s, state) {
272 r[i] = cunescape_length(word, l);
285 char **strv_split_newlines(const char *s) {
291 /* Special version of strv_split() that splits on newlines and
292 * suppresses an empty string at the end */
294 l = strv_split(s, NEWLINE);
302 if (isempty(l[n-1])) {
310 char *strv_join(char **l, const char *separator) {
318 k = strlen(separator);
334 e = stpcpy(e, separator);
344 char *strv_join_quoted(char **l) {
347 size_t allocated = 0, len = 0;
350 /* assuming here that escaped string cannot be more
351 * than twice as long, and reserving space for the
352 * separator and quotes.
354 _cleanup_free_ char *esc = NULL;
357 if (!GREEDY_REALLOC(buf, allocated,
358 len + strlen(*s) * 2 + 3))
365 needed = snprintf(buf + len, allocated - len, "%s\"%s\"",
366 len > 0 ? " " : "", esc);
367 assert(needed < allocated - len);
381 int strv_push(char ***l, char *value) {
389 c = realloc(*l, sizeof(char*) * (n + 2));
400 int strv_push_prepend(char ***l, char *value) {
408 c = new(char*, n + 2);
412 for (i = 0; i < n; i++)
424 int strv_consume(char ***l, char *value) {
427 r = strv_push(l, value);
434 int strv_consume_prepend(char ***l, char *value) {
437 r = strv_push_prepend(l, value);
444 int strv_extend(char ***l, const char *value) {
454 return strv_consume(l, v);
457 char **strv_uniq(char **l) {
460 /* Drops duplicate entries. The first identical string will be
461 * kept, the others dropped */
464 strv_remove(i+1, *i);
469 char **strv_remove(char **l, const char *s) {
477 /* Drops every occurrence of s in the string list, edits
480 for (f = t = l; *f; f++)
490 char **strv_parse_nulstr(const char *s, size_t l) {
492 unsigned c = 0, i = 0;
498 return new0(char*, 1);
500 for (p = s; p < s + l; p++)
507 v = new0(char*, c+1);
515 e = memchr(p, 0, s + l - p);
517 v[i] = strndup(p, e ? e - p : s + l - p);
536 char **strv_split_nulstr(const char *s) {
541 if (strv_extend(&r, i) < 0) {
547 return strv_new(NULL, NULL);
552 bool strv_overlap(char **a, char **b) {
556 if (strv_contains(b, *i))
562 static int str_compare(const void *_a, const void *_b) {
563 const char **a = (const char**) _a, **b = (const char**) _b;
565 return strcmp(*a, *b);
568 char **strv_sort(char **l) {
573 qsort(l, strv_length(l), sizeof(char*), str_compare);
577 void strv_print(char **l) {
584 int strv_extendf(char ***l, const char *format, ...) {
589 va_start(ap, format);
590 r = vasprintf(&x, format, ap);
596 return strv_consume(l, x);