node_first
struct node_data *node_first, *node_last;
node_first = __add_in_list(&head, &lock);
if (!node_first) {
if (!bpf_list_is_first(&head, &node_first->l)) {
bpf_obj_drop(node_first);
struct node_data *node_first, *node_last;
node_first = __add_in_list(&head, &lock);
if (!node_first) {
bpf_node_first = bpf_list_del(&head, &node_first->l);
bpf_obj_drop(node_first);
struct node_data *node_first;
node_first = __add_in_list(&head, &lock);
if (!node_first)
err = bpf_list_add(&head, &new_node->l, &node_first->l);
bpf_obj_drop(node_first);
nodep = node_first(s);
nodep1 = node_first(s);
for (nodep = node_first(s); nodep; nodep = node_next(s, nodep)) {
for (nodep = node_first(s); nodep;