2010-08-17 03:33:07 +02:00
|
|
|
/*-*- Mode: C; c-basic-offset: 8; indent-tabs-mode: nil -*-*/
|
2009-11-18 00:42:52 +01:00
|
|
|
|
2012-07-18 19:07:51 +02:00
|
|
|
#pragma once
|
2009-11-18 00:42:52 +01:00
|
|
|
|
2010-02-03 13:03:47 +01:00
|
|
|
/***
|
|
|
|
This file is part of systemd.
|
|
|
|
|
|
|
|
Copyright 2010 Lennart Poettering
|
|
|
|
|
|
|
|
systemd is free software; you can redistribute it and/or modify it
|
2012-04-12 00:20:58 +02:00
|
|
|
under the terms of the GNU Lesser General Public License as published by
|
|
|
|
the Free Software Foundation; either version 2.1 of the License, or
|
2010-02-03 13:03:47 +01:00
|
|
|
(at your option) any later version.
|
|
|
|
|
|
|
|
systemd is distributed in the hope that it will be useful, but
|
|
|
|
WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
2012-04-12 00:20:58 +02:00
|
|
|
Lesser General Public License for more details.
|
2010-02-03 13:03:47 +01:00
|
|
|
|
2012-04-12 00:20:58 +02:00
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
2010-02-03 13:03:47 +01:00
|
|
|
along with systemd; If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
***/
|
|
|
|
|
2010-04-21 22:15:06 +02:00
|
|
|
#include <stdarg.h>
|
|
|
|
#include <stdbool.h>
|
|
|
|
|
2013-10-13 02:28:21 +02:00
|
|
|
#include "util.h"
|
2009-11-18 00:42:52 +01:00
|
|
|
|
2013-05-03 04:51:50 +02:00
|
|
|
char *strv_find(char **l, const char *name) _pure_;
|
|
|
|
char *strv_find_prefix(char **l, const char *name) _pure_;
|
2010-06-16 05:06:02 +02:00
|
|
|
|
2009-11-18 00:42:52 +01:00
|
|
|
void strv_free(char **l);
|
2013-10-14 04:59:26 +02:00
|
|
|
DEFINE_TRIVIAL_CLEANUP_FUNC(char**, strv_free);
|
2013-04-16 05:25:57 +02:00
|
|
|
#define _cleanup_strv_free_ _cleanup_(strv_freep)
|
|
|
|
|
2013-04-26 01:47:43 +02:00
|
|
|
char **strv_copy(char * const *l);
|
2013-05-03 04:51:50 +02:00
|
|
|
unsigned strv_length(char * const *l) _pure_;
|
2009-11-18 00:42:52 +01:00
|
|
|
|
2010-01-26 04:18:44 +01:00
|
|
|
char **strv_merge(char **a, char **b);
|
2010-02-13 01:04:44 +01:00
|
|
|
char **strv_merge_concat(char **a, char **b, const char *suffix);
|
|
|
|
char **strv_append(char **l, const char *s);
|
2013-01-11 01:04:11 +01:00
|
|
|
int strv_extend(char ***l, const char *value);
|
2013-03-22 17:44:15 +01:00
|
|
|
int strv_push(char ***l, char *value);
|
2010-01-26 04:18:44 +01:00
|
|
|
|
2010-02-13 01:04:44 +01:00
|
|
|
char **strv_remove(char **l, const char *s);
|
2012-04-11 12:56:51 +02:00
|
|
|
char **strv_remove_prefix(char **l, const char *s);
|
2010-02-13 01:04:44 +01:00
|
|
|
char **strv_uniq(char **l);
|
|
|
|
|
|
|
|
#define strv_contains(l, s) (!!strv_find((l), (s)))
|
2010-01-27 22:38:21 +01:00
|
|
|
|
2013-04-26 01:47:43 +02:00
|
|
|
char **strv_new(const char *x, ...) _sentinel_;
|
|
|
|
char **strv_new_ap(const char *x, va_list ap);
|
2009-11-18 00:42:52 +01:00
|
|
|
|
2012-05-23 03:43:29 +02:00
|
|
|
static inline const char* STRV_IFNOTNULL(const char *x) {
|
|
|
|
return x ? x : (const char *) -1;
|
|
|
|
}
|
|
|
|
|
2013-03-25 02:30:32 +01:00
|
|
|
static inline bool strv_isempty(char * const *l) {
|
2010-02-13 01:04:44 +01:00
|
|
|
return !l || !*l;
|
|
|
|
}
|
|
|
|
|
2013-04-26 01:47:43 +02:00
|
|
|
char **strv_split(const char *s, const char *separator);
|
|
|
|
char **strv_split_quoted(const char *s);
|
|
|
|
char **strv_split_newlines(const char *s);
|
2010-02-13 01:04:44 +01:00
|
|
|
|
2013-04-26 01:47:43 +02:00
|
|
|
char *strv_join(char **l, const char *separator);
|
2013-08-31 20:28:09 +02:00
|
|
|
char *strv_join_quoted(char **l);
|
2010-02-13 01:04:44 +01:00
|
|
|
|
2011-02-23 01:12:07 +01:00
|
|
|
char **strv_parse_nulstr(const char *s, size_t l);
|
2013-02-11 23:48:36 +01:00
|
|
|
char **strv_split_nulstr(const char *s);
|
2011-02-23 01:12:07 +01:00
|
|
|
|
2013-05-03 04:51:50 +02:00
|
|
|
bool strv_overlap(char **a, char **b) _pure_;
|
2011-08-23 00:37:35 +02:00
|
|
|
|
2009-11-18 00:42:52 +01:00
|
|
|
#define STRV_FOREACH(s, l) \
|
2010-01-27 22:38:21 +01:00
|
|
|
for ((s) = (l); (s) && *(s); (s)++)
|
2009-11-18 00:42:52 +01:00
|
|
|
|
|
|
|
#define STRV_FOREACH_BACKWARDS(s, l) \
|
2013-10-26 16:41:22 +02:00
|
|
|
STRV_FOREACH(s, l) \
|
|
|
|
; \
|
|
|
|
for ((s)--; (l) && ((s) >= (l)); (s)--)
|
2012-10-19 04:52:25 +02:00
|
|
|
|
2013-01-12 04:24:12 +01:00
|
|
|
#define STRV_FOREACH_PAIR(x, y, l) \
|
2013-03-15 16:41:13 +01:00
|
|
|
for ((x) = (l), (y) = (x+1); (x) && *(x) && *(y); (x) += 2, (y) = (x + 1))
|
2013-01-12 04:24:12 +01:00
|
|
|
|
|
|
|
|
2012-10-19 04:52:25 +02:00
|
|
|
char **strv_sort(char **l);
|
2013-02-07 00:15:27 +01:00
|
|
|
void strv_print(char **l);
|