return NULL;
n = 0;
- HASHMAP_FOREACH(item, h, it)
- sv[n++] = item;
+ HASHMAP_FOREACH(item, h, it) {
+ sv[n++] = item;
+ }
sv[n] = NULL;
return sv;
assert(name);
- STRV_FOREACH(i, l)
- if (streq(*i, name))
- return *i;
+ STRV_FOREACH(i, l) {
+ if (streq(*i, name))
+ return *i;
+ }
return NULL;
}
assert(name);
- STRV_FOREACH(i, l)
- if (startswith(*i, name))
- return *i;
+ STRV_FOREACH(i, l) {
+ if (startswith(*i, name))
+ return *i;
+ }
return NULL;
}
assert(s);
n = 0;
- FOREACH_WORD_SEPARATOR(w, l, s, separator, state)
- n++;
+ FOREACH_WORD_SEPARATOR(w, l, s, separator, state) {
+ n++;
+ }
r = new(char *, n + 1);
if (!r)
assert(s);
n = 0;
- FOREACH_WORD_QUOTED(w, l, s, state)
- n++;
+ FOREACH_WORD_QUOTED(w, l, s, state) {
+ n++;
+ }
r = new(char *, n + 1);
if (!r)
/* Drops duplicate entries. The first identical string will be
* kept, the others dropped */
- STRV_FOREACH(i, l)
- strv_remove(i + 1, *i);
-
+ STRV_FOREACH(i, l) {
+ strv_remove(i + 1, *i);
+ }
return l;
}
const char *i;
char **r = NULL;
- NULSTR_FOREACH(i, s)
- if (strv_extend(&r, i) < 0) {
- strv_free(r);
- return NULL;
+ NULSTR_FOREACH(i, s) {
+ if (strv_extend(&r, i) < 0) {
+ strv_free(r);
+ return NULL;
+ }
}
if (!r)
if (!l)
return;
- STRV_FOREACH(s, l)
- puts(*s);
+ STRV_FOREACH(s, l) {
+ puts(*s);
+ }
}