437 	struct node_data *node_first, *node_last;  in list_is_edge_test1()  local
444 	node_first = __add_in_list(&head, &lock);  in list_is_edge_test1()
445 	if (!node_first) {  in list_is_edge_test1()
451 	if (!bpf_list_is_first(&head, &node_first->l)) {  in list_is_edge_test1()
460 	bpf_obj_drop(node_first);  in list_is_edge_test1()
543 	struct node_data *node_first, *node_last;  in list_del_test1()  local
551 	node_first = __add_in_list(&head, &lock);  in list_del_test1()
552 	if (!node_first) {  in list_del_test1()
559 	bpf_node_first = bpf_list_del(&head, &node_first->l);  in list_del_test1()
572 	bpf_obj_drop(node_first);  in list_del_test1()
657 	struct node_data *node_first;  in list_add_test1()  local
661 	node_first = __add_in_list(&head, &lock);  in list_add_test1()
662 	if (!node_first)  in list_add_test1()
672 	err = bpf_list_add(&head, &new_node->l, &node_first->l);  in list_add_test1()
680 	bpf_obj_drop(node_first);  in list_add_test1()