3fb2326f3e
Possibly fixes #15220. (There might be another leak. I'm still investigating.) The leak would occur when the path cache was rebuilt. So in normal circumstances it wouldn't be too bad, since usually the path cache is not rebuilt too often. But the case in #15220, where new unit files are created in a loop and started, the leak occurs once for each unit file: $ for i in {1..300}; do cp ~/.config/systemd/user/test0001.service ~/.config/systemd/user/test$(printf %04d $i).service; systemctl --user start test$(printf %04d $i).service;done
139 lines
4.4 KiB
C
139 lines
4.4 KiB
C
/* SPDX-License-Identifier: LGPL-2.1+ */
|
|
#pragma once
|
|
|
|
#include "extract-word.h"
|
|
#include "hashmap.h"
|
|
#include "macro.h"
|
|
|
|
#define set_free_and_replace(a, b) \
|
|
({ \
|
|
set_free(a); \
|
|
(a) = (b); \
|
|
(b) = NULL; \
|
|
0; \
|
|
})
|
|
|
|
Set *internal_set_new(const struct hash_ops *hash_ops HASHMAP_DEBUG_PARAMS);
|
|
#define set_new(ops) internal_set_new(ops HASHMAP_DEBUG_SRC_ARGS)
|
|
|
|
static inline Set *set_free(Set *s) {
|
|
return (Set*) internal_hashmap_free(HASHMAP_BASE(s), NULL, NULL);
|
|
}
|
|
|
|
static inline Set *set_free_free(Set *s) {
|
|
return (Set*) internal_hashmap_free(HASHMAP_BASE(s), free, NULL);
|
|
}
|
|
|
|
/* no set_free_free_free */
|
|
|
|
static inline Set *set_copy(Set *s) {
|
|
return (Set*) internal_hashmap_copy(HASHMAP_BASE(s));
|
|
}
|
|
|
|
int internal_set_ensure_allocated(Set **s, const struct hash_ops *hash_ops HASHMAP_DEBUG_PARAMS);
|
|
#define set_ensure_allocated(h, ops) internal_set_ensure_allocated(h, ops HASHMAP_DEBUG_SRC_ARGS)
|
|
|
|
int set_put(Set *s, const void *key);
|
|
/* no set_update */
|
|
/* no set_replace */
|
|
static inline void *set_get(const Set *s, void *key) {
|
|
return internal_hashmap_get(HASHMAP_BASE((Set *) s), key);
|
|
}
|
|
/* no set_get2 */
|
|
|
|
static inline bool set_contains(const Set *s, const void *key) {
|
|
return internal_hashmap_contains(HASHMAP_BASE((Set *) s), key);
|
|
}
|
|
|
|
static inline void *set_remove(Set *s, const void *key) {
|
|
return internal_hashmap_remove(HASHMAP_BASE(s), key);
|
|
}
|
|
|
|
/* no set_remove2 */
|
|
/* no set_remove_value */
|
|
int set_remove_and_put(Set *s, const void *old_key, const void *new_key);
|
|
/* no set_remove_and_replace */
|
|
int set_merge(Set *s, Set *other);
|
|
|
|
static inline int set_reserve(Set *h, unsigned entries_add) {
|
|
return internal_hashmap_reserve(HASHMAP_BASE(h), entries_add);
|
|
}
|
|
|
|
static inline int set_move(Set *s, Set *other) {
|
|
return internal_hashmap_move(HASHMAP_BASE(s), HASHMAP_BASE(other));
|
|
}
|
|
|
|
static inline int set_move_one(Set *s, Set *other, const void *key) {
|
|
return internal_hashmap_move_one(HASHMAP_BASE(s), HASHMAP_BASE(other), key);
|
|
}
|
|
|
|
static inline unsigned set_size(const Set *s) {
|
|
return internal_hashmap_size(HASHMAP_BASE((Set *) s));
|
|
}
|
|
|
|
static inline bool set_isempty(const Set *s) {
|
|
return set_size(s) == 0;
|
|
}
|
|
|
|
static inline unsigned set_buckets(const Set *s) {
|
|
return internal_hashmap_buckets(HASHMAP_BASE((Set *) s));
|
|
}
|
|
|
|
bool set_iterate(const Set *s, Iterator *i, void **value);
|
|
|
|
static inline void set_clear(Set *s) {
|
|
internal_hashmap_clear(HASHMAP_BASE(s), NULL, NULL);
|
|
}
|
|
|
|
static inline void set_clear_free(Set *s) {
|
|
internal_hashmap_clear(HASHMAP_BASE(s), free, NULL);
|
|
}
|
|
|
|
/* no set_clear_free_free */
|
|
|
|
static inline void *set_steal_first(Set *s) {
|
|
return internal_hashmap_first_key_and_value(HASHMAP_BASE(s), true, NULL);
|
|
}
|
|
|
|
#define set_clear_with_destructor(_s, _f) \
|
|
({ \
|
|
void *_item; \
|
|
while ((_item = set_steal_first(_s))) \
|
|
_f(_item); \
|
|
})
|
|
#define set_free_with_destructor(_s, _f) \
|
|
({ \
|
|
set_clear_with_destructor(_s, _f); \
|
|
set_free(_s); \
|
|
})
|
|
|
|
/* no set_steal_first_key */
|
|
/* no set_first_key */
|
|
|
|
static inline void *set_first(const Set *s) {
|
|
return internal_hashmap_first_key_and_value(HASHMAP_BASE((Set *) s), false, NULL);
|
|
}
|
|
|
|
/* no set_next */
|
|
|
|
static inline char **set_get_strv(Set *s) {
|
|
return internal_hashmap_get_strv(HASHMAP_BASE(s));
|
|
}
|
|
|
|
int set_consume(Set *s, void *value);
|
|
int set_put_strdup(Set **s, const char *p);
|
|
int set_put_strdupv(Set **s, char **l);
|
|
int set_put_strsplit(Set *s, const char *v, const char *separators, ExtractFlags flags);
|
|
|
|
#define SET_FOREACH(e, s, i) \
|
|
for ((i) = ITERATOR_FIRST; set_iterate((s), &(i), (void**)&(e)); )
|
|
|
|
#define SET_FOREACH_MOVE(e, d, s) \
|
|
for (; ({ e = set_first(s); assert_se(!e || set_move_one(d, s, e) >= 0); e; }); )
|
|
|
|
DEFINE_TRIVIAL_CLEANUP_FUNC(Set*, set_free);
|
|
DEFINE_TRIVIAL_CLEANUP_FUNC(Set*, set_free_free);
|
|
|
|
#define _cleanup_set_free_ _cleanup_(set_freep)
|
|
#define _cleanup_set_free_free_ _cleanup_(set_free_freep)
|