ht = consumer_data.stream_list_ht;
cds_lfht_for_each_entry_duplicate(ht->ht,
- ht->hash_fct((void *)((unsigned long) id), 0x42UL),
+ ht->hash_fct((void *)((unsigned long) id), lttng_ht_seed),
ht->match_fct, (void *)((unsigned long) id),
&iter.iter, stream, node_session_id.node) {
/* If this call fails, the stream is being used hence data pending. */
#include "hashtable.h"
#include "utils.h"
-#define HASH_SEED 0x42UL /* The answer to life */
+unsigned long lttng_ht_seed;
static unsigned long min_hash_alloc_size = 1;
static unsigned long max_hash_buckets_size = 0;
assert(ht);
assert(ht->ht);
- cds_lfht_lookup(ht->ht, ht->hash_fct(key, HASH_SEED),
+ cds_lfht_lookup(ht->ht, ht->hash_fct(key, lttng_ht_seed),
ht->match_fct, key, &iter->iter);
}
assert(ht->ht);
assert(node);
- node_ptr = cds_lfht_add_unique(ht->ht, ht->hash_fct(node->key, HASH_SEED),
+ node_ptr = cds_lfht_add_unique(ht->ht, ht->hash_fct(node->key, lttng_ht_seed),
ht->match_fct, node->key, &node->node);
assert(node_ptr == &node->node);
}
assert(ht->ht);
assert(node);
- cds_lfht_add(ht->ht, ht->hash_fct((void *) node->key, HASH_SEED),
+ cds_lfht_add(ht->ht, ht->hash_fct((void *) node->key, lttng_ht_seed),
&node->node);
}
assert(node);
node_ptr = cds_lfht_add_unique(ht->ht,
- ht->hash_fct((void *) node->key, HASH_SEED), ht->match_fct,
+ ht->hash_fct((void *) node->key, lttng_ht_seed), ht->match_fct,
(void *) node->key, &node->node);
assert(node_ptr == &node->node);
}
assert(node);
node_ptr = cds_lfht_add_replace(ht->ht,
- ht->hash_fct((void *) node->key, HASH_SEED), ht->match_fct,
+ ht->hash_fct((void *) node->key, lttng_ht_seed), ht->match_fct,
(void *) node->key, &node->node);
if (!node_ptr) {
return NULL;
}
return caa_container_of(node, struct lttng_ht_node_ulong, node);
}
+
+/*
+ * lib constructor
+ */
+static void __attribute__((constructor)) _init()
+{
+ /* Init hash table seed */
+ lttng_ht_seed = (unsigned long) time(NULL);
+}