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 General Public License as published by
10 the Free Software Foundation; either version 2 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 General Public License for more details.
18 You should have received a copy of the GNU 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 void strv_free(char **l) {
67 char **strv_copy(char **l) {
70 if (!(r = new(char*, strv_length(l)+1)))
73 for (k = r; *l; k++, l++)
74 if (!(*k = strdup(*l)))
81 for (k--; k >= r; k--)
89 unsigned strv_length(char **l) {
101 char **strv_new_ap(const char *x, va_list ap) {
104 unsigned n = 0, i = 0;
112 while (va_arg(aq, const char*))
117 if (!(a = new(char*, n+1)))
121 if (!(a[i] = strdup(x))) {
128 while ((s = va_arg(ap, const char*))) {
129 if (!(a[i] = strdup(s)))
151 char **strv_new(const char *x, ...) {
156 r = strv_new_ap(x, ap);
162 char **strv_merge(char **a, char **b) {
171 if (!(r = new(char*, strv_length(a)+strv_length(b)+1)))
174 for (k = r; *a; k++, a++)
175 if (!(*k = strdup(*a)))
178 if (!(*k = strdup(*b)))
185 for (k--; k >= r; k--)
193 char **strv_merge_concat(char **a, char **b, const char *suffix) {
196 /* Like strv_merge(), but appends suffix to all strings in b, before adding */
201 if (!(r = new(char*, strv_length(a)+strv_length(b)+1)))
204 for (k = r; *a; k++, a++)
205 if (!(*k = strdup(*a)))
208 if (!(*k = strappend(*b, suffix)))
215 for (k--; k >= r; k--)
224 char **strv_split(const char *s, const char *separator) {
234 FOREACH_WORD_SEPARATOR(w, l, s, separator, state)
237 if (!(r = new(char*, n+1)))
241 FOREACH_WORD_SEPARATOR(w, l, s, separator, state)
242 if (!(r[i++] = strndup(w, l))) {
251 char **strv_split_quoted(const char *s) {
261 FOREACH_WORD_QUOTED(w, l, s, state)
264 if (!(r = new(char*, n+1)))
268 FOREACH_WORD_QUOTED(w, l, s, state)
269 if (!(r[i++] = cunescape_length(w, l))) {
278 char *strv_join(char **l, const char *separator) {
286 k = strlen(separator);
295 if (!(r = new(char, n+1)))
301 e = stpcpy(e, separator);
311 char **strv_append(char **l, const char *s) {
315 return strv_new(s, NULL);
320 if (!(r = new(char*, strv_length(l)+2)))
323 for (k = r; *l; k++, l++)
324 if (!(*k = strdup(*l)))
327 if (!(*(k++) = strdup(s)))
334 for (k--; k >= r; k--)
342 char **strv_uniq(char **l) {
345 /* Drops duplicate entries. The first identical string will be
346 * kept, the others dropped */
349 strv_remove(i+1, *i);
354 char **strv_remove(char **l, const char *s) {
360 /* Drops every occurrence of s in the string list */
362 for (f = t = l; *f; f++) {
376 static int env_append(char **r, char ***k, char **a) {
383 /* Add the entries of a to *k unless they already exist in *r
384 * in which case they are overridden instead. This assumes
385 * there is enough space in the r array. */
389 size_t n = strcspn(*a, "=") + 1;
391 for (j = r; j < *k; j++)
392 if (strncmp(*j, *a, n) == 0)
400 if (!(*j = strdup(*a)))
407 char **strv_env_merge(unsigned n_lists, ...) {
413 /* Merges an arbitrary number of environment sets */
415 va_start(ap, n_lists);
416 for (i = 0; i < n_lists; i++) {
417 l = va_arg(ap, char**);
422 if (!(r = new(char*, n+1)))
427 va_start(ap, n_lists);
428 for (i = 0; i < n_lists; i++) {
429 l = va_arg(ap, char**);
430 if (env_append(r, &k, l) < 0)
442 for (k--; k >= r; k--)
450 static bool env_match(const char *t, const char *pattern) {
454 /* pattern a matches string a
459 * a= does not match a
460 * a=b does not match a=
461 * a=b does not match a
462 * a=b does not match a=c */
464 if (streq(t, pattern))
467 if (!strchr(pattern, '=')) {
468 size_t l = strlen(pattern);
470 return strncmp(t, pattern, l) == 0 && t[l] == '=';
476 char **strv_env_delete(char **x, unsigned n_lists, ...) {
478 char **l, **k, **r, **j;
481 /* Deletes every entry from x that is mentioned in the other
486 if (!(r = new(char*, n+1)))
490 va_start(ap, n_lists);
492 for (i = 0; i < n_lists; i++) {
493 l = va_arg(ap, char**);
495 if (env_match(*k, *j))
501 if (!(r[i++] = strdup(*k))) {
519 char **strv_env_set(char **x, const char *p) {
523 if (!(r = new(char*, strv_length(x)+2)))
527 if (env_append(r, &k, x) < 0)
530 if (!(*(k++) = strdup(p)))
538 for (k--; k >= r; k--)
547 char *strv_env_get_with_length(char **l, const char *name, size_t k) {
553 if (strncmp(*i, name, k) == 0 &&
560 char *strv_env_get(char **l, const char *name) {
561 return strv_env_get_with_length(l, name, strlen(name));
564 char **strv_env_clean(char **l) {
567 for (r = ret = l; *l; l++) {
570 equal = strchr(*l, '=');
572 if (equal && equal[1] == 0) {
585 char **strv_parse_nulstr(const char *s, size_t l) {
587 unsigned c = 0, i = 0;
593 return strv_new(NULL, NULL);
595 for (p = s; p < s + l; p++)
602 if (!(v = new0(char*, c+1)))
609 e = memchr(p, 0, s + l - p);
611 if (!(v[i++] = strndup(p, e ? e - p : s + l - p))) {