X-Git-Url: http://git.lttng.org/?a=blobdiff_plain;f=liblttng-ust%2Frculfhash.h;h=9f5016a05ea7c305c39bf1e0b56d6158e241695c;hb=6ba6fd60507f8e045bdc4f1be14e9d99c6a15f7f;hp=58f5a5da0d4bf21dd2ef903649bee6a8b02cd284;hpb=10544ee8af31afb239e3dfa71cb2fe09d3de3771;p=lttng-ust.git diff --git a/liblttng-ust/rculfhash.h b/liblttng-ust/rculfhash.h index 58f5a5da..9f5016a0 100644 --- a/liblttng-ust/rculfhash.h +++ b/liblttng-ust/rculfhash.h @@ -1,29 +1,15 @@ -#ifndef _LTTNG_UST_RCULFHASH_H -#define _LTTNG_UST_RCULFHASH_H - /* - * urcu/rculfhash.h - * - * Userspace RCU library - Lock-Free RCU Hash Table - * - * Copyright 2011 - Mathieu Desnoyers - * Copyright 2011 - Lai Jiangshan - * - * This library is free software; you can redistribute it and/or - * modify it under the terms of the GNU Lesser General Public - * License as published by the Free Software Foundation; either - * version 2.1 of the License, or (at your option) any later version. + * SPDX-License-Identifier: LGPL-2.1-or-later * - * This library is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU - * Lesser General Public License for more details. + * Copyright 2011 Mathieu Desnoyers + * Copyright 2011 Lai Jiangshan * - * You should have received a copy of the GNU Lesser General Public - * License along with this library; if not, write to the Free Software - * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA + * Userspace RCU library - Lock-Free RCU Hash Table */ +#ifndef _LTTNG_UST_RCULFHASH_H +#define _LTTNG_UST_RCULFHASH_H + #include #include #include @@ -89,7 +75,7 @@ typedef int (*lttng_ust_lfht_match_fct)(struct lttng_ust_lfht_node *node, const * (detection of memory corruption). */ static inline -void lttng_ust_lfht_node_init(struct lttng_ust_lfht_node *node) +void lttng_ust_lfht_node_init(struct lttng_ust_lfht_node *node __attribute__((unused))) { } @@ -110,9 +96,14 @@ struct lttng_ust_lfht_mm_type { unsigned long index); }; -extern const struct lttng_ust_lfht_mm_type lttng_ust_lfht_mm_order; -extern const struct lttng_ust_lfht_mm_type lttng_ust_lfht_mm_chunk; -extern const struct lttng_ust_lfht_mm_type lttng_ust_lfht_mm_mmap; +extern const struct lttng_ust_lfht_mm_type lttng_ust_lfht_mm_order + __attribute__((visibility("hidden"))); + +extern const struct lttng_ust_lfht_mm_type lttng_ust_lfht_mm_chunk + __attribute__((visibility("hidden"))); + +extern const struct lttng_ust_lfht_mm_type lttng_ust_lfht_mm_mmap + __attribute__((visibility("hidden"))); /* * lttng_ust_lfht_new - allocate a hash table. @@ -131,12 +122,12 @@ extern const struct lttng_ust_lfht_mm_type lttng_ust_lfht_mm_mmap; * Return NULL on error. * Note: the RCU flavor must be already included before the hash table header. */ -extern -struct lttng_ust_lfht *lttng_ust_lfht_new(unsigned long init_size, +extern struct lttng_ust_lfht *lttng_ust_lfht_new(unsigned long init_size, unsigned long min_nr_alloc_buckets, unsigned long max_nr_buckets, int flags, - const struct lttng_ust_lfht_mm_type *mm); + const struct lttng_ust_lfht_mm_type *mm) + __attribute__((visibility("hidden"))); /* * lttng_ust_lfht_destroy - destroy a hash table. @@ -155,8 +146,8 @@ struct lttng_ust_lfht *lttng_ust_lfht_new(unsigned long init_size, * thread to handle resize operations, which removes RCU requirements on * lttng_ust_lfht_destroy. */ -extern -int lttng_ust_lfht_destroy(struct lttng_ust_lfht *ht); +extern int lttng_ust_lfht_destroy(struct lttng_ust_lfht *ht) + __attribute__((visibility("hidden"))); /* * lttng_ust_lfht_count_nodes - count the number of nodes in the hash table. @@ -168,11 +159,11 @@ int lttng_ust_lfht_destroy(struct lttng_ust_lfht *ht); * Call with rcu_read_lock held. * Threads calling this API need to be registered RCU read-side threads. */ -extern -void lttng_ust_lfht_count_nodes(struct lttng_ust_lfht *ht, +extern void lttng_ust_lfht_count_nodes(struct lttng_ust_lfht *ht, long *split_count_before, unsigned long *count, - long *split_count_after); + long *split_count_after) + __attribute__((visibility("hidden"))); /* * lttng_ust_lfht_lookup - lookup a node by key. @@ -186,10 +177,10 @@ void lttng_ust_lfht_count_nodes(struct lttng_ust_lfht *ht, * Threads calling this API need to be registered RCU read-side threads. * This function acts as a rcu_dereference() to read the node pointer. */ -extern -void lttng_ust_lfht_lookup(struct lttng_ust_lfht *ht, unsigned long hash, +extern void lttng_ust_lfht_lookup(struct lttng_ust_lfht *ht, unsigned long hash, lttng_ust_lfht_match_fct match, const void *key, - struct lttng_ust_lfht_iter *iter); + struct lttng_ust_lfht_iter *iter) + __attribute__((visibility("hidden"))); /* * lttng_ust_lfht_next_duplicate - get the next item with same key, after iterator. @@ -211,10 +202,10 @@ void lttng_ust_lfht_lookup(struct lttng_ust_lfht *ht, unsigned long hash, * Threads calling this API need to be registered RCU read-side threads. * This function acts as a rcu_dereference() to read the node pointer. */ -extern -void lttng_ust_lfht_next_duplicate(struct lttng_ust_lfht *ht, +extern void lttng_ust_lfht_next_duplicate(struct lttng_ust_lfht *ht, lttng_ust_lfht_match_fct match, const void *key, - struct lttng_ust_lfht_iter *iter); + struct lttng_ust_lfht_iter *iter) + __attribute__((visibility("hidden"))); /* * lttng_ust_lfht_first - get the first node in the table. @@ -226,8 +217,8 @@ void lttng_ust_lfht_next_duplicate(struct lttng_ust_lfht *ht, * Threads calling this API need to be registered RCU read-side threads. * This function acts as a rcu_dereference() to read the node pointer. */ -extern -void lttng_ust_lfht_first(struct lttng_ust_lfht *ht, struct lttng_ust_lfht_iter *iter); +extern void lttng_ust_lfht_first(struct lttng_ust_lfht *ht, struct lttng_ust_lfht_iter *iter) + __attribute__((visibility("hidden"))); /* * lttng_ust_lfht_next - get the next node in the table. @@ -241,8 +232,8 @@ void lttng_ust_lfht_first(struct lttng_ust_lfht *ht, struct lttng_ust_lfht_iter * Threads calling this API need to be registered RCU read-side threads. * This function acts as a rcu_dereference() to read the node pointer. */ -extern -void lttng_ust_lfht_next(struct lttng_ust_lfht *ht, struct lttng_ust_lfht_iter *iter); +extern void lttng_ust_lfht_next(struct lttng_ust_lfht *ht, struct lttng_ust_lfht_iter *iter) + __attribute__((visibility("hidden"))); /* * lttng_ust_lfht_add - add a node to the hash table. @@ -256,9 +247,9 @@ void lttng_ust_lfht_next(struct lttng_ust_lfht *ht, struct lttng_ust_lfht_iter * * This function issues a full memory barrier before and after its * atomic commit. */ -extern -void lttng_ust_lfht_add(struct lttng_ust_lfht *ht, unsigned long hash, - struct lttng_ust_lfht_node *node); +extern void lttng_ust_lfht_add(struct lttng_ust_lfht *ht, unsigned long hash, + struct lttng_ust_lfht_node *node) + __attribute__((visibility("hidden"))); /* * lttng_ust_lfht_add_unique - add a node to hash table, if key is not present. @@ -287,12 +278,12 @@ void lttng_ust_lfht_add(struct lttng_ust_lfht *ht, unsigned long hash, * node pointer. The failure case does not guarantee any other memory * barrier. */ -extern -struct lttng_ust_lfht_node *lttng_ust_lfht_add_unique(struct lttng_ust_lfht *ht, +extern struct lttng_ust_lfht_node *lttng_ust_lfht_add_unique(struct lttng_ust_lfht *ht, unsigned long hash, lttng_ust_lfht_match_fct match, const void *key, - struct lttng_ust_lfht_node *node); + struct lttng_ust_lfht_node *node) + __attribute__((visibility("hidden"))); /* * lttng_ust_lfht_add_replace - replace or add a node within hash table. @@ -324,12 +315,12 @@ struct lttng_ust_lfht_node *lttng_ust_lfht_add_unique(struct lttng_ust_lfht *ht, * This function issues a full memory barrier before and after its * atomic commit. */ -extern -struct lttng_ust_lfht_node *lttng_ust_lfht_add_replace(struct lttng_ust_lfht *ht, +extern struct lttng_ust_lfht_node *lttng_ust_lfht_add_replace(struct lttng_ust_lfht *ht, unsigned long hash, lttng_ust_lfht_match_fct match, const void *key, - struct lttng_ust_lfht_node *node); + struct lttng_ust_lfht_node *node) + __attribute__((visibility("hidden"))); /* * lttng_ust_lfht_replace - replace a node pointed to by iter within hash table. @@ -360,13 +351,13 @@ struct lttng_ust_lfht_node *lttng_ust_lfht_add_replace(struct lttng_ust_lfht *ht * after its atomic commit. Upon failure, this function does not issue * any memory barrier. */ -extern -int lttng_ust_lfht_replace(struct lttng_ust_lfht *ht, +extern int lttng_ust_lfht_replace(struct lttng_ust_lfht *ht, struct lttng_ust_lfht_iter *old_iter, unsigned long hash, lttng_ust_lfht_match_fct match, const void *key, - struct lttng_ust_lfht_node *new_node); + struct lttng_ust_lfht_node *new_node) + __attribute__((visibility("hidden"))); /* * lttng_ust_lfht_del - remove node pointed to by iterator from hash table. @@ -389,8 +380,8 @@ int lttng_ust_lfht_replace(struct lttng_ust_lfht *ht, * after its atomic commit. Upon failure, this function does not issue * any memory barrier. */ -extern -int lttng_ust_lfht_del(struct lttng_ust_lfht *ht, struct lttng_ust_lfht_node *node); +extern int lttng_ust_lfht_del(struct lttng_ust_lfht *ht, struct lttng_ust_lfht_node *node) + __attribute__((visibility("hidden"))); /* * lttng_ust_lfht_is_node_deleted - query whether a node is removed from hash table. @@ -405,8 +396,8 @@ int lttng_ust_lfht_del(struct lttng_ust_lfht *ht, struct lttng_ust_lfht_node *no * Threads calling this API need to be registered RCU read-side threads. * This function does not issue any memory barrier. */ -extern -int lttng_ust_lfht_is_node_deleted(const struct lttng_ust_lfht_node *node); +extern int lttng_ust_lfht_is_node_deleted(const struct lttng_ust_lfht_node *node) + __attribute__((visibility("hidden"))); /* * lttng_ust_lfht_resize - Force a hash table resize @@ -418,8 +409,8 @@ int lttng_ust_lfht_is_node_deleted(const struct lttng_ust_lfht_node *node); * lttng_ust_lfht_resize should *not* be called from a RCU read-side critical * section. */ -extern -void lttng_ust_lfht_resize(struct lttng_ust_lfht *ht, unsigned long new_size); +extern void lttng_ust_lfht_resize(struct lttng_ust_lfht *ht, unsigned long new_size) + __attribute__((visibility("hidden"))); /* * Note: it is safe to perform element removal (del), replacement, or