This add operation supports redundant keys in the table.
Signed-off-by: David Goulet <dgoulet@efficios.com>
assert(node_ptr == &node->node);
}
+/*
+ * Add unsigned long node to hashtable.
+ */
+void lttng_ht_add_ulong(struct lttng_ht *ht, struct lttng_ht_node_ulong *node)
+{
+ assert(ht);
+ assert(ht->ht);
+ assert(node);
+
+ cds_lfht_add(ht->ht, ht->hash_fct((void *) node->key, HASH_SEED),
+ &node->node);
+}
+
/*
* Add unique unsigned long node to hashtable.
*/
struct lttng_ht_node_ulong *node);
extern struct lttng_ht_node_ulong *lttng_ht_add_replace_ulong(
struct lttng_ht *ht, struct lttng_ht_node_ulong *node);
+extern void lttng_ht_add_ulong(struct lttng_ht *ht,
+ struct lttng_ht_node_ulong *node);
extern int lttng_ht_del(struct lttng_ht *ht, struct lttng_ht_iter *iter);