#include <linux/err.h>
#include <linux/seq_file.h>
#include <linux/stringify.h>
-#include <linux/rculist.h>
#include <linux/hash.h>
#include <linux/rcupdate.h>
#include "wrapper/tracepoint.h"
+#include "wrapper/list.h"
#include "lttng-events.h"
/*
uint32_t hash = hash_32(pid, 32);
head = &lpf->pid_hash[hash & (LTTNG_PID_TABLE_SIZE - 1)];
- hlist_for_each_entry_rcu_notrace(e, head, hlist) {
+ lttng_hlist_for_each_entry_rcu_notrace(e, head, hlist) {
if (pid == e->pid)
return 1; /* Found */
}
uint32_t hash = hash_32(pid, 32);
head = &lpf->pid_hash[hash & (LTTNG_PID_TABLE_SIZE - 1)];
- hlist_for_each_entry(e, head, hlist) {
+ lttng_hlist_for_each_entry(e, head, hlist) {
if (pid == e->pid)
return -EEXIST;
}
* No need of _safe iteration, because we stop traversal as soon
* as we remove the entry.
*/
- hlist_for_each_entry(e, head, hlist) {
+ lttng_hlist_for_each_entry(e, head, hlist) {
if (pid == e->pid) {
pid_tracker_del_node_rcu(e);
return 0;
struct lttng_pid_hash_node *e;
struct hlist_node *tmp;
- hlist_for_each_entry_safe(e, tmp, head, hlist)
+ lttng_hlist_for_each_entry_safe(e, tmp, head, hlist)
pid_tracker_del_node(e);
}
kfree(lpf);