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)))
74 for (k = r; *l; k++, l++)
75 if (!(*k = strdup(*l)))
82 for (k--; k >= r; k--)
90 unsigned strv_length(char **l) {
102 char **strv_new_ap(const char *x, va_list ap) {
105 unsigned n = 0, i = 0;
113 while (va_arg(aq, const char*))
118 if (!(a = new(char*, n+1)))
122 if (!(a[i] = strdup(x))) {
129 while ((s = va_arg(ap, const char*))) {
130 if (!(a[i] = strdup(s)))
152 char **strv_new(const char *x, ...) {
157 r = strv_new_ap(x, ap);
163 char **strv_merge(char **a, char **b) {
172 if (!(r = new(char*, strv_length(a)+strv_length(b)+1)))
175 for (k = r; *a; k++, a++)
176 if (!(*k = strdup(*a)))
179 if (!(*k = strdup(*b)))
186 for (k--; k >= r; k--)
194 char **strv_merge_concat(char **a, char **b, const char *suffix) {
197 /* Like strv_merge(), but appends suffix to all strings in b, before adding */
202 if (!(r = new(char*, strv_length(a)+strv_length(b)+1)))
205 for (k = r; *a; k++, a++)
206 if (!(*k = strdup(*a)))
209 if (!(*k = strappend(*b, suffix)))
216 for (k--; k >= r; k--)
225 char **strv_split(const char *s, const char *separator) {
235 FOREACH_WORD_SEPARATOR(w, l, s, separator, state)
238 if (!(r = new(char*, n+1)))
242 FOREACH_WORD_SEPARATOR(w, l, s, separator, state)
243 if (!(r[i++] = strndup(w, l))) {
252 char **strv_split_quoted(const char *s) {
262 FOREACH_WORD_QUOTED(w, l, s, state)
265 if (!(r = new(char*, n+1)))
269 FOREACH_WORD_QUOTED(w, l, s, state)
270 if (!(r[i++] = cunescape_length(w, l))) {
279 char *strv_join(char **l, const char *separator) {
287 k = strlen(separator);
296 if (!(r = new(char, n+1)))
302 e = stpcpy(e, separator);
312 char **strv_append(char **l, const char *s) {
316 return strv_new(s, NULL);
321 if (!(r = new(char*, strv_length(l)+2)))
324 for (k = r; *l; k++, l++)
325 if (!(*k = strdup(*l)))
328 if (!(*(k++) = strdup(s)))
335 for (k--; k >= r; k--)
343 char **strv_uniq(char **l) {
346 /* Drops duplicate entries. The first identical string will be
347 * kept, the others dropped */
350 strv_remove(i+1, *i);
355 char **strv_remove(char **l, const char *s) {
361 /* Drops every occurrence of s in the string list */
363 for (f = t = l; *f; f++) {
377 static int env_append(char **r, char ***k, char **a) {
384 /* Add the entries of a to *k unless they already exist in *r
385 * in which case they are overridden instead. This assumes
386 * there is enough space in the r array. */
390 size_t n = strcspn(*a, "=") + 1;
392 for (j = r; j < *k; j++)
393 if (strncmp(*j, *a, n) == 0)
401 if (!(*j = strdup(*a)))
408 char **strv_env_merge(unsigned n_lists, ...) {
414 /* Merges an arbitrary number of environment sets */
416 va_start(ap, n_lists);
417 for (i = 0; i < n_lists; i++) {
418 l = va_arg(ap, char**);
423 if (!(r = new(char*, n+1)))
428 va_start(ap, n_lists);
429 for (i = 0; i < n_lists; i++) {
430 l = va_arg(ap, char**);
431 if (env_append(r, &k, l) < 0)
443 for (k--; k >= r; k--)
451 static bool env_match(const char *t, const char *pattern) {
455 /* pattern a matches string a
460 * a= does not match a
461 * a=b does not match a=
462 * a=b does not match a
463 * a=b does not match a=c */
465 if (streq(t, pattern))
468 if (!strchr(pattern, '=')) {
469 size_t l = strlen(pattern);
471 return strncmp(t, pattern, l) == 0 && t[l] == '=';
477 char **strv_env_delete(char **x, unsigned n_lists, ...) {
479 char **l, **k, **r, **j;
482 /* Deletes every entry from x that is mentioned in the other
487 if (!(r = new(char*, n+1)))
491 va_start(ap, n_lists);
493 for (i = 0; i < n_lists; i++) {
494 l = va_arg(ap, char**);
496 if (env_match(*k, *j))
502 if (!(r[i++] = strdup(*k))) {
520 char **strv_env_set(char **x, const char *p) {
524 if (!(r = new(char*, strv_length(x)+2)))
528 if (env_append(r, &k, x) < 0)
531 if (!(*(k++) = strdup(p)))
539 for (k--; k >= r; k--)
548 char *strv_env_get_with_length(char **l, const char *name, size_t k) {
554 if (strncmp(*i, name, k) == 0 &&
561 char *strv_env_get(char **l, const char *name) {
562 return strv_env_get_with_length(l, name, strlen(name));
565 char **strv_env_clean(char **l) {
568 for (r = ret = l; *l; l++) {
571 equal = strchr(*l, '=');
573 if (equal && equal[1] == 0) {
586 char **strv_parse_nulstr(const char *s, size_t l) {
588 unsigned c = 0, i = 0;
594 return strv_new(NULL, NULL);
596 for (p = s; p < s + l; p++)
603 if (!(v = new0(char*, c+1)))
610 e = memchr(p, 0, s + l - p);
612 if (!(v[i++] = strndup(p, e ? e - p : s + l - p))) {