4 This file is part of systemd.
6 Copyright 2010 Lennart Poettering
8 systemd is free software; you can redistribute it and/or modify it
9 under the terms of the GNU Lesser General Public License as published by
10 the Free Software Foundation; either version 2.1 of the License, or
11 (at your option) any later version.
13 systemd is distributed in the hope that it will be useful, but
14 WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 Lesser General Public License for more details.
18 You should have received a copy of the GNU Lesser General Public License
19 along with systemd; If not, see <http://www.gnu.org/licenses/>.
25 Set *internal_set_new(const struct hash_ops *hash_ops HASHMAP_DEBUG_PARAMS);
26 #define set_new(ops) internal_set_new(ops HASHMAP_DEBUG_SRC_ARGS)
28 static inline Set *set_free(Set *s) {
29 internal_hashmap_free(HASHMAP_BASE(s));
33 static inline Set *set_free_free(Set *s) {
34 internal_hashmap_free_free(HASHMAP_BASE(s));
38 /* no set_free_free_free */
40 static inline Set *set_copy(Set *s) {
41 return (Set*) internal_hashmap_copy(HASHMAP_BASE(s));
44 int internal_set_ensure_allocated(Set **s, const struct hash_ops *hash_ops HASHMAP_DEBUG_PARAMS);
45 #define set_ensure_allocated(h, ops) internal_set_ensure_allocated(h, ops HASHMAP_DEBUG_SRC_ARGS)
47 int set_put(Set *s, const void *key);
50 static inline void *set_get(Set *s, void *key) {
51 return internal_hashmap_get(HASHMAP_BASE(s), key);
55 static inline bool set_contains(Set *s, const void *key) {
56 return internal_hashmap_contains(HASHMAP_BASE(s), key);
59 static inline void *set_remove(Set *s, const void *key) {
60 return internal_hashmap_remove(HASHMAP_BASE(s), key);
64 /* no set_remove_value */
65 #if 0 /// UNNEEDED by elogind
66 int set_remove_and_put(Set *s, const void *old_key, const void *new_key);
68 /* no set_remove_and_replace */
69 int set_merge(Set *s, Set *other);
71 static inline int set_reserve(Set *h, unsigned entries_add) {
72 return internal_hashmap_reserve(HASHMAP_BASE(h), entries_add);
75 static inline int set_move(Set *s, Set *other) {
76 return internal_hashmap_move(HASHMAP_BASE(s), HASHMAP_BASE(other));
79 static inline int set_move_one(Set *s, Set *other, const void *key) {
80 return internal_hashmap_move_one(HASHMAP_BASE(s), HASHMAP_BASE(other), key);
83 static inline unsigned set_size(Set *s) {
84 return internal_hashmap_size(HASHMAP_BASE(s));
87 static inline bool set_isempty(Set *s) {
88 return set_size(s) == 0;
91 static inline unsigned set_buckets(Set *s) {
92 return internal_hashmap_buckets(HASHMAP_BASE(s));
95 bool set_iterate(Set *s, Iterator *i, void **value);
97 static inline void set_clear(Set *s) {
98 internal_hashmap_clear(HASHMAP_BASE(s));
101 static inline void set_clear_free(Set *s) {
102 internal_hashmap_clear_free(HASHMAP_BASE(s));
105 /* no set_clear_free_free */
107 static inline void *set_steal_first(Set *s) {
108 return internal_hashmap_steal_first(HASHMAP_BASE(s));
111 /* no set_steal_first_key */
112 /* no set_first_key */
114 static inline void *set_first(Set *s) {
115 return internal_hashmap_first(HASHMAP_BASE(s));
120 static inline char **set_get_strv(Set *s) {
121 return internal_hashmap_get_strv(HASHMAP_BASE(s));
124 int set_consume(Set *s, void *value);
125 int set_put_strdup(Set *s, const char *p);
126 #if 0 /// UNNEEDED by elogind
127 int set_put_strdupv(Set *s, char **l);
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)