}
static void print_subtree(const char *prefix, const char *path, char **l) {
- const char *vertical, *space;
- char **n;
-
/* We assume the list is sorted. Let's first skip over the
* entry we are looking at. */
for (;;) {
l++;
}
- vertical = strjoina(prefix, special_glyph(SPECIAL_GLYPH_TREE_VERTICAL));
- space = strjoina(prefix, special_glyph(SPECIAL_GLYPH_TREE_SPACE));
+ const char
+ *vertical = strjoina(prefix, special_glyph(SPECIAL_GLYPH_TREE_VERTICAL)),
+ *space = strjoina(prefix, special_glyph(SPECIAL_GLYPH_TREE_SPACE));
for (;;) {
bool has_more = false;
+ char **n;
if (!*l || !path_startswith(*l, path))
break;
_cleanup_(sd_bus_message_unrefp) sd_bus_message *reply_xml = NULL;
_cleanup_(sd_bus_error_free) sd_bus_error error = SD_BUS_ERROR_NULL;
_cleanup_(member_set_freep) Set *members = NULL;
- unsigned name_width, type_width, signature_width, result_width, j, k = 0;
- Member *m, **sorted = NULL;
+ unsigned name_width, type_width, signature_width, result_width;
+ Member *m;
const char *xml;
int r;
signature_width = strlen("SIGNATURE");
result_width = strlen("RESULT/VALUE");
- sorted = newa(Member*, set_size(members));
+ Member **sorted = newa(Member*, set_size(members));
+ size_t k = 0;
SET_FOREACH(m, members) {
if (argv[3] && !streq(argv[3], m->interface))
(int) result_width, "RESULT/VALUE",
"FLAGS");
- for (j = 0; j < k; j++) {
+ for (size_t j = 0; j < k; j++) {
_cleanup_free_ char *ellipsized = NULL;
const char *rv;
bool is_interface;