Fix: uatomic arm32: add missing release barrier before uatomic_xchg
[urcu.git] / include / urcu / rculfhash.h
1 #ifndef _URCU_RCULFHASH_H
2 #define _URCU_RCULFHASH_H
3
4 /*
5 * urcu/rculfhash.h
6 *
7 * Userspace RCU library - Lock-Free RCU Hash Table
8 *
9 * Copyright 2011 - Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
10 * Copyright 2011 - Lai Jiangshan <laijs@cn.fujitsu.com>
11 *
12 * This library is free software; you can redistribute it and/or
13 * modify it under the terms of the GNU Lesser General Public
14 * License as published by the Free Software Foundation; either
15 * version 2.1 of the License, or (at your option) any later version.
16 *
17 * This library is distributed in the hope that it will be useful,
18 * but WITHOUT ANY WARRANTY; without even the implied warranty of
19 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
20 * Lesser General Public License for more details.
21 *
22 * You should have received a copy of the GNU Lesser General Public
23 * License along with this library; if not, write to the Free Software
24 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
25 *
26 * Include this file _after_ including your URCU flavor.
27 */
28
29 #include <stdint.h>
30 #include <urcu/compiler.h>
31 #include <urcu-call-rcu.h>
32 #include <urcu-flavor.h>
33
34 #ifdef __cplusplus
35 extern "C" {
36 #endif
37
38 /*
39 * cds_lfht_node: Contains the next pointers and reverse-hash
40 * value required for lookup and traversal of the hash table.
41 *
42 * struct cds_lfht_node should be aligned on 8-bytes boundaries because
43 * the three lower bits are used as flags. It is worth noting that the
44 * information contained within these three bits could be represented on
45 * two bits by re-using the same bit for REMOVAL_OWNER_FLAG and
46 * BUCKET_FLAG. This can be done if we ensure that no iterator nor
47 * updater check the BUCKET_FLAG after it detects that the REMOVED_FLAG
48 * is set. Given the minimum size of struct cds_lfht_node is 8 bytes on
49 * 32-bit architectures, we choose to go for simplicity and reserve
50 * three bits.
51 *
52 * struct cds_lfht_node can be embedded into a structure (as a field).
53 * caa_container_of() can be used to get the structure from the struct
54 * cds_lfht_node after a lookup.
55 *
56 * The structure which embeds it typically holds the key (or key-value
57 * pair) of the object. The caller code is responsible for calculation
58 * of the hash value for cds_lfht APIs.
59 */
60 struct cds_lfht_node {
61 struct cds_lfht_node *next; /* ptr | REMOVAL_OWNER_FLAG | BUCKET_FLAG | REMOVED_FLAG */
62 unsigned long reverse_hash;
63 } __attribute__((aligned(8)));
64
65 /* cds_lfht_iter: Used to track state while traversing a hash chain. */
66 struct cds_lfht_iter {
67 struct cds_lfht_node *node, *next;
68 };
69
70 static inline
71 struct cds_lfht_node *cds_lfht_iter_get_node(struct cds_lfht_iter *iter)
72 {
73 return iter->node;
74 }
75
76 struct cds_lfht;
77
78 /*
79 * Caution !
80 * Ensure reader and writer threads are registered as urcu readers.
81 */
82
83 typedef int (*cds_lfht_match_fct)(struct cds_lfht_node *node, const void *key);
84
85 /*
86 * cds_lfht_node_init - initialize a hash table node
87 * @node: the node to initialize.
88 *
89 * This function is kept to be eventually used for debugging purposes
90 * (detection of memory corruption).
91 */
92 static inline
93 void cds_lfht_node_init(struct cds_lfht_node *node)
94 {
95 }
96
97 /*
98 * Hash table creation flags.
99 */
100 enum {
101 CDS_LFHT_AUTO_RESIZE = (1U << 0),
102 CDS_LFHT_ACCOUNTING = (1U << 1),
103 };
104
105 struct cds_lfht_mm_type {
106 struct cds_lfht *(*alloc_cds_lfht)(unsigned long min_nr_alloc_buckets,
107 unsigned long max_nr_buckets);
108 void (*alloc_bucket_table)(struct cds_lfht *ht, unsigned long order);
109 void (*free_bucket_table)(struct cds_lfht *ht, unsigned long order);
110 struct cds_lfht_node *(*bucket_at)(struct cds_lfht *ht,
111 unsigned long index);
112 };
113
114 extern const struct cds_lfht_mm_type cds_lfht_mm_order;
115 extern const struct cds_lfht_mm_type cds_lfht_mm_chunk;
116 extern const struct cds_lfht_mm_type cds_lfht_mm_mmap;
117
118 /*
119 * _cds_lfht_new - API used by cds_lfht_new wrapper. Do not use directly.
120 */
121 extern
122 struct cds_lfht *_cds_lfht_new(unsigned long init_size,
123 unsigned long min_nr_alloc_buckets,
124 unsigned long max_nr_buckets,
125 int flags,
126 const struct cds_lfht_mm_type *mm,
127 const struct rcu_flavor_struct *flavor,
128 pthread_attr_t *attr);
129
130 /*
131 * cds_lfht_new - allocate a hash table.
132 * @init_size: number of buckets to allocate initially. Must be power of two.
133 * @min_nr_alloc_buckets: the minimum number of allocated buckets.
134 * (must be power of two)
135 * @max_nr_buckets: the maximum number of hash table buckets allowed.
136 * (must be power of two, 0 is accepted, means
137 * "infinite")
138 * @flags: hash table creation flags (can be combined with bitwise or: '|').
139 * 0: no flags.
140 * CDS_LFHT_AUTO_RESIZE: automatically resize hash table.
141 * CDS_LFHT_ACCOUNTING: count the number of node addition
142 * and removal in the table
143 * @attr: optional resize worker thread attributes. NULL for default.
144 *
145 * Return NULL on error.
146 * Note: the RCU flavor must be already included before the hash table header.
147 *
148 * The programmer is responsible for ensuring that resize operation has a
149 * priority equal to hash table updater threads. It should be performed by
150 * specifying the appropriate priority in the pthread "attr" argument, and,
151 * for CDS_LFHT_AUTO_RESIZE, by ensuring that call_rcu worker threads also have
152 * this priority level. Having lower priority for call_rcu and resize threads
153 * does not pose any correctness issue, but the resize operations could be
154 * starved by updates, thus leading to long hash table bucket chains.
155 * Threads calling cds_lfht_new are NOT required to be registered RCU
156 * read-side threads. It can be called very early. (e.g. before RCU is
157 * initialized)
158 */
159 static inline
160 struct cds_lfht *cds_lfht_new(unsigned long init_size,
161 unsigned long min_nr_alloc_buckets,
162 unsigned long max_nr_buckets,
163 int flags,
164 pthread_attr_t *attr)
165 {
166 return _cds_lfht_new(init_size, min_nr_alloc_buckets, max_nr_buckets,
167 flags, NULL, &rcu_flavor, attr);
168 }
169
170 /*
171 * cds_lfht_destroy - destroy a hash table.
172 * @ht: the hash table to destroy.
173 * @attr: (output) resize worker thread attributes, as received by cds_lfht_new.
174 * The caller will typically want to free this pointer if dynamically
175 * allocated. The attr point can be NULL if the caller does not
176 * need to be informed of the value passed to cds_lfht_new().
177 *
178 * Return 0 on success, negative error value on error.
179 * Threads calling this API need to be registered RCU read-side threads.
180 * cds_lfht_destroy should *not* be called from a RCU read-side critical
181 * section. It should *not* be called from a call_rcu thread context
182 * neither.
183 */
184 extern
185 int cds_lfht_destroy(struct cds_lfht *ht, pthread_attr_t **attr);
186
187 /*
188 * cds_lfht_count_nodes - count the number of nodes in the hash table.
189 * @ht: the hash table.
190 * @split_count_before: sample the node count split-counter before traversal.
191 * @count: traverse the hash table, count the number of nodes observed.
192 * @split_count_after: sample the node count split-counter after traversal.
193 *
194 * Call with rcu_read_lock held.
195 * Threads calling this API need to be registered RCU read-side threads.
196 */
197 extern
198 void cds_lfht_count_nodes(struct cds_lfht *ht,
199 long *split_count_before,
200 unsigned long *count,
201 long *split_count_after);
202
203 /*
204 * cds_lfht_lookup - lookup a node by key.
205 * @ht: the hash table.
206 * @hash: the key hash.
207 * @match: the key match function.
208 * @key: the current node key.
209 * @iter: node, if found (output). *iter->node set to NULL if not found.
210 *
211 * Call with rcu_read_lock held.
212 * Threads calling this API need to be registered RCU read-side threads.
213 * This function acts as a rcu_dereference() to read the node pointer.
214 */
215 extern
216 void cds_lfht_lookup(struct cds_lfht *ht, unsigned long hash,
217 cds_lfht_match_fct match, const void *key,
218 struct cds_lfht_iter *iter);
219
220 /*
221 * cds_lfht_next_duplicate - get the next item with same key, after iterator.
222 * @ht: the hash table.
223 * @match: the key match function.
224 * @key: the current node key.
225 * @iter: input: current iterator.
226 * output: node, if found. *iter->node set to NULL if not found.
227 *
228 * Uses an iterator initialized by a lookup or traversal. Important: the
229 * iterator _needs_ to be initialized before calling
230 * cds_lfht_next_duplicate.
231 * Sets *iter-node to the following node with same key.
232 * Sets *iter->node to NULL if no following node exists with same key.
233 * RCU read-side lock must be held across cds_lfht_lookup and
234 * cds_lfht_next calls, and also between cds_lfht_next calls using the
235 * node returned by a previous cds_lfht_next.
236 * Call with rcu_read_lock held.
237 * Threads calling this API need to be registered RCU read-side threads.
238 * This function acts as a rcu_dereference() to read the node pointer.
239 */
240 extern
241 void cds_lfht_next_duplicate(struct cds_lfht *ht,
242 cds_lfht_match_fct match, const void *key,
243 struct cds_lfht_iter *iter);
244
245 /*
246 * cds_lfht_first - get the first node in the table.
247 * @ht: the hash table.
248 * @iter: First node, if exists (output). *iter->node set to NULL if not found.
249 *
250 * Output in "*iter". *iter->node set to NULL if table is empty.
251 * Call with rcu_read_lock held.
252 * Threads calling this API need to be registered RCU read-side threads.
253 * This function acts as a rcu_dereference() to read the node pointer.
254 */
255 extern
256 void cds_lfht_first(struct cds_lfht *ht, struct cds_lfht_iter *iter);
257
258 /*
259 * cds_lfht_next - get the next node in the table.
260 * @ht: the hash table.
261 * @iter: input: current iterator.
262 * output: next node, if exists. *iter->node set to NULL if not found.
263 *
264 * Input/Output in "*iter". *iter->node set to NULL if *iter was
265 * pointing to the last table node.
266 * Call with rcu_read_lock held.
267 * Threads calling this API need to be registered RCU read-side threads.
268 * This function acts as a rcu_dereference() to read the node pointer.
269 */
270 extern
271 void cds_lfht_next(struct cds_lfht *ht, struct cds_lfht_iter *iter);
272
273 /*
274 * cds_lfht_add - add a node to the hash table.
275 * @ht: the hash table.
276 * @hash: the key hash.
277 * @node: the node to add.
278 *
279 * This function supports adding redundant keys into the table.
280 * Call with rcu_read_lock held.
281 * Threads calling this API need to be registered RCU read-side threads.
282 * This function issues a full memory barrier before and after its
283 * atomic commit.
284 */
285 extern
286 void cds_lfht_add(struct cds_lfht *ht, unsigned long hash,
287 struct cds_lfht_node *node);
288
289 /*
290 * cds_lfht_add_unique - add a node to hash table, if key is not present.
291 * @ht: the hash table.
292 * @hash: the node's hash.
293 * @match: the key match function.
294 * @key: the node's key.
295 * @node: the node to try adding.
296 *
297 * Return the node added upon success.
298 * Return the unique node already present upon failure. If
299 * cds_lfht_add_unique fails, the node passed as parameter should be
300 * freed by the caller. In this case, the caller does NOT need to wait
301 * for a grace period before freeing or re-using the node.
302 * Call with rcu_read_lock held.
303 * Threads calling this API need to be registered RCU read-side threads.
304 *
305 * The semantic of this function is that if only this function is used
306 * to add keys into the table, no duplicated keys should ever be
307 * observable in the table. The same guarantee apply for combination of
308 * add_unique and add_replace (see below).
309 *
310 * Upon success, this function issues a full memory barrier before and
311 * after its atomic commit. Upon failure, this function acts like a
312 * simple lookup operation: it acts as a rcu_dereference() to read the
313 * node pointer. The failure case does not guarantee any other memory
314 * barrier.
315 */
316 extern
317 struct cds_lfht_node *cds_lfht_add_unique(struct cds_lfht *ht,
318 unsigned long hash,
319 cds_lfht_match_fct match,
320 const void *key,
321 struct cds_lfht_node *node);
322
323 /*
324 * cds_lfht_add_replace - replace or add a node within hash table.
325 * @ht: the hash table.
326 * @hash: the node's hash.
327 * @match: the key match function.
328 * @key: the node's key.
329 * @node: the node to add.
330 *
331 * Return the node replaced upon success. If no node matching the key
332 * was present, return NULL, which also means the operation succeeded.
333 * This replacement operation should never fail.
334 * Call with rcu_read_lock held.
335 * Threads calling this API need to be registered RCU read-side threads.
336 * After successful replacement, a grace period must be waited for before
337 * freeing or re-using the memory reserved for the returned node.
338 *
339 * The semantic of replacement vs lookups and traversals is the
340 * following: if lookups and traversals are performed between a key
341 * unique insertion and its removal, we guarantee that the lookups and
342 * traversals will always find exactly one instance of the key if it is
343 * replaced concurrently with the lookups.
344 *
345 * Providing this semantic allows us to ensure that replacement-only
346 * schemes will never generate duplicated keys. It also allows us to
347 * guarantee that a combination of add_replace and add_unique updates
348 * will never generate duplicated keys.
349 *
350 * This function issues a full memory barrier before and after its
351 * atomic commit.
352 */
353 extern
354 struct cds_lfht_node *cds_lfht_add_replace(struct cds_lfht *ht,
355 unsigned long hash,
356 cds_lfht_match_fct match,
357 const void *key,
358 struct cds_lfht_node *node);
359
360 /*
361 * cds_lfht_replace - replace a node pointed to by iter within hash table.
362 * @ht: the hash table.
363 * @old_iter: the iterator position of the node to replace.
364 * @hash: the node's hash.
365 * @match: the key match function.
366 * @key: the node's key.
367 * @new_node: the new node to use as replacement.
368 *
369 * Return 0 if replacement is successful, negative value otherwise.
370 * Replacing a NULL old node or an already removed node will fail with
371 * -ENOENT.
372 * If the hash or value of the node to replace and the new node differ,
373 * this function returns -EINVAL without proceeding to the replacement.
374 * Old node can be looked up with cds_lfht_lookup and cds_lfht_next.
375 * RCU read-side lock must be held between lookup and replacement.
376 * Call with rcu_read_lock held.
377 * Threads calling this API need to be registered RCU read-side threads.
378 * After successful replacement, a grace period must be waited for before
379 * freeing or re-using the memory reserved for the old node (which can
380 * be accessed with cds_lfht_iter_get_node).
381 *
382 * The semantic of replacement vs lookups is the same as
383 * cds_lfht_add_replace().
384 *
385 * Upon success, this function issues a full memory barrier before and
386 * after its atomic commit. Upon failure, this function does not issue
387 * any memory barrier.
388 */
389 extern
390 int cds_lfht_replace(struct cds_lfht *ht,
391 struct cds_lfht_iter *old_iter,
392 unsigned long hash,
393 cds_lfht_match_fct match,
394 const void *key,
395 struct cds_lfht_node *new_node);
396
397 /*
398 * cds_lfht_del - remove node pointed to by iterator from hash table.
399 * @ht: the hash table.
400 * @node: the node to delete.
401 *
402 * Return 0 if the node is successfully removed, negative value
403 * otherwise.
404 * Deleting a NULL node or an already removed node will fail with a
405 * negative value.
406 * Node can be looked up with cds_lfht_lookup and cds_lfht_next,
407 * followed by use of cds_lfht_iter_get_node.
408 * RCU read-side lock must be held between lookup and removal.
409 * Call with rcu_read_lock held.
410 * Threads calling this API need to be registered RCU read-side threads.
411 * After successful removal, a grace period must be waited for before
412 * freeing or re-using the memory reserved for old node (which can be
413 * accessed with cds_lfht_iter_get_node).
414 * Upon success, this function issues a full memory barrier before and
415 * after its atomic commit. Upon failure, this function does not issue
416 * any memory barrier.
417 */
418 extern
419 int cds_lfht_del(struct cds_lfht *ht, struct cds_lfht_node *node);
420
421 /*
422 * cds_lfht_is_node_deleted - query whether a node is removed from hash table.
423 *
424 * Return non-zero if the node is deleted from the hash table, 0
425 * otherwise.
426 * Node can be looked up with cds_lfht_lookup and cds_lfht_next,
427 * followed by use of cds_lfht_iter_get_node.
428 * RCU read-side lock must be held between lookup and call to this
429 * function.
430 * Call with rcu_read_lock held.
431 * Threads calling this API need to be registered RCU read-side threads.
432 * This function does not issue any memory barrier.
433 */
434 extern
435 int cds_lfht_is_node_deleted(struct cds_lfht_node *node);
436
437 /*
438 * cds_lfht_resize - Force a hash table resize
439 * @ht: the hash table.
440 * @new_size: update to this hash table size.
441 *
442 * Threads calling this API need to be registered RCU read-side threads.
443 * This function does not (necessarily) issue memory barriers.
444 * cds_lfht_resize should *not* be called from a RCU read-side critical
445 * section.
446 */
447 extern
448 void cds_lfht_resize(struct cds_lfht *ht, unsigned long new_size);
449
450 /*
451 * Note: it is safe to perform element removal (del), replacement, or
452 * any hash table update operation during any of the following hash
453 * table traversals.
454 * These functions act as rcu_dereference() to read the node pointers.
455 */
456 #define cds_lfht_for_each(ht, iter, node) \
457 for (cds_lfht_first(ht, iter), \
458 node = cds_lfht_iter_get_node(iter); \
459 node != NULL; \
460 cds_lfht_next(ht, iter), \
461 node = cds_lfht_iter_get_node(iter))
462
463 #define cds_lfht_for_each_duplicate(ht, hash, match, key, iter, node) \
464 for (cds_lfht_lookup(ht, hash, match, key, iter), \
465 node = cds_lfht_iter_get_node(iter); \
466 node != NULL; \
467 cds_lfht_next_duplicate(ht, match, key, iter), \
468 node = cds_lfht_iter_get_node(iter))
469
470 #define cds_lfht_for_each_entry(ht, iter, pos, member) \
471 for (cds_lfht_first(ht, iter), \
472 pos = caa_container_of(cds_lfht_iter_get_node(iter), \
473 __typeof__(*(pos)), member); \
474 cds_lfht_iter_get_node(iter) != NULL; \
475 cds_lfht_next(ht, iter), \
476 pos = caa_container_of(cds_lfht_iter_get_node(iter), \
477 __typeof__(*(pos)), member))
478
479 #define cds_lfht_for_each_entry_duplicate(ht, hash, match, key, \
480 iter, pos, member) \
481 for (cds_lfht_lookup(ht, hash, match, key, iter), \
482 pos = caa_container_of(cds_lfht_iter_get_node(iter), \
483 __typeof__(*(pos)), member); \
484 cds_lfht_iter_get_node(iter) != NULL; \
485 cds_lfht_next_duplicate(ht, match, key, iter), \
486 pos = caa_container_of(cds_lfht_iter_get_node(iter), \
487 __typeof__(*(pos)), member))
488
489 #ifdef __cplusplus
490 }
491 #endif
492
493 #endif /* _URCU_RCULFHASH_H */
This page took 0.057423 seconds and 4 git commands to generate.