450 lines
20 KiB
C
450 lines
20 KiB
C
/* SPDX-License-Identifier: LGPL-2.1-or-later */
|
|
#pragma once
|
|
|
|
#include <limits.h>
|
|
#include <stdbool.h>
|
|
#include <stddef.h>
|
|
|
|
#include "hash-funcs.h"
|
|
#include "macro.h"
|
|
#include "util.h"
|
|
|
|
/*
|
|
* A hash table implementation. As a minor optimization a NULL hashmap object
|
|
* will be treated as empty hashmap for all read operations. That way it is not
|
|
* necessary to instantiate an object for each Hashmap use.
|
|
*
|
|
* If ENABLE_DEBUG_HASHMAP is defined (by configuring with -Ddebug-extra=hashmap),
|
|
* the implementation will:
|
|
* - store extra data for debugging and statistics (see tools/gdb-sd_dump_hashmaps.py)
|
|
* - perform extra checks for invalid use of iterators
|
|
*/
|
|
|
|
#define HASH_KEY_SIZE 16
|
|
|
|
typedef void* (*hashmap_destroy_t)(void *p);
|
|
|
|
/* The base type for all hashmap and set types. Many functions in the implementation take (HashmapBase*)
|
|
* parameters and are run-time polymorphic, though the API is not meant to be polymorphic (do not call
|
|
* underscore-prefixed functions directly). */
|
|
typedef struct HashmapBase HashmapBase;
|
|
|
|
/* Specific hashmap/set types */
|
|
typedef struct Hashmap Hashmap; /* Maps keys to values */
|
|
typedef struct OrderedHashmap OrderedHashmap; /* Like Hashmap, but also remembers entry insertion order */
|
|
typedef struct Set Set; /* Stores just keys */
|
|
|
|
typedef struct IteratedCache IteratedCache; /* Caches the iterated order of one of the above */
|
|
|
|
/* Ideally the Iterator would be an opaque struct, but it is instantiated
|
|
* by hashmap users, so the definition has to be here. Do not use its fields
|
|
* directly. */
|
|
typedef struct {
|
|
unsigned idx; /* index of an entry to be iterated next */
|
|
const void *next_key; /* expected value of that entry's key pointer */
|
|
#if ENABLE_DEBUG_HASHMAP
|
|
unsigned put_count; /* hashmap's put_count recorded at start of iteration */
|
|
unsigned rem_count; /* hashmap's rem_count in previous iteration */
|
|
unsigned prev_idx; /* idx in previous iteration */
|
|
#endif
|
|
} Iterator;
|
|
|
|
#define _IDX_ITERATOR_FIRST (UINT_MAX - 1)
|
|
#define ITERATOR_FIRST ((Iterator) { .idx = _IDX_ITERATOR_FIRST, .next_key = NULL })
|
|
|
|
/* Macros for type checking */
|
|
#define PTR_COMPATIBLE_WITH_HASHMAP_BASE(h) \
|
|
(__builtin_types_compatible_p(typeof(h), HashmapBase*) || \
|
|
__builtin_types_compatible_p(typeof(h), Hashmap*) || \
|
|
__builtin_types_compatible_p(typeof(h), OrderedHashmap*) || \
|
|
__builtin_types_compatible_p(typeof(h), Set*))
|
|
|
|
#define PTR_COMPATIBLE_WITH_PLAIN_HASHMAP(h) \
|
|
(__builtin_types_compatible_p(typeof(h), Hashmap*) || \
|
|
__builtin_types_compatible_p(typeof(h), OrderedHashmap*)) \
|
|
|
|
#define HASHMAP_BASE(h) \
|
|
__builtin_choose_expr(PTR_COMPATIBLE_WITH_HASHMAP_BASE(h), \
|
|
(HashmapBase*)(h), \
|
|
(void)0)
|
|
|
|
#define PLAIN_HASHMAP(h) \
|
|
__builtin_choose_expr(PTR_COMPATIBLE_WITH_PLAIN_HASHMAP(h), \
|
|
(Hashmap*)(h), \
|
|
(void)0)
|
|
|
|
#if ENABLE_DEBUG_HASHMAP
|
|
# define HASHMAP_DEBUG_PARAMS , const char *func, const char *file, int line
|
|
# define HASHMAP_DEBUG_SRC_ARGS , __func__, PROJECT_FILE, __LINE__
|
|
# define HASHMAP_DEBUG_PASS_ARGS , func, file, line
|
|
#else
|
|
# define HASHMAP_DEBUG_PARAMS
|
|
# define HASHMAP_DEBUG_SRC_ARGS
|
|
# define HASHMAP_DEBUG_PASS_ARGS
|
|
#endif
|
|
|
|
Hashmap* _hashmap_new(const struct hash_ops *hash_ops HASHMAP_DEBUG_PARAMS);
|
|
OrderedHashmap* _ordered_hashmap_new(const struct hash_ops *hash_ops HASHMAP_DEBUG_PARAMS);
|
|
#define hashmap_new(ops) _hashmap_new(ops HASHMAP_DEBUG_SRC_ARGS)
|
|
#define ordered_hashmap_new(ops) _ordered_hashmap_new(ops HASHMAP_DEBUG_SRC_ARGS)
|
|
|
|
#define hashmap_free_and_replace(a, b) \
|
|
({ \
|
|
hashmap_free(a); \
|
|
(a) = (b); \
|
|
(b) = NULL; \
|
|
0; \
|
|
})
|
|
|
|
HashmapBase* _hashmap_free(HashmapBase *h, free_func_t default_free_key, free_func_t default_free_value);
|
|
static inline Hashmap* hashmap_free(Hashmap *h) {
|
|
return (void*) _hashmap_free(HASHMAP_BASE(h), NULL, NULL);
|
|
}
|
|
static inline OrderedHashmap* ordered_hashmap_free(OrderedHashmap *h) {
|
|
return (void*) _hashmap_free(HASHMAP_BASE(h), NULL, NULL);
|
|
}
|
|
|
|
static inline Hashmap* hashmap_free_free(Hashmap *h) {
|
|
return (void*) _hashmap_free(HASHMAP_BASE(h), NULL, free);
|
|
}
|
|
static inline OrderedHashmap* ordered_hashmap_free_free(OrderedHashmap *h) {
|
|
return (void*) _hashmap_free(HASHMAP_BASE(h), NULL, free);
|
|
}
|
|
|
|
static inline Hashmap* hashmap_free_free_key(Hashmap *h) {
|
|
return (void*) _hashmap_free(HASHMAP_BASE(h), free, NULL);
|
|
}
|
|
static inline OrderedHashmap* ordered_hashmap_free_free_key(OrderedHashmap *h) {
|
|
return (void*) _hashmap_free(HASHMAP_BASE(h), free, NULL);
|
|
}
|
|
|
|
static inline Hashmap* hashmap_free_free_free(Hashmap *h) {
|
|
return (void*) _hashmap_free(HASHMAP_BASE(h), free, free);
|
|
}
|
|
static inline OrderedHashmap* ordered_hashmap_free_free_free(OrderedHashmap *h) {
|
|
return (void*) _hashmap_free(HASHMAP_BASE(h), free, free);
|
|
}
|
|
|
|
IteratedCache* iterated_cache_free(IteratedCache *cache);
|
|
int iterated_cache_get(IteratedCache *cache, const void ***res_keys, const void ***res_values, unsigned *res_n_entries);
|
|
|
|
HashmapBase* _hashmap_copy(HashmapBase *h HASHMAP_DEBUG_PARAMS);
|
|
#define hashmap_copy(h) ((Hashmap*) _hashmap_copy(HASHMAP_BASE(h) HASHMAP_DEBUG_SRC_ARGS))
|
|
#define ordered_hashmap_copy(h) ((OrderedHashmap*) _hashmap_copy(HASHMAP_BASE(h) HASHMAP_DEBUG_SRC_ARGS))
|
|
|
|
int _hashmap_ensure_allocated(Hashmap **h, const struct hash_ops *hash_ops HASHMAP_DEBUG_PARAMS);
|
|
int _ordered_hashmap_ensure_allocated(OrderedHashmap **h, const struct hash_ops *hash_ops HASHMAP_DEBUG_PARAMS);
|
|
#define hashmap_ensure_allocated(h, ops) _hashmap_ensure_allocated(h, ops HASHMAP_DEBUG_SRC_ARGS)
|
|
#define ordered_hashmap_ensure_allocated(h, ops) _ordered_hashmap_ensure_allocated(h, ops HASHMAP_DEBUG_SRC_ARGS)
|
|
|
|
int _ordered_hashmap_ensure_put(OrderedHashmap **h, const struct hash_ops *hash_ops, const void *key, void *value HASHMAP_DEBUG_PARAMS);
|
|
#define ordered_hashmap_ensure_put(s, ops, key, value) _ordered_hashmap_ensure_put(s, ops, key, value HASHMAP_DEBUG_SRC_ARGS)
|
|
|
|
IteratedCache* _hashmap_iterated_cache_new(HashmapBase *h);
|
|
static inline IteratedCache* hashmap_iterated_cache_new(Hashmap *h) {
|
|
return (IteratedCache*) _hashmap_iterated_cache_new(HASHMAP_BASE(h));
|
|
}
|
|
static inline IteratedCache* ordered_hashmap_iterated_cache_new(OrderedHashmap *h) {
|
|
return (IteratedCache*) _hashmap_iterated_cache_new(HASHMAP_BASE(h));
|
|
}
|
|
|
|
int hashmap_put(Hashmap *h, const void *key, void *value);
|
|
static inline int ordered_hashmap_put(OrderedHashmap *h, const void *key, void *value) {
|
|
return hashmap_put(PLAIN_HASHMAP(h), key, value);
|
|
}
|
|
|
|
int _hashmap_put_strdup_full(Hashmap **h, const struct hash_ops *hash_ops, const char *k, const char *v HASHMAP_DEBUG_PARAMS);
|
|
#define hashmap_put_strdup_full(h, hash_ops, k, v) _hashmap_put_strdup_full(h, hash_ops, k, v HASHMAP_DEBUG_SRC_ARGS)
|
|
#define hashmap_put_strdup(h, k, v) hashmap_put_strdup_full(h, &string_hash_ops_free_free, k, v)
|
|
|
|
int hashmap_update(Hashmap *h, const void *key, void *value);
|
|
static inline int ordered_hashmap_update(OrderedHashmap *h, const void *key, void *value) {
|
|
return hashmap_update(PLAIN_HASHMAP(h), key, value);
|
|
}
|
|
|
|
int hashmap_replace(Hashmap *h, const void *key, void *value);
|
|
static inline int ordered_hashmap_replace(OrderedHashmap *h, const void *key, void *value) {
|
|
return hashmap_replace(PLAIN_HASHMAP(h), key, value);
|
|
}
|
|
|
|
void* _hashmap_get(HashmapBase *h, const void *key);
|
|
static inline void *hashmap_get(Hashmap *h, const void *key) {
|
|
return _hashmap_get(HASHMAP_BASE(h), key);
|
|
}
|
|
static inline void *ordered_hashmap_get(OrderedHashmap *h, const void *key) {
|
|
return _hashmap_get(HASHMAP_BASE(h), key);
|
|
}
|
|
|
|
void* hashmap_get2(Hashmap *h, const void *key, void **rkey);
|
|
static inline void *ordered_hashmap_get2(OrderedHashmap *h, const void *key, void **rkey) {
|
|
return hashmap_get2(PLAIN_HASHMAP(h), key, rkey);
|
|
}
|
|
|
|
bool _hashmap_contains(HashmapBase *h, const void *key);
|
|
static inline bool hashmap_contains(Hashmap *h, const void *key) {
|
|
return _hashmap_contains(HASHMAP_BASE(h), key);
|
|
}
|
|
static inline bool ordered_hashmap_contains(OrderedHashmap *h, const void *key) {
|
|
return _hashmap_contains(HASHMAP_BASE(h), key);
|
|
}
|
|
|
|
void* _hashmap_remove(HashmapBase *h, const void *key);
|
|
static inline void *hashmap_remove(Hashmap *h, const void *key) {
|
|
return _hashmap_remove(HASHMAP_BASE(h), key);
|
|
}
|
|
static inline void *ordered_hashmap_remove(OrderedHashmap *h, const void *key) {
|
|
return _hashmap_remove(HASHMAP_BASE(h), key);
|
|
}
|
|
|
|
void* hashmap_remove2(Hashmap *h, const void *key, void **rkey);
|
|
static inline void *ordered_hashmap_remove2(OrderedHashmap *h, const void *key, void **rkey) {
|
|
return hashmap_remove2(PLAIN_HASHMAP(h), key, rkey);
|
|
}
|
|
|
|
void* _hashmap_remove_value(HashmapBase *h, const void *key, void *value);
|
|
static inline void *hashmap_remove_value(Hashmap *h, const void *key, void *value) {
|
|
return _hashmap_remove_value(HASHMAP_BASE(h), key, value);
|
|
}
|
|
|
|
static inline void* ordered_hashmap_remove_value(OrderedHashmap *h, const void *key, void *value) {
|
|
return hashmap_remove_value(PLAIN_HASHMAP(h), key, value);
|
|
}
|
|
|
|
int hashmap_remove_and_put(Hashmap *h, const void *old_key, const void *new_key, void *value);
|
|
static inline int ordered_hashmap_remove_and_put(OrderedHashmap *h, const void *old_key, const void *new_key, void *value) {
|
|
return hashmap_remove_and_put(PLAIN_HASHMAP(h), old_key, new_key, value);
|
|
}
|
|
|
|
int hashmap_remove_and_replace(Hashmap *h, const void *old_key, const void *new_key, void *value);
|
|
static inline int ordered_hashmap_remove_and_replace(OrderedHashmap *h, const void *old_key, const void *new_key, void *value) {
|
|
return hashmap_remove_and_replace(PLAIN_HASHMAP(h), old_key, new_key, value);
|
|
}
|
|
|
|
/* Since merging data from a OrderedHashmap into a Hashmap or vice-versa
|
|
* should just work, allow this by having looser type-checking here. */
|
|
int _hashmap_merge(Hashmap *h, Hashmap *other);
|
|
#define hashmap_merge(h, other) _hashmap_merge(PLAIN_HASHMAP(h), PLAIN_HASHMAP(other))
|
|
#define ordered_hashmap_merge(h, other) hashmap_merge(h, other)
|
|
|
|
int _hashmap_reserve(HashmapBase *h, unsigned entries_add);
|
|
static inline int hashmap_reserve(Hashmap *h, unsigned entries_add) {
|
|
return _hashmap_reserve(HASHMAP_BASE(h), entries_add);
|
|
}
|
|
static inline int ordered_hashmap_reserve(OrderedHashmap *h, unsigned entries_add) {
|
|
return _hashmap_reserve(HASHMAP_BASE(h), entries_add);
|
|
}
|
|
|
|
int _hashmap_move(HashmapBase *h, HashmapBase *other);
|
|
/* Unlike hashmap_merge, hashmap_move does not allow mixing the types. */
|
|
static inline int hashmap_move(Hashmap *h, Hashmap *other) {
|
|
return _hashmap_move(HASHMAP_BASE(h), HASHMAP_BASE(other));
|
|
}
|
|
static inline int ordered_hashmap_move(OrderedHashmap *h, OrderedHashmap *other) {
|
|
return _hashmap_move(HASHMAP_BASE(h), HASHMAP_BASE(other));
|
|
}
|
|
|
|
int _hashmap_move_one(HashmapBase *h, HashmapBase *other, const void *key);
|
|
static inline int hashmap_move_one(Hashmap *h, Hashmap *other, const void *key) {
|
|
return _hashmap_move_one(HASHMAP_BASE(h), HASHMAP_BASE(other), key);
|
|
}
|
|
static inline int ordered_hashmap_move_one(OrderedHashmap *h, OrderedHashmap *other, const void *key) {
|
|
return _hashmap_move_one(HASHMAP_BASE(h), HASHMAP_BASE(other), key);
|
|
}
|
|
|
|
unsigned _hashmap_size(HashmapBase *h) _pure_;
|
|
static inline unsigned hashmap_size(Hashmap *h) {
|
|
return _hashmap_size(HASHMAP_BASE(h));
|
|
}
|
|
static inline unsigned ordered_hashmap_size(OrderedHashmap *h) {
|
|
return _hashmap_size(HASHMAP_BASE(h));
|
|
}
|
|
|
|
static inline bool hashmap_isempty(Hashmap *h) {
|
|
return hashmap_size(h) == 0;
|
|
}
|
|
static inline bool ordered_hashmap_isempty(OrderedHashmap *h) {
|
|
return ordered_hashmap_size(h) == 0;
|
|
}
|
|
|
|
unsigned _hashmap_buckets(HashmapBase *h) _pure_;
|
|
static inline unsigned hashmap_buckets(Hashmap *h) {
|
|
return _hashmap_buckets(HASHMAP_BASE(h));
|
|
}
|
|
static inline unsigned ordered_hashmap_buckets(OrderedHashmap *h) {
|
|
return _hashmap_buckets(HASHMAP_BASE(h));
|
|
}
|
|
|
|
bool _hashmap_iterate(HashmapBase *h, Iterator *i, void **value, const void **key);
|
|
static inline bool hashmap_iterate(Hashmap *h, Iterator *i, void **value, const void **key) {
|
|
return _hashmap_iterate(HASHMAP_BASE(h), i, value, key);
|
|
}
|
|
static inline bool ordered_hashmap_iterate(OrderedHashmap *h, Iterator *i, void **value, const void **key) {
|
|
return _hashmap_iterate(HASHMAP_BASE(h), i, value, key);
|
|
}
|
|
|
|
void _hashmap_clear(HashmapBase *h, free_func_t default_free_key, free_func_t default_free_value);
|
|
static inline void hashmap_clear(Hashmap *h) {
|
|
_hashmap_clear(HASHMAP_BASE(h), NULL, NULL);
|
|
}
|
|
static inline void ordered_hashmap_clear(OrderedHashmap *h) {
|
|
_hashmap_clear(HASHMAP_BASE(h), NULL, NULL);
|
|
}
|
|
|
|
static inline void hashmap_clear_free(Hashmap *h) {
|
|
_hashmap_clear(HASHMAP_BASE(h), NULL, free);
|
|
}
|
|
static inline void ordered_hashmap_clear_free(OrderedHashmap *h) {
|
|
_hashmap_clear(HASHMAP_BASE(h), NULL, free);
|
|
}
|
|
|
|
static inline void hashmap_clear_free_key(Hashmap *h) {
|
|
_hashmap_clear(HASHMAP_BASE(h), free, NULL);
|
|
}
|
|
static inline void ordered_hashmap_clear_free_key(OrderedHashmap *h) {
|
|
_hashmap_clear(HASHMAP_BASE(h), free, NULL);
|
|
}
|
|
|
|
static inline void hashmap_clear_free_free(Hashmap *h) {
|
|
_hashmap_clear(HASHMAP_BASE(h), free, free);
|
|
}
|
|
static inline void ordered_hashmap_clear_free_free(OrderedHashmap *h) {
|
|
_hashmap_clear(HASHMAP_BASE(h), free, free);
|
|
}
|
|
|
|
/*
|
|
* Note about all *_first*() functions
|
|
*
|
|
* For plain Hashmaps and Sets the order of entries is undefined.
|
|
* The functions find whatever entry is first in the implementation
|
|
* internal order.
|
|
*
|
|
* Only for OrderedHashmaps the order is well defined and finding
|
|
* the first entry is O(1).
|
|
*/
|
|
|
|
void *_hashmap_first_key_and_value(HashmapBase *h, bool remove, void **ret_key);
|
|
static inline void *hashmap_steal_first_key_and_value(Hashmap *h, void **ret) {
|
|
return _hashmap_first_key_and_value(HASHMAP_BASE(h), true, ret);
|
|
}
|
|
static inline void *ordered_hashmap_steal_first_key_and_value(OrderedHashmap *h, void **ret) {
|
|
return _hashmap_first_key_and_value(HASHMAP_BASE(h), true, ret);
|
|
}
|
|
static inline void *hashmap_first_key_and_value(Hashmap *h, void **ret) {
|
|
return _hashmap_first_key_and_value(HASHMAP_BASE(h), false, ret);
|
|
}
|
|
static inline void *ordered_hashmap_first_key_and_value(OrderedHashmap *h, void **ret) {
|
|
return _hashmap_first_key_and_value(HASHMAP_BASE(h), false, ret);
|
|
}
|
|
|
|
static inline void *hashmap_steal_first(Hashmap *h) {
|
|
return _hashmap_first_key_and_value(HASHMAP_BASE(h), true, NULL);
|
|
}
|
|
static inline void *ordered_hashmap_steal_first(OrderedHashmap *h) {
|
|
return _hashmap_first_key_and_value(HASHMAP_BASE(h), true, NULL);
|
|
}
|
|
static inline void *hashmap_first(Hashmap *h) {
|
|
return _hashmap_first_key_and_value(HASHMAP_BASE(h), false, NULL);
|
|
}
|
|
static inline void *ordered_hashmap_first(OrderedHashmap *h) {
|
|
return _hashmap_first_key_and_value(HASHMAP_BASE(h), false, NULL);
|
|
}
|
|
|
|
static inline void *_hashmap_first_key(HashmapBase *h, bool remove) {
|
|
void *key = NULL;
|
|
|
|
(void) _hashmap_first_key_and_value(HASHMAP_BASE(h), remove, &key);
|
|
return key;
|
|
}
|
|
static inline void *hashmap_steal_first_key(Hashmap *h) {
|
|
return _hashmap_first_key(HASHMAP_BASE(h), true);
|
|
}
|
|
static inline void *ordered_hashmap_steal_first_key(OrderedHashmap *h) {
|
|
return _hashmap_first_key(HASHMAP_BASE(h), true);
|
|
}
|
|
static inline void *hashmap_first_key(Hashmap *h) {
|
|
return _hashmap_first_key(HASHMAP_BASE(h), false);
|
|
}
|
|
static inline void *ordered_hashmap_first_key(OrderedHashmap *h) {
|
|
return _hashmap_first_key(HASHMAP_BASE(h), false);
|
|
}
|
|
|
|
#define hashmap_clear_with_destructor(_s, _f) \
|
|
({ \
|
|
void *_item; \
|
|
while ((_item = hashmap_steal_first(_s))) \
|
|
_f(_item); \
|
|
})
|
|
#define hashmap_free_with_destructor(_s, _f) \
|
|
({ \
|
|
hashmap_clear_with_destructor(_s, _f); \
|
|
hashmap_free(_s); \
|
|
})
|
|
#define ordered_hashmap_clear_with_destructor(_s, _f) \
|
|
({ \
|
|
void *_item; \
|
|
while ((_item = ordered_hashmap_steal_first(_s))) \
|
|
_f(_item); \
|
|
})
|
|
#define ordered_hashmap_free_with_destructor(_s, _f) \
|
|
({ \
|
|
ordered_hashmap_clear_with_destructor(_s, _f); \
|
|
ordered_hashmap_free(_s); \
|
|
})
|
|
|
|
/* no hashmap_next */
|
|
void* ordered_hashmap_next(OrderedHashmap *h, const void *key);
|
|
|
|
char** _hashmap_get_strv(HashmapBase *h);
|
|
static inline char** hashmap_get_strv(Hashmap *h) {
|
|
return _hashmap_get_strv(HASHMAP_BASE(h));
|
|
}
|
|
static inline char** ordered_hashmap_get_strv(OrderedHashmap *h) {
|
|
return _hashmap_get_strv(HASHMAP_BASE(h));
|
|
}
|
|
|
|
/*
|
|
* Hashmaps are iterated in unpredictable order.
|
|
* OrderedHashmaps are an exception to this. They are iterated in the order
|
|
* the entries were inserted.
|
|
* It is safe to remove the current entry.
|
|
*/
|
|
#define _HASHMAP_FOREACH(e, h, i) \
|
|
for (Iterator i = ITERATOR_FIRST; hashmap_iterate((h), &i, (void**)&(e), NULL); )
|
|
#define HASHMAP_FOREACH(e, h) \
|
|
_HASHMAP_FOREACH(e, h, UNIQ_T(i, UNIQ))
|
|
|
|
#define _ORDERED_HASHMAP_FOREACH(e, h, i) \
|
|
for (Iterator i = ITERATOR_FIRST; ordered_hashmap_iterate((h), &i, (void**)&(e), NULL); )
|
|
#define ORDERED_HASHMAP_FOREACH(e, h) \
|
|
_ORDERED_HASHMAP_FOREACH(e, h, UNIQ_T(i, UNIQ))
|
|
|
|
#define _HASHMAP_FOREACH_KEY(e, k, h, i) \
|
|
for (Iterator i = ITERATOR_FIRST; hashmap_iterate((h), &i, (void**)&(e), (const void**) &(k)); )
|
|
#define HASHMAP_FOREACH_KEY(e, k, h) \
|
|
_HASHMAP_FOREACH_KEY(e, k, h, UNIQ_T(i, UNIQ))
|
|
|
|
#define _ORDERED_HASHMAP_FOREACH_KEY(e, k, h, i) \
|
|
for (Iterator i = ITERATOR_FIRST; ordered_hashmap_iterate((h), &i, (void**)&(e), (const void**) &(k)); )
|
|
#define ORDERED_HASHMAP_FOREACH_KEY(e, k, h) \
|
|
_ORDERED_HASHMAP_FOREACH_KEY(e, k, h, UNIQ_T(i, UNIQ))
|
|
|
|
DEFINE_TRIVIAL_CLEANUP_FUNC(Hashmap*, hashmap_free);
|
|
DEFINE_TRIVIAL_CLEANUP_FUNC(Hashmap*, hashmap_free_free);
|
|
DEFINE_TRIVIAL_CLEANUP_FUNC(Hashmap*, hashmap_free_free_key);
|
|
DEFINE_TRIVIAL_CLEANUP_FUNC(Hashmap*, hashmap_free_free_free);
|
|
DEFINE_TRIVIAL_CLEANUP_FUNC(OrderedHashmap*, ordered_hashmap_free);
|
|
DEFINE_TRIVIAL_CLEANUP_FUNC(OrderedHashmap*, ordered_hashmap_free_free);
|
|
DEFINE_TRIVIAL_CLEANUP_FUNC(OrderedHashmap*, ordered_hashmap_free_free_key);
|
|
DEFINE_TRIVIAL_CLEANUP_FUNC(OrderedHashmap*, ordered_hashmap_free_free_free);
|
|
|
|
#define _cleanup_hashmap_free_ _cleanup_(hashmap_freep)
|
|
#define _cleanup_hashmap_free_free_ _cleanup_(hashmap_free_freep)
|
|
#define _cleanup_hashmap_free_free_free_ _cleanup_(hashmap_free_free_freep)
|
|
#define _cleanup_ordered_hashmap_free_ _cleanup_(ordered_hashmap_freep)
|
|
#define _cleanup_ordered_hashmap_free_free_ _cleanup_(ordered_hashmap_free_freep)
|
|
#define _cleanup_ordered_hashmap_free_free_free_ _cleanup_(ordered_hashmap_free_free_freep)
|
|
|
|
DEFINE_TRIVIAL_CLEANUP_FUNC(IteratedCache*, iterated_cache_free);
|
|
|
|
#define _cleanup_iterated_cache_free_ _cleanup_(iterated_cache_freep)
|