]>
Commit | Line | Data |
---|---|---|
db9ecf05 | 1 | /* SPDX-License-Identifier: LGPL-2.1-or-later */ |
a7334b09 | 2 | |
d25d4f18 | 3 | #include <fnmatch.h> |
ae0b700a | 4 | #include <pthread.h> |
4f18ff2e | 5 | #include <unistd.h> |
50b35193 ZJS |
6 | #if HAVE_VALGRIND_VALGRIND_H |
7 | # include <valgrind/valgrind.h> | |
8 | #endif | |
60918275 | 9 | |
b5efdb8a | 10 | #include "alloc-util.h" |
0c15577a | 11 | #include "extract-word.h" |
b4f60743 | 12 | #include "hashmap.h" |
93a1f792 | 13 | #include "log.h" |
3ae6b3bf | 14 | #include "logarithm.h" |
0a970718 | 15 | #include "memory-util.h" |
b3dcf58e | 16 | #include "mempool.h" |
d4510856 | 17 | #include "process-util.h" |
3df3e884 | 18 | #include "random-util.h" |
d4510856 LP |
19 | #include "set.h" |
20 | #include "siphash24.h" | |
c619033f | 21 | #include "sort-util.h" |
556c7bae | 22 | #include "string-util.h" |
d4510856 | 23 | #include "strv.h" |
60918275 | 24 | |
349cc4a5 | 25 | #if ENABLE_DEBUG_HASHMAP |
2eec67ac TA |
26 | #include "list.h" |
27 | #endif | |
28 | ||
89439d4f MS |
29 | /* |
30 | * Implementation of hashmaps. | |
31 | * Addressing: open | |
32 | * - uses less RAM compared to closed addressing (chaining), because | |
33 | * our entries are small (especially in Sets, which tend to contain | |
34 | * the majority of entries in systemd). | |
35 | * Collision resolution: Robin Hood | |
36 | * - tends to equalize displacement of entries from their optimal buckets. | |
37 | * Probe sequence: linear | |
38 | * - though theoretically worse than random probing/uniform hashing/double | |
39 | * hashing, it is good for cache locality. | |
40 | * | |
41 | * References: | |
42 | * Celis, P. 1986. Robin Hood Hashing. | |
43 | * Ph.D. Dissertation. University of Waterloo, Waterloo, Ont., Canada, Canada. | |
44 | * https://cs.uwaterloo.ca/research/tr/1986/CS-86-14.pdf | |
45 | * - The results are derived for random probing. Suggests deletion with | |
46 | * tombstones and two mean-centered search methods. None of that works | |
47 | * well for linear probing. | |
48 | * | |
49 | * Janson, S. 2005. Individual displacements for linear probing hashing with different insertion policies. | |
50 | * ACM Trans. Algorithms 1, 2 (October 2005), 177-213. | |
51 | * DOI=10.1145/1103963.1103964 http://doi.acm.org/10.1145/1103963.1103964 | |
52 | * http://www.math.uu.se/~svante/papers/sj157.pdf | |
53 | * - Applies to Robin Hood with linear probing. Contains remarks on | |
54 | * the unsuitability of mean-centered search with linear probing. | |
55 | * | |
56 | * Viola, A. 2005. Exact distribution of individual displacements in linear probing hashing. | |
57 | * ACM Trans. Algorithms 1, 2 (October 2005), 214-242. | |
58 | * DOI=10.1145/1103963.1103965 http://doi.acm.org/10.1145/1103963.1103965 | |
59 | * - Similar to Janson. Note that Viola writes about C_{m,n} (number of probes | |
60 | * in a successful search), and Janson writes about displacement. C = d + 1. | |
61 | * | |
62 | * Goossaert, E. 2013. Robin Hood hashing: backward shift deletion. | |
63 | * http://codecapsule.com/2013/11/17/robin-hood-hashing-backward-shift-deletion/ | |
64 | * - Explanation of backward shift deletion with pictures. | |
65 | * | |
66 | * Khuong, P. 2013. The Other Robin Hood Hashing. | |
67 | * http://www.pvk.ca/Blog/2013/11/26/the-other-robin-hood-hashing/ | |
68 | * - Short summary of random vs. linear probing, and tombstones vs. backward shift. | |
69 | */ | |
70 | ||
71 | /* | |
72 | * XXX Ideas for improvement: | |
73 | * For unordered hashmaps, randomize iteration order, similarly to Perl: | |
74 | * http://blog.booking.com/hardening-perls-hash-function.html | |
75 | */ | |
76 | ||
77 | /* INV_KEEP_FREE = 1 / (1 - max_load_factor) | |
78 | * e.g. 1 / (1 - 0.8) = 5 ... keep one fifth of the buckets free. */ | |
79 | #define INV_KEEP_FREE 5U | |
80 | ||
81 | /* Fields common to entries of all hashmap/set types */ | |
82 | struct hashmap_base_entry { | |
60918275 | 83 | const void *key; |
89439d4f MS |
84 | }; |
85 | ||
86 | /* Entry types for specific hashmap/set types | |
87 | * hashmap_base_entry must be at the beginning of each entry struct. */ | |
88 | ||
89 | struct plain_hashmap_entry { | |
90 | struct hashmap_base_entry b; | |
60918275 | 91 | void *value; |
60918275 LP |
92 | }; |
93 | ||
89439d4f MS |
94 | struct ordered_hashmap_entry { |
95 | struct plain_hashmap_entry p; | |
96 | unsigned iterate_next, iterate_previous; | |
97 | }; | |
60918275 | 98 | |
89439d4f MS |
99 | struct set_entry { |
100 | struct hashmap_base_entry b; | |
101 | }; | |
45fa9e29 | 102 | |
89439d4f MS |
103 | /* In several functions it is advantageous to have the hash table extended |
104 | * virtually by a couple of additional buckets. We reserve special index values | |
105 | * for these "swap" buckets. */ | |
106 | #define _IDX_SWAP_BEGIN (UINT_MAX - 3) | |
107 | #define IDX_PUT (_IDX_SWAP_BEGIN + 0) | |
108 | #define IDX_TMP (_IDX_SWAP_BEGIN + 1) | |
109 | #define _IDX_SWAP_END (_IDX_SWAP_BEGIN + 2) | |
39c2a6f1 | 110 | |
89439d4f MS |
111 | #define IDX_FIRST (UINT_MAX - 1) /* special index for freshly initialized iterators */ |
112 | #define IDX_NIL UINT_MAX /* special index value meaning "none" or "end" */ | |
113 | ||
114 | assert_cc(IDX_FIRST == _IDX_SWAP_END); | |
115 | assert_cc(IDX_FIRST == _IDX_ITERATOR_FIRST); | |
116 | ||
117 | /* Storage space for the "swap" buckets. | |
387f6955 | 118 | * All entry types can fit into an ordered_hashmap_entry. */ |
89439d4f MS |
119 | struct swap_entries { |
120 | struct ordered_hashmap_entry e[_IDX_SWAP_END - _IDX_SWAP_BEGIN]; | |
60918275 LP |
121 | }; |
122 | ||
89439d4f MS |
123 | /* Distance from Initial Bucket */ |
124 | typedef uint8_t dib_raw_t; | |
3ef11dcf ZJS |
125 | #define DIB_RAW_OVERFLOW ((dib_raw_t)0xfdU) /* indicates DIB value is greater than representable */ |
126 | #define DIB_RAW_REHASH ((dib_raw_t)0xfeU) /* entry yet to be rehashed during in-place resize */ | |
127 | #define DIB_RAW_FREE ((dib_raw_t)0xffU) /* a free bucket */ | |
128 | #define DIB_RAW_INIT ((char)DIB_RAW_FREE) /* a byte to memset a DIB store with when initializing */ | |
89439d4f MS |
129 | |
130 | #define DIB_FREE UINT_MAX | |
131 | ||
349cc4a5 | 132 | #if ENABLE_DEBUG_HASHMAP |
89439d4f MS |
133 | struct hashmap_debug_info { |
134 | LIST_FIELDS(struct hashmap_debug_info, debug_list); | |
135 | unsigned max_entries; /* high watermark of n_entries */ | |
136 | ||
89439d4f MS |
137 | /* fields to detect modification while iterating */ |
138 | unsigned put_count; /* counts puts into the hashmap */ | |
139 | unsigned rem_count; /* counts removals from hashmap */ | |
140 | unsigned last_rem_idx; /* remembers last removal index */ | |
39c2a6f1 LP |
141 | }; |
142 | ||
89439d4f MS |
143 | /* Tracks all existing hashmaps. Get at it from gdb. See sd_dump_hashmaps.py */ |
144 | static LIST_HEAD(struct hashmap_debug_info, hashmap_debug_list); | |
4f1b3061 | 145 | static pthread_mutex_t hashmap_debug_list_mutex = PTHREAD_MUTEX_INITIALIZER; |
55825de5 | 146 | #endif |
39c2a6f1 | 147 | |
89439d4f MS |
148 | enum HashmapType { |
149 | HASHMAP_TYPE_PLAIN, | |
150 | HASHMAP_TYPE_ORDERED, | |
151 | HASHMAP_TYPE_SET, | |
152 | _HASHMAP_TYPE_MAX | |
153 | }; | |
39c2a6f1 | 154 | |
89439d4f | 155 | struct _packed_ indirect_storage { |
1a39bc8c | 156 | void *storage; /* where buckets and DIBs are stored */ |
89439d4f MS |
157 | uint8_t hash_key[HASH_KEY_SIZE]; /* hash key; changes during resize */ |
158 | ||
159 | unsigned n_entries; /* number of stored entries */ | |
160 | unsigned n_buckets; /* number of buckets */ | |
161 | ||
162 | unsigned idx_lowest_entry; /* Index below which all buckets are free. | |
79893116 | 163 | Makes "while (hashmap_steal_first())" loops |
89439d4f MS |
164 | O(n) instead of O(n^2) for unordered hashmaps. */ |
165 | uint8_t _pad[3]; /* padding for the whole HashmapBase */ | |
166 | /* The bitfields in HashmapBase complete the alignment of the whole thing. */ | |
167 | }; | |
168 | ||
169 | struct direct_storage { | |
da890466 ZJS |
170 | /* This gives us 39 bytes on 64-bit, or 35 bytes on 32-bit. |
171 | * That's room for 4 set_entries + 4 DIB bytes + 3 unused bytes on 64-bit, | |
172 | * or 7 set_entries + 7 DIB bytes + 0 unused bytes on 32-bit. */ | |
1a39bc8c | 173 | uint8_t storage[sizeof(struct indirect_storage)]; |
89439d4f MS |
174 | }; |
175 | ||
176 | #define DIRECT_BUCKETS(entry_t) \ | |
177 | (sizeof(struct direct_storage) / (sizeof(entry_t) + sizeof(dib_raw_t))) | |
178 | ||
179 | /* We should be able to store at least one entry directly. */ | |
180 | assert_cc(DIRECT_BUCKETS(struct ordered_hashmap_entry) >= 1); | |
181 | ||
182 | /* We have 3 bits for n_direct_entries. */ | |
183 | assert_cc(DIRECT_BUCKETS(struct set_entry) < (1 << 3)); | |
184 | ||
185 | /* Hashmaps with directly stored entries all use this shared hash key. | |
186 | * It's no big deal if the key is guessed, because there can be only | |
187 | * a handful of directly stored entries in a hashmap. When a hashmap | |
188 | * outgrows direct storage, it gets its own key for indirect storage. */ | |
189 | static uint8_t shared_hash_key[HASH_KEY_SIZE]; | |
89439d4f MS |
190 | |
191 | /* Fields that all hashmap/set types must have */ | |
192 | struct HashmapBase { | |
193 | const struct hash_ops *hash_ops; /* hash and compare ops to use */ | |
194 | ||
195 | union _packed_ { | |
196 | struct indirect_storage indirect; /* if has_indirect */ | |
197 | struct direct_storage direct; /* if !has_indirect */ | |
198 | }; | |
199 | ||
200 | enum HashmapType type:2; /* HASHMAP_TYPE_* */ | |
201 | bool has_indirect:1; /* whether indirect storage is used */ | |
202 | unsigned n_direct_entries:3; /* Number of entries in direct storage. | |
203 | * Only valid if !has_indirect. */ | |
204 | bool from_pool:1; /* whether was allocated from mempool */ | |
45ea84d8 VC |
205 | bool dirty:1; /* whether dirtied since last iterated_cache_get() */ |
206 | bool cached:1; /* whether this hashmap is being cached */ | |
55825de5 ZJS |
207 | |
208 | #if ENABLE_DEBUG_HASHMAP | |
209 | struct hashmap_debug_info debug; | |
210 | #endif | |
89439d4f MS |
211 | }; |
212 | ||
213 | /* Specific hash types | |
214 | * HashmapBase must be at the beginning of each hashmap struct. */ | |
215 | ||
216 | struct Hashmap { | |
217 | struct HashmapBase b; | |
218 | }; | |
219 | ||
220 | struct OrderedHashmap { | |
221 | struct HashmapBase b; | |
222 | unsigned iterate_list_head, iterate_list_tail; | |
223 | }; | |
224 | ||
225 | struct Set { | |
226 | struct HashmapBase b; | |
227 | }; | |
228 | ||
45ea84d8 VC |
229 | typedef struct CacheMem { |
230 | const void **ptr; | |
319a4f4b | 231 | size_t n_populated; |
45ea84d8 VC |
232 | bool active:1; |
233 | } CacheMem; | |
234 | ||
235 | struct IteratedCache { | |
236 | HashmapBase *hashmap; | |
237 | CacheMem keys, values; | |
238 | }; | |
239 | ||
89439d4f MS |
240 | DEFINE_MEMPOOL(hashmap_pool, Hashmap, 8); |
241 | DEFINE_MEMPOOL(ordered_hashmap_pool, OrderedHashmap, 8); | |
242 | /* No need for a separate Set pool */ | |
243 | assert_cc(sizeof(Hashmap) == sizeof(Set)); | |
244 | ||
245 | struct hashmap_type_info { | |
246 | size_t head_size; | |
247 | size_t entry_size; | |
248 | struct mempool *mempool; | |
249 | unsigned n_direct_buckets; | |
250 | }; | |
251 | ||
43874aa7 | 252 | static _used_ const struct hashmap_type_info hashmap_type_info[_HASHMAP_TYPE_MAX] = { |
89439d4f MS |
253 | [HASHMAP_TYPE_PLAIN] = { |
254 | .head_size = sizeof(Hashmap), | |
255 | .entry_size = sizeof(struct plain_hashmap_entry), | |
256 | .mempool = &hashmap_pool, | |
257 | .n_direct_buckets = DIRECT_BUCKETS(struct plain_hashmap_entry), | |
258 | }, | |
259 | [HASHMAP_TYPE_ORDERED] = { | |
260 | .head_size = sizeof(OrderedHashmap), | |
261 | .entry_size = sizeof(struct ordered_hashmap_entry), | |
262 | .mempool = &ordered_hashmap_pool, | |
263 | .n_direct_buckets = DIRECT_BUCKETS(struct ordered_hashmap_entry), | |
264 | }, | |
265 | [HASHMAP_TYPE_SET] = { | |
266 | .head_size = sizeof(Set), | |
267 | .entry_size = sizeof(struct set_entry), | |
268 | .mempool = &hashmap_pool, | |
269 | .n_direct_buckets = DIRECT_BUCKETS(struct set_entry), | |
270 | }, | |
271 | }; | |
39c2a6f1 | 272 | |
a2b052b2 | 273 | void hashmap_trim_pools(void) { |
9a0f0ef5 | 274 | int r; |
556c7bae | 275 | |
9a0f0ef5 LP |
276 | /* The pool is only allocated by the main thread, but the memory can be passed to other |
277 | * threads. Let's clean up if we are the main thread and no other threads are live. */ | |
556c7bae | 278 | |
9a0f0ef5 LP |
279 | /* We build our own is_main_thread() here, which doesn't use C11 TLS based caching of the |
280 | * result. That's because valgrind apparently doesn't like TLS to be used from a GCC destructor. */ | |
31c9d74d | 281 | if (getpid() != gettid()) |
9a0f0ef5 | 282 | return (void) log_debug("Not cleaning up memory pools, not in main thread."); |
556c7bae | 283 | |
9a0f0ef5 LP |
284 | r = get_process_threads(0); |
285 | if (r < 0) | |
286 | return (void) log_debug_errno(r, "Failed to determine number of threads, not cleaning up memory pools: %m"); | |
287 | if (r != 1) | |
288 | return (void) log_debug("Not cleaning up memory pools, running in multi-threaded process."); | |
556c7bae | 289 | |
a2b052b2 LP |
290 | mempool_trim(&hashmap_pool); |
291 | mempool_trim(&ordered_hashmap_pool); | |
556c7bae | 292 | } |
9a0f0ef5 | 293 | |
50b35193 | 294 | #if HAVE_VALGRIND_VALGRIND_H |
9a0f0ef5 LP |
295 | _destructor_ static void cleanup_pools(void) { |
296 | /* Be nice to valgrind */ | |
50b35193 ZJS |
297 | if (RUNNING_ON_VALGRIND) |
298 | hashmap_trim_pools(); | |
9a0f0ef5 | 299 | } |
556c7bae ZJS |
300 | #endif |
301 | ||
89439d4f MS |
302 | static unsigned n_buckets(HashmapBase *h) { |
303 | return h->has_indirect ? h->indirect.n_buckets | |
304 | : hashmap_type_info[h->type].n_direct_buckets; | |
305 | } | |
306 | ||
307 | static unsigned n_entries(HashmapBase *h) { | |
308 | return h->has_indirect ? h->indirect.n_entries | |
309 | : h->n_direct_entries; | |
310 | } | |
311 | ||
312 | static void n_entries_inc(HashmapBase *h) { | |
313 | if (h->has_indirect) | |
314 | h->indirect.n_entries++; | |
315 | else | |
316 | h->n_direct_entries++; | |
317 | } | |
318 | ||
319 | static void n_entries_dec(HashmapBase *h) { | |
320 | if (h->has_indirect) | |
321 | h->indirect.n_entries--; | |
322 | else | |
323 | h->n_direct_entries--; | |
324 | } | |
325 | ||
8a35af80 | 326 | static void* storage_ptr(HashmapBase *h) { |
89439d4f MS |
327 | return h->has_indirect ? h->indirect.storage |
328 | : h->direct.storage; | |
329 | } | |
330 | ||
8a35af80 | 331 | static uint8_t* hash_key(HashmapBase *h) { |
89439d4f MS |
332 | return h->has_indirect ? h->indirect.hash_key |
333 | : shared_hash_key; | |
334 | } | |
335 | ||
336 | static unsigned base_bucket_hash(HashmapBase *h, const void *p) { | |
b826ab58 | 337 | struct siphash state; |
0cb3c286 | 338 | uint64_t hash; |
b826ab58 | 339 | |
0cb3c286 | 340 | siphash24_init(&state, hash_key(h)); |
b826ab58 TG |
341 | |
342 | h->hash_ops->hash(p, &state); | |
343 | ||
933f9cae | 344 | hash = siphash24_finalize(&state); |
0cb3c286 TG |
345 | |
346 | return (unsigned) (hash % n_buckets(h)); | |
9bf3b535 | 347 | } |
89439d4f | 348 | #define bucket_hash(h, p) base_bucket_hash(HASHMAP_BASE(h), p) |
9bf3b535 | 349 | |
a1e92eee | 350 | static void base_set_dirty(HashmapBase *h) { |
84dcca75 VC |
351 | h->dirty = true; |
352 | } | |
353 | #define hashmap_set_dirty(h) base_set_dirty(HASHMAP_BASE(h)) | |
354 | ||
9bf3b535 LP |
355 | static void get_hash_key(uint8_t hash_key[HASH_KEY_SIZE], bool reuse_is_ok) { |
356 | static uint8_t current[HASH_KEY_SIZE]; | |
357 | static bool current_initialized = false; | |
358 | ||
359 | /* Returns a hash function key to use. In order to keep things | |
360 | * fast we will not generate a new key each time we allocate a | |
361 | * new hash table. Instead, we'll just reuse the most recently | |
362 | * generated one, except if we never generated one or when we | |
363 | * are rehashing an entire hash table because we reached a | |
364 | * fill level */ | |
365 | ||
366 | if (!current_initialized || !reuse_is_ok) { | |
367 | random_bytes(current, sizeof(current)); | |
368 | current_initialized = true; | |
369 | } | |
370 | ||
371 | memcpy(hash_key, current, sizeof(current)); | |
a3b6fafe LP |
372 | } |
373 | ||
8a35af80 | 374 | static struct hashmap_base_entry* bucket_at(HashmapBase *h, unsigned idx) { |
6759b627 TH |
375 | return CAST_ALIGN_PTR( |
376 | struct hashmap_base_entry, | |
377 | (uint8_t *) storage_ptr(h) + idx * hashmap_type_info[h->type].entry_size); | |
89439d4f MS |
378 | } |
379 | ||
8a35af80 | 380 | static struct plain_hashmap_entry* plain_bucket_at(Hashmap *h, unsigned idx) { |
89439d4f MS |
381 | return (struct plain_hashmap_entry*) bucket_at(HASHMAP_BASE(h), idx); |
382 | } | |
383 | ||
8a35af80 | 384 | static struct ordered_hashmap_entry* ordered_bucket_at(OrderedHashmap *h, unsigned idx) { |
89439d4f MS |
385 | return (struct ordered_hashmap_entry*) bucket_at(HASHMAP_BASE(h), idx); |
386 | } | |
39c2a6f1 | 387 | |
89439d4f MS |
388 | static struct set_entry *set_bucket_at(Set *h, unsigned idx) { |
389 | return (struct set_entry*) bucket_at(HASHMAP_BASE(h), idx); | |
390 | } | |
39c2a6f1 | 391 | |
8a35af80 | 392 | static struct ordered_hashmap_entry* bucket_at_swap(struct swap_entries *swap, unsigned idx) { |
89439d4f MS |
393 | return &swap->e[idx - _IDX_SWAP_BEGIN]; |
394 | } | |
39c2a6f1 | 395 | |
89439d4f MS |
396 | /* Returns a pointer to the bucket at index idx. |
397 | * Understands real indexes and swap indexes, hence "_virtual". */ | |
8a35af80 | 398 | static struct hashmap_base_entry* bucket_at_virtual(HashmapBase *h, struct swap_entries *swap, |
89439d4f MS |
399 | unsigned idx) { |
400 | if (idx < _IDX_SWAP_BEGIN) | |
401 | return bucket_at(h, idx); | |
402 | ||
403 | if (idx < _IDX_SWAP_END) | |
404 | return &bucket_at_swap(swap, idx)->p.b; | |
405 | ||
04499a70 | 406 | assert_not_reached(); |
89439d4f MS |
407 | } |
408 | ||
8a35af80 | 409 | static dib_raw_t* dib_raw_ptr(HashmapBase *h) { |
89439d4f | 410 | return (dib_raw_t*) |
1a39bc8c | 411 | ((uint8_t*) storage_ptr(h) + hashmap_type_info[h->type].entry_size * n_buckets(h)); |
89439d4f MS |
412 | } |
413 | ||
414 | static unsigned bucket_distance(HashmapBase *h, unsigned idx, unsigned from) { | |
415 | return idx >= from ? idx - from | |
416 | : n_buckets(h) + idx - from; | |
417 | } | |
418 | ||
419 | static unsigned bucket_calculate_dib(HashmapBase *h, unsigned idx, dib_raw_t raw_dib) { | |
420 | unsigned initial_bucket; | |
421 | ||
422 | if (raw_dib == DIB_RAW_FREE) | |
423 | return DIB_FREE; | |
424 | ||
425 | if (_likely_(raw_dib < DIB_RAW_OVERFLOW)) | |
426 | return raw_dib; | |
427 | ||
428 | /* | |
429 | * Having an overflow DIB value is very unlikely. The hash function | |
430 | * would have to be bad. For example, in a table of size 2^24 filled | |
431 | * to load factor 0.9 the maximum observed DIB is only about 60. | |
432 | * In theory (assuming I used Maxima correctly), for an infinite size | |
433 | * hash table with load factor 0.8 the probability of a given entry | |
434 | * having DIB > 40 is 1.9e-8. | |
435 | * This returns the correct DIB value by recomputing the hash value in | |
436 | * the unlikely case. XXX Hitting this case could be a hint to rehash. | |
437 | */ | |
438 | initial_bucket = bucket_hash(h, bucket_at(h, idx)->key); | |
439 | return bucket_distance(h, idx, initial_bucket); | |
440 | } | |
441 | ||
442 | static void bucket_set_dib(HashmapBase *h, unsigned idx, unsigned dib) { | |
443 | dib_raw_ptr(h)[idx] = dib != DIB_FREE ? MIN(dib, DIB_RAW_OVERFLOW) : DIB_RAW_FREE; | |
444 | } | |
445 | ||
446 | static unsigned skip_free_buckets(HashmapBase *h, unsigned idx) { | |
447 | dib_raw_t *dibs; | |
448 | ||
449 | dibs = dib_raw_ptr(h); | |
450 | ||
451 | for ( ; idx < n_buckets(h); idx++) | |
452 | if (dibs[idx] != DIB_RAW_FREE) | |
453 | return idx; | |
454 | ||
455 | return IDX_NIL; | |
456 | } | |
457 | ||
458 | static void bucket_mark_free(HashmapBase *h, unsigned idx) { | |
eccaf899 | 459 | memzero(bucket_at(h, idx), hashmap_type_info[h->type].entry_size); |
89439d4f MS |
460 | bucket_set_dib(h, idx, DIB_FREE); |
461 | } | |
462 | ||
463 | static void bucket_move_entry(HashmapBase *h, struct swap_entries *swap, | |
464 | unsigned from, unsigned to) { | |
465 | struct hashmap_base_entry *e_from, *e_to; | |
466 | ||
467 | assert(from != to); | |
39c2a6f1 | 468 | |
89439d4f MS |
469 | e_from = bucket_at_virtual(h, swap, from); |
470 | e_to = bucket_at_virtual(h, swap, to); | |
471 | ||
472 | memcpy(e_to, e_from, hashmap_type_info[h->type].entry_size); | |
473 | ||
474 | if (h->type == HASHMAP_TYPE_ORDERED) { | |
475 | OrderedHashmap *lh = (OrderedHashmap*) h; | |
476 | struct ordered_hashmap_entry *le, *le_to; | |
477 | ||
478 | le_to = (struct ordered_hashmap_entry*) e_to; | |
479 | ||
480 | if (le_to->iterate_next != IDX_NIL) { | |
481 | le = (struct ordered_hashmap_entry*) | |
482 | bucket_at_virtual(h, swap, le_to->iterate_next); | |
483 | le->iterate_previous = to; | |
484 | } | |
485 | ||
486 | if (le_to->iterate_previous != IDX_NIL) { | |
487 | le = (struct ordered_hashmap_entry*) | |
488 | bucket_at_virtual(h, swap, le_to->iterate_previous); | |
489 | le->iterate_next = to; | |
490 | } | |
491 | ||
492 | if (lh->iterate_list_head == from) | |
493 | lh->iterate_list_head = to; | |
494 | if (lh->iterate_list_tail == from) | |
495 | lh->iterate_list_tail = to; | |
39c2a6f1 | 496 | } |
89439d4f | 497 | } |
60918275 | 498 | |
89439d4f MS |
499 | static unsigned next_idx(HashmapBase *h, unsigned idx) { |
500 | return (idx + 1U) % n_buckets(h); | |
501 | } | |
60918275 | 502 | |
89439d4f MS |
503 | static unsigned prev_idx(HashmapBase *h, unsigned idx) { |
504 | return (n_buckets(h) + idx - 1U) % n_buckets(h); | |
505 | } | |
60918275 | 506 | |
8a35af80 | 507 | static void* entry_value(HashmapBase *h, struct hashmap_base_entry *e) { |
89439d4f | 508 | switch (h->type) { |
45fa9e29 | 509 | |
89439d4f MS |
510 | case HASHMAP_TYPE_PLAIN: |
511 | case HASHMAP_TYPE_ORDERED: | |
512 | return ((struct plain_hashmap_entry*)e)->value; | |
39c2a6f1 | 513 | |
89439d4f MS |
514 | case HASHMAP_TYPE_SET: |
515 | return (void*) e->key; | |
a3b6fafe | 516 | |
89439d4f | 517 | default: |
04499a70 | 518 | assert_not_reached(); |
89439d4f | 519 | } |
60918275 LP |
520 | } |
521 | ||
89439d4f MS |
522 | static void base_remove_entry(HashmapBase *h, unsigned idx) { |
523 | unsigned left, right, prev, dib; | |
524 | dib_raw_t raw_dib, *dibs; | |
45fa9e29 | 525 | |
89439d4f MS |
526 | dibs = dib_raw_ptr(h); |
527 | assert(dibs[idx] != DIB_RAW_FREE); | |
034c6ed7 | 528 | |
349cc4a5 | 529 | #if ENABLE_DEBUG_HASHMAP |
89439d4f MS |
530 | h->debug.rem_count++; |
531 | h->debug.last_rem_idx = idx; | |
532 | #endif | |
034c6ed7 | 533 | |
89439d4f MS |
534 | left = idx; |
535 | /* Find the stop bucket ("right"). It is either free or has DIB == 0. */ | |
536 | for (right = next_idx(h, left); ; right = next_idx(h, right)) { | |
537 | raw_dib = dibs[right]; | |
4c701096 | 538 | if (IN_SET(raw_dib, 0, DIB_RAW_FREE)) |
89439d4f MS |
539 | break; |
540 | ||
541 | /* The buckets are not supposed to be all occupied and with DIB > 0. | |
542 | * That would mean we could make everyone better off by shifting them | |
543 | * backward. This scenario is impossible. */ | |
544 | assert(left != right); | |
545 | } | |
034c6ed7 | 546 | |
89439d4f MS |
547 | if (h->type == HASHMAP_TYPE_ORDERED) { |
548 | OrderedHashmap *lh = (OrderedHashmap*) h; | |
549 | struct ordered_hashmap_entry *le = ordered_bucket_at(lh, idx); | |
550 | ||
551 | if (le->iterate_next != IDX_NIL) | |
552 | ordered_bucket_at(lh, le->iterate_next)->iterate_previous = le->iterate_previous; | |
553 | else | |
554 | lh->iterate_list_tail = le->iterate_previous; | |
555 | ||
556 | if (le->iterate_previous != IDX_NIL) | |
557 | ordered_bucket_at(lh, le->iterate_previous)->iterate_next = le->iterate_next; | |
558 | else | |
559 | lh->iterate_list_head = le->iterate_next; | |
560 | } | |
561 | ||
562 | /* Now shift all buckets in the interval (left, right) one step backwards */ | |
563 | for (prev = left, left = next_idx(h, left); left != right; | |
564 | prev = left, left = next_idx(h, left)) { | |
565 | dib = bucket_calculate_dib(h, left, dibs[left]); | |
566 | assert(dib != 0); | |
567 | bucket_move_entry(h, NULL, left, prev); | |
568 | bucket_set_dib(h, prev, dib - 1); | |
569 | } | |
570 | ||
571 | bucket_mark_free(h, prev); | |
572 | n_entries_dec(h); | |
84dcca75 | 573 | base_set_dirty(h); |
034c6ed7 | 574 | } |
89439d4f MS |
575 | #define remove_entry(h, idx) base_remove_entry(HASHMAP_BASE(h), idx) |
576 | ||
577 | static unsigned hashmap_iterate_in_insertion_order(OrderedHashmap *h, Iterator *i) { | |
578 | struct ordered_hashmap_entry *e; | |
579 | unsigned idx; | |
034c6ed7 | 580 | |
101d8e63 | 581 | assert(h); |
89439d4f MS |
582 | assert(i); |
583 | ||
584 | if (i->idx == IDX_NIL) | |
585 | goto at_end; | |
586 | ||
587 | if (i->idx == IDX_FIRST && h->iterate_list_head == IDX_NIL) | |
588 | goto at_end; | |
589 | ||
590 | if (i->idx == IDX_FIRST) { | |
591 | idx = h->iterate_list_head; | |
592 | e = ordered_bucket_at(h, idx); | |
101d8e63 | 593 | } else { |
89439d4f MS |
594 | idx = i->idx; |
595 | e = ordered_bucket_at(h, idx); | |
596 | /* | |
597 | * We allow removing the current entry while iterating, but removal may cause | |
598 | * a backward shift. The next entry may thus move one bucket to the left. | |
599 | * To detect when it happens, we remember the key pointer of the entry we were | |
600 | * going to iterate next. If it does not match, there was a backward shift. | |
601 | */ | |
602 | if (e->p.b.key != i->next_key) { | |
603 | idx = prev_idx(HASHMAP_BASE(h), idx); | |
604 | e = ordered_bucket_at(h, idx); | |
605 | } | |
606 | assert(e->p.b.key == i->next_key); | |
101d8e63 | 607 | } |
101d8e63 | 608 | |
349cc4a5 | 609 | #if ENABLE_DEBUG_HASHMAP |
89439d4f MS |
610 | i->prev_idx = idx; |
611 | #endif | |
612 | ||
613 | if (e->iterate_next != IDX_NIL) { | |
614 | struct ordered_hashmap_entry *n; | |
615 | i->idx = e->iterate_next; | |
616 | n = ordered_bucket_at(h, i->idx); | |
617 | i->next_key = n->p.b.key; | |
618 | } else | |
619 | i->idx = IDX_NIL; | |
620 | ||
621 | return idx; | |
622 | ||
623 | at_end: | |
624 | i->idx = IDX_NIL; | |
625 | return IDX_NIL; | |
101d8e63 LP |
626 | } |
627 | ||
89439d4f MS |
628 | static unsigned hashmap_iterate_in_internal_order(HashmapBase *h, Iterator *i) { |
629 | unsigned idx; | |
630 | ||
60918275 | 631 | assert(h); |
89439d4f | 632 | assert(i); |
60918275 | 633 | |
89439d4f MS |
634 | if (i->idx == IDX_NIL) |
635 | goto at_end; | |
60918275 | 636 | |
89439d4f MS |
637 | if (i->idx == IDX_FIRST) { |
638 | /* fast forward to the first occupied bucket */ | |
639 | if (h->has_indirect) { | |
640 | i->idx = skip_free_buckets(h, h->indirect.idx_lowest_entry); | |
641 | h->indirect.idx_lowest_entry = i->idx; | |
642 | } else | |
643 | i->idx = skip_free_buckets(h, 0); | |
644 | ||
645 | if (i->idx == IDX_NIL) | |
646 | goto at_end; | |
647 | } else { | |
648 | struct hashmap_base_entry *e; | |
649 | ||
650 | assert(i->idx > 0); | |
60918275 | 651 | |
89439d4f MS |
652 | e = bucket_at(h, i->idx); |
653 | /* | |
654 | * We allow removing the current entry while iterating, but removal may cause | |
655 | * a backward shift. The next entry may thus move one bucket to the left. | |
656 | * To detect when it happens, we remember the key pointer of the entry we were | |
657 | * going to iterate next. If it does not match, there was a backward shift. | |
658 | */ | |
659 | if (e->key != i->next_key) | |
660 | e = bucket_at(h, --i->idx); | |
60918275 | 661 | |
89439d4f MS |
662 | assert(e->key == i->next_key); |
663 | } | |
664 | ||
665 | idx = i->idx; | |
349cc4a5 | 666 | #if ENABLE_DEBUG_HASHMAP |
89439d4f MS |
667 | i->prev_idx = idx; |
668 | #endif | |
669 | ||
670 | i->idx = skip_free_buckets(h, i->idx + 1); | |
671 | if (i->idx != IDX_NIL) | |
672 | i->next_key = bucket_at(h, i->idx)->key; | |
101d8e63 | 673 | else |
89439d4f MS |
674 | i->idx = IDX_NIL; |
675 | ||
676 | return idx; | |
60918275 | 677 | |
89439d4f MS |
678 | at_end: |
679 | i->idx = IDX_NIL; | |
680 | return IDX_NIL; | |
60918275 LP |
681 | } |
682 | ||
89439d4f MS |
683 | static unsigned hashmap_iterate_entry(HashmapBase *h, Iterator *i) { |
684 | if (!h) { | |
685 | i->idx = IDX_NIL; | |
686 | return IDX_NIL; | |
687 | } | |
101d8e63 | 688 | |
349cc4a5 | 689 | #if ENABLE_DEBUG_HASHMAP |
89439d4f MS |
690 | if (i->idx == IDX_FIRST) { |
691 | i->put_count = h->debug.put_count; | |
692 | i->rem_count = h->debug.rem_count; | |
693 | } else { | |
694 | /* While iterating, must not add any new entries */ | |
695 | assert(i->put_count == h->debug.put_count); | |
696 | /* ... or remove entries other than the current one */ | |
697 | assert(i->rem_count == h->debug.rem_count || | |
698 | (i->rem_count == h->debug.rem_count - 1 && | |
699 | i->prev_idx == h->debug.last_rem_idx)); | |
700 | /* Reset our removals counter */ | |
701 | i->rem_count = h->debug.rem_count; | |
702 | } | |
703 | #endif | |
101d8e63 | 704 | |
89439d4f MS |
705 | return h->type == HASHMAP_TYPE_ORDERED ? hashmap_iterate_in_insertion_order((OrderedHashmap*) h, i) |
706 | : hashmap_iterate_in_internal_order(h, i); | |
707 | } | |
39c2a6f1 | 708 | |
138f49e4 | 709 | bool _hashmap_iterate(HashmapBase *h, Iterator *i, void **value, const void **key) { |
89439d4f MS |
710 | struct hashmap_base_entry *e; |
711 | void *data; | |
712 | unsigned idx; | |
713 | ||
714 | idx = hashmap_iterate_entry(h, i); | |
715 | if (idx == IDX_NIL) { | |
8927b1da DH |
716 | if (value) |
717 | *value = NULL; | |
89439d4f MS |
718 | if (key) |
719 | *key = NULL; | |
720 | ||
8927b1da | 721 | return false; |
89439d4f MS |
722 | } |
723 | ||
724 | e = bucket_at(h, idx); | |
725 | data = entry_value(h, e); | |
8927b1da DH |
726 | if (value) |
727 | *value = data; | |
89439d4f MS |
728 | if (key) |
729 | *key = e->key; | |
730 | ||
8927b1da | 731 | return true; |
101d8e63 LP |
732 | } |
733 | ||
89439d4f MS |
734 | #define HASHMAP_FOREACH_IDX(idx, h, i) \ |
735 | for ((i) = ITERATOR_FIRST, (idx) = hashmap_iterate_entry((h), &(i)); \ | |
736 | (idx != IDX_NIL); \ | |
737 | (idx) = hashmap_iterate_entry((h), &(i))) | |
738 | ||
8a35af80 | 739 | IteratedCache* _hashmap_iterated_cache_new(HashmapBase *h) { |
45ea84d8 VC |
740 | IteratedCache *cache; |
741 | ||
742 | assert(h); | |
743 | assert(!h->cached); | |
744 | ||
745 | if (h->cached) | |
746 | return NULL; | |
747 | ||
748 | cache = new0(IteratedCache, 1); | |
749 | if (!cache) | |
750 | return NULL; | |
751 | ||
752 | cache->hashmap = h; | |
753 | h->cached = true; | |
754 | ||
755 | return cache; | |
756 | } | |
757 | ||
89439d4f MS |
758 | static void reset_direct_storage(HashmapBase *h) { |
759 | const struct hashmap_type_info *hi = &hashmap_type_info[h->type]; | |
760 | void *p; | |
761 | ||
762 | assert(!h->has_indirect); | |
763 | ||
764 | p = mempset(h->direct.storage, 0, hi->entry_size * hi->n_direct_buckets); | |
765 | memset(p, DIB_RAW_INIT, sizeof(dib_raw_t) * hi->n_direct_buckets); | |
766 | } | |
767 | ||
ae0b700a LP |
768 | static void shared_hash_key_initialize(void) { |
769 | random_bytes(shared_hash_key, sizeof(shared_hash_key)); | |
770 | } | |
771 | ||
c09ce222 | 772 | static struct HashmapBase* hashmap_base_new(const struct hash_ops *hash_ops, enum HashmapType type) { |
89439d4f MS |
773 | HashmapBase *h; |
774 | const struct hashmap_type_info *hi = &hashmap_type_info[type]; | |
89439d4f | 775 | |
e8d2cb0f | 776 | bool use_pool = mempool_enabled && mempool_enabled(); /* mempool_enabled is a weak symbol */ |
67f3c402 | 777 | |
b01f3195 | 778 | h = use_pool ? mempool_alloc0_tile(hi->mempool) : malloc0(hi->head_size); |
60918275 | 779 | if (!h) |
89439d4f MS |
780 | return NULL; |
781 | ||
782 | h->type = type; | |
b01f3195 | 783 | h->from_pool = use_pool; |
70b400d9 | 784 | h->hash_ops = hash_ops ?: &trivial_hash_ops; |
89439d4f MS |
785 | |
786 | if (type == HASHMAP_TYPE_ORDERED) { | |
787 | OrderedHashmap *lh = (OrderedHashmap*)h; | |
788 | lh->iterate_list_head = lh->iterate_list_tail = IDX_NIL; | |
789 | } | |
790 | ||
791 | reset_direct_storage(h); | |
60918275 | 792 | |
ae0b700a LP |
793 | static pthread_once_t once = PTHREAD_ONCE_INIT; |
794 | assert_se(pthread_once(&once, shared_hash_key_initialize) == 0); | |
89439d4f | 795 | |
349cc4a5 | 796 | #if ENABLE_DEBUG_HASHMAP |
4f1b3061 TG |
797 | assert_se(pthread_mutex_lock(&hashmap_debug_list_mutex) == 0); |
798 | LIST_PREPEND(debug_list, hashmap_debug_list, &h->debug); | |
799 | assert_se(pthread_mutex_unlock(&hashmap_debug_list_mutex) == 0); | |
89439d4f MS |
800 | #endif |
801 | ||
802 | return h; | |
803 | } | |
60918275 | 804 | |
c09ce222 DDM |
805 | Hashmap *hashmap_new(const struct hash_ops *hash_ops) { |
806 | return (Hashmap*) hashmap_base_new(hash_ops, HASHMAP_TYPE_PLAIN); | |
89439d4f MS |
807 | } |
808 | ||
c09ce222 DDM |
809 | OrderedHashmap *ordered_hashmap_new(const struct hash_ops *hash_ops) { |
810 | return (OrderedHashmap*) hashmap_base_new(hash_ops, HASHMAP_TYPE_ORDERED); | |
89439d4f MS |
811 | } |
812 | ||
c09ce222 DDM |
813 | Set *set_new(const struct hash_ops *hash_ops) { |
814 | return (Set*) hashmap_base_new(hash_ops, HASHMAP_TYPE_SET); | |
89439d4f MS |
815 | } |
816 | ||
817 | static int hashmap_base_ensure_allocated(HashmapBase **h, const struct hash_ops *hash_ops, | |
c09ce222 | 818 | enum HashmapType type) { |
89439d4f MS |
819 | HashmapBase *q; |
820 | ||
821 | assert(h); | |
822 | ||
bc169c4f YW |
823 | if (*h) { |
824 | assert((*h)->hash_ops == (hash_ops ?: &trivial_hash_ops)); | |
89439d4f | 825 | return 0; |
bc169c4f | 826 | } |
89439d4f | 827 | |
c09ce222 | 828 | q = hashmap_base_new(hash_ops, type); |
89439d4f MS |
829 | if (!q) |
830 | return -ENOMEM; | |
831 | ||
832 | *h = q; | |
9ff7c5b0 | 833 | return 1; |
89439d4f MS |
834 | } |
835 | ||
c09ce222 DDM |
836 | int hashmap_ensure_allocated(Hashmap **h, const struct hash_ops *hash_ops) { |
837 | return hashmap_base_ensure_allocated((HashmapBase**)h, hash_ops, HASHMAP_TYPE_PLAIN); | |
89439d4f MS |
838 | } |
839 | ||
c09ce222 DDM |
840 | int ordered_hashmap_ensure_allocated(OrderedHashmap **h, const struct hash_ops *hash_ops) { |
841 | return hashmap_base_ensure_allocated((HashmapBase**)h, hash_ops, HASHMAP_TYPE_ORDERED); | |
89439d4f MS |
842 | } |
843 | ||
54bbfa00 | 844 | int set_ensure_allocated(Set **s, const struct hash_ops *hash_ops) { |
c09ce222 | 845 | return hashmap_base_ensure_allocated((HashmapBase**)s, hash_ops, HASHMAP_TYPE_SET); |
89439d4f MS |
846 | } |
847 | ||
c09ce222 | 848 | int hashmap_ensure_put(Hashmap **h, const struct hash_ops *hash_ops, const void *key, void *value) { |
1346c36d SS |
849 | int r; |
850 | ||
c09ce222 | 851 | r = hashmap_ensure_allocated(h, hash_ops); |
1346c36d SS |
852 | if (r < 0) |
853 | return r; | |
854 | ||
855 | return hashmap_put(*h, key, value); | |
856 | } | |
857 | ||
c09ce222 | 858 | int ordered_hashmap_ensure_put(OrderedHashmap **h, const struct hash_ops *hash_ops, const void *key, void *value) { |
b7847e05 SS |
859 | int r; |
860 | ||
c09ce222 | 861 | r = ordered_hashmap_ensure_allocated(h, hash_ops); |
b7847e05 SS |
862 | if (r < 0) |
863 | return r; | |
864 | ||
865 | return ordered_hashmap_put(*h, key, value); | |
866 | } | |
867 | ||
c09ce222 | 868 | int ordered_hashmap_ensure_replace(OrderedHashmap **h, const struct hash_ops *hash_ops, const void *key, void *value) { |
afb1fe36 MC |
869 | int r; |
870 | ||
c09ce222 | 871 | r = ordered_hashmap_ensure_allocated(h, hash_ops); |
afb1fe36 MC |
872 | if (r < 0) |
873 | return r; | |
874 | ||
875 | return ordered_hashmap_replace(*h, key, value); | |
876 | } | |
877 | ||
c09ce222 | 878 | int hashmap_ensure_replace(Hashmap **h, const struct hash_ops *hash_ops, const void *key, void *value) { |
afb1fe36 MC |
879 | int r; |
880 | ||
c09ce222 | 881 | r = hashmap_ensure_allocated(h, hash_ops); |
afb1fe36 MC |
882 | if (r < 0) |
883 | return r; | |
884 | ||
885 | return hashmap_replace(*h, key, value); | |
886 | } | |
887 | ||
89439d4f MS |
888 | static void hashmap_free_no_clear(HashmapBase *h) { |
889 | assert(!h->has_indirect); | |
ee05335f | 890 | assert(h->n_direct_entries == 0); |
89439d4f | 891 | |
349cc4a5 | 892 | #if ENABLE_DEBUG_HASHMAP |
4f1b3061 | 893 | assert_se(pthread_mutex_lock(&hashmap_debug_list_mutex) == 0); |
89439d4f | 894 | LIST_REMOVE(debug_list, hashmap_debug_list, &h->debug); |
4f1b3061 | 895 | assert_se(pthread_mutex_unlock(&hashmap_debug_list_mutex) == 0); |
89439d4f | 896 | #endif |
45fa9e29 | 897 | |
205c085b LP |
898 | if (h->from_pool) { |
899 | /* Ensure that the object didn't get migrated between threads. */ | |
900 | assert_se(is_main_thread()); | |
89439d4f | 901 | mempool_free_tile(hashmap_type_info[h->type].mempool, h); |
205c085b | 902 | } else |
39c2a6f1 | 903 | free(h); |
60918275 LP |
904 | } |
905 | ||
885001ed | 906 | HashmapBase* _hashmap_free(HashmapBase *h) { |
cfe561a4 | 907 | if (h) { |
885001ed | 908 | _hashmap_clear(h); |
cfe561a4 DH |
909 | hashmap_free_no_clear(h); |
910 | } | |
89439d4f | 911 | |
cfe561a4 | 912 | return NULL; |
89439d4f MS |
913 | } |
914 | ||
885001ed | 915 | void _hashmap_clear(HashmapBase *h) { |
59a5cda7 YW |
916 | if (!h) |
917 | return; | |
67f3c402 | 918 | |
885001ed | 919 | if (h->hash_ops->free_key || h->hash_ops->free_value) { |
449ddb2d | 920 | |
c380b84d LP |
921 | /* If destructor calls are defined, let's destroy things defensively: let's take the item out of the |
922 | * hash table, and only then call the destructor functions. If these destructors then try to unregister | |
923 | * themselves from our hash table a second time, the entry is already gone. */ | |
924 | ||
138f49e4 | 925 | while (_hashmap_size(h) > 0) { |
ca323715 TH |
926 | void *k = NULL; |
927 | void *v; | |
c380b84d | 928 | |
138f49e4 | 929 | v = _hashmap_first_key_and_value(h, true, &k); |
fabe5c0e | 930 | |
885001ed YW |
931 | if (h->hash_ops->free_key) |
932 | h->hash_ops->free_key(k); | |
fabe5c0e | 933 | |
885001ed YW |
934 | if (h->hash_ops->free_value) |
935 | h->hash_ops->free_value(v); | |
59a5cda7 | 936 | } |
cfe561a4 | 937 | } |
fabe5c0e | 938 | |
89439d4f MS |
939 | if (h->has_indirect) { |
940 | free(h->indirect.storage); | |
941 | h->has_indirect = false; | |
942 | } | |
943 | ||
944 | h->n_direct_entries = 0; | |
945 | reset_direct_storage(h); | |
946 | ||
947 | if (h->type == HASHMAP_TYPE_ORDERED) { | |
948 | OrderedHashmap *lh = (OrderedHashmap*) h; | |
949 | lh->iterate_list_head = lh->iterate_list_tail = IDX_NIL; | |
950 | } | |
84dcca75 VC |
951 | |
952 | base_set_dirty(h); | |
11dd41ce LP |
953 | } |
954 | ||
89439d4f MS |
955 | static int resize_buckets(HashmapBase *h, unsigned entries_add); |
956 | ||
957 | /* | |
958 | * Finds an empty bucket to put an entry into, starting the scan at 'idx'. | |
959 | * Performs Robin Hood swaps as it goes. The entry to put must be placed | |
960 | * by the caller into swap slot IDX_PUT. | |
961 | * If used for in-place resizing, may leave a displaced entry in swap slot | |
962 | * IDX_PUT. Caller must rehash it next. | |
963 | * Returns: true if it left a displaced entry to rehash next in IDX_PUT, | |
964 | * false otherwise. | |
965 | */ | |
966 | static bool hashmap_put_robin_hood(HashmapBase *h, unsigned idx, | |
967 | struct swap_entries *swap) { | |
968 | dib_raw_t raw_dib, *dibs; | |
969 | unsigned dib, distance; | |
970 | ||
349cc4a5 | 971 | #if ENABLE_DEBUG_HASHMAP |
89439d4f MS |
972 | h->debug.put_count++; |
973 | #endif | |
974 | ||
975 | dibs = dib_raw_ptr(h); | |
976 | ||
977 | for (distance = 0; ; distance++) { | |
978 | raw_dib = dibs[idx]; | |
3742095b | 979 | if (IN_SET(raw_dib, DIB_RAW_FREE, DIB_RAW_REHASH)) { |
89439d4f MS |
980 | if (raw_dib == DIB_RAW_REHASH) |
981 | bucket_move_entry(h, swap, idx, IDX_TMP); | |
982 | ||
983 | if (h->has_indirect && h->indirect.idx_lowest_entry > idx) | |
984 | h->indirect.idx_lowest_entry = idx; | |
60918275 | 985 | |
89439d4f MS |
986 | bucket_set_dib(h, idx, distance); |
987 | bucket_move_entry(h, swap, IDX_PUT, idx); | |
988 | if (raw_dib == DIB_RAW_REHASH) { | |
989 | bucket_move_entry(h, swap, IDX_TMP, IDX_PUT); | |
990 | return true; | |
991 | } | |
60918275 | 992 | |
89439d4f MS |
993 | return false; |
994 | } | |
995 | ||
996 | dib = bucket_calculate_dib(h, idx, raw_dib); | |
997 | ||
998 | if (dib < distance) { | |
999 | /* Found a wealthier entry. Go Robin Hood! */ | |
89439d4f MS |
1000 | bucket_set_dib(h, idx, distance); |
1001 | ||
1002 | /* swap the entries */ | |
1003 | bucket_move_entry(h, swap, idx, IDX_TMP); | |
1004 | bucket_move_entry(h, swap, IDX_PUT, idx); | |
1005 | bucket_move_entry(h, swap, IDX_TMP, IDX_PUT); | |
1006 | ||
1007 | distance = dib; | |
1008 | } | |
1009 | ||
1010 | idx = next_idx(h, idx); | |
1011 | } | |
60918275 LP |
1012 | } |
1013 | ||
89439d4f MS |
1014 | /* |
1015 | * Puts an entry into a hashmap, boldly - no check whether key already exists. | |
1016 | * The caller must place the entry (only its key and value, not link indexes) | |
1017 | * in swap slot IDX_PUT. | |
1018 | * Caller must ensure: the key does not exist yet in the hashmap. | |
1019 | * that resize is not needed if !may_resize. | |
1020 | * Returns: 1 if entry was put successfully. | |
1021 | * -ENOMEM if may_resize==true and resize failed with -ENOMEM. | |
1022 | * Cannot return -ENOMEM if !may_resize. | |
1023 | */ | |
1024 | static int hashmap_base_put_boldly(HashmapBase *h, unsigned idx, | |
1025 | struct swap_entries *swap, bool may_resize) { | |
1026 | struct ordered_hashmap_entry *new_entry; | |
1027 | int r; | |
1028 | ||
1029 | assert(idx < n_buckets(h)); | |
1030 | ||
1031 | new_entry = bucket_at_swap(swap, IDX_PUT); | |
1032 | ||
1033 | if (may_resize) { | |
1034 | r = resize_buckets(h, 1); | |
1035 | if (r < 0) | |
1036 | return r; | |
1037 | if (r > 0) | |
1038 | idx = bucket_hash(h, new_entry->p.b.key); | |
1039 | } | |
1040 | assert(n_entries(h) < n_buckets(h)); | |
1041 | ||
1042 | if (h->type == HASHMAP_TYPE_ORDERED) { | |
1043 | OrderedHashmap *lh = (OrderedHashmap*) h; | |
1044 | ||
1045 | new_entry->iterate_next = IDX_NIL; | |
1046 | new_entry->iterate_previous = lh->iterate_list_tail; | |
1047 | ||
1048 | if (lh->iterate_list_tail != IDX_NIL) { | |
1049 | struct ordered_hashmap_entry *old_tail; | |
1050 | ||
1051 | old_tail = ordered_bucket_at(lh, lh->iterate_list_tail); | |
1052 | assert(old_tail->iterate_next == IDX_NIL); | |
1053 | old_tail->iterate_next = IDX_PUT; | |
1054 | } | |
1055 | ||
1056 | lh->iterate_list_tail = IDX_PUT; | |
1057 | if (lh->iterate_list_head == IDX_NIL) | |
1058 | lh->iterate_list_head = IDX_PUT; | |
1059 | } | |
1060 | ||
1061 | assert_se(hashmap_put_robin_hood(h, idx, swap) == false); | |
1062 | ||
1063 | n_entries_inc(h); | |
349cc4a5 | 1064 | #if ENABLE_DEBUG_HASHMAP |
89439d4f MS |
1065 | h->debug.max_entries = MAX(h->debug.max_entries, n_entries(h)); |
1066 | #endif | |
1067 | ||
84dcca75 VC |
1068 | base_set_dirty(h); |
1069 | ||
89439d4f MS |
1070 | return 1; |
1071 | } | |
1072 | #define hashmap_put_boldly(h, idx, swap, may_resize) \ | |
1073 | hashmap_base_put_boldly(HASHMAP_BASE(h), idx, swap, may_resize) | |
1074 | ||
1075 | /* | |
1076 | * Returns 0 if resize is not needed. | |
f131770b | 1077 | * 1 if successfully resized. |
89439d4f MS |
1078 | * -ENOMEM on allocation failure. |
1079 | */ | |
1080 | static int resize_buckets(HashmapBase *h, unsigned entries_add) { | |
1081 | struct swap_entries swap; | |
1a39bc8c | 1082 | void *new_storage; |
89439d4f MS |
1083 | dib_raw_t *old_dibs, *new_dibs; |
1084 | const struct hashmap_type_info *hi; | |
1085 | unsigned idx, optimal_idx; | |
1086 | unsigned old_n_buckets, new_n_buckets, n_rehashed, new_n_entries; | |
1087 | uint8_t new_shift; | |
1088 | bool rehash_next; | |
45fa9e29 LP |
1089 | |
1090 | assert(h); | |
1091 | ||
89439d4f MS |
1092 | hi = &hashmap_type_info[h->type]; |
1093 | new_n_entries = n_entries(h) + entries_add; | |
e4c691b5 MS |
1094 | |
1095 | /* overflow? */ | |
89439d4f | 1096 | if (_unlikely_(new_n_entries < entries_add)) |
e4c691b5 MS |
1097 | return -ENOMEM; |
1098 | ||
89439d4f MS |
1099 | /* For direct storage we allow 100% load, because it's tiny. */ |
1100 | if (!h->has_indirect && new_n_entries <= hi->n_direct_buckets) | |
9700d698 | 1101 | return 0; |
45fa9e29 | 1102 | |
89439d4f MS |
1103 | /* |
1104 | * Load factor = n/m = 1 - (1/INV_KEEP_FREE). | |
1105 | * From it follows: m = n + n/(INV_KEEP_FREE - 1) | |
1106 | */ | |
1107 | new_n_buckets = new_n_entries + new_n_entries / (INV_KEEP_FREE - 1); | |
1108 | /* overflow? */ | |
1109 | if (_unlikely_(new_n_buckets < new_n_entries)) | |
9700d698 | 1110 | return -ENOMEM; |
45fa9e29 | 1111 | |
89439d4f MS |
1112 | if (_unlikely_(new_n_buckets > UINT_MAX / (hi->entry_size + sizeof(dib_raw_t)))) |
1113 | return -ENOMEM; | |
a3b6fafe | 1114 | |
89439d4f | 1115 | old_n_buckets = n_buckets(h); |
45fa9e29 | 1116 | |
89439d4f MS |
1117 | if (_likely_(new_n_buckets <= old_n_buckets)) |
1118 | return 0; | |
45fa9e29 | 1119 | |
89439d4f MS |
1120 | new_shift = log2u_round_up(MAX( |
1121 | new_n_buckets * (hi->entry_size + sizeof(dib_raw_t)), | |
1122 | 2 * sizeof(struct direct_storage))); | |
45fa9e29 | 1123 | |
89439d4f MS |
1124 | /* Realloc storage (buckets and DIB array). */ |
1125 | new_storage = realloc(h->has_indirect ? h->indirect.storage : NULL, | |
1126 | 1U << new_shift); | |
1127 | if (!new_storage) | |
1128 | return -ENOMEM; | |
45fa9e29 | 1129 | |
89439d4f MS |
1130 | /* Must upgrade direct to indirect storage. */ |
1131 | if (!h->has_indirect) { | |
1132 | memcpy(new_storage, h->direct.storage, | |
1133 | old_n_buckets * (hi->entry_size + sizeof(dib_raw_t))); | |
1134 | h->indirect.n_entries = h->n_direct_entries; | |
1135 | h->indirect.idx_lowest_entry = 0; | |
1136 | h->n_direct_entries = 0; | |
1137 | } | |
45fa9e29 | 1138 | |
89439d4f MS |
1139 | /* Get a new hash key. If we've just upgraded to indirect storage, |
1140 | * allow reusing a previously generated key. It's still a different key | |
1141 | * from the shared one that we used for direct storage. */ | |
1142 | get_hash_key(h->indirect.hash_key, !h->has_indirect); | |
1143 | ||
1144 | h->has_indirect = true; | |
1145 | h->indirect.storage = new_storage; | |
1146 | h->indirect.n_buckets = (1U << new_shift) / | |
1147 | (hi->entry_size + sizeof(dib_raw_t)); | |
1148 | ||
1a39bc8c | 1149 | old_dibs = (dib_raw_t*)((uint8_t*) new_storage + hi->entry_size * old_n_buckets); |
89439d4f MS |
1150 | new_dibs = dib_raw_ptr(h); |
1151 | ||
1152 | /* | |
1153 | * Move the DIB array to the new place, replacing valid DIB values with | |
1154 | * DIB_RAW_REHASH to indicate all of the used buckets need rehashing. | |
1155 | * Note: Overlap is not possible, because we have at least doubled the | |
1156 | * number of buckets and dib_raw_t is smaller than any entry type. | |
1157 | */ | |
1158 | for (idx = 0; idx < old_n_buckets; idx++) { | |
1159 | assert(old_dibs[idx] != DIB_RAW_REHASH); | |
1160 | new_dibs[idx] = old_dibs[idx] == DIB_RAW_FREE ? DIB_RAW_FREE | |
1161 | : DIB_RAW_REHASH; | |
45fa9e29 LP |
1162 | } |
1163 | ||
89439d4f | 1164 | /* Zero the area of newly added entries (including the old DIB area) */ |
eccaf899 | 1165 | memzero(bucket_at(h, old_n_buckets), |
89439d4f | 1166 | (n_buckets(h) - old_n_buckets) * hi->entry_size); |
45fa9e29 | 1167 | |
89439d4f MS |
1168 | /* The upper half of the new DIB array needs initialization */ |
1169 | memset(&new_dibs[old_n_buckets], DIB_RAW_INIT, | |
1170 | (n_buckets(h) - old_n_buckets) * sizeof(dib_raw_t)); | |
9bf3b535 | 1171 | |
89439d4f MS |
1172 | /* Rehash entries that need it */ |
1173 | n_rehashed = 0; | |
1174 | for (idx = 0; idx < old_n_buckets; idx++) { | |
1175 | if (new_dibs[idx] != DIB_RAW_REHASH) | |
1176 | continue; | |
45fa9e29 | 1177 | |
89439d4f | 1178 | optimal_idx = bucket_hash(h, bucket_at(h, idx)->key); |
45fa9e29 | 1179 | |
89439d4f MS |
1180 | /* |
1181 | * Not much to do if by luck the entry hashes to its current | |
1182 | * location. Just set its DIB. | |
1183 | */ | |
1184 | if (optimal_idx == idx) { | |
1185 | new_dibs[idx] = 0; | |
1186 | n_rehashed++; | |
1187 | continue; | |
1188 | } | |
1189 | ||
1190 | new_dibs[idx] = DIB_RAW_FREE; | |
1191 | bucket_move_entry(h, &swap, idx, IDX_PUT); | |
1192 | /* bucket_move_entry does not clear the source */ | |
eccaf899 | 1193 | memzero(bucket_at(h, idx), hi->entry_size); |
89439d4f MS |
1194 | |
1195 | do { | |
1196 | /* | |
1197 | * Find the new bucket for the current entry. This may make | |
1198 | * another entry homeless and load it into IDX_PUT. | |
1199 | */ | |
1200 | rehash_next = hashmap_put_robin_hood(h, optimal_idx, &swap); | |
1201 | n_rehashed++; | |
1202 | ||
1203 | /* Did the current entry displace another one? */ | |
1204 | if (rehash_next) | |
1205 | optimal_idx = bucket_hash(h, bucket_at_swap(&swap, IDX_PUT)->p.b.key); | |
1206 | } while (rehash_next); | |
1207 | } | |
60918275 | 1208 | |
3b2b3d29 | 1209 | assert_se(n_rehashed == n_entries(h)); |
60918275 | 1210 | |
89439d4f MS |
1211 | return 1; |
1212 | } | |
45fa9e29 | 1213 | |
89439d4f MS |
1214 | /* |
1215 | * Finds an entry with a matching key | |
1216 | * Returns: index of the found entry, or IDX_NIL if not found. | |
1217 | */ | |
1218 | static unsigned base_bucket_scan(HashmapBase *h, unsigned idx, const void *key) { | |
1219 | struct hashmap_base_entry *e; | |
1220 | unsigned dib, distance; | |
1221 | dib_raw_t *dibs = dib_raw_ptr(h); | |
39c2a6f1 | 1222 | |
89439d4f | 1223 | assert(idx < n_buckets(h)); |
60918275 | 1224 | |
89439d4f MS |
1225 | for (distance = 0; ; distance++) { |
1226 | if (dibs[idx] == DIB_RAW_FREE) | |
1227 | return IDX_NIL; | |
60918275 | 1228 | |
89439d4f | 1229 | dib = bucket_calculate_dib(h, idx, dibs[idx]); |
60918275 | 1230 | |
89439d4f MS |
1231 | if (dib < distance) |
1232 | return IDX_NIL; | |
1233 | if (dib == distance) { | |
1234 | e = bucket_at(h, idx); | |
1235 | if (h->hash_ops->compare(e->key, key) == 0) | |
1236 | return idx; | |
1237 | } | |
1238 | ||
1239 | idx = next_idx(h, idx); | |
1240 | } | |
60918275 | 1241 | } |
89439d4f | 1242 | #define bucket_scan(h, idx, key) base_bucket_scan(HASHMAP_BASE(h), idx, key) |
60918275 | 1243 | |
923041cb | 1244 | int hashmap_put(Hashmap *h, const void *key, void *value) { |
89439d4f MS |
1245 | struct swap_entries swap; |
1246 | struct plain_hashmap_entry *e; | |
1247 | unsigned hash, idx; | |
923041cb MS |
1248 | |
1249 | assert(h); | |
1250 | ||
1251 | hash = bucket_hash(h, key); | |
89439d4f MS |
1252 | idx = bucket_scan(h, hash, key); |
1253 | if (idx != IDX_NIL) { | |
1254 | e = plain_bucket_at(h, idx); | |
923041cb MS |
1255 | if (e->value == value) |
1256 | return 0; | |
1257 | return -EEXIST; | |
1258 | } | |
1259 | ||
89439d4f MS |
1260 | e = &bucket_at_swap(&swap, IDX_PUT)->p; |
1261 | e->b.key = key; | |
1262 | e->value = value; | |
1263 | return hashmap_put_boldly(h, hash, &swap, true); | |
1264 | } | |
1265 | ||
1266 | int set_put(Set *s, const void *key) { | |
1267 | struct swap_entries swap; | |
1268 | struct hashmap_base_entry *e; | |
1269 | unsigned hash, idx; | |
1270 | ||
1271 | assert(s); | |
1272 | ||
1273 | hash = bucket_hash(s, key); | |
1274 | idx = bucket_scan(s, hash, key); | |
1275 | if (idx != IDX_NIL) | |
1276 | return 0; | |
1277 | ||
1278 | e = &bucket_at_swap(&swap, IDX_PUT)->p.b; | |
1279 | e->key = key; | |
1280 | return hashmap_put_boldly(s, hash, &swap, true); | |
923041cb MS |
1281 | } |
1282 | ||
c09ce222 | 1283 | int set_ensure_put(Set **s, const struct hash_ops *hash_ops, const void *key) { |
0f9ccd95 ZJS |
1284 | int r; |
1285 | ||
54bbfa00 | 1286 | r = set_ensure_allocated(s, hash_ops); |
0f9ccd95 ZJS |
1287 | if (r < 0) |
1288 | return r; | |
1289 | ||
1290 | return set_put(*s, key); | |
1291 | } | |
1292 | ||
c09ce222 | 1293 | int set_ensure_consume(Set **s, const struct hash_ops *hash_ops, void *key) { |
fcc1d031 ZJS |
1294 | int r; |
1295 | ||
c09ce222 | 1296 | r = set_ensure_put(s, hash_ops, key); |
fcc1d031 ZJS |
1297 | if (r <= 0) { |
1298 | if (hash_ops && hash_ops->free_key) | |
1299 | hash_ops->free_key(key); | |
1300 | else | |
1301 | free(key); | |
1302 | } | |
1303 | ||
1304 | return r; | |
1305 | } | |
1306 | ||
3158713e | 1307 | int hashmap_replace(Hashmap *h, const void *key, void *value) { |
89439d4f MS |
1308 | struct swap_entries swap; |
1309 | struct plain_hashmap_entry *e; | |
1310 | unsigned hash, idx; | |
3158713e LP |
1311 | |
1312 | assert(h); | |
1313 | ||
a3b6fafe | 1314 | hash = bucket_hash(h, key); |
89439d4f MS |
1315 | idx = bucket_scan(h, hash, key); |
1316 | if (idx != IDX_NIL) { | |
1317 | e = plain_bucket_at(h, idx); | |
349cc4a5 | 1318 | #if ENABLE_DEBUG_HASHMAP |
89439d4f MS |
1319 | /* Although the key is equal, the key pointer may have changed, |
1320 | * and this would break our assumption for iterating. So count | |
1321 | * this operation as incompatible with iteration. */ | |
1322 | if (e->b.key != key) { | |
1323 | h->b.debug.put_count++; | |
1324 | h->b.debug.rem_count++; | |
1325 | h->b.debug.last_rem_idx = idx; | |
1326 | } | |
1327 | #endif | |
1328 | e->b.key = key; | |
3158713e | 1329 | e->value = value; |
84dcca75 VC |
1330 | hashmap_set_dirty(h); |
1331 | ||
3158713e LP |
1332 | return 0; |
1333 | } | |
1334 | ||
89439d4f MS |
1335 | e = &bucket_at_swap(&swap, IDX_PUT)->p; |
1336 | e->b.key = key; | |
1337 | e->value = value; | |
1338 | return hashmap_put_boldly(h, hash, &swap, true); | |
3158713e LP |
1339 | } |
1340 | ||
d99ae53a | 1341 | int hashmap_update(Hashmap *h, const void *key, void *value) { |
89439d4f MS |
1342 | struct plain_hashmap_entry *e; |
1343 | unsigned hash, idx; | |
d99ae53a LP |
1344 | |
1345 | assert(h); | |
1346 | ||
a3b6fafe | 1347 | hash = bucket_hash(h, key); |
89439d4f MS |
1348 | idx = bucket_scan(h, hash, key); |
1349 | if (idx == IDX_NIL) | |
d99ae53a LP |
1350 | return -ENOENT; |
1351 | ||
89439d4f | 1352 | e = plain_bucket_at(h, idx); |
d99ae53a | 1353 | e->value = value; |
84dcca75 VC |
1354 | hashmap_set_dirty(h); |
1355 | ||
d99ae53a LP |
1356 | return 0; |
1357 | } | |
1358 | ||
8a35af80 | 1359 | void* _hashmap_get(HashmapBase *h, const void *key) { |
89439d4f MS |
1360 | struct hashmap_base_entry *e; |
1361 | unsigned hash, idx; | |
60918275 LP |
1362 | |
1363 | if (!h) | |
1364 | return NULL; | |
1365 | ||
a3b6fafe | 1366 | hash = bucket_hash(h, key); |
89439d4f MS |
1367 | idx = bucket_scan(h, hash, key); |
1368 | if (idx == IDX_NIL) | |
60918275 LP |
1369 | return NULL; |
1370 | ||
89439d4f MS |
1371 | e = bucket_at(h, idx); |
1372 | return entry_value(h, e); | |
60918275 LP |
1373 | } |
1374 | ||
8a35af80 | 1375 | void* hashmap_get2(Hashmap *h, const void *key, void **key2) { |
89439d4f MS |
1376 | struct plain_hashmap_entry *e; |
1377 | unsigned hash, idx; | |
d99ae53a LP |
1378 | |
1379 | if (!h) | |
1380 | return NULL; | |
1381 | ||
a3b6fafe | 1382 | hash = bucket_hash(h, key); |
89439d4f MS |
1383 | idx = bucket_scan(h, hash, key); |
1384 | if (idx == IDX_NIL) | |
d99ae53a LP |
1385 | return NULL; |
1386 | ||
89439d4f | 1387 | e = plain_bucket_at(h, idx); |
d99ae53a | 1388 | if (key2) |
89439d4f | 1389 | *key2 = (void*) e->b.key; |
d99ae53a LP |
1390 | |
1391 | return e->value; | |
1392 | } | |
1393 | ||
138f49e4 | 1394 | bool _hashmap_contains(HashmapBase *h, const void *key) { |
96342de6 | 1395 | unsigned hash; |
96342de6 LN |
1396 | |
1397 | if (!h) | |
1398 | return false; | |
1399 | ||
a3b6fafe | 1400 | hash = bucket_hash(h, key); |
89439d4f | 1401 | return bucket_scan(h, hash, key) != IDX_NIL; |
96342de6 LN |
1402 | } |
1403 | ||
8a35af80 | 1404 | void* _hashmap_remove(HashmapBase *h, const void *key) { |
89439d4f MS |
1405 | struct hashmap_base_entry *e; |
1406 | unsigned hash, idx; | |
60918275 LP |
1407 | void *data; |
1408 | ||
1409 | if (!h) | |
1410 | return NULL; | |
1411 | ||
a3b6fafe | 1412 | hash = bucket_hash(h, key); |
89439d4f MS |
1413 | idx = bucket_scan(h, hash, key); |
1414 | if (idx == IDX_NIL) | |
60918275 LP |
1415 | return NULL; |
1416 | ||
89439d4f MS |
1417 | e = bucket_at(h, idx); |
1418 | data = entry_value(h, e); | |
1419 | remove_entry(h, idx); | |
60918275 LP |
1420 | |
1421 | return data; | |
1422 | } | |
1423 | ||
8a35af80 | 1424 | void* hashmap_remove2(Hashmap *h, const void *key, void **rkey) { |
89439d4f MS |
1425 | struct plain_hashmap_entry *e; |
1426 | unsigned hash, idx; | |
c582a3b3 LP |
1427 | void *data; |
1428 | ||
1429 | if (!h) { | |
1430 | if (rkey) | |
1431 | *rkey = NULL; | |
1432 | return NULL; | |
1433 | } | |
1434 | ||
1435 | hash = bucket_hash(h, key); | |
89439d4f MS |
1436 | idx = bucket_scan(h, hash, key); |
1437 | if (idx == IDX_NIL) { | |
c582a3b3 LP |
1438 | if (rkey) |
1439 | *rkey = NULL; | |
1440 | return NULL; | |
1441 | } | |
1442 | ||
89439d4f | 1443 | e = plain_bucket_at(h, idx); |
c582a3b3 LP |
1444 | data = e->value; |
1445 | if (rkey) | |
89439d4f | 1446 | *rkey = (void*) e->b.key; |
c582a3b3 | 1447 | |
89439d4f | 1448 | remove_entry(h, idx); |
c582a3b3 LP |
1449 | |
1450 | return data; | |
1451 | } | |
1452 | ||
101d8e63 | 1453 | int hashmap_remove_and_put(Hashmap *h, const void *old_key, const void *new_key, void *value) { |
89439d4f MS |
1454 | struct swap_entries swap; |
1455 | struct plain_hashmap_entry *e; | |
1456 | unsigned old_hash, new_hash, idx; | |
101d8e63 LP |
1457 | |
1458 | if (!h) | |
1459 | return -ENOENT; | |
1460 | ||
a3b6fafe | 1461 | old_hash = bucket_hash(h, old_key); |
89439d4f MS |
1462 | idx = bucket_scan(h, old_hash, old_key); |
1463 | if (idx == IDX_NIL) | |
101d8e63 LP |
1464 | return -ENOENT; |
1465 | ||
a3b6fafe | 1466 | new_hash = bucket_hash(h, new_key); |
89439d4f | 1467 | if (bucket_scan(h, new_hash, new_key) != IDX_NIL) |
101d8e63 LP |
1468 | return -EEXIST; |
1469 | ||
89439d4f | 1470 | remove_entry(h, idx); |
101d8e63 | 1471 | |
89439d4f MS |
1472 | e = &bucket_at_swap(&swap, IDX_PUT)->p; |
1473 | e->b.key = new_key; | |
101d8e63 | 1474 | e->value = value; |
89439d4f MS |
1475 | assert_se(hashmap_put_boldly(h, new_hash, &swap, false) == 1); |
1476 | ||
1477 | return 0; | |
1478 | } | |
1479 | ||
1480 | int set_remove_and_put(Set *s, const void *old_key, const void *new_key) { | |
1481 | struct swap_entries swap; | |
1482 | struct hashmap_base_entry *e; | |
1483 | unsigned old_hash, new_hash, idx; | |
101d8e63 | 1484 | |
89439d4f MS |
1485 | if (!s) |
1486 | return -ENOENT; | |
1487 | ||
1488 | old_hash = bucket_hash(s, old_key); | |
1489 | idx = bucket_scan(s, old_hash, old_key); | |
1490 | if (idx == IDX_NIL) | |
1491 | return -ENOENT; | |
1492 | ||
1493 | new_hash = bucket_hash(s, new_key); | |
1494 | if (bucket_scan(s, new_hash, new_key) != IDX_NIL) | |
1495 | return -EEXIST; | |
1496 | ||
1497 | remove_entry(s, idx); | |
1498 | ||
1499 | e = &bucket_at_swap(&swap, IDX_PUT)->p.b; | |
1500 | e->key = new_key; | |
1501 | assert_se(hashmap_put_boldly(s, new_hash, &swap, false) == 1); | |
101d8e63 LP |
1502 | |
1503 | return 0; | |
1504 | } | |
1505 | ||
8fe914ec | 1506 | int hashmap_remove_and_replace(Hashmap *h, const void *old_key, const void *new_key, void *value) { |
89439d4f MS |
1507 | struct swap_entries swap; |
1508 | struct plain_hashmap_entry *e; | |
1509 | unsigned old_hash, new_hash, idx_old, idx_new; | |
8fe914ec LP |
1510 | |
1511 | if (!h) | |
1512 | return -ENOENT; | |
1513 | ||
a3b6fafe | 1514 | old_hash = bucket_hash(h, old_key); |
89439d4f MS |
1515 | idx_old = bucket_scan(h, old_hash, old_key); |
1516 | if (idx_old == IDX_NIL) | |
8fe914ec LP |
1517 | return -ENOENT; |
1518 | ||
89439d4f | 1519 | old_key = bucket_at(HASHMAP_BASE(h), idx_old)->key; |
8fe914ec | 1520 | |
89439d4f MS |
1521 | new_hash = bucket_hash(h, new_key); |
1522 | idx_new = bucket_scan(h, new_hash, new_key); | |
1523 | if (idx_new != IDX_NIL) | |
1524 | if (idx_old != idx_new) { | |
1525 | remove_entry(h, idx_new); | |
1526 | /* Compensate for a possible backward shift. */ | |
1527 | if (old_key != bucket_at(HASHMAP_BASE(h), idx_old)->key) | |
1528 | idx_old = prev_idx(HASHMAP_BASE(h), idx_old); | |
1529 | assert(old_key == bucket_at(HASHMAP_BASE(h), idx_old)->key); | |
1530 | } | |
1531 | ||
1532 | remove_entry(h, idx_old); | |
1533 | ||
1534 | e = &bucket_at_swap(&swap, IDX_PUT)->p; | |
1535 | e->b.key = new_key; | |
8fe914ec | 1536 | e->value = value; |
89439d4f | 1537 | assert_se(hashmap_put_boldly(h, new_hash, &swap, false) == 1); |
8fe914ec LP |
1538 | |
1539 | return 0; | |
1540 | } | |
1541 | ||
8a35af80 | 1542 | void* _hashmap_remove_value(HashmapBase *h, const void *key, void *value) { |
c380b84d | 1543 | struct hashmap_base_entry *e; |
89439d4f | 1544 | unsigned hash, idx; |
3158713e LP |
1545 | |
1546 | if (!h) | |
1547 | return NULL; | |
1548 | ||
a3b6fafe | 1549 | hash = bucket_hash(h, key); |
89439d4f MS |
1550 | idx = bucket_scan(h, hash, key); |
1551 | if (idx == IDX_NIL) | |
3158713e LP |
1552 | return NULL; |
1553 | ||
c380b84d LP |
1554 | e = bucket_at(h, idx); |
1555 | if (entry_value(h, e) != value) | |
3158713e LP |
1556 | return NULL; |
1557 | ||
89439d4f | 1558 | remove_entry(h, idx); |
3158713e LP |
1559 | |
1560 | return value; | |
1561 | } | |
1562 | ||
89439d4f MS |
1563 | static unsigned find_first_entry(HashmapBase *h) { |
1564 | Iterator i = ITERATOR_FIRST; | |
60918275 | 1565 | |
89439d4f MS |
1566 | if (!h || !n_entries(h)) |
1567 | return IDX_NIL; | |
60918275 | 1568 | |
89439d4f | 1569 | return hashmap_iterate_entry(h, &i); |
60918275 LP |
1570 | } |
1571 | ||
8a35af80 | 1572 | void* _hashmap_first_key_and_value(HashmapBase *h, bool remove, void **ret_key) { |
89439d4f | 1573 | struct hashmap_base_entry *e; |
7ef670c3 | 1574 | void *key, *data; |
89439d4f | 1575 | unsigned idx; |
60918275 | 1576 | |
89439d4f | 1577 | idx = find_first_entry(h); |
51c682df TH |
1578 | if (idx == IDX_NIL) { |
1579 | if (ret_key) | |
1580 | *ret_key = NULL; | |
60918275 | 1581 | return NULL; |
51c682df | 1582 | } |
60918275 | 1583 | |
89439d4f | 1584 | e = bucket_at(h, idx); |
7ef670c3 | 1585 | key = (void*) e->key; |
89439d4f | 1586 | data = entry_value(h, e); |
60918275 | 1587 | |
7ef670c3 YW |
1588 | if (remove) |
1589 | remove_entry(h, idx); | |
60918275 | 1590 | |
7ef670c3 YW |
1591 | if (ret_key) |
1592 | *ret_key = key; | |
22be093f | 1593 | |
7ef670c3 | 1594 | return data; |
22be093f LP |
1595 | } |
1596 | ||
138f49e4 | 1597 | unsigned _hashmap_size(HashmapBase *h) { |
60918275 LP |
1598 | if (!h) |
1599 | return 0; | |
1600 | ||
89439d4f | 1601 | return n_entries(h); |
60918275 LP |
1602 | } |
1603 | ||
138f49e4 | 1604 | unsigned _hashmap_buckets(HashmapBase *h) { |
45fa9e29 LP |
1605 | if (!h) |
1606 | return 0; | |
1607 | ||
89439d4f | 1608 | return n_buckets(h); |
45fa9e29 LP |
1609 | } |
1610 | ||
138f49e4 | 1611 | int _hashmap_merge(Hashmap *h, Hashmap *other) { |
89439d4f MS |
1612 | Iterator i; |
1613 | unsigned idx; | |
60918275 | 1614 | |
89439d4f | 1615 | assert(h); |
60918275 | 1616 | |
89439d4f MS |
1617 | HASHMAP_FOREACH_IDX(idx, HASHMAP_BASE(other), i) { |
1618 | struct plain_hashmap_entry *pe = plain_bucket_at(other, idx); | |
1619 | int r; | |
91cdde8a | 1620 | |
89439d4f MS |
1621 | r = hashmap_put(h, pe->b.key, pe->value); |
1622 | if (r < 0 && r != -EEXIST) | |
1623 | return r; | |
1624 | } | |
91cdde8a | 1625 | |
89439d4f MS |
1626 | return 0; |
1627 | } | |
91cdde8a | 1628 | |
89439d4f MS |
1629 | int set_merge(Set *s, Set *other) { |
1630 | Iterator i; | |
1631 | unsigned idx; | |
91cdde8a | 1632 | |
89439d4f MS |
1633 | assert(s); |
1634 | ||
1635 | HASHMAP_FOREACH_IDX(idx, HASHMAP_BASE(other), i) { | |
1636 | struct set_entry *se = set_bucket_at(other, idx); | |
91cdde8a LP |
1637 | int r; |
1638 | ||
89439d4f MS |
1639 | r = set_put(s, se->b.key); |
1640 | if (r < 0) | |
a3b6fafe | 1641 | return r; |
91cdde8a LP |
1642 | } |
1643 | ||
1644 | return 0; | |
1645 | } | |
1646 | ||
138f49e4 | 1647 | int _hashmap_reserve(HashmapBase *h, unsigned entries_add) { |
e4c691b5 MS |
1648 | int r; |
1649 | ||
1650 | assert(h); | |
1651 | ||
1652 | r = resize_buckets(h, entries_add); | |
1653 | if (r < 0) | |
1654 | return r; | |
1655 | ||
1656 | return 0; | |
1657 | } | |
1658 | ||
89439d4f MS |
1659 | /* |
1660 | * The same as hashmap_merge(), but every new item from other is moved to h. | |
1661 | * Keys already in h are skipped and stay in other. | |
1662 | * Returns: 0 on success. | |
1663 | * -ENOMEM on alloc failure, in which case no move has been done. | |
1664 | */ | |
138f49e4 | 1665 | int _hashmap_move(HashmapBase *h, HashmapBase *other) { |
89439d4f MS |
1666 | struct swap_entries swap; |
1667 | struct hashmap_base_entry *e, *n; | |
1668 | Iterator i; | |
1669 | unsigned idx; | |
1670 | int r; | |
101d8e63 LP |
1671 | |
1672 | assert(h); | |
1673 | ||
101d8e63 | 1674 | if (!other) |
7ad63f57 | 1675 | return 0; |
101d8e63 | 1676 | |
89439d4f MS |
1677 | assert(other->type == h->type); |
1678 | ||
1679 | /* | |
1680 | * This reserves buckets for the worst case, where none of other's | |
1681 | * entries are yet present in h. This is preferable to risking | |
1682 | * an allocation failure in the middle of the moving and having to | |
1683 | * rollback or return a partial result. | |
1684 | */ | |
1685 | r = resize_buckets(h, n_entries(other)); | |
1686 | if (r < 0) | |
1687 | return r; | |
101d8e63 | 1688 | |
89439d4f MS |
1689 | HASHMAP_FOREACH_IDX(idx, other, i) { |
1690 | unsigned h_hash; | |
101d8e63 | 1691 | |
89439d4f | 1692 | e = bucket_at(other, idx); |
a3b6fafe | 1693 | h_hash = bucket_hash(h, e->key); |
89439d4f | 1694 | if (bucket_scan(h, h_hash, e->key) != IDX_NIL) |
101d8e63 LP |
1695 | continue; |
1696 | ||
89439d4f MS |
1697 | n = &bucket_at_swap(&swap, IDX_PUT)->p.b; |
1698 | n->key = e->key; | |
1699 | if (h->type != HASHMAP_TYPE_SET) | |
1700 | ((struct plain_hashmap_entry*) n)->value = | |
1701 | ((struct plain_hashmap_entry*) e)->value; | |
1702 | assert_se(hashmap_put_boldly(h, h_hash, &swap, false) == 1); | |
1703 | ||
1704 | remove_entry(other, idx); | |
101d8e63 | 1705 | } |
7ad63f57 MS |
1706 | |
1707 | return 0; | |
101d8e63 LP |
1708 | } |
1709 | ||
138f49e4 | 1710 | int _hashmap_move_one(HashmapBase *h, HashmapBase *other, const void *key) { |
89439d4f MS |
1711 | struct swap_entries swap; |
1712 | unsigned h_hash, other_hash, idx; | |
1713 | struct hashmap_base_entry *e, *n; | |
1714 | int r; | |
101d8e63 | 1715 | |
101d8e63 LP |
1716 | assert(h); |
1717 | ||
a3b6fafe | 1718 | h_hash = bucket_hash(h, key); |
89439d4f | 1719 | if (bucket_scan(h, h_hash, key) != IDX_NIL) |
101d8e63 LP |
1720 | return -EEXIST; |
1721 | ||
bf3d3e2b MS |
1722 | if (!other) |
1723 | return -ENOENT; | |
1724 | ||
89439d4f MS |
1725 | assert(other->type == h->type); |
1726 | ||
a3b6fafe | 1727 | other_hash = bucket_hash(other, key); |
89439d4f MS |
1728 | idx = bucket_scan(other, other_hash, key); |
1729 | if (idx == IDX_NIL) | |
101d8e63 LP |
1730 | return -ENOENT; |
1731 | ||
89439d4f MS |
1732 | e = bucket_at(other, idx); |
1733 | ||
1734 | n = &bucket_at_swap(&swap, IDX_PUT)->p.b; | |
1735 | n->key = e->key; | |
1736 | if (h->type != HASHMAP_TYPE_SET) | |
1737 | ((struct plain_hashmap_entry*) n)->value = | |
1738 | ((struct plain_hashmap_entry*) e)->value; | |
1739 | r = hashmap_put_boldly(h, h_hash, &swap, true); | |
1740 | if (r < 0) | |
1741 | return r; | |
101d8e63 | 1742 | |
89439d4f | 1743 | remove_entry(other, idx); |
101d8e63 LP |
1744 | return 0; |
1745 | } | |
1746 | ||
c09ce222 | 1747 | HashmapBase* _hashmap_copy(HashmapBase *h) { |
89439d4f MS |
1748 | HashmapBase *copy; |
1749 | int r; | |
91cdde8a LP |
1750 | |
1751 | assert(h); | |
1752 | ||
c09ce222 | 1753 | copy = hashmap_base_new(h->hash_ops, h->type); |
45fa9e29 | 1754 | if (!copy) |
91cdde8a LP |
1755 | return NULL; |
1756 | ||
89439d4f MS |
1757 | switch (h->type) { |
1758 | case HASHMAP_TYPE_PLAIN: | |
1759 | case HASHMAP_TYPE_ORDERED: | |
1760 | r = hashmap_merge((Hashmap*)copy, (Hashmap*)h); | |
1761 | break; | |
1762 | case HASHMAP_TYPE_SET: | |
1763 | r = set_merge((Set*)copy, (Set*)h); | |
1764 | break; | |
1765 | default: | |
04499a70 | 1766 | assert_not_reached(); |
89439d4f MS |
1767 | } |
1768 | ||
add74e89 | 1769 | if (r < 0) |
885001ed | 1770 | return _hashmap_free(copy); |
91cdde8a LP |
1771 | |
1772 | return copy; | |
1773 | } | |
db1413d7 | 1774 | |
8a35af80 | 1775 | char** _hashmap_get_strv(HashmapBase *h) { |
db1413d7 | 1776 | char **sv; |
89439d4f MS |
1777 | Iterator i; |
1778 | unsigned idx, n; | |
db1413d7 | 1779 | |
107e2163 LP |
1780 | if (!h) |
1781 | return new0(char*, 1); | |
1782 | ||
89439d4f | 1783 | sv = new(char*, n_entries(h)+1); |
729e3769 | 1784 | if (!sv) |
db1413d7 KS |
1785 | return NULL; |
1786 | ||
1787 | n = 0; | |
89439d4f MS |
1788 | HASHMAP_FOREACH_IDX(idx, h, i) |
1789 | sv[n++] = entry_value(h, bucket_at(h, idx)); | |
db1413d7 KS |
1790 | sv[n] = NULL; |
1791 | ||
1792 | return sv; | |
1793 | } | |
3c1668da | 1794 | |
24655047 YW |
1795 | char** set_to_strv(Set **s) { |
1796 | assert(s); | |
1797 | ||
1798 | /* This is similar to set_get_strv(), but invalidates the set on success. */ | |
1799 | ||
1800 | char **v = new(char*, set_size(*s) + 1); | |
1801 | if (!v) | |
1802 | return NULL; | |
1803 | ||
1804 | for (char **p = v; (*p = set_steal_first(*s)); p++) | |
1805 | ; | |
1806 | ||
1807 | assert(set_isempty(*s)); | |
1808 | *s = set_free(*s); | |
1809 | return v; | |
1810 | } | |
1811 | ||
8a35af80 | 1812 | void* ordered_hashmap_next(OrderedHashmap *h, const void *key) { |
89439d4f MS |
1813 | struct ordered_hashmap_entry *e; |
1814 | unsigned hash, idx; | |
3c1668da | 1815 | |
3c1668da LP |
1816 | if (!h) |
1817 | return NULL; | |
1818 | ||
a3b6fafe | 1819 | hash = bucket_hash(h, key); |
89439d4f MS |
1820 | idx = bucket_scan(h, hash, key); |
1821 | if (idx == IDX_NIL) | |
3c1668da LP |
1822 | return NULL; |
1823 | ||
89439d4f MS |
1824 | e = ordered_bucket_at(h, idx); |
1825 | if (e->iterate_next == IDX_NIL) | |
3c1668da | 1826 | return NULL; |
89439d4f MS |
1827 | return ordered_bucket_at(h, e->iterate_next)->p.value; |
1828 | } | |
3c1668da | 1829 | |
89439d4f MS |
1830 | int set_consume(Set *s, void *value) { |
1831 | int r; | |
1832 | ||
d97c5aea LP |
1833 | assert(s); |
1834 | assert(value); | |
1835 | ||
89439d4f | 1836 | r = set_put(s, value); |
575ccc1b | 1837 | if (r <= 0) |
89439d4f MS |
1838 | free(value); |
1839 | ||
1840 | return r; | |
1841 | } | |
1842 | ||
c09ce222 | 1843 | int hashmap_put_strdup_full(Hashmap **h, const struct hash_ops *hash_ops, const char *k, const char *v) { |
87da8784 ZJS |
1844 | int r; |
1845 | ||
c09ce222 | 1846 | r = hashmap_ensure_allocated(h, hash_ops); |
87da8784 ZJS |
1847 | if (r < 0) |
1848 | return r; | |
1849 | ||
1850 | _cleanup_free_ char *kdup = NULL, *vdup = NULL; | |
25b3e2a8 | 1851 | |
87da8784 | 1852 | kdup = strdup(k); |
25b3e2a8 | 1853 | if (!kdup) |
87da8784 ZJS |
1854 | return -ENOMEM; |
1855 | ||
25b3e2a8 ZJS |
1856 | if (v) { |
1857 | vdup = strdup(v); | |
1858 | if (!vdup) | |
1859 | return -ENOMEM; | |
1860 | } | |
1861 | ||
87da8784 ZJS |
1862 | r = hashmap_put(*h, kdup, vdup); |
1863 | if (r < 0) { | |
25b3e2a8 | 1864 | if (r == -EEXIST && streq_ptr(v, hashmap_get(*h, kdup))) |
87da8784 ZJS |
1865 | return 0; |
1866 | return r; | |
1867 | } | |
1868 | ||
25b3e2a8 ZJS |
1869 | /* 0 with non-null vdup would mean vdup is already in the hashmap, which cannot be */ |
1870 | assert(vdup == NULL || r > 0); | |
1871 | if (r > 0) | |
1872 | kdup = vdup = NULL; | |
87da8784 | 1873 | |
25b3e2a8 | 1874 | return r; |
87da8784 ZJS |
1875 | } |
1876 | ||
c09ce222 | 1877 | int set_put_strndup_full(Set **s, const struct hash_ops *hash_ops, const char *p, size_t n) { |
89439d4f | 1878 | char *c; |
be327321 | 1879 | int r; |
89439d4f MS |
1880 | |
1881 | assert(s); | |
1882 | assert(p); | |
1883 | ||
54bbfa00 | 1884 | r = set_ensure_allocated(s, hash_ops); |
be327321 ZJS |
1885 | if (r < 0) |
1886 | return r; | |
1887 | ||
cb649d12 YW |
1888 | if (n == SIZE_MAX) { |
1889 | if (set_contains(*s, (char*) p)) | |
1890 | return 0; | |
454f0f86 | 1891 | |
cb649d12 YW |
1892 | c = strdup(p); |
1893 | } else | |
1894 | c = strndup(p, n); | |
89439d4f MS |
1895 | if (!c) |
1896 | return -ENOMEM; | |
1897 | ||
be327321 | 1898 | return set_consume(*s, c); |
89439d4f MS |
1899 | } |
1900 | ||
c09ce222 | 1901 | int set_put_strdupv_full(Set **s, const struct hash_ops *hash_ops, char **l) { |
89439d4f | 1902 | int n = 0, r; |
89439d4f | 1903 | |
d97c5aea LP |
1904 | assert(s); |
1905 | ||
89439d4f | 1906 | STRV_FOREACH(i, l) { |
c09ce222 | 1907 | r = set_put_strndup_full(s, hash_ops, *i, SIZE_MAX); |
89439d4f MS |
1908 | if (r < 0) |
1909 | return r; | |
1910 | ||
1911 | n += r; | |
1912 | } | |
1913 | ||
1914 | return n; | |
3c1668da | 1915 | } |
d97c5aea LP |
1916 | |
1917 | int set_put_strsplit(Set *s, const char *v, const char *separators, ExtractFlags flags) { | |
99534007 | 1918 | const char *p = ASSERT_PTR(v); |
d97c5aea LP |
1919 | int r; |
1920 | ||
1921 | assert(s); | |
d97c5aea LP |
1922 | |
1923 | for (;;) { | |
1924 | char *word; | |
1925 | ||
1926 | r = extract_first_word(&p, &word, separators, flags); | |
1927 | if (r <= 0) | |
1928 | return r; | |
1929 | ||
1930 | r = set_consume(s, word); | |
1931 | if (r < 0) | |
1932 | return r; | |
1933 | } | |
1934 | } | |
45ea84d8 VC |
1935 | |
1936 | /* expand the cachemem if needed, return true if newly (re)activated. */ | |
319a4f4b | 1937 | static int cachemem_maintain(CacheMem *mem, size_t size) { |
45ea84d8 VC |
1938 | assert(mem); |
1939 | ||
319a4f4b | 1940 | if (!GREEDY_REALLOC(mem->ptr, size)) { |
45ea84d8 VC |
1941 | if (size > 0) |
1942 | return -ENOMEM; | |
1943 | } | |
1944 | ||
afbbc068 ZJS |
1945 | if (!mem->active) { |
1946 | mem->active = true; | |
1947 | return true; | |
1948 | } | |
45ea84d8 | 1949 | |
afbbc068 | 1950 | return false; |
45ea84d8 VC |
1951 | } |
1952 | ||
1953 | int iterated_cache_get(IteratedCache *cache, const void ***res_keys, const void ***res_values, unsigned *res_n_entries) { | |
1954 | bool sync_keys = false, sync_values = false; | |
319a4f4b | 1955 | size_t size; |
45ea84d8 VC |
1956 | int r; |
1957 | ||
1958 | assert(cache); | |
1959 | assert(cache->hashmap); | |
1960 | ||
1961 | size = n_entries(cache->hashmap); | |
1962 | ||
1963 | if (res_keys) { | |
1964 | r = cachemem_maintain(&cache->keys, size); | |
1965 | if (r < 0) | |
1966 | return r; | |
1967 | ||
1968 | sync_keys = r; | |
1969 | } else | |
1970 | cache->keys.active = false; | |
1971 | ||
1972 | if (res_values) { | |
1973 | r = cachemem_maintain(&cache->values, size); | |
1974 | if (r < 0) | |
1975 | return r; | |
1976 | ||
1977 | sync_values = r; | |
1978 | } else | |
1979 | cache->values.active = false; | |
1980 | ||
1981 | if (cache->hashmap->dirty) { | |
1982 | if (cache->keys.active) | |
1983 | sync_keys = true; | |
1984 | if (cache->values.active) | |
1985 | sync_values = true; | |
1986 | ||
1987 | cache->hashmap->dirty = false; | |
1988 | } | |
1989 | ||
1990 | if (sync_keys || sync_values) { | |
1991 | unsigned i, idx; | |
1992 | Iterator iter; | |
1993 | ||
1994 | i = 0; | |
1995 | HASHMAP_FOREACH_IDX(idx, cache->hashmap, iter) { | |
1996 | struct hashmap_base_entry *e; | |
1997 | ||
1998 | e = bucket_at(cache->hashmap, idx); | |
1999 | ||
2000 | if (sync_keys) | |
2001 | cache->keys.ptr[i] = e->key; | |
2002 | if (sync_values) | |
2003 | cache->values.ptr[i] = entry_value(cache->hashmap, e); | |
2004 | i++; | |
2005 | } | |
2006 | } | |
2007 | ||
2008 | if (res_keys) | |
2009 | *res_keys = cache->keys.ptr; | |
2010 | if (res_values) | |
2011 | *res_values = cache->values.ptr; | |
2012 | if (res_n_entries) | |
2013 | *res_n_entries = size; | |
2014 | ||
2015 | return 0; | |
2016 | } | |
2017 | ||
8a35af80 | 2018 | IteratedCache* iterated_cache_free(IteratedCache *cache) { |
45ea84d8 VC |
2019 | if (cache) { |
2020 | free(cache->keys.ptr); | |
2021 | free(cache->values.ptr); | |
45ea84d8 VC |
2022 | } |
2023 | ||
b61658fd | 2024 | return mfree(cache); |
45ea84d8 | 2025 | } |
4dbce717 | 2026 | |
8d80f275 | 2027 | int set_strjoin(Set *s, const char *separator, bool wrap_with_separator, char **ret) { |
4dbce717 | 2028 | _cleanup_free_ char *str = NULL; |
319a4f4b | 2029 | size_t separator_len, len = 0; |
4dbce717 | 2030 | const char *value; |
8d80f275 | 2031 | bool first; |
4dbce717 YW |
2032 | |
2033 | assert(ret); | |
2034 | ||
8d80f275 YW |
2035 | if (set_isempty(s)) { |
2036 | *ret = NULL; | |
2037 | return 0; | |
2038 | } | |
2039 | ||
4dbce717 YW |
2040 | separator_len = strlen_ptr(separator); |
2041 | ||
8d80f275 YW |
2042 | if (separator_len == 0) |
2043 | wrap_with_separator = false; | |
2044 | ||
2045 | first = !wrap_with_separator; | |
2046 | ||
4dbce717 YW |
2047 | SET_FOREACH(value, s) { |
2048 | size_t l = strlen_ptr(value); | |
2049 | ||
2050 | if (l == 0) | |
2051 | continue; | |
2052 | ||
319a4f4b | 2053 | if (!GREEDY_REALLOC(str, len + l + (first ? 0 : separator_len) + (wrap_with_separator ? separator_len : 0) + 1)) |
4dbce717 YW |
2054 | return -ENOMEM; |
2055 | ||
2056 | if (separator_len > 0 && !first) { | |
2057 | memcpy(str + len, separator, separator_len); | |
2058 | len += separator_len; | |
2059 | } | |
2060 | ||
2061 | memcpy(str + len, value, l); | |
2062 | len += l; | |
2063 | first = false; | |
2064 | } | |
8d80f275 YW |
2065 | |
2066 | if (wrap_with_separator) { | |
2067 | memcpy(str + len, separator, separator_len); | |
2068 | len += separator_len; | |
2069 | } | |
2070 | ||
2071 | str[len] = '\0'; | |
4dbce717 YW |
2072 | |
2073 | *ret = TAKE_PTR(str); | |
2074 | return 0; | |
2075 | } | |
e4304fb8 LP |
2076 | |
2077 | bool set_equal(Set *a, Set *b) { | |
2078 | void *p; | |
2079 | ||
2080 | /* Checks whether each entry of 'a' is also in 'b' and vice versa, i.e. the two sets contain the same | |
2081 | * entries */ | |
2082 | ||
2083 | if (a == b) | |
2084 | return true; | |
2085 | ||
2086 | if (set_isempty(a) && set_isempty(b)) | |
2087 | return true; | |
2088 | ||
2089 | if (set_size(a) != set_size(b)) /* Cheap check that hopefully catches a lot of inequality cases | |
2090 | * already */ | |
2091 | return false; | |
2092 | ||
2093 | SET_FOREACH(p, a) | |
2094 | if (!set_contains(b, p)) | |
2095 | return false; | |
2096 | ||
2097 | /* If we have the same hashops, then we don't need to check things backwards given we compared the | |
2098 | * size and that all of a is in b. */ | |
2099 | if (a->b.hash_ops == b->b.hash_ops) | |
2100 | return true; | |
2101 | ||
2102 | SET_FOREACH(p, b) | |
2103 | if (!set_contains(a, p)) | |
2104 | return false; | |
2105 | ||
2106 | return true; | |
2107 | } | |
d25d4f18 YW |
2108 | |
2109 | static bool set_fnmatch_one(Set *patterns, const char *needle) { | |
2110 | const char *p; | |
2111 | ||
2112 | assert(needle); | |
2113 | ||
8812f8fc LP |
2114 | /* Any failure of fnmatch() is treated as equivalent to FNM_NOMATCH, i.e. as non-matching pattern */ |
2115 | ||
d25d4f18 YW |
2116 | SET_FOREACH(p, patterns) |
2117 | if (fnmatch(p, needle, 0) == 0) | |
2118 | return true; | |
2119 | ||
2120 | return false; | |
2121 | } | |
2122 | ||
2123 | bool set_fnmatch(Set *include_patterns, Set *exclude_patterns, const char *needle) { | |
2124 | assert(needle); | |
2125 | ||
2126 | if (set_fnmatch_one(exclude_patterns, needle)) | |
2127 | return false; | |
2128 | ||
2129 | if (set_isempty(include_patterns)) | |
2130 | return true; | |
2131 | ||
2132 | return set_fnmatch_one(include_patterns, needle); | |
2133 | } | |
c619033f YW |
2134 | |
2135 | static int hashmap_entry_compare( | |
2136 | struct hashmap_base_entry * const *a, | |
2137 | struct hashmap_base_entry * const *b, | |
2138 | compare_func_t compare) { | |
2139 | ||
2140 | assert(a && *a); | |
2141 | assert(b && *b); | |
2142 | assert(compare); | |
2143 | ||
2144 | return compare((*a)->key, (*b)->key); | |
2145 | } | |
2146 | ||
c425c885 AV |
2147 | static int _hashmap_dump_entries_sorted( |
2148 | HashmapBase *h, | |
2149 | void ***ret, | |
2150 | size_t *ret_n) { | |
2151 | _cleanup_free_ void **entries = NULL; | |
c619033f YW |
2152 | Iterator iter; |
2153 | unsigned idx; | |
2154 | size_t n = 0; | |
2155 | ||
2156 | assert(ret); | |
c425c885 | 2157 | assert(ret_n); |
c619033f YW |
2158 | |
2159 | if (_hashmap_size(h) == 0) { | |
2160 | *ret = NULL; | |
c425c885 | 2161 | *ret_n = 0; |
c619033f YW |
2162 | return 0; |
2163 | } | |
2164 | ||
b2e9d809 DDM |
2165 | /* We append one more element than needed so that the resulting array can be used as a strv. We |
2166 | * don't count this entry in the returned size. */ | |
c425c885 | 2167 | entries = new(void*, _hashmap_size(h) + 1); |
c619033f YW |
2168 | if (!entries) |
2169 | return -ENOMEM; | |
2170 | ||
2171 | HASHMAP_FOREACH_IDX(idx, h, iter) | |
2172 | entries[n++] = bucket_at(h, idx); | |
2173 | ||
2174 | assert(n == _hashmap_size(h)); | |
b2e9d809 | 2175 | entries[n] = NULL; |
c619033f | 2176 | |
c425c885 AV |
2177 | typesafe_qsort_r((struct hashmap_base_entry**) entries, n, |
2178 | hashmap_entry_compare, h->hash_ops->compare); | |
2179 | ||
2180 | *ret = TAKE_PTR(entries); | |
2181 | *ret_n = n; | |
2182 | return 0; | |
2183 | } | |
2184 | ||
2185 | int _hashmap_dump_keys_sorted(HashmapBase *h, void ***ret, size_t *ret_n) { | |
2186 | _cleanup_free_ void **entries = NULL; | |
2187 | size_t n; | |
2188 | int r; | |
2189 | ||
2190 | r = _hashmap_dump_entries_sorted(h, &entries, &n); | |
2191 | if (r < 0) | |
2192 | return r; | |
2193 | ||
2194 | /* Reuse the array. */ | |
2195 | FOREACH_ARRAY(e, entries, n) | |
2196 | *e = (void*) (*(struct hashmap_base_entry**) e)->key; | |
2197 | ||
2198 | *ret = TAKE_PTR(entries); | |
2199 | if (ret_n) | |
2200 | *ret_n = n; | |
2201 | return 0; | |
2202 | } | |
2203 | ||
2204 | int _hashmap_dump_sorted(HashmapBase *h, void ***ret, size_t *ret_n) { | |
2205 | _cleanup_free_ void **entries = NULL; | |
2206 | size_t n; | |
2207 | int r; | |
2208 | ||
2209 | r = _hashmap_dump_entries_sorted(h, &entries, &n); | |
2210 | if (r < 0) | |
2211 | return r; | |
c619033f YW |
2212 | |
2213 | /* Reuse the array. */ | |
2214 | FOREACH_ARRAY(e, entries, n) | |
c425c885 | 2215 | *e = entry_value(h, *(struct hashmap_base_entry**) e); |
c619033f | 2216 | |
c425c885 | 2217 | *ret = TAKE_PTR(entries); |
c619033f YW |
2218 | if (ret_n) |
2219 | *ret_n = n; | |
2220 | return 0; | |
2221 | } |