#include <stdint.h>
#include <pthread.h>
#include <urcu/compiler.h>
-#include "ust-helper.h"
#ifdef __cplusplus
extern "C" {
* (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)))
{
}
unsigned long index);
};
-LTTNG_HIDDEN
-extern const struct lttng_ust_lfht_mm_type lttng_ust_lfht_mm_order;
-LTTNG_HIDDEN
-extern const struct lttng_ust_lfht_mm_type lttng_ust_lfht_mm_chunk;
-LTTNG_HIDDEN
-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.
* Return NULL on error.
* Note: the RCU flavor must be already included before the hash table header.
*/
-LTTNG_HIDDEN
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.
* thread to handle resize operations, which removes RCU requirements on
* lttng_ust_lfht_destroy.
*/
-LTTNG_HIDDEN
-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.
* Call with rcu_read_lock held.
* Threads calling this API need to be registered RCU read-side threads.
*/
-LTTNG_HIDDEN
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.
* Threads calling this API need to be registered RCU read-side threads.
* This function acts as a rcu_dereference() to read the node pointer.
*/
-LTTNG_HIDDEN
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.
* Threads calling this API need to be registered RCU read-side threads.
* This function acts as a rcu_dereference() to read the node pointer.
*/
-LTTNG_HIDDEN
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.
* Threads calling this API need to be registered RCU read-side threads.
* This function acts as a rcu_dereference() to read the node pointer.
*/
-LTTNG_HIDDEN
-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.
* Threads calling this API need to be registered RCU read-side threads.
* This function acts as a rcu_dereference() to read the node pointer.
*/
-LTTNG_HIDDEN
-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.
* This function issues a full memory barrier before and after its
* atomic commit.
*/
-LTTNG_HIDDEN
extern void lttng_ust_lfht_add(struct lttng_ust_lfht *ht, unsigned long hash,
- struct lttng_ust_lfht_node *node);
+ 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.
* node pointer. The failure case does not guarantee any other memory
* barrier.
*/
-LTTNG_HIDDEN
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.
* This function issues a full memory barrier before and after its
* atomic commit.
*/
-LTTNG_HIDDEN
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.
* after its atomic commit. Upon failure, this function does not issue
* any memory barrier.
*/
-LTTNG_HIDDEN
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.
* after its atomic commit. Upon failure, this function does not issue
* any memory barrier.
*/
-LTTNG_HIDDEN
-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.
* Threads calling this API need to be registered RCU read-side threads.
* This function does not issue any memory barrier.
*/
-LTTNG_HIDDEN
-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
* lttng_ust_lfht_resize should *not* be called from a RCU read-side critical
* section.
*/
-LTTNG_HIDDEN
-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