15263807472

/* SPDX-License-Identifier: LGPL-2.1-or-later */

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#include "fileio.h"
#include "ordered-set.h"
#include "strv.h"

int ordered_set_ensure_allocated(OrderedSet **s, const struct hash_ops *ops) {
        if (*s)
                return 0;

        *s = ordered_set_new(ops);
        if (!*s)
                return -ENOMEM;

        return 0;
}

int ordered_set_ensure_put(OrderedSet **s, const struct hash_ops *ops, void *p) {
        int r;

        r = ordered_set_ensure_allocated(s, ops);
        if (r < 0)
                return r;

        return ordered_set_put(*s, p);
}

int ordered_set_consume(OrderedSet *s, void *p) {
        int r;

        r = ordered_set_put(s, p);
        if (r <= 0)
                free(p);

        return r;
}

int ordered_set_put_strdup(OrderedSet **s, const char *p) {
        char *c;
        int r;

        assert(s);
        assert(p);

        r = ordered_set_ensure_allocated(s, &string_hash_ops_free);
        if (r < 0)
                return r;

        if (ordered_set_contains(*s, p))
                return 0;

        c = strdup(p);
        if (!c)
                return -ENOMEM;

        return ordered_set_consume(*s, c);
}

int ordered_set_put_strdupv(OrderedSet **s, char **l) {
        int n = 0, r;

        STRV_FOREACH(i, l) {
                r = ordered_set_put_strdup(s, *i);
                if (r < 0)
                        return r;

                n += r;
        }

        return n;
}

int ordered_set_put_string_set(OrderedSet **s, OrderedSet *l) {
        int n = 0, r;
        char *p;

        /* Like ordered_set_put_strv, but for an OrderedSet of strings */

        ORDERED_SET_FOREACH(p, l) {
                r = ordered_set_put_strdup(s, p);
                if (r < 0)
                        return r;

                n += r;
        }

        return n;
}

void ordered_set_print(FILE *f, const char *field, OrderedSet *s) {
        bool space = false;
        char *p;

        assert(f);
        assert(field);

        if (ordered_set_isempty(s))
                return;

        fputs(field, f);

        ORDERED_SET_FOREACH(p, s)
                fputs_with_separator(f, p, NULL, &space);

        fputc('\n', f);
}

1	/* SPDX-License-Identifier: LGPL-2.1-or-later */
2
3	#include <stdio.h>
4	#include <stdlib.h>
5	#include <string.h>
6
7	#include "fileio.h"
8	#include "ordered-set.h"
9	#include "strv.h"
10
11	int ordered_set_ensure_allocated(OrderedSet *s, const struct hash_ops ops) {	110,141✔
12	if (*s)	110,141✔
13	return 0;
14
15	*s = ordered_set_new(ops);	37,254✔
16	if (!*s)	37,254✔
UNCOV 17	return -ENOMEM;	×
18
19	return 0;
20	}
21
22	int ordered_set_ensure_put(OrderedSet *s, const struct hash_ops ops, void *p) {	90,611✔
23	int r;	90,611✔
24
25	r = ordered_set_ensure_allocated(s, ops);	90,611✔
26	if (r < 0)	90,611✔
27	return r;
28
29	return ordered_set_put(*s, p);	90,611✔
30	}
31
32	int ordered_set_consume(OrderedSet s, void p) {	3,157✔
33	int r;	3,157✔
34
35	r = ordered_set_put(s, p);	3,157✔
36	if (r <= 0)	3,157✔
37	free(p);	10✔
38
39	return r;	3,157✔
40	}
41
42	int ordered_set_put_strdup(OrderedSet *s, const char p) {	1,181✔
43	char *c;	1,181✔
44	int r;	1,181✔
45
46	assert(s);	1,181✔
47	assert(p);	1,181✔
48
49	r = ordered_set_ensure_allocated(s, &string_hash_ops_free);	1,181✔
50	if (r < 0)	1,181✔
51	return r;
52
53	if (ordered_set_contains(*s, p))	1,181✔
54	return 0;
55
56	c = strdup(p);	1,150✔
57	if (!c)	1,150✔
58	return -ENOMEM;
59
60	return ordered_set_consume(*s, c);	1,150✔
61	}
62
63	int ordered_set_put_strdupv(OrderedSet s, char l) {	11,896✔
64	int n = 0, r;	11,896✔
65
66	STRV_FOREACH(i, l) {	11,974✔
67	r = ordered_set_put_strdup(s, *i);	78✔
68	if (r < 0)	78✔
69	return r;
70
71	n += r;	78✔
72	}
73
74	return n;
75	}
76
77	int ordered_set_put_string_set(OrderedSet *s, OrderedSet l) {	23,751✔
78	int n = 0, r;	23,751✔
79	char *p;	23,751✔
80
81	/* Like ordered_set_put_strv, but for an OrderedSet of strings */
82
83	ORDERED_SET_FOREACH(p, l) {	23,923✔
84	r = ordered_set_put_strdup(s, p);	172✔
85	if (r < 0)	172✔
UNCOV 86	return r;	×
87
88	n += r;	172✔
89	}
90
91	return n;	23,751✔
92	}
93
94	void ordered_set_print(FILE f, const char field, OrderedSet *s) {	44,824✔
95	bool space = false;	44,824✔
96	char *p;	44,824✔
97
98	assert(f);	44,824✔
99	assert(field);	44,824✔
100
101	if (ordered_set_isempty(s))	44,824✔
102	return;	44,136✔
103
104	fputs(field, f);	688✔
105
106	ORDERED_SET_FOREACH(p, s)	1,826✔
107	fputs_with_separator(f, p, NULL, &space);	1,138✔
108
109	fputc('\n', f);	688✔
110	}

systemd / systemd / 15263807472

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous