Home
last modified time | relevance | path

Searched refs:node_first (Results 1 – 2 of 2) sorted by relevance

/linux/tools/testing/selftests/bpf/progs/
H A Drefcounted_kptr.c437 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()
[all …]
/linux/tools/testing/selftests/kvm/lib/
H A Dsparsebit.c205 static struct node *node_first(const struct sparsebit *s) in node_first() function
1093 nodep = node_first(s); in sparsebit_first_set()
1108 nodep1 = node_first(s); in sparsebit_first_clear()
1600 for (nodep = node_first(s); nodep; nodep = node_next(s, nodep)) { in sparsebit_dump()
1692 for (nodep = node_first(s); nodep; in sparsebit_validate_internal()