1 /* SPDX-License-Identifier: LGPL-2.1+ */
5 Copyright 2010 Lennart Poettering
8 #include "extract-word.h"
12 Set *internal_set_new(const struct hash_ops *hash_ops HASHMAP_DEBUG_PARAMS);
13 #define set_new(ops) internal_set_new(ops HASHMAP_DEBUG_SRC_ARGS)
15 static inline Set *set_free(Set *s) {
16 internal_hashmap_free(HASHMAP_BASE(s));
20 static inline Set *set_free_free(Set *s) {
21 internal_hashmap_free_free(HASHMAP_BASE(s));
25 /* no set_free_free_free */
27 static inline Set *set_copy(Set *s) {
28 return (Set*) internal_hashmap_copy(HASHMAP_BASE(s));
31 int internal_set_ensure_allocated(Set **s, const struct hash_ops *hash_ops HASHMAP_DEBUG_PARAMS);
32 #define set_ensure_allocated(h, ops) internal_set_ensure_allocated(h, ops HASHMAP_DEBUG_SRC_ARGS)
34 int set_put(Set *s, const void *key);
37 static inline void *set_get(Set *s, void *key) {
38 return internal_hashmap_get(HASHMAP_BASE(s), key);
42 static inline bool set_contains(Set *s, const void *key) {
43 return internal_hashmap_contains(HASHMAP_BASE(s), key);
46 static inline void *set_remove(Set *s, const void *key) {
47 return internal_hashmap_remove(HASHMAP_BASE(s), key);
51 /* no set_remove_value */
52 #if 0 /// UNNEEDED by elogind
53 int set_remove_and_put(Set *s, const void *old_key, const void *new_key);
55 /* no set_remove_and_replace */
56 int set_merge(Set *s, Set *other);
58 static inline int set_reserve(Set *h, unsigned entries_add) {
59 return internal_hashmap_reserve(HASHMAP_BASE(h), entries_add);
62 static inline int set_move(Set *s, Set *other) {
63 return internal_hashmap_move(HASHMAP_BASE(s), HASHMAP_BASE(other));
66 static inline int set_move_one(Set *s, Set *other, const void *key) {
67 return internal_hashmap_move_one(HASHMAP_BASE(s), HASHMAP_BASE(other), key);
70 static inline unsigned set_size(Set *s) {
71 return internal_hashmap_size(HASHMAP_BASE(s));
74 static inline bool set_isempty(Set *s) {
75 return set_size(s) == 0;
78 static inline unsigned set_buckets(Set *s) {
79 return internal_hashmap_buckets(HASHMAP_BASE(s));
82 bool set_iterate(Set *s, Iterator *i, void **value);
84 static inline void set_clear(Set *s) {
85 internal_hashmap_clear(HASHMAP_BASE(s));
88 static inline void set_clear_free(Set *s) {
89 internal_hashmap_clear_free(HASHMAP_BASE(s));
92 /* no set_clear_free_free */
94 static inline void *set_steal_first(Set *s) {
95 return internal_hashmap_steal_first(HASHMAP_BASE(s));
98 #define set_clear_with_destructor(_s, _f) \
101 while ((_item = set_steal_first(_s))) \
104 #define set_free_with_destructor(_s, _f) \
106 set_clear_with_destructor(_s, _f); \
110 /* no set_steal_first_key */
111 /* no set_first_key */
113 static inline void *set_first(Set *s) {
114 return internal_hashmap_first(HASHMAP_BASE(s));
119 static inline char **set_get_strv(Set *s) {
120 return internal_hashmap_get_strv(HASHMAP_BASE(s));
123 int set_consume(Set *s, void *value);
124 int set_put_strdup(Set *s, const char *p);
125 #if 0 /// UNNEEDED by elogind
126 int set_put_strdupv(Set *s, char **l);
127 int set_put_strsplit(Set *s, const char *v, const char *separators, ExtractFlags flags);
130 #define SET_FOREACH(e, s, i) \
131 for ((i) = ITERATOR_FIRST; set_iterate((s), &(i), (void**)&(e)); )
133 #define SET_FOREACH_MOVE(e, d, s) \
134 for (; ({ e = set_first(s); assert_se(!e || set_move_one(d, s, e) >= 0); e; }); )
136 DEFINE_TRIVIAL_CLEANUP_FUNC(Set*, set_free);
137 DEFINE_TRIVIAL_CLEANUP_FUNC(Set*, set_free_free);
139 #define _cleanup_set_free_ _cleanup_(set_freep)
140 #define _cleanup_set_free_free_ _cleanup_(set_free_freep)